1. 1158.60 s [pandoc] #1: OK (0.02s)
  2. 1158.61 s [pandoc] #2: OK (0.01s)
  3. 1158.61 s [pandoc] 256.md
  4. 1158.62 s [pandoc] #1: OK (0.01s)
  5. 1158.63 s [pandoc] #2: OK
  6. 1158.63 s [pandoc] pandoc-citeproc-401.md
  7. 1158.75 s [pandoc] #1: OK (0.12s)
  8. 1158.75 s [pandoc] 3736.md
  9. 1158.76 s [pandoc] #1: OK
  10. 1158.77 s [pandoc] #2: OK
  11. 1158.77 s [pandoc] #3: OK
  12. 1158.77 s [pandoc] 3708.md
  13. 1158.78 s [pandoc] #1: OK
  14. 1158.78 s [pandoc] 6783.md
  15. 1158.82 s [pandoc] #1: OK (0.04s)
  16. 1158.82 s [pandoc] 8487.md
  17. 1158.83 s [pandoc] #1: OK
  18. 1158.83 s [pandoc] 9472.md
  19. 1158.87 s [pandoc] #1: OK (0.04s)
  20. 1158.87 s [pandoc] 7953.md
  21. 1158.88 s [pandoc] #1: OK
  22. 1158.88 s [pandoc] 3968.md
  23. 1158.88 s [pandoc] #1: OK
  24. 1158.89 s [pandoc] biblatex-knuth-ct-b.md
  25. 1158.93 s [pandoc] #1: OK (0.05s)
  26. 1158.93 s [pandoc] biblatex-cms.md
  27. 1158.97 s [pandoc] #1: OK (0.03s)
  28. 1158.97 s [pandoc] biblatex-hyman.md
  29. 1159.00 s [pandoc] #1: OK (0.03s)
  30. 1159.00 s [pandoc] 9603.md
  31. 1159.01 s [pandoc] #1: OK (0.01s)
  32. 1159.01 s [pandoc] 8003.md
  33. 1159.03 s [pandoc] #1: OK (0.02s)
  34. 1159.03 s [pandoc] 3701.md
  35. 1159.04 s [pandoc] #1: OK (0.01s)
  36. 1159.05 s [pandoc] #2: OK (0.02s)
  37. 1159.05 s [pandoc] 10855.md
  38. 1159.07 s [pandoc] #1: OK (0.01s)
  39. 1159.09 s [pandoc] #2: OK (0.02s)
  40. 1159.10 s [pandoc] #3: OK (0.01s)
  41. 1159.11 s [pandoc] #4: OK (0.01s)
  42. 1159.11 s [pandoc] 5936.md
  43. 1159.12 s [pandoc] #1: OK
  44. 1159.13 s [pandoc] #2: OK
  45. 1159.13 s [pandoc] 7064.md
  46. 1159.14 s [pandoc] #1: OK (0.01s)
  47. 1159.14 s [pandoc] 10825.md
  48. 1159.15 s [pandoc] #1: OK (0.01s)
  49. 1159.15 s [pandoc] pandoc-citeproc-chicago-fullnote-bibliography.md
  50. 1159.33 s [pandoc] #1: OK (0.18s)
  51. 1159.33 s [pandoc] 5116.md
  52. 1159.35 s [pandoc] #1: OK (0.02s)
  53. 1159.38 s [pandoc] #2: OK (0.03s)
  54. 1159.39 s [pandoc] #3: OK (0.02s)
  55. 1159.39 s [pandoc] figures-jira.md
  56. 1159.40 s [pandoc] #1: OK (0.01s)
  57. 1159.40 s [pandoc] biblatex-cotton.md
  58. 1159.44 s [pandoc] #1: OK (0.04s)
  59. 1159.44 s [pandoc] input-with-endinput.md
  60. 1159.45 s [pandoc] #1: OK
  61. 1159.45 s [pandoc] biblatex-report.md
  62. 1159.49 s [pandoc] #1: OK (0.03s)
  63. 1159.49 s [pandoc] 7003.md
  64. 1159.60 s [pandoc] #1: OK (0.12s)
  65. 1159.60 s [pandoc] 10862.md
  66. 1159.61 s [pandoc] #1: OK (0.01s)
  67. 1159.61 s [pandoc] biblatex-moore-related.md
  68. 1159.64 s [pandoc] #1: OK (0.03s)
  69. 1159.64 s [pandoc] 4877.md
  70. 1159.65 s [pandoc] #1: OK
  71. 1159.65 s [pandoc] #2: OK
  72. 1159.65 s [pandoc] 3537.md
  73. 1159.66 s [pandoc] #1: OK
  74. 1159.67 s [pandoc] #2: OK
  75. 1159.68 s [pandoc] #3: OK
  76. 1159.68 s [pandoc] 9017.md
  77. 1159.72 s [pandoc] #1: OK (0.04s)
  78. 1159.72 s [pandoc] biblatex-augustine.md
  79. 1159.74 s [pandoc] #1: OK (0.02s)
  80. 1159.74 s [pandoc] sloppypar.md
  81. 1159.75 s [pandoc] #1: OK (0.01s)
  82. 1159.76 s [pandoc] #2: OK
  83. 1159.76 s [pandoc] figures-rst.md
  84. 1159.77 s [pandoc] #1: OK
  85. 1159.77 s [pandoc] empty_paragraphs.md
  86. 1159.85 s [pandoc] #1: OK (0.08s)
  87. 1159.93 s [pandoc] #2: OK (0.08s)
  88. 1160.01 s [pandoc] #3: OK (0.08s)
  89. 1160.06 s [pandoc] #4: OK (0.05s)
  90. 1160.07 s [pandoc] #5: OK
  91. 1160.08 s [pandoc] #6: OK (0.01s)
  92. 1160.09 s [pandoc] #7: OK
  93. 1160.10 s [pandoc] #8: OK
  94. 1160.11 s [pandoc] #9: OK
  95. 1160.12 s [pandoc] #10: OK (0.01s)
  96. 1160.12 s [pandoc] biblatex-issue288.md
  97. 1160.15 s [pandoc] #1: OK (0.03s)
  98. 1160.15 s [pandoc] 4007.md
  99. 1160.16 s [pandoc] #1: OK
  100. 1160.17 s [pandoc] #2: OK
  101. 1160.18 s [pandoc] #3: OK
  102. 1160.18 s [pandoc] 5795.md
  103. 1160.19 s [pandoc] #1: OK (0.01s)
  104. 1160.20 s [pandoc] #2: OK
  105. 1160.21 s [pandoc] #3: OK
  106. 1160.21 s [pandoc] 3401.md
  107. 1160.22 s [pandoc] #1: OK
  108. 1160.23 s [pandoc] #2: OK
  109. 1160.23 s [pandoc] 4199.md
  110. 1160.24 s [pandoc] #1: OK
  111. 1160.24 s [pandoc] 5793.md
  112. 1160.25 s [pandoc] #1: OK (0.01s)
  113. 1160.26 s [pandoc] #2: OK (0.01s)
  114. 1160.26 s [pandoc] 6774.md
  115. 1160.27 s [pandoc] #1: OK
  116. 1160.28 s [pandoc] #2: OK (0.01s)
  117. 1160.29 s [pandoc] #3: OK (0.01s)
  118. 1160.31 s [pandoc] #4: OK (0.01s)
  119. 1160.31 s [pandoc] 9579.md
  120. 1160.32 s [pandoc] #1: OK
  121. 1160.33 s [pandoc] #2: OK (0.01s)
  122. 1160.33 s [pandoc] biblatex-kowalik.md
  123. 1160.39 s [pandoc] #1: OK (0.06s)
  124. 1160.39 s [pandoc] 9088.md
  125. 1160.40 s [pandoc] #1: OK (0.01s)
  126. 1160.40 s [pandoc] 4832.md
  127. 1160.41 s [pandoc] #1: OK
  128. 1160.42 s [pandoc] #2: OK
  129. 1160.43 s [pandoc] #3: OK
  130. 1160.43 s [pandoc] 9038.md
  131. 1160.43 s [pandoc] #1: OK
  132. 1160.44 s [pandoc] 9047.md
  133. 1160.44 s [pandoc] #1: OK
  134. 1160.46 s [pandoc] #2: OK (0.01s)
  135. 1160.47 s [pandoc] #3: OK (0.01s)
  136. 1160.47 s [pandoc] #4: OK
  137. 1160.47 s [pandoc] 5340.md
  138. 1160.48 s [pandoc] #1: OK
  139. 1160.48 s [pandoc] pandoc-citeproc-70.md
  140. 1160.59 s [pandoc] #1: OK (0.11s)
  141. 1160.59 s [pandoc] biblatex-wassenberg.md
  142. 1160.62 s [pandoc] #1: OK (0.03s)
  143. 1160.62 s [pandoc] 7678.md
  144. 1160.64 s [pandoc] #1: OK (0.02s)
  145. 1160.66 s [pandoc] #2: OK (0.02s)
  146. 1160.66 s [pandoc] 4056.md
  147. 1160.67 s [pandoc] #1: OK
  148. 1160.68 s [pandoc] #2: OK
  149. 1160.68 s [pandoc] 6265.md
  150. 1160.69 s [pandoc] #1: OK
  151. 1160.69 s [pandoc] pandoc-citeproc-77.md
  152. 1160.80 s [pandoc] #1: OK (0.11s)
  153. 1160.80 s [pandoc] biblatex-coleridge.md
  154. 1160.85 s [pandoc] #1: OK (0.05s)
  155. 1160.85 s [pandoc] pandoc-citeproc-move-period-inside-quote.md
  156. 1160.89 s [pandoc] #1: OK (0.04s)
  157. 1160.89 s [pandoc] 7546.md
  158. 1160.90 s [pandoc] #1: OK
  159. 1160.90 s [pandoc] 7272.md
  160. 1160.91 s [pandoc] #1: OK
  161. 1160.91 s [pandoc] 8070.md
  162. 1160.92 s [pandoc] #1: OK
  163. 1160.92 s [pandoc] 7557.md
  164. 1160.93 s [pandoc] #1: OK
  165. 1160.93 s [pandoc] 3526.md
  166. 1160.93 s [pandoc] #1: OK
  167. 1160.93 s [pandoc] pandoc-citeproc-399.md
  168. 1161.04 s [pandoc] #1: OK (0.10s)
  169. 1161.04 s [pandoc] 7436.md
  170. 1161.04 s [pandoc] #1: OK
  171. 1161.05 s [pandoc] 9630.md
  172. 1161.06 s [pandoc] #1: OK (0.01s)
  173. 1161.06 s [pandoc] pandoc-citeproc-118.md
  174. 1161.10 s [pandoc] #1: OK (0.04s)
  175. 1161.10 s [pandoc] biblatex-book-coleridge.md
  176. 1161.13 s [pandoc] #1: OK (0.03s)
  177. 1161.13 s [pandoc] 3804.md
  178. 1161.14 s [pandoc] #1: OK
  179. 1161.14 s [pandoc] unicode-collation.md
  180. 1161.25 s [pandoc] #1: OK (0.11s)
  181. 1161.36 s [pandoc] #2: OK (0.10s)
  182. 1161.46 s [pandoc] #3: OK (0.10s)
  183. 1161.46 s [pandoc] 2397.md
  184. 1161.47 s [pandoc] #1: OK (0.01s)
  185. 1161.47 s [pandoc] 4240.md
  186. 1161.48 s [pandoc] #1: OK (0.01s)
  187. 1161.48 s [pandoc] pandoc-citeproc-locators-integrated.md
  188. 1161.54 s [pandoc] #1: OK (0.06s)
  189. 1161.54 s [pandoc] tasklist.md
  190. 1161.55 s [pandoc] #1: OK (0.01s)
  191. 1161.57 s [pandoc] #2: OK (0.01s)
  192. 1161.58 s [pandoc] #3: OK (0.02s)
  193. 1161.59 s [pandoc] #4: OK
  194. 1161.60 s [pandoc] #5: OK
  195. 1161.60 s [pandoc] 5714.md
  196. 1161.61 s [pandoc] #1: OK
  197. 1161.61 s [pandoc] pandoc-citeproc-ieee.md
  198. 1161.72 s [pandoc] #1: OK (0.10s)
  199. 1161.72 s [pandoc] 3523.md
  200. 1161.73 s [pandoc] #1: OK (0.02s)
  201. 1161.73 s [pandoc] 10631.md
  202. 1161.74 s [pandoc] #1: OK
  203. 1161.74 s [pandoc] 7099.md
  204. 1161.75 s [pandoc] #1: OK
  205. 1161.75 s [pandoc] #2: OK
  206. 1161.75 s [pandoc] 2103.md
  207. 1161.76 s [pandoc] #1: OK
  208. 1161.76 s [pandoc] 5119.md
  209. 1161.77 s [pandoc] #1: OK (0.01s)
  210. 1161.77 s [pandoc] 4019.md
  211. 1161.78 s [pandoc] #1: OK
  212. 1161.78 s [pandoc] 8354.md
  213. 1161.82 s [pandoc] #1: OK (0.04s)
  214. 1161.83 s [pandoc] 10459.md
  215. 1161.83 s [pandoc] #1: OK
  216. 1161.83 s [pandoc] bibtex-basic.md
  217. 1161.85 s [pandoc] #1: OK (0.02s)
  218. 1161.85 s [pandoc] 6958.md
  219. 1161.86 s [pandoc] #1: OK (0.01s)
  220. 1161.86 s [pandoc] biblatex-knuth-ct-related.md
  221. 1161.90 s [pandoc] #1: OK (0.04s)
  222. 1161.91 s [pandoc] 1745.md
  223. 1161.92 s [pandoc] #1: OK (0.01s)
  224. 1161.92 s [pandoc] 8079.md
  225. 1161.93 s [pandoc] #1: OK
  226. 1161.93 s [pandoc] biblatex-vangennep.md
  227. 1161.95 s [pandoc] #1: OK (0.02s)
  228. 1161.95 s [pandoc] 4171.md
  229. 1161.96 s [pandoc] #1: OK (0.01s)
  230. 1161.98 s [pandoc] #2: OK (0.02s)
  231. 1161.98 s [pandoc] #3: OK
  232. 1161.98 s [pandoc] 3422.md
  233. 1161.99 s [pandoc] #1: OK
  234. 1161.99 s [pandoc] 9878.md
  235. 1162.00 s [pandoc] #1: OK
  236. 1162.01 s [pandoc] #2: OK
  237. 1162.01 s [pandoc] latex-command-comment.md
  238. 1162.02 s [pandoc] #1: OK (0.01s)
  239. 1162.02 s [pandoc] 4068.md
  240. 1162.04 s [pandoc] #1: OK (0.01s)
  241. 1162.04 s [pandoc] figures-html.md
  242. 1162.05 s [pandoc] #1: OK (0.01s)
  243. 1162.06 s [pandoc] #2: OK (0.01s)
  244. 1162.07 s [pandoc] #3: OK (0.01s)
  245. 1162.08 s [pandoc] #4: OK (0.01s)
  246. 1162.10 s [pandoc] #5: OK (0.01s)
  247. 1162.11 s [pandoc] #6: OK (0.01s)
  248. 1162.11 s [pandoc] 6741.md
  249. 1162.27 s [pandoc] #1: OK (0.16s)
  250. 1162.27 s [pandoc] 8365.md
  251. 1162.28 s [pandoc] #1: OK
  252. 1162.28 s [pandoc] 10071.md
  253. 1162.29 s [pandoc] #1: OK
  254. 1162.29 s [pandoc] 7847.md
  255. 1162.30 s [pandoc] #1: OK (0.01s)
  256. 1162.31 s [pandoc] #2: OK (0.01s)
  257. 1162.32 s [pandoc] #3: OK (0.01s)
  258. 1162.32 s [pandoc] biblatex-dates.md
  259. 1162.38 s [pandoc] #1: OK (0.05s)
  260. 1162.38 s [pandoc] 8179.md
  261. 1162.39 s [pandoc] #1: OK (0.01s)
  262. 1162.39 s [pandoc] 5416.md
  263. 1162.40 s [pandoc] #1: OK
  264. 1162.41 s [pandoc] #2: OK (0.01s)
  265. 1162.41 s [pandoc] biblatex-cicero.md
  266. 1162.46 s [pandoc] #1: OK (0.05s)
  267. 1162.46 s [pandoc] 10328.md
  268. 1162.55 s [pandoc] #1: OK (0.02s)
  269. 1162.55 s [pandoc] 5876.md
  270. 1162.55 s [pandoc] #1: OK (0.01s)
  271. 1162.55 s [pandoc] #2: OK (0.01s)
  272. 1162.55 s [pandoc] #3: OK
  273. 1162.55 s [pandoc] #4: OK
  274. 1162.55 s [pandoc] 4550.md
  275. 1162.55 s [pandoc] #1: OK
  276. 1162.55 s [pandoc] 9150.md
  277. 1162.55 s [pandoc] #1: OK (0.01s)
  278. 1162.55 s [pandoc] #2: OK (0.01s)
  279. 1162.56 s [pandoc] #3: OK (0.02s)
  280. 1162.56 s [pandoc] bits-book-meta.md
  281. 1162.56 s [pandoc] #1: OK
  282. 1162.56 s [pandoc] biblatex-gerhardt.md
  283. 1162.59 s [pandoc] #1: OK (0.03s)
  284. 1162.59 s [pandoc] biblatex-article.md
  285. 1162.63 s [pandoc] #1: OK (0.04s)
  286. 1162.63 s [pandoc] 5014.md
  287. 1162.65 s [pandoc] #1: OK (0.01s)
  288. 1162.65 s [pandoc] 4742.md
  289. 1162.66 s [pandoc] #1: OK (0.02s)
  290. 1162.67 s [pandoc] #2: OK (0.01s)
  291. 1162.69 s [pandoc] #3: OK (0.01s)
  292. 1162.69 s [pandoc] pandoc-citeproc-75.md
  293. 1162.73 s [pandoc] #1: OK (0.04s)
  294. 1162.73 s [pandoc] 9358.md
  295. 1162.75 s [pandoc] #1: OK (0.02s)
  296. 1162.75 s [pandoc] pandoc-citeproc-locators-delimited.md
  297. 1162.79 s [pandoc] #1: OK (0.04s)
  298. 1162.79 s [pandoc] biblatex-glashow.md
  299. 1162.81 s [pandoc] #1: OK (0.02s)
  300. 1162.81 s [pandoc] 8764.md
  301. 1162.81 s [pandoc] #1: OK
  302. 1162.81 s [pandoc] 5684.md
  303. 1162.82 s [pandoc] #1: OK
  304. 1162.82 s [pandoc] 10730.md
  305. 1162.83 s [pandoc] #1: OK
  306. 1162.83 s [pandoc] 5797.md
  307. 1162.84 s [pandoc] #1: OK
  308. 1162.85 s [pandoc] #2: OK
  309. 1162.85 s [pandoc] #3: OK
  310. 1162.85 s [pandoc] 9445.md
  311. 1162.86 s [pandoc] #1: OK
  312. 1162.86 s [pandoc] 4454.md
  313. 1162.87 s [pandoc] #1: OK
  314. 1162.87 s [pandoc] 5476.md
  315. 1162.88 s [pandoc] #1: OK
  316. 1162.88 s [pandoc] 4382.md
  317. 1162.88 s [pandoc] #1: OK
  318. 1162.88 s [pandoc] 1279.md
  319. 1162.89 s [pandoc] #1: OK
  320. 1162.89 s [pandoc] 4470.md
  321. 1162.90 s [pandoc] #1: OK
  322. 1162.90 s [pandoc] #2: OK
  323. 1162.91 s [pandoc] #3: OK
  324. 1162.92 s [pandoc] #4: OK
  325. 1162.92 s [pandoc] 4208.md
  326. 1162.93 s [pandoc] #1: OK (0.01s)
  327. 1162.93 s [pandoc] 3792.md
  328. 1162.93 s [pandoc] #1: OK
  329. 1162.93 s [pandoc] 4186.md
  330. 1162.94 s [pandoc] #1: OK
  331. 1163.03 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.o, dist/build/Data/Vector/Unboxed/Mutable.dyn_o )
  332. 1163.38 s [pandoc] #2: OK (0.44s)
  333. 1163.38 s [pandoc] pandoc-citeproc-338.md
  334. 1163.41 s [pandoc] #1: OK (0.03s)
  335. 1163.41 s [pandoc] 10279.md
  336. 1163.42 s [pandoc] #1: OK (0.01s)
  337. 1163.42 s [pandoc] 9371.md
  338. 1163.43 s [pandoc] #1: OK (0.01s)
  339. 1163.43 s [pandoc] 10145.md
  340. 1163.45 s [pandoc] #1: OK (0.01s)
  341. 1163.45 s [pandoc] 1608.md
  342. 1163.46 s [pandoc] #1: OK (0.02s)
  343. 1163.46 s [pandoc] 7321.md
  344. 1163.50 s [pandoc] #1: OK (0.04s)
  345. 1163.50 s [pandoc] 3978.md
  346. 1163.51 s [pandoc] #1: OK
  347. 1163.51 s [pandoc] emoji.md
  348. 1163.52 s [pandoc] #1: OK (0.01s)
  349. 1163.53 s [pandoc] #2: OK (0.01s)
  350. 1163.54 s [pandoc] #3: OK
  351. 1163.56 s [pandoc] #4: OK (0.01s)
  352. 1163.56 s [pandoc] bits-toc-elements.md
  353. 1163.56 s [pandoc] #1: OK
  354. 1163.56 s [pandoc] 3675.md
  355. 1163.57 s [pandoc] #1: OK
  356. 1163.57 s [pandoc] 9676.md
  357. 1163.59 s [pandoc] #1: OK (0.01s)
  358. 1163.59 s [pandoc] biblatex-jcg.md
  359. 1163.61 s [pandoc] #1: OK (0.03s)
  360. 1163.62 s [pandoc] 8402.md
  361. 1163.63 s [pandoc] #1: OK (0.01s)
  362. 1163.63 s [pandoc] 10062.md
  363. 1163.63 s [pandoc] #1: OK
  364. 1163.63 s [pandoc] biblatex-escapedquotes.md
  365. 1163.65 s [pandoc] #1: OK (0.02s)
  366. 1163.65 s [pandoc] 4281.md
  367. 1163.66 s [pandoc] #1: OK
  368. 1163.66 s [pandoc] 7494.md
  369. 1163.67 s [pandoc] #1: OK
  370. 1163.69 s [pandoc] #2: OK (0.01s)
  371. 1163.69 s [pandoc] #3: OK
  372. 1163.70 s [pandoc] #4: OK
  373. 1163.71 s [pandoc] #5: OK
  374. 1163.71 s [pandoc] 6348.md
  375. 1163.71 s [pandoc] #1: OK
  376. 1163.72 s [pandoc] 5686.md
  377. 1163.72 s [pandoc] #1: OK
  378. 1163.72 s [pandoc] pandoc-citeproc-312.md
  379. 1163.83 s [pandoc] #1: OK (0.11s)
  380. 1163.83 s [pandoc] 5898.md
  381. 1163.84 s [pandoc] #1: OK
  382. 1163.84 s [pandoc] 7376.md
  383. 1163.89 s [pandoc] #1: OK (0.05s)
  384. 1163.89 s [pandoc] 1881.md
  385. 1163.90 s [pandoc] #1: OK (0.01s)
  386. 1163.91 s [pandoc] #2: OK
  387. 1163.91 s [pandoc] 4653.md
  388. 1163.92 s [pandoc] #1: OK
  389. 1163.92 s [pandoc] citeproc-17.md
  390. 1163.94 s [pandoc] #1: OK (0.02s)
  391. 1163.94 s [pandoc] 6285.md
  392. 1163.99 s [pandoc] #1: OK (0.05s)
  393. 1163.99 s [pandoc] 6802.md
  394. 1163.99 s [pandoc] #1: OK
  395. 1163.99 s [pandoc] shift-heading-level-by.md
  396. 1164.00 s [pandoc] #1: OK
  397. 1164.01 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.p_o )
  398. 1164.01 s [pandoc] #2: OK (0.01s)
  399. 1164.01 s [pandoc] 4960.md
  400. 1164.02 s [pandoc] #1: OK
  401. 1164.03 s [pandoc] #2: OK
  402. 1164.04 s [pandoc] #3: OK (0.01s)
  403. 1164.04 s [pandoc] biblatex-shore.md
  404. 1164.09 s [pandoc] #1: OK (0.04s)
  405. 1164.09 s [pandoc] 9902.md
  406. 1164.10 s [pandoc] #1: OK
  407. 1164.10 s [pandoc] 3958.md
  408. 1164.11 s [pandoc] #1: OK (0.01s)
  409. 1164.12 s [pandoc] #2: OK (0.01s)
  410. 1164.13 s [pandoc] #3: OK
  411. 1164.13 s [pandoc] biblatex-worman.md
  412. 1164.16 s [pandoc] #1: OK (0.03s)
  413. 1164.16 s [pandoc] 2994.md
  414. 1164.21 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  415. 1164.23 s [pandoc] #1: OK (0.07s)
  416. 1164.23 s [pandoc] 4159.md
  417. 1164.23 s [vector] [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.p_o )
  418. 1164.24 s [pandoc] #1: OK
  419. 1164.24 s [pandoc] 6588.md
  420. 1164.25 s [pandoc] #1: OK (0.01s)
  421. 1164.25 s [pandoc] biblatex-companion.md
  422. 1164.29 s [pandoc] #1: OK (0.04s)
  423. 1164.29 s [pandoc] 6844.md
  424. 1164.29 s [pandoc] #1: OK
  425. 1164.30 s [pandoc] #2: OK
  426. 1164.31 s [pandoc] #3: OK
  427. 1164.31 s [pandoc] 4465.md
  428. 1164.32 s [pandoc] #1: OK
  429. 1164.32 s [pandoc] 9387.md
  430. 1164.32 s [pandoc] #1: OK
  431. 1164.33 s [pandoc] #2: OK
  432. 1164.33 s [pandoc] 8661.md
  433. 1164.34 s [pandoc] #1: OK
  434. 1164.34 s [pandoc] 3510.md
  435. 1164.35 s [pandoc] #1: OK
  436. 1164.35 s [pandoc] 3539.md
  437. 1164.36 s [pandoc] #1: OK
  438. 1164.37 s [pandoc] #2: OK
  439. 1164.37 s [pandoc] #3: OK
  440. 1164.38 s [pandoc] #4: OK
  441. 1164.39 s [pandoc] #5: OK
  442. 1164.40 s [pandoc] #6: OK (0.01s)
  443. 1164.40 s [pandoc] 9388.md
  444. 1164.41 s [pandoc] #1: OK (0.01s)
  445. 1164.41 s [pandoc] 3494.md
  446. 1164.43 s [pandoc] #1: OK (0.02s)
  447. 1164.43 s [pandoc] 7112.md
  448. 1164.45 s [pandoc] #1: OK (0.01s)
  449. 1164.45 s [pandoc] 7434.md
  450. 1164.47 s [pandoc] #1: OK (0.02s)
  451. 1164.47 s [pandoc] 5241.md
  452. 1164.48 s [pandoc] #1: OK
  453. 1164.48 s [pandoc] 8997.md
  454. 1164.49 s [pandoc] #1: OK
  455. 1164.50 s [pandoc] #2: OK
  456. 1164.50 s [pandoc] 853.md
  457. 1164.51 s [pandoc] #1: OK (0.01s)
  458. 1164.51 s [pandoc] 10271.md
  459. 1164.52 s [pandoc] #1: OK
  460. 1164.54 s [pandoc] #2: OK (0.02s)
  461. 1164.55 s [pandoc] #3: OK
  462. 1164.55 s [pandoc] #4: OK
  463. 1164.56 s [pandoc] 4113.md
  464. 1164.56 s [pandoc] #1: OK
  465. 1164.56 s [pandoc] 7573.md
  466. 1164.57 s [pandoc] #1: OK
  467. 1164.57 s [pandoc] biblatex-yoon.md
  468. 1164.61 s [pandoc] #1: OK (0.03s)
  469. 1164.61 s [pandoc] biblatex-inbook-title-booktitle-maintitle-series.md
  470. 1164.62 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
  471. 1164.62 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  472. 1164.62 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  473. 1164.62 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.p_o )
  474. 1164.63 s [pandoc] #1: OK (0.02s)
  475. 1164.63 s [pandoc] 8611.md
  476. 1164.64 s [pandoc] #1: OK (0.02s)
  477. 1164.64 s [pandoc] csv.md
  478. 1164.65 s [pandoc] #1: OK (0.01s)
  479. 1164.65 s [pandoc] figures-fb2.md
  480. 1164.66 s [pandoc] #1: OK
  481. 1164.66 s [pandoc] rst_block_subst.md
  482. 1164.67 s [pandoc] #1: OK
  483. 1164.67 s [pandoc] 7568.md
  484. 1164.68 s [pandoc] #1: OK (0.01s)
  485. 1164.68 s [pandoc] 8236.md
  486. 1164.69 s [pandoc] #1: OK
  487. 1164.69 s [pandoc] 5099.md
  488. 1164.70 s [pandoc] #1: OK
  489. 1164.70 s [pandoc] #2: OK
  490. 1164.70 s [pandoc] 8770-block.md
  491. 1164.72 s [pandoc] #1: OK (0.01s)
  492. 1164.72 s [pandoc] 5541-localLink.md
  493. 1164.73 s [pandoc] #1: OK (0.02s)
  494. 1164.73 s [pandoc] bits-book-part-wrapper.md
  495. 1164.75 s [pandoc] #1: OK
  496. 1164.75 s [pandoc] 3512.md
  497. 1164.76 s [pandoc] #1: OK
  498. 1164.77 s [pandoc] #2: OK
  499. 1164.77 s [pandoc] 7219.md
  500. 1164.81 s [pandoc] #1: OK (0.03s)
  501. 1164.81 s [pandoc] 5708.md
  502. 1164.82 s [pandoc] #1: OK (0.01s)
  503. 1164.82 s [pandoc] pandoc-citeproc-160.md
  504. 1164.87 s [pandoc] #1: OK (0.05s)
  505. 1164.87 s [pandoc] biblatex-basic.md
  506. 1164.91 s [pandoc] #1: OK (0.04s)
  507. 1164.91 s [pandoc] nested-table-to-asciidoc-6942.md
  508. 1164.94 s [pandoc] #1: OK (0.03s)
  509. 1164.96 s [pandoc] #2: OK (0.02s)
  510. 1164.96 s [pandoc] 6837.md
  511. 1164.97 s [pandoc] #1: OK (0.01s)
  512. 1164.98 s [pandoc] #2: OK
  513. 1164.98 s [pandoc] #3: OK
  514. 1164.98 s [pandoc] 4528.md
  515. 1164.99 s [pandoc] #1: OK
  516. 1165.00 s [pandoc] #2: OK
  517. 1165.01 s [pandoc] #3: OK
  518. 1165.02 s [pandoc] #4: OK
  519. 1165.02 s [pandoc] #5: OK
  520. 1165.04 s [pandoc] #6: OK
  521. 1165.04 s [pandoc] #7: OK
  522. 1165.05 s [pandoc] #8: OK
  523. 1165.06 s [pandoc] #9: OK
  524. 1165.07 s [pandoc] #10: OK
  525. 1165.08 s [pandoc] #11: OK
  526. 1165.09 s [pandoc] #12: OK (0.01s)
  527. 1165.10 s [pandoc] #13: OK
  528. 1165.11 s [pandoc] #14: OK
  529. 1165.12 s [pandoc] #15: OK
  530. 1165.13 s [pandoc] #16: OK
  531. 1165.14 s [pandoc] #17: OK (0.01s)
  532. 1165.15 s [pandoc] #18: OK
  533. 1165.16 s [pandoc] #19: OK
  534. 1165.17 s [pandoc] #20: OK
  535. 1165.38 s [pandoc] #21: OK (0.20s)
  536. 1165.38 s [pandoc] biblatex-kastenholz.md
  537. 1165.42 s [pandoc] #1: OK (0.04s)
  538. 1165.42 s [pandoc] 3755.md
  539. 1165.43 s [pandoc] #1: OK
  540. 1165.44 s [pandoc] #2: OK
  541. 1165.44 s [pandoc] 6620.md
  542. 1165.45 s [pandoc] #1: OK (0.01s)
  543. 1165.45 s [pandoc] 4420.md
  544. 1165.46 s [pandoc] #1: OK
  545. 1165.46 s [pandoc] 4908.md
  546. 1165.47 s [pandoc] #1: OK
  547. 1165.47 s [pandoc] biblatex-nietzsche-historie.md
  548. 1165.50 s [pandoc] #1: OK (0.03s)
  549. 1165.50 s [pandoc] 3558.md
  550. 1165.51 s [pandoc] #1: OK (0.01s)
  551. 1165.51 s [pandoc] 5986.md
  552. 1165.56 s [pandoc] #1: OK (0.04s)
  553. 1165.56 s [pandoc] biblatex-strings.md
  554. 1165.58 s [pandoc] #1: OK (0.02s)
  555. 1165.58 s [pandoc] figures-xwiki.md
  556. 1165.58 s [pandoc] #1: OK
  557. 1165.59 s [pandoc] 4054.md
  558. 1165.59 s [pandoc] #1: OK
  559. 1165.61 s [pandoc] #2: OK (0.01s)
  560. 1165.61 s [pandoc] 9202.md
  561. 1165.62 s [pandoc] #1: OK (0.01s)
  562. 1165.63 s [pandoc] #2: OK
  563. 1165.64 s [pandoc] #3: OK
  564. 1165.65 s [pandoc] #4: OK (0.01s)
  565. 1165.65 s [pandoc] #5: OK
  566. 1165.65 s [pandoc] biblatex-gaonkar-in.md
  567. 1165.67 s [pandoc] #1: OK (0.02s)
  568. 1165.67 s [pandoc] biblatex-inbook-title-booktitle-maintitle-series-2.md
  569. 1165.70 s [pandoc] #1: OK (0.03s)
  570. 1165.70 s [pandoc] pandoc-citeproc-31.md
  571. 1165.83 s [pandoc] #1: OK (0.13s)
  572. 1165.83 s [pandoc] 7067.md
  573. 1165.84 s [pandoc] #1: OK (0.01s)
  574. 1165.85 s [pandoc] #2: OK (0.01s)
  575. 1165.86 s [pandoc] #3: OK
  576. 1165.86 s [pandoc] 6765.md
  577. 1165.91 s [pandoc] #1: OK (0.05s)
  578. 1165.91 s [pandoc] 4545.md
  579. 1165.92 s [pandoc] #1: OK (0.01s)
  580. 1165.93 s [pandoc] #2: OK
  581. 1165.93 s [pandoc] pandoc-citeproc-392.md
  582. 1165.97 s [pandoc] #1: OK (0.04s)
  583. 1165.97 s [pandoc] 5565.md
  584. 1165.97 s [pandoc] #1: OK
  585. 1165.97 s [pandoc] 7520.md
  586. 1165.98 s [pandoc] #1: OK
  587. 1165.98 s [pandoc] pandoc-citeproc-250.md
  588. 1166.03 s [pandoc] #1: OK (0.04s)
  589. 1166.03 s [pandoc] 9275.md
  590. 1166.05 s [pandoc] #1: OK (0.02s)
  591. 1166.06 s [pandoc] #2: OK (0.02s)
  592. 1166.06 s [pandoc] typst-property-output.md
  593. 1166.07 s [pandoc] #1: OK
  594. 1166.09 s [pandoc] #2: OK (0.01s)
  595. 1166.10 s [pandoc] #3: OK (0.01s)
  596. 1166.11 s [pandoc] #4: OK (0.01s)
  597. 1166.12 s [pandoc] #5: OK
  598. 1166.13 s [pandoc] #6: OK
  599. 1166.14 s [pandoc] #7: OK
  600. 1166.15 s [pandoc] #8: OK (0.01s)
  601. 1166.16 s [pandoc] #9: OK
  602. 1166.16 s [pandoc] #10: OK
  603. 1166.17 s [pandoc] #11: OK
  604. 1166.18 s [pandoc] #12: OK
  605. 1166.19 s [pandoc] #13: OK
  606. 1166.20 s [pandoc] #14: OK (0.01s)
  607. 1166.22 s [pandoc] #15: OK (0.01s)
  608. 1166.22 s [pandoc] bits-book-part-wrapper-meta.md
  609. 1166.23 s [pandoc] #1: OK (0.01s)
  610. 1166.23 s [pandoc] 7397.md
  611. 1166.24 s [pandoc] #1: OK
  612. 1166.25 s [pandoc] 3450.md
  613. 1166.27 s [pandoc] #1: OK (0.03s)
  614. 1166.28 s [pandoc] #2: OK (0.01s)
  615. 1166.28 s [pandoc] 6858.md
  616. 1166.30 s [pandoc] #1: OK (0.01s)
  617. 1166.30 s [pandoc] #2: OK
  618. 1166.30 s [pandoc] pandoc-citeproc-51.md
  619. 1166.42 s [pandoc] #1: OK (0.11s)
  620. 1166.42 s [pandoc] 5071.md
  621. 1166.43 s [pandoc] #1: OK (0.01s)
  622. 1166.44 s [pandoc] #2: OK (0.01s)
  623. 1166.46 s [pandoc] #3: OK (0.01s)
  624. 1166.47 s [pandoc] #4: OK (0.01s)
  625. 1166.47 s [pandoc] 4012.md
  626. 1166.48 s [pandoc] #1: OK (0.01s)
  627. 1166.48 s [pandoc] 4162.md
  628. 1166.49 s [pandoc] #1: OK
  629. 1166.49 s [pandoc] 3619.md
  630. 1166.50 s [pandoc] #1: OK
  631. 1166.51 s [pandoc] #2: OK (0.01s)
  632. 1166.52 s [pandoc] #3: OK
  633. 1166.52 s [pandoc] 8380.md
  634. 1166.53 s [pandoc] #1: OK
  635. 1166.53 s [pandoc] #2: OK
  636. 1166.54 s [pandoc] #3: OK
  637. 1166.54 s [pandoc] 4677.md
  638. 1166.56 s [pandoc] #1: OK (0.02s)
  639. 1166.56 s [pandoc] 4172.md
  640. 1166.57 s [pandoc] #1: OK (0.01s)
  641. 1166.59 s [pandoc] #2: OK (0.01s)
  642. 1166.59 s [pandoc] 7930.md
  643. 1166.61 s [pandoc] #1: OK (0.02s)
  644. 1166.61 s [pandoc] 7173.md
  645. 1166.62 s [pandoc] #1: OK (0.02s)
  646. 1166.64 s [pandoc] #2: OK (0.02s)
  647. 1166.66 s [pandoc] #3: OK (0.02s)
  648. 1166.67 s [pandoc] #4: OK (0.02s)
  649. 1166.69 s [pandoc] #5: OK (0.01s)
  650. 1166.69 s [pandoc] 512.md
  651. 1166.70 s [pandoc] #1: OK (0.01s)
  652. 1166.72 s [pandoc] #2: OK (0.01s)
  653. 1166.73 s [pandoc] #3: OK (0.02s)
  654. 1166.73 s [pandoc] 10781.md
  655. 1166.74 s [pandoc] #1: OK (0.01s)
  656. 1166.74 s [pandoc] pandoc-citeproc-no-author.md
  657. 1166.86 s [pandoc] #1: OK (0.12s)
  658. 1166.86 s [pandoc] biblatex-crossref-nested.md
  659. 1166.89 s [pandoc] #1: OK (0.03s)
  660. 1166.89 s [pandoc] 5805.md
  661. 1166.90 s [pandoc] #1: OK (0.01s)
  662. 1166.91 s [pandoc] #2: OK
  663. 1166.92 s [pandoc] #3: OK
  664. 1166.92 s [pandoc] 7324.md
  665. 1166.97 s [pandoc] #1: OK (0.04s)
  666. 1166.97 s [pandoc] 3432a.md
  667. 1166.98 s [pandoc] #1: OK (0.01s)
  668. 1166.98 s [pandoc] 6137.md
  669. 1167.00 s [pandoc] #1: OK (0.02s)
  670. 1167.00 s [pandoc] biblatex-westfahl-frontier.md
  671. 1167.06 s [pandoc] #1: OK (0.06s)
  672. 1167.07 s [pandoc] 5967.md
  673. 1167.08 s [pandoc] #1: OK (0.01s)
  674. 1167.08 s [pandoc] 2118.md
  675. 1167.09 s [pandoc] #1: OK (0.02s)
  676. 1167.09 s [pandoc] 10490.md
  677. 1167.12 s [pandoc] #1: OK (0.02s)
  678. 1167.12 s [pandoc] 8513.md
  679. 1167.13 s [pandoc] #1: OK (0.01s)
  680. 1167.14 s [pandoc] #2: OK (0.01s)
  681. 1167.16 s [pandoc] #3: OK (0.02s)
  682. 1167.16 s [pandoc] 7329.md
  683. 1167.18 s [pandoc] #1: OK (0.02s)
  684. 1167.23 s [pandoc] #2: OK (0.05s)
  685. 1167.28 s [pandoc] #3: OK (0.05s)
  686. 1167.31 s [pandoc] #4: OK (0.03s)
  687. 1167.31 s [pandoc] 3257.md
  688. 1167.32 s [pandoc] #1: OK (0.01s)
  689. 1167.33 s [pandoc] #2: OK (0.01s)
  690. 1167.33 s [pandoc] 4845.md
  691. 1167.35 s [pandoc] #1: OK (0.01s)
  692. 1167.36 s [pandoc] biblatex-bibstring-resolution.md
  693. 1167.39 s [pandoc] #1: OK (0.04s)
  694. 1167.39 s [pandoc] 3348.md
  695. 1167.41 s [pandoc] #1: OK (0.02s)
  696. 1167.41 s [pandoc] defaults-inheritance-2.md
  697. 1167.41 s [pandoc] #1: OK
  698. 1167.41 s [pandoc] 9635.md
  699. 1167.43 s [pandoc] #1: OK (0.01s)
  700. 1167.43 s [pandoc] pandoc-citeproc-386.md
  701. 1167.47 s [pandoc] #1: OK (0.05s)
  702. 1167.47 s [pandoc] 7861.md
  703. 1167.56 s [pandoc] #1: OK
  704. 1167.56 s [pandoc] pandoc-citeproc-76.md
  705. 1167.60 s [pandoc] #1: OK (0.12s)
  706. 1167.60 s [pandoc] 10537.md
  707. 1167.62 s [pandoc] #1: OK
  708. 1167.63 s [pandoc] #2: OK
  709. 1167.63 s [pandoc] 8984.md
  710. 1167.64 s [pandoc] #1: OK (0.01s)
  711. 1167.65 s [pandoc] #2: OK (0.01s)
  712. 1167.65 s [pandoc] 3511.md
  713. 1167.66 s [pandoc] #1: OK (0.01s)
  714. 1167.67 s [pandoc] #2: OK (0.01s)
  715. 1167.67 s [pandoc] pandoc-citeproc-307.md
  716. 1167.71 s [pandoc] #1: OK (0.03s)
  717. 1167.71 s [pandoc] 8178.md
  718. 1167.71 s [pandoc] #1: OK
  719. 1167.72 s [pandoc] #2: OK
  720. 1167.73 s [pandoc] #3: OK
  721. 1167.73 s [pandoc] 9209.md
  722. 1167.74 s [pandoc] #1: OK
  723. 1167.74 s [pandoc] 5360.md
  724. 1167.75 s [pandoc] #1: OK
  725. 1167.75 s [pandoc] dots.md
  726. 1167.75 s [pandoc] #1: OK
  727. 1167.75 s [pandoc] 6033.md
  728. 1167.77 s [pandoc] #1: OK (0.01s)
  729. 1167.77 s [pandoc] 8028.md
  730. 1167.78 s [pandoc] #1: OK (0.01s)
  731. 1167.78 s [pandoc] 9045.md
  732. 1167.79 s [pandoc] #1: OK
  733. 1167.79 s [pandoc] 4768.md
  734. 1167.79 s [pandoc] #1: OK
  735. 1167.79 s [pandoc] 6719.md
  736. 1167.80 s [pandoc] #1: OK
  737. 1167.81 s [pandoc] #2: OK
  738. 1167.81 s [pandoc] 4669.md
  739. 1167.81 s [pandoc] #1: OK
  740. 1167.83 s [pandoc] #2: OK (0.01s)
  741. 1167.83 s [pandoc] biblatex-incollection-2.md
  742. 1167.87 s [pandoc] #1: OK (0.04s)
  743. 1167.87 s [pandoc] biblatex-spiegelberg.md
  744. 1167.91 s [pandoc] #1: OK (0.04s)
  745. 1167.91 s [pandoc] 8789.md
  746. 1167.92 s [pandoc] #1: OK (0.02s)
  747. 1167.92 s [pandoc] 8777.md
  748. 1167.93 s [pandoc] #1: OK
  749. 1167.93 s [pandoc] 10148.md
  750. 1167.94 s [pandoc] #1: OK
  751. 1167.94 s [pandoc] 5177.md
  752. 1167.95 s [pandoc] #1: OK
  753. 1167.95 s [pandoc] nested-spanlike.md
  754. 1167.96 s [pandoc] #1: OK
  755. 1167.96 s [pandoc] 3771.md
  756. 1167.96 s [pandoc] #1: OK
  757. 1167.96 s [pandoc] 4598.md
  758. 1167.97 s [pandoc] #1: OK (0.01s)
  759. 1167.97 s [pandoc] latex-color.md
  760. 1167.98 s [pandoc] #1: OK
  761. 1167.99 s [pandoc] #2: OK
  762. 1168.00 s [pandoc] #3: OK
  763. 1168.00 s [pandoc] #4: OK
  764. 1168.01 s [pandoc] #5: OK (0.01s)
  765. 1168.02 s [pandoc] #6: OK
  766. 1168.03 s [pandoc] #7: OK
  767. 1168.04 s [pandoc] #8: OK
  768. 1168.05 s [pandoc] #9: OK (0.01s)
  769. 1168.05 s [pandoc] #10: OK
  770. 1168.06 s [pandoc] #11: OK
  771. 1168.08 s [pandoc] #12: OK (0.01s)
  772. 1168.08 s [pandoc] 6796.md
  773. 1168.09 s [pandoc] #1: OK
  774. 1168.09 s [pandoc] 4842.md
  775. 1168.18 s [pandoc] #1: OK
  776. 1168.18 s [pandoc] 3752.md
  777. 1168.27 s [pandoc] #1: OK (0.18s)
  778. 1168.30 s [pandoc] #2: OK (0.02s)
  779. 1168.31 s [pandoc] #3: OK (0.02s)
  780. 1168.31 s [pandoc] 3779.md
  781. 1168.33 s [pandoc] #1: OK (0.01s)
  782. 1168.33 s [pandoc] 3407.md
  783. 1168.35 s [pandoc] #1: OK (0.02s)
  784. 1168.35 s [pandoc] #2: OK
  785. 1168.35 s [pandoc] 8201.md
  786. 1168.36 s [pandoc] #1: OK (0.01s)
  787. 1168.36 s [pandoc] 4639.md
  788. 1168.38 s [pandoc] #1: OK (0.01s)
  789. 1168.38 s [pandoc] 6466.md
  790. 1168.39 s [pandoc] #1: OK (0.01s)
  791. 1168.39 s [pandoc] biblatex-almendro.md
  792. 1168.42 s [pandoc] #1: OK (0.03s)
  793. 1168.42 s [pandoc] biblatex-knuth-ct.md
  794. 1168.45 s [pandoc] #1: OK (0.03s)
  795. 1168.45 s [pandoc] 5627.md
  796. 1168.47 s [pandoc] #1: OK (0.02s)
  797. 1168.50 s [pandoc] #2: OK (0.03s)
  798. 1168.52 s [pandoc] #3: OK (0.02s)
  799. 1168.52 s [pandoc] translations.md
  800. 1168.53 s [pandoc] #1: OK (0.01s)
  801. 1168.54 s [pandoc] #2: OK (0.01s)
  802. 1168.55 s [pandoc] #3: OK (0.01s)
  803. 1168.56 s [pandoc] #4: OK (0.01s)
  804. 1168.56 s [pandoc] 6384.md
  805. 1168.58 s [pandoc] #1: OK (0.02s)
  806. 1168.58 s [pandoc] biblatex-thesis.md
  807. 1168.62 s [pandoc] #1: OK (0.03s)
  808. 1168.62 s [pandoc] 1841.md
  809. 1168.63 s [pandoc] #1: OK (0.01s)
  810. 1168.65 s [pandoc] #2: OK (0.01s)
  811. 1168.65 s [pandoc] 5010.md
  812. 1168.65 s [pandoc] #1: OK
  813. 1168.66 s [pandoc] #2: OK
  814. 1168.66 s [pandoc] 5620.md
  815. 1168.67 s [pandoc] #1: OK
  816. 1168.67 s [pandoc] 5053.md
  817. 1168.68 s [pandoc] #1: OK (0.01s)
  818. 1168.69 s [pandoc] #2: OK (0.01s)
  819. 1168.69 s [pandoc] 7208.md
  820. 1168.70 s [pandoc] #1: OK
  821. 1168.70 s [pandoc] 9002.md
  822. 1168.72 s [pandoc] #1: OK (0.02s)
  823. 1168.72 s [pandoc] yaml-with-chomp.md
  824. 1168.73 s [pandoc] #1: OK (0.01s)
  825. 1168.73 s [pandoc] 4061.md
  826. 1168.75 s [pandoc] #1: OK (0.01s)
  827. 1168.75 s [pandoc] 6869.md
  828. 1168.76 s [pandoc] #1: OK (0.01s)
  829. 1168.76 s [pandoc] biblatex-inbook.md
  830. 1168.80 s [pandoc] #1: OK (0.04s)
  831. 1168.80 s [pandoc] 5321.md
  832. 1168.81 s [pandoc] #1: OK
  833. 1168.81 s [pandoc] #2: OK
  834. 1168.81 s [pandoc] macro-defs-in-preamble.md
  835. 1168.83 s [pandoc] #1: OK (0.01s)
  836. 1168.83 s [pandoc] 9517.md
  837. 1168.84 s [pandoc] #1: OK (0.02s)
  838. 1168.84 s [pandoc] 7743.md
  839. 1168.86 s [pandoc] #1: OK (0.02s)
  840. 1168.87 s [pandoc] #2: OK
  841. 1168.87 s [pandoc] #3: OK
  842. 1168.88 s [pandoc] #4: OK
  843. 1168.89 s [pandoc] #5: OK
  844. 1168.89 s [pandoc] #6: OK
  845. 1168.97 s [pandoc] #7: OK (0.07s)
  846. 1168.98 s [pandoc] #8: OK
  847. 1168.98 s [pandoc] 10497.md
  848. 1168.99 s [pandoc] #1: OK (0.01s)
  849. 1168.99 s [pandoc] pandoc-citeproc-327.md
  850. 1169.03 s [pandoc] #1: OK (0.04s)
  851. 1169.03 s [pandoc] 3518.md
  852. 1169.04 s [pandoc] #1: OK (0.02s)
  853. 1169.04 s [pandoc] 7134.md
  854. 1169.05 s [pandoc] #1: OK (0.01s)
  855. 1169.05 s [pandoc] biblatex-laufenberg.md
  856. 1169.08 s [pandoc] #1: OK (0.03s)
  857. 1169.08 s [pandoc] biblatex-maron.md
  858. 1169.11 s [pandoc] #1: OK (0.03s)
  859. 1169.11 s [pandoc] biblatex-inproceedings.md
  860. 1169.16 s [pandoc] #1: OK (0.05s)
  861. 1169.16 s [pandoc] 5635.md
  862. 1169.17 s [pandoc] #1: OK
  863. 1169.18 s [pandoc] #2: OK
  864. 1169.18 s [pandoc] pandoc-citeproc-64.md
  865. 1169.28 s [pandoc] #1: OK (0.10s)
  866. 1169.28 s [pandoc] 6951.md
  867. 1169.37 s [pandoc] #1: OK (0.09s)
  868. 1169.37 s [pandoc] biblatex-nietzsche-ksa1.md
  869. 1169.40 s [pandoc] #1: OK (0.04s)
  870. 1169.41 s [pandoc] figures-jats.md
  871. 1169.41 s [pandoc] #1: OK
  872. 1169.42 s [pandoc] #2: OK
  873. 1169.42 s [pandoc] biblatex-sorace.md
  874. 1169.46 s [pandoc] #1: OK (0.03s)
  875. 1169.46 s [pandoc] biblatex-test-case-conversion.md
  876. 1169.50 s [pandoc] #1: OK (0.04s)
  877. 1169.50 s [pandoc] 4748.md
  878. 1169.51 s [pandoc] #1: OK (0.01s)
  879. 1169.51 s [pandoc] 8511.md
  880. 1169.52 s [pandoc] #1: OK (0.01s)
  881. 1169.53 s [pandoc] #2: OK
  882. 1169.53 s [pandoc] 6699.md
  883. 1169.54 s [pandoc] #1: OK (0.01s)
  884. 1169.54 s [pandoc] 9555.md
  885. 1169.55 s [pandoc] #1: OK (0.01s)
  886. 1169.55 s [pandoc] pandoc-citeproc-361.md
  887. 1169.61 s [pandoc] #1: OK (0.06s)
  888. 1169.61 s [pandoc] 7339.md
  889. 1169.62 s [pandoc] #1: OK (0.01s)
  890. 1169.62 s [pandoc] 8251.md
  891. 1169.63 s [pandoc] #1: OK (0.01s)
  892. 1169.64 s [pandoc] #2: OK
  893. 1169.65 s [pandoc] 6723.md
  894. 1169.71 s [pandoc] #1: OK (0.06s)
  895. 1169.71 s [pandoc] 2874.md
  896. 1169.72 s [pandoc] #1: OK (0.01s)
  897. 1169.73 s [pandoc] #2: OK
  898. 1169.73 s [pandoc] 4667.md
  899. 1169.74 s [pandoc] #1: OK
  900. 1169.74 s [pandoc] 5072.md
  901. 1169.74 s [pandoc] #1: OK
  902. 1169.75 s [pandoc] figures-textile.md
  903. 1169.75 s [pandoc] #1: OK
  904. 1169.76 s [pandoc] #2: OK
  905. 1169.76 s [pandoc] 5543.md
  906. 1169.77 s [pandoc] #1: OK
  907. 1169.77 s [pandoc] 4499.md
  908. 1169.79 s [pandoc] #1: OK (0.01s)
  909. 1169.80 s [pandoc] #2: OK (0.02s)
  910. 1169.81 s [pandoc] #3: OK (0.01s)
  911. 1169.82 s [pandoc] #4: OK
  912. 1169.83 s [pandoc] #5: OK
  913. 1169.84 s [pandoc] #6: OK (0.01s)
  914. 1169.85 s [pandoc] #7: OK (0.01s)
  915. 1169.87 s [pandoc] #8: OK (0.01s)
  916. 1169.87 s [pandoc] #9: OK (0.01s)
  917. 1169.88 s [pandoc] #10: OK
  918. 1169.89 s [pandoc] #11: OK (0.01s)
  919. 1169.90 s [pandoc] #12: OK
  920. 1169.90 s [pandoc] 3816.md
  921. 1169.92 s [pandoc] #1: OK (0.01s)
  922. 1169.92 s [pandoc] 3236.md
  923. 1169.93 s [pandoc] #1: OK (0.01s)
  924. 1169.93 s [pandoc] 4589.md
  925. 1169.94 s [pandoc] #1: OK
  926. 1169.94 s [pandoc] 9193.md
  927. 1169.94 s [pandoc] #1: OK
  928. 1169.94 s [pandoc] 4781.md
  929. 1169.95 s [pandoc] #1: OK
  930. 1169.96 s [pandoc] #2: OK
  931. 1169.96 s [pandoc] 1166.md
  932. 1169.98 s [pandoc] #1: OK (0.02s)
  933. 1169.98 s [pandoc] 4715.md
  934. 1169.99 s [pandoc] #1: OK
  935. 1169.99 s [pandoc] 4594.md
  936. 1170.00 s [pandoc] #1: OK (0.01s)
  937. 1170.00 s [pandoc] pandoc-citeproc-14.md
  938. 1170.11 s [pandoc] #1: OK (0.11s)
  939. 1170.11 s [pandoc] 5107.md
  940. 1170.12 s [pandoc] #1: OK (0.01s)
  941. 1170.13 s [pandoc] #2: OK
  942. 1170.13 s [pandoc] 3840.md
  943. 1170.15 s [pandoc] #1: OK (0.01s)
  944. 1170.16 s [pandoc] #2: OK (0.01s)
  945. 1170.16 s [pandoc] 7006.md
  946. 1170.17 s [pandoc] #1: OK (0.01s)
  947. 1170.17 s [pandoc] 3667.md
  948. 1170.18 s [pandoc] #1: OK
  949. 1170.18 s [pandoc] 4102.md
  950. 1170.19 s [pandoc] #1: OK
  951. 1170.19 s [pandoc] 4062.md
  952. 1170.20 s [pandoc] #1: OK
  953. 1170.20 s [pandoc] short-caption.md
  954. 1170.21 s [pandoc] #1: OK
  955. 1170.21 s [pandoc] figures-org.md
  956. 1170.22 s [pandoc] #1: OK
  957. 1170.23 s [pandoc] #2: OK (0.01s)
  958. 1170.23 s [pandoc] biblatex-murray.md
  959. 1170.27 s [pandoc] #1: OK (0.04s)
  960. 1170.27 s [pandoc] 3773.md
  961. 1170.28 s [pandoc] #1: OK (0.01s)
  962. 1170.28 s [pandoc] figures-context.md
  963. 1170.29 s [pandoc] #1: OK
  964. 1170.30 s [pandoc] #2: OK (0.01s)
  965. 1170.30 s [pandoc] 5574.md
  966. 1170.31 s [pandoc] #1: OK
  967. 1170.31 s [pandoc] 8948.md
  968. 1170.33 s [pandoc] #1: OK (0.02s)
  969. 1170.35 s [pandoc] #2: OK (0.02s)
  970. 1170.36 s [pandoc] #3: OK (0.02s)
  971. 1170.36 s [pandoc] html-writer-a-in-a.md
  972. 1170.38 s [pandoc] #1: OK (0.01s)
  973. 1170.38 s [pandoc] 9777-b.md
  974. 1170.39 s [pandoc] #1: OK
  975. 1170.39 s [pandoc] 6114.md
  976. 1170.40 s [pandoc] #1: OK (0.01s)
  977. 1170.40 s [pandoc] 7919.md
  978. 1170.41 s [pandoc] #1: OK (0.01s)
  979. 1170.43 s [pandoc] #2: OK (0.02s)
  980. 1170.44 s [pandoc] #3: OK (0.01s)
  981. 1170.45 s [pandoc] #4: OK (0.01s)
  982. 1170.46 s [pandoc] #5: OK (0.01s)
  983. 1170.48 s [pandoc] #6: OK (0.02s)
  984. 1170.48 s [pandoc] 6925.md
  985. 1170.49 s [pandoc] #1: OK (0.01s)
  986. 1170.49 s [pandoc] pandoc-citeproc-65.md
  987. 1170.53 s [pandoc] #1: OK (0.04s)
  988. 1170.53 s [pandoc] 6541.md
  989. 1170.55 s [pandoc] #1: OK (0.01s)
  990. 1170.55 s [pandoc] 3533-rst-csv-tables.md
  991. 1170.57 s [pandoc] #1: OK (0.02s)
  992. 1170.59 s [pandoc] #2: OK (0.02s)
  993. 1170.61 s [pandoc] #3: OK (0.02s)
  994. 1170.61 s [pandoc] 9639.md
  995. 1170.61 s [pandoc] #1: OK
  996. 1170.61 s [pandoc] 3309.md
  997. 1170.62 s [pandoc] #1: OK
  998. 1170.63 s [pandoc] #2: OK (0.01s)
  999. 1170.64 s [pandoc] #3: OK (0.01s)
  1000. 1170.64 s [pandoc] 6755.md
  1001. 1170.65 s [pandoc] #1: OK
  1002. 1170.65 s [pandoc] 4578.md
  1003. 1170.67 s [pandoc] #1: OK (0.01s)
  1004. 1170.67 s [pandoc] 4183.md
  1005. 1170.68 s [pandoc] #1: OK (0.01s)
  1006. 1170.69 s [pandoc] #2: OK (0.01s)
  1007. 1170.70 s [pandoc] #3: OK (0.01s)
  1008. 1170.70 s [pandoc] 7181.md
  1009. 1170.71 s [pandoc] #1: OK (0.01s)
  1010. 1170.71 s [pandoc] biblatex-gonzalez.md
  1011. 1170.76 s [pandoc] #1: OK (0.04s)
  1012. 1170.76 s [pandoc] 6133.md
  1013. 1170.77 s [pandoc] #1: OK (0.01s)
  1014. 1170.77 s [pandoc] biblatex-massa.md
  1015. 1170.80 s [pandoc] #1: OK (0.03s)
  1016. 1170.80 s [pandoc] 4306.md
  1017. 1170.81 s [pandoc] #1: OK (0.01s)
  1018. 1170.81 s [pandoc] mdoc-Bl-column.md
  1019. 1170.83 s [pandoc] #1: OK (0.01s)
  1020. 1170.83 s [pandoc] 5650.md
  1021. 1170.84 s [pandoc] #1: OK (0.01s)
  1022. 1170.86 s [pandoc] #2: OK (0.02s)
  1023. 1170.86 s [pandoc] 7129.md
  1024. 1170.87 s [pandoc] #1: OK (0.01s)
  1025. 1170.87 s [pandoc] 10659.md
  1026. 1170.88 s [pandoc] #1: OK (0.01s)
  1027. 1170.90 s [pandoc] #2: OK (0.01s)
  1028. 1170.91 s [pandoc] #3: OK (0.01s)
  1029. 1170.91 s [pandoc] 8437.md
  1030. 1170.93 s [pandoc] #1: OK (0.02s)
  1031. 1170.95 s [pandoc] #2: OK (0.02s)
  1032. 1170.96 s [pandoc] #3: OK (0.01s)
  1033. 1170.96 s [pandoc] 9090.md
  1034. 1170.98 s [pandoc] #1: OK
  1035. 1170.98 s [pandoc] 6739.md
  1036. 1171.00 s [pandoc] #1: OK (0.03s)
  1037. 1171.01 s [pandoc] #2: OK (0.01s)
  1038. 1171.01 s [pandoc] 8770-document.md
  1039. 1171.03 s [pandoc] #1: OK (0.02s)
  1040. 1171.03 s [pandoc] 7810.md
  1041. 1171.04 s [pandoc] #1: OK (0.01s)
  1042. 1171.05 s [pandoc] #2: OK (0.01s)
  1043. 1171.07 s [pandoc] #3: OK (0.01s)
  1044. 1171.07 s [pandoc] biblatex-vangennep-related.md
  1045. 1171.09 s [pandoc] #1: OK (0.03s)
  1046. 1171.09 s [pandoc] 4063.md
  1047. 1171.11 s [pandoc] #1: OK (0.02s)
  1048. 1171.11 s [pandoc] smart.md
  1049. 1171.12 s [pandoc] #1: OK (0.01s)
  1050. 1171.13 s [pandoc] #2: OK (0.01s)
  1051. 1171.14 s [pandoc] #3: OK (0.01s)
  1052. 1171.16 s [pandoc] #4: OK (0.01s)
  1053. 1171.16 s [pandoc] #5: OK
  1054. 1171.18 s [pandoc] #6: OK (0.01s)
  1055. 1171.18 s [pandoc] 7858.md
  1056. 1171.19 s [pandoc] #1: OK (0.01s)
  1057. 1171.19 s [pandoc] 10812.md
  1058. 1171.20 s [pandoc] #1: OK (0.01s)
  1059. 1171.22 s [pandoc] #2: OK (0.01s)
  1060. 1171.22 s [pandoc] 10093.md
  1061. 1171.23 s [pandoc] #1: OK (0.02s)
  1062. 1171.25 s [pandoc] #2: OK (0.02s)
  1063. 1171.25 s [pandoc] 4690.md
  1064. 1171.26 s [pandoc] #1: OK (0.01s)
  1065. 1171.26 s [pandoc] 5836.md
  1066. 1171.27 s [pandoc] #1: OK (0.01s)
  1067. 1171.29 s [pandoc] #2: OK (0.01s)
  1068. 1171.29 s [pandoc] #3: OK
  1069. 1171.29 s [pandoc] biblatex-averroes-bland.md
  1070. 1171.34 s [pandoc] #1: OK (0.05s)
  1071. 1171.34 s [pandoc] 5740.md
  1072. 1171.35 s [pandoc] #1: OK (0.01s)
  1073. 1171.35 s [pandoc] 4442.md
  1074. 1171.37 s [pandoc] #1: OK (0.02s)
  1075. 1171.37 s [pandoc] pandoc-citeproc-320a.md
  1076. 1171.54 s [pandoc] #1: OK (0.17s)
  1077. 1171.54 s [pandoc] citeproc-7b.md
  1078. 1171.57 s [pandoc] #1: OK (0.04s)
  1079. 1171.57 s [pandoc] rst-links.md
  1080. 1171.59 s [pandoc] #1: OK (0.02s)
  1081. 1171.61 s [pandoc] #2: OK (0.01s)
  1082. 1171.61 s [pandoc] figures-zimwiki.md
  1083. 1171.62 s [pandoc] #1: OK (0.01s)
  1084. 1171.62 s [pandoc] alerts.md
  1085. 1171.63 s [pandoc] #1: OK
  1086. 1171.64 s [pandoc] #2: OK
  1087. 1171.64 s [pandoc] #3: OK
  1088. 1171.66 s [pandoc] #4: OK (0.01s)
  1089. 1171.67 s [pandoc] #5: OK (0.01s)
  1090. 1171.67 s [pandoc] 9391.md
  1091. 1171.70 s [pandoc] #1: OK (0.03s)
  1092. 1171.70 s [pandoc] biblatex-herrmann.md
  1093. 1171.74 s [pandoc] #1: OK (0.04s)
  1094. 1171.74 s [pandoc] biblatex-book-averroes.md
  1095. 1171.79 s [pandoc] #1: OK (0.05s)
  1096. 1171.79 s [pandoc] 3531.md
  1097. 1171.80 s [pandoc] #1: OK (0.01s)
  1098. 1171.80 s [pandoc] 7155.md
  1099. 1171.81 s [pandoc] #1: OK (0.01s)
  1100. 1171.82 s [pandoc] #2: OK
  1101. 1171.82 s [pandoc] pandoc-citeproc-213.md
  1102. 1171.88 s [pandoc] #1: OK (0.06s)
  1103. 1171.88 s [pandoc] latex-tabular-column-specs.md
  1104. 1171.89 s [pandoc] #1: OK (0.01s)
  1105. 1171.89 s [pandoc] Old
  1106. 1171.89 s [pandoc] markdown
  1107. 1171.89 s [pandoc] writer
  1108. 1172.03 s [pandoc] basic: OK (0.14s)
  1109. 1172.08 s [pandoc] tables: OK (0.04s)
  1110. 1172.10 s [pandoc] lhs to normal: OK (0.02s)
  1111. 1172.11 s [pandoc] lhs to lhs: OK (0.02s)
  1112. 1172.23 s [pandoc] basic: OK (0.11s)
  1113. 1172.28 s [pandoc] tables: OK (0.05s)
  1114. 1172.32 s [pandoc] planets table: OK (0.04s)
  1115. 1172.33 s [pandoc] nordics table: OK (0.02s)
  1116. 1172.35 s [pandoc] students table: OK (0.02s)
  1117. 1172.35 s [pandoc] reader
  1118. 1172.52 s [pandoc] basic: OK (0.17s)
  1119. 1172.61 s [pandoc] tables: OK (0.04s)
  1120. 1172.61 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  1121. 1172.61 s [pandoc] pipe tables: OK (0.05s)
  1122. 1172.69 s [pandoc] more: OK (0.08s)
  1123. 1172.70 s [pandoc] lhs: OK (0.01s)
  1124. 1172.70 s [pandoc] citations
  1125. 1172.73 s [pandoc] citations: OK (0.03s)
  1126. 1172.73 s [pandoc] rst
  1127. 1172.73 s [pandoc] writer
  1128. 1172.84 s [pandoc] basic: OK (0.11s)
  1129. 1172.88 s [pandoc] tables: OK (0.03s)
  1130. 1172.89 s [pandoc] lhs to normal: OK (0.02s)
  1131. 1172.91 s [pandoc] lhs to lhs: OK (0.02s)
  1132. 1172.91 s [pandoc] reader
  1133. 1173.02 s [pandoc] basic: OK (0.11s)
  1134. 1173.08 s [pandoc] tables: OK (0.06s)
  1135. 1173.10 s [pandoc] lhs: OK (0.02s)
  1136. 1173.10 s [pandoc] latex
  1137. 1173.10 s [pandoc] writer
  1138. 1173.21 s [pandoc] basic: OK (0.11s)
  1139. 1173.25 s [pandoc] tables: OK (0.04s)
  1140. 1173.30 s [pandoc] planets table: OK (0.05s)
  1141. 1173.32 s [pandoc] nordics table: OK (0.03s)
  1142. 1173.34 s [pandoc] students table: OK (0.02s)
  1143. 1173.36 s [pandoc] lhs to normal: OK (0.02s)
  1144. 1173.38 s [pandoc] lhs to lhs: OK (0.02s)
  1145. 1173.38 s [pandoc] reader
  1146. 1173.48 s [pandoc] basic: OK (0.10s)
  1147. 1173.49 s [pandoc] lhs: OK (0.01s)
  1148. 1173.49 s [pandoc] html
  1149. 1173.49 s [pandoc] writer
  1150. 1173.66 s [pandoc] basic: OK (0.17s)
  1151. 1173.71 s [pandoc] tables: OK (0.05s)
  1152. 1173.76 s [pandoc] planets table: OK (0.04s)
  1153. 1173.77 s [pandoc] nordics table: OK (0.02s)
  1154. 1173.79 s [pandoc] students table: OK (0.02s)
  1155. 1173.99 s [pandoc] basic: OK (0.20s)
  1156. 1174.05 s [pandoc] tables: OK (0.06s)
  1157. 1174.10 s [pandoc] planets table: OK (0.05s)
  1158. 1174.14 s [pandoc] nordics table: OK (0.05s)
  1159. 1174.17 s [pandoc] students table: OK (0.03s)
  1160. 1174.22 s [pandoc] lhs to normal: OK (0.05s)
  1161. 1174.68 s [pandoc] lhs to lhs: OK (0.46s)
  1162. 1174.85 s [pandoc] reader: OK (0.17s)
  1163. 1174.85 s [pandoc] s5
  1164. 1174.89 s [pandoc] s5 writer (basic): OK (0.04s)
  1165. 1174.92 s [pandoc] s5 writer (fancy): OK (0.03s)
  1166. 1174.95 s [pandoc] html4 writer (fragment): OK (0.03s)
  1167. 1174.98 s [pandoc] html4 writer (inserts): OK (0.04s)
  1168. 1174.98 s [pandoc] textile
  1169. 1174.98 s [pandoc] writer
  1170. 1175.10 s [pandoc] basic: OK (0.12s)
  1171. 1175.14 s [pandoc] tables: OK (0.03s)
  1172. 1175.18 s [pandoc] reader: OK (0.05s)
  1173. 1175.18 s [pandoc] djot
  1174. 1175.18 s [pandoc] writer
  1175. 1175.28 s [pandoc] basic: OK (0.10s)
  1176. 1175.32 s [pandoc] tables: OK (0.04s)
  1177. 1175.37 s [pandoc] reader: OK (0.04s)
  1178. 1175.37 s [pandoc] docbook
  1179. 1175.37 s [pandoc] writer
  1180. 1175.48 s [pandoc] basic: OK (0.11s)
  1181. 1175.52 s [pandoc] tables: OK (0.04s)
  1182. 1175.63 s [pandoc] reader: OK (0.11s)
  1183. 1175.64 s [pandoc] reader: OK (0.01s)
  1184. 1175.66 s [pandoc] reader: OK (0.02s)
  1185. 1175.66 s [pandoc] docbook5
  1186. 1175.66 s [pandoc] writer
  1187. 1175.78 s [pandoc] basic: OK (0.12s)
  1188. 1175.83 s [pandoc] tables: OK (0.05s)
  1189. 1175.83 s [pandoc] jats
  1190. 1175.83 s [pandoc] writer
  1191. 1175.83 s [pandoc] jats_archiving
  1192. 1175.99 s [pandoc] basic: OK (0.16s)
  1193. 1176.04 s [pandoc] tables: OK (0.05s)
  1194. 1176.07 s [pandoc] planets table: OK (0.04s)
  1195. 1176.09 s [pandoc] nordics table: OK (0.02s)
  1196. 1176.12 s [pandoc] students table: OK (0.03s)
  1197. 1176.12 s [pandoc] jats_articleauthoring
  1198. 1176.25 s [pandoc] basic: OK (0.13s)
  1199. 1176.29 s [pandoc] tables: OK (0.04s)
  1200. 1176.29 s [pandoc] jats_publishing
  1201. 1176.42 s [pandoc] basic: OK (0.13s)
  1202. 1176.47 s [pandoc] tables: OK (0.05s)
  1203. 1176.59 s [pandoc] reader: OK (0.13s)
  1204. 1176.59 s [pandoc] jira
  1205. 1176.59 s [pandoc] writer
  1206. 1176.71 s [pandoc] basic: OK (0.11s)
  1207. 1176.74 s [pandoc] tables: OK (0.04s)
  1208. 1176.78 s [pandoc] reader: OK (0.04s)
  1209. 1176.78 s [pandoc] native
  1210. 1176.78 s [pandoc] writer
  1211. 1176.93 s [pandoc] basic: OK (0.15s)
  1212. 1176.99 s [pandoc] tables: OK (0.06s)
  1213. 1177.00 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  1214. 1177.12 s [pandoc] reader: OK (0.13s)
  1215. 1177.12 s [pandoc] fb2
  1216. 1177.14 s [pandoc] basic: OK (0.02s)
  1217. 1177.15 s [pandoc] titles: OK
  1218. 1177.17 s [pandoc] images: OK (0.02s)
  1219. 1177.19 s [pandoc] images-embedded: OK (0.02s)
  1220. 1177.21 s [pandoc] math: OK (0.01s)
  1221. 1177.21 s [pandoc] meta: OK
  1222. 1177.26 s [pandoc] tables: OK (0.05s)
  1223. 1177.37 s [pandoc] testsuite: OK (0.11s)
  1224. 1177.37 s [pandoc] mediawiki
  1225. 1177.37 s [pandoc] writer
  1226. 1177.46 s [pandoc] basic: OK (0.09s)
  1227. 1177.50 s [pandoc] tables: OK (0.03s)
  1228. 1177.58 s [pandoc] basic: OK (0.08s)
  1229. 1177.62 s [pandoc] tables: OK (0.04s)
  1230. 1177.74 s [pandoc] planets table: OK (0.03s)
  1231. 1177.74 s [pandoc] nordics table: OK (0.02s)
  1232. 1177.74 s [pandoc] students table: OK (0.01s)
  1233. 1177.78 s [pandoc] reader: OK (0.10s)
  1234. 1177.78 s [pandoc] vimwiki
  1235. 1177.91 s [pandoc] reader: OK (0.12s)
  1236. 1177.91 s [pandoc] dokuwiki
  1237. 1177.91 s [pandoc] writer
  1238. 1178.01 s [pandoc] basic: OK (0.10s)
  1239. 1178.04 s [pandoc] tables: OK (0.04s)
  1240. 1178.06 s [pandoc] inline_formatting: OK (0.01s)
  1241. 1178.07 s [pandoc] multiblock table: OK (0.01s)
  1242. 1178.08 s [pandoc] external images: OK (0.01s)
  1243. 1178.08 s [pandoc] opml
  1244. 1178.22 s [pandoc] basic: OK (0.13s)
  1245. 1178.25 s [pandoc] reader: OK (0.03s)
  1246. 1178.25 s [pandoc] haddock
  1247. 1178.25 s [pandoc] writer
  1248. 1178.39 s [pandoc] basic: OK (0.14s)
  1249. 1178.47 s [pandoc] tables: OK (0.08s)
  1250. 1178.51 s [pandoc] reader: OK (0.04s)
  1251. 1178.51 s [pandoc] txt2tags
  1252. 1178.82 s [pandoc] reader: OK (0.32s)
  1253. 1178.82 s [pandoc] epub
  1254. 1179.07 s [pandoc] features: OK (0.24s)
  1255. 1179.44 s [pandoc] wasteland: OK (0.38s)
  1256. 1179.94 s [pandoc] formatting: OK (0.49s)
  1257. 1179.94 s [pandoc] twiki
  1258. 1180.01 s [pandoc] reader: OK (0.07s)
  1259. 1180.01 s [pandoc] tikiwiki
  1260. 1180.07 s [pandoc] reader: OK (0.07s)
  1261. 1180.07 s [pandoc] other writers
  1262. 1180.07 s [pandoc] opendocument
  1263. 1180.27 s [pandoc] basic: OK (0.20s)
  1264. 1180.32 s [pandoc] tables: OK (0.05s)
  1265. 1180.32 s [pandoc] context
  1266. 1180.44 s [pandoc] basic: OK (0.12s)
  1267. 1180.49 s [pandoc] tables: OK (0.06s)
  1268. 1180.49 s [pandoc] texinfo
  1269. 1180.63 s [pandoc] basic: OK (0.13s)
  1270. 1180.68 s [pandoc] tables: OK (0.06s)
  1271. 1180.68 s [pandoc] icml
  1272. 1180.90 s [pandoc] basic: OK (0.22s)
  1273. 1180.97 s [pandoc] tables: OK (0.07s)
  1274. 1180.98 s [pandoc] tei
  1275. 1181.12 s [pandoc] basic: OK (0.14s)
  1276. 1181.16 s [pandoc] tables: OK (0.04s)
  1277. 1181.16 s [pandoc] man
  1278. 1181.32 s [pandoc] basic: OK (0.17s)
  1279. 1181.37 s [pandoc] tables: OK (0.05s)
  1280. 1181.37 s [pandoc] plain
  1281. 1181.59 s [pandoc] basic: OK (0.22s)
  1282. 1181.68 s [pandoc] tables: OK (0.09s)
  1283. 1181.68 s [pandoc] asciidoc
  1284. 1181.89 s [pandoc] basic: OK (0.21s)
  1285. 1181.95 s [pandoc] tables: OK (0.06s)
  1286. 1181.96 s [pandoc] asciidoc_legacy
  1287. 1182.15 s [pandoc] basic: OK (0.20s)
  1288. 1182.22 s [pandoc] tables: OK (0.07s)
  1289. 1182.22 s [pandoc] xwiki
  1290. 1182.33 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  1291. 1182.45 s [pandoc] basic: OK (0.23s)
  1292. 1182.52 s [pandoc] tables: OK (0.07s)
  1293. 1182.52 s [pandoc] zimwiki
  1294. 1182.80 s [pandoc] basic: OK (0.28s)
  1295. 1182.90 s [pandoc] tables: OK (0.11s)
  1296. 1182.94 s [pandoc] writers-lang-and-dir
  1297. 1183.01 s [pandoc] latex: OK (0.11s)
  1298. 1183.07 s [pandoc] context: OK (0.06s)
  1299. 1183.07 s [pandoc] muse
  1300. 1183.07 s [pandoc] writer
  1301. 1183.36 s [pandoc] basic: OK (0.28s)
  1302. 1183.46 s [pandoc] tables: OK (0.10s)
  1303. 1183.46 s [pandoc] ms
  1304. 1183.76 s [pandoc] basic: OK (0.30s)
  1305. 1183.84 s [pandoc] tables: OK (0.08s)
  1306. 1183.84 s [pandoc] typst
  1307. 1183.84 s [pandoc] writer
  1308. 1183.89 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  1309. 1184.09 s [pandoc] basic: OK (0.24s)
  1310. 1184.14 s [pandoc] tables: OK (0.06s)
  1311. 1184.39 s [pandoc] basic: OK (0.25s)
  1312. 1184.49 s [pandoc] tables: OK (0.10s)
  1313. 1184.56 s [pandoc] planets table: OK (0.06s)
  1314. 1184.59 s [pandoc] nordics table: OK (0.04s)
  1315. 1184.62 s [pandoc] students table: OK (0.03s)
  1316. 1184.62 s [pandoc] reader
  1317. 1185.63 s [pandoc] typst-reader: OK (1.01s)
  1318. 1185.63 s [pandoc] creole
  1319. 1185.71 s [pandoc] reader: OK (0.09s)
  1320. 1185.71 s [pandoc] man
  1321. 1185.76 s [pandoc] reader: OK (0.05s)
  1322. 1185.76 s [pandoc] org
  1323. 1185.80 s [pandoc] reader: OK (0.04s)
  1324. 1185.80 s [pandoc] writer
  1325. 1186.00 s [pandoc] basic: OK (0.20s)
  1326. 1186.06 s [pandoc] tables: OK (0.06s)
  1327. 1186.06 s [pandoc] rtf
  1328. 1186.06 s [pandoc] writer
  1329. 1186.31 s [pandoc] basic: OK (0.25s)
  1330. 1186.37 s [pandoc] tables: OK (0.06s)
  1331. 1186.37 s [pandoc] endnotexml
  1332. 1186.40 s [pandoc] reader: OK (0.02s)
  1333. 1186.40 s [pandoc] ipynb
  1334. 1186.44 s [pandoc] reader: OK (0.05s)
  1335. 1186.48 s [pandoc] writer: OK (0.04s)
  1336. 1186.49 s [pandoc] reader: OK (0.02s)
  1337. 1186.53 s [pandoc] writer: OK (0.03s)
  1338. 1186.57 s [pandoc] reader: OK (0.04s)
  1339. 1186.57 s [pandoc] markua
  1340. 1186.57 s [pandoc] writer
  1341. 1186.73 s [pandoc] basic: OK (0.16s)
  1342. 1186.79 s [pandoc] tables: OK (0.06s)
  1343. 1186.79 s [pandoc] ansi
  1344. 1186.87 s [pandoc] ansi: OK (0.08s)
  1345. 1186.87 s [pandoc] pod
  1346. 1186.89 s [pandoc] pod: OK (0.03s)
  1347. 1186.89 s [pandoc] Shared
  1348. 1186.89 s [pandoc] compactifyDL
  1349. 1186.89 s [pandoc] compactifyDL with empty def: OK
  1350. 1186.89 s [pandoc] collapseFilePath
  1351. 1186.89 s [pandoc] collapse: OK
  1352. 1186.89 s [pandoc] collapse: OK
  1353. 1186.89 s [pandoc] collapse: OK
  1354. 1186.89 s [pandoc] collapse: OK
  1355. 1186.89 s [pandoc] collapse: OK
  1356. 1186.89 s [pandoc] collapse: OK
  1357. 1186.89 s [pandoc] collapse: OK
  1358. 1186.89 s [pandoc] collapse: OK
  1359. 1186.89 s [pandoc] collapse: OK
  1360. 1186.89 s [pandoc] collapse: OK
  1361. 1186.90 s [pandoc] collapse: OK
  1362. 1186.90 s [pandoc] collapse: OK
  1363. 1186.90 s [pandoc] collapse: OK
  1364. 1186.90 s [pandoc] collapse: OK
  1365. 1186.90 s [pandoc] collapse: OK
  1366. 1186.90 s [pandoc] collapse: OK
  1367. 1186.90 s [pandoc] collapse: OK
  1368. 1186.90 s [pandoc] collapse: OK
  1369. 1186.90 s [pandoc] toLegacyTable
  1370. 1186.90 s [pandoc] decomposes a table with head: OK
  1371. 1186.90 s [pandoc] decomposes a table without head: OK
  1372. 1186.90 s [pandoc] decomposes the table from issue 7683: OK
  1373. 1186.90 s [pandoc] table of contents
  1374. 1186.90 s [pandoc] empty case: OK
  1375. 1186.90 s [pandoc] no headers: OK
  1376. 1186.90 s [pandoc] unlinked header: OK
  1377. 1186.90 s [pandoc] linked header: OK
  1378. 1186.90 s [pandoc] nested headlines: OK
  1379. 1186.90 s [pandoc] only referenced headers: OK
  1380. 1186.90 s [pandoc] section id used as backup: OK
  1381. 1186.91 s [pandoc] makeSections
  1382. 1187.20 s [pandoc] makeSections is idempotent: OK (0.30s)
  1383. 1187.20 s [pandoc] +++ OK, passed 100 tests.
  1384. 1187.20 s [pandoc] makeSections is idempotent for test case: OK
  1385. 1187.20 s [pandoc] MediaBag
  1386. 1187.20 s [pandoc] test fillMediaBag & extractMedia: OK
  1387. 1187.21 s [pandoc] Writers
  1388. 1187.21 s [pandoc] Native
  1389. 1189.53 s [pandoc] p_write_rt: OK (2.33s)
  1390. 1189.60 s [pandoc] +++ OK, passed 100 tests.
  1391. 1189.88 s [pandoc] p_write_blocks_rt: OK (0.36s)
  1392. 1189.88 s [pandoc] +++ OK, passed 100 tests.
  1393. 1189.88 s [pandoc] ConTeXt
  1394. 1189.88 s [pandoc] inline code
  1395. 1189.88 s [pandoc] with '}': OK
  1396. 1189.88 s [pandoc] without '}': OK
  1397. 1189.88 s [pandoc] span with ID: OK
  1398. 1189.89 s [pandoc] code property: OK
  1399. 1189.89 s [pandoc] +++ OK, passed 100 tests.
  1400. 1189.89 s [pandoc] headers
  1401. 1189.89 s [pandoc] level 1: OK
  1402. 1189.89 s [pandoc] Section as top-level: OK
  1403. 1189.89 s [pandoc] bullet lists
  1404. 1189.89 s [pandoc] nested: OK
  1405. 1189.89 s [pandoc] natural tables
  1406. 1189.89 s [pandoc] table with header and caption: OK
  1407. 1189.89 s [pandoc] LaTeX
  1408. 1189.89 s [pandoc] code blocks
  1409. 1189.89 s [pandoc] in footnotes: OK
  1410. 1189.89 s [pandoc] identifier: OK
  1411. 1189.89 s [pandoc] no identifier: OK
  1412. 1189.89 s [pandoc] definition lists
  1413. 1189.89 s [pandoc] with internal link: OK
  1414. 1189.89 s [pandoc] math
  1415. 1189.89 s [pandoc] escape |: OK
  1416. 1189.89 s [pandoc] headers
  1417. 1189.89 s [pandoc] unnumbered header: OK
  1418. 1189.89 s [pandoc] in list item: OK
  1419. 1189.89 s [pandoc] in definition list item: OK
  1420. 1189.89 s [pandoc] containing image: OK
  1421. 1189.89 s [pandoc] inline code
  1422. 1189.89 s [pandoc] struck out and highlighted: OK
  1423. 1189.89 s [pandoc] struck out and not highlighted: OK
  1424. 1189.89 s [pandoc] single quotes: OK
  1425. 1189.89 s [pandoc] backtick: OK
  1426. 1189.89 s [pandoc] inline note
  1427. 1189.89 s [pandoc] Big note in emph: OK
  1428. 1189.89 s [pandoc] Big note in strong: OK
  1429. 1189.89 s [pandoc] Big note in underline: OK
  1430. 1189.89 s [pandoc] Big note in strikeout: OK
  1431. 1189.89 s [pandoc] Small note in emph: OK
  1432. 1189.89 s [pandoc] Big note nested in emph and strong: OK
  1433. 1189.89 s [pandoc] Two Big notes in emph: OK
  1434. 1189.89 s [pandoc] writer options
  1435. 1189.89 s [pandoc] top-level division
  1436. 1189.89 s [pandoc] sections as top-level: OK
  1437. 1189.89 s [pandoc] chapters as top-level: OK
  1438. 1189.89 s [pandoc] parts as top-level: OK
  1439. 1189.89 s [pandoc] default top-level: OK
  1440. 1189.89 s [pandoc] sections as top-level in beamer: OK
  1441. 1189.89 s [pandoc] chapters are as part in beamer: OK
  1442. 1189.89 s [pandoc] parts as top-level in beamer: OK
  1443. 1189.90 s [pandoc] default top-level in beamer: OK
  1444. 1189.92 s [pandoc] part top-level, section not in toc: OK
  1445. 1189.92 s [pandoc] HTML
  1446. 1189.93 s [pandoc] inline code
  1447. 1190.06 s [pandoc] basic: OK
  1448. 1190.06 s [pandoc] haskell: OK
  1449. 1190.41 s [pandoc] nolanguage: OK (0.51s)
  1450. 1190.41 s [pandoc] images
  1451. 1190.41 s [pandoc] alt with formatting: OK
  1452. 1190.41 s [pandoc] blocks
  1453. 1190.41 s [pandoc] definition list with empty <dt>: OK
  1454. 1190.41 s [pandoc] heading with disallowed attributes: OK
  1455. 1190.41 s [pandoc] quotes
  1456. 1190.41 s [pandoc] quote with cite attribute (without q-tags): OK
  1457. 1190.41 s [pandoc] quote with cite attribute (with q-tags): OK
  1458. 1190.41 s [pandoc] code
  1459. 1190.41 s [pandoc] code should be rendered correctly: OK
  1460. 1190.41 s [pandoc] sample
  1461. 1190.41 s [pandoc] sample should be rendered correctly: OK
  1462. 1190.41 s [pandoc] variable
  1463. 1190.41 s [pandoc] variable should be rendered correctly: OK
  1464. 1190.41 s [pandoc] sample with style
  1465. 1190.41 s [pandoc] samp should wrap highlighted code: OK
  1466. 1190.41 s [pandoc] variable with style
  1467. 1190.41 s [pandoc] var should wrap highlighted code: OK
  1468. 1190.41 s [pandoc] footnotes
  1469. 1190.41 s [pandoc] at the end of a document: OK
  1470. 1190.41 s [pandoc] at the end of a block: OK
  1471. 1190.41 s [pandoc] at the end of a section: OK
  1472. 1190.41 s [pandoc] at the end of a section, with section divs: OK
  1473. 1190.41 s [pandoc] JATS
  1474. 1190.41 s [pandoc] inline code
  1475. 1190.41 s [pandoc] basic: OK
  1476. 1190.41 s [pandoc] block code
  1477. 1190.41 s [pandoc] basic: OK
  1478. 1190.41 s [pandoc] lang: OK
  1479. 1190.41 s [pandoc] images
  1480. 1190.41 s [pandoc] basic: OK
  1481. 1190.41 s [pandoc] inlines
  1482. 1190.41 s [pandoc] Emphasis: OK
  1483. 1190.41 s [pandoc] footnote in articleauthoring tag set: OK
  1484. 1190.41 s [pandoc] bullet list
  1485. 1190.41 s [pandoc] plain items: OK
  1486. 1190.42 s [pandoc] item with implicit figure: OK
  1487. 1190.42 s [pandoc] definition lists
  1488. 1190.42 s [pandoc] with internal link: OK
  1489. 1190.42 s [pandoc] math
  1490. 1190.42 s [pandoc] escape |: OK
  1491. 1190.42 s [pandoc] headers
  1492. 1190.42 s [pandoc] unnumbered header: OK
  1493. 1190.42 s [pandoc] unnumbered sub header: OK
  1494. 1190.42 s [pandoc] containing image: OK
  1495. 1190.42 s [pandoc] ids
  1496. 1190.42 s [pandoc] non-ASCII in header ID: OK
  1497. 1190.42 s [pandoc] disallowed symbol in header id: OK
  1498. 1190.42 s [pandoc] disallowed symbols in internal link target: OK
  1499. 1190.42 s [pandoc] code id starting with a number: OK
  1500. 1190.42 s [pandoc] spans
  1501. 1190.42 s [pandoc] unwrapped if no attributes given: OK
  1502. 1190.42 s [pandoc] converted to named-content element if class given: OK
  1503. 1190.42 s [pandoc] unwrapped if styled-content element would have no at...: OK
  1504. 1190.42 s [pandoc] use content-type attribute if present: OK
  1505. 1190.42 s [pandoc] Jira
  1506. 1190.42 s [pandoc] inlines
  1507. 1190.42 s [pandoc] underlined text: OK
  1508. 1190.42 s [pandoc] image with attributes: OK
  1509. 1190.42 s [pandoc] links
  1510. 1190.42 s [pandoc] external link: OK
  1511. 1190.42 s [pandoc] external link without description: OK
  1512. 1190.42 s [pandoc] email link: OK
  1513. 1190.42 s [pandoc] email link without description: OK
  1514. 1190.42 s [pandoc] attachment link: OK
  1515. 1190.42 s [pandoc] attachment link without description: OK
  1516. 1190.42 s [pandoc] user link: OK
  1517. 1190.42 s [pandoc] user link with user as description: OK
  1518. 1190.42 s [pandoc] 'smart' link: OK
  1519. 1190.42 s [pandoc] 'smart' card: OK
  1520. 1190.42 s [pandoc] spans
  1521. 1190.42 s [pandoc] id is used as anchor: OK
  1522. 1190.42 s [pandoc] use `color` attribute: OK
  1523. 1190.42 s [pandoc] code
  1524. 1190.42 s [pandoc] code block with known language: OK
  1525. 1190.42 s [pandoc] code block without language: OK
  1526. 1190.42 s [pandoc] blocks
  1527. 1190.42 s [pandoc] div
  1528. 1190.42 s [pandoc] empty attributes: OK
  1529. 1190.42 s [pandoc] just identifier: OK
  1530. 1190.42 s [pandoc] with class 'panel': OK
  1531. 1190.42 s [pandoc] panel with id: OK
  1532. 1190.42 s [pandoc] title attribute: OK
  1533. 1190.42 s [pandoc] nested panels: OK
  1534. 1190.42 s [pandoc] Docbook
  1535. 1190.42 s [pandoc] inline elements
  1536. 1190.42 s [pandoc] links
  1537. 1190.42 s [pandoc] db4 external link: OK
  1538. 1190.42 s [pandoc] db5 external link: OK
  1539. 1190.42 s [pandoc] anchor: OK
  1540. 1190.42 s [pandoc] automatic anchor: OK
  1541. 1190.42 s [pandoc] line blocks
  1542. 1190.42 s [pandoc] none: OK
  1543. 1190.42 s [pandoc] basic: OK
  1544. 1190.42 s [pandoc] blockquote: OK
  1545. 1190.42 s [pandoc] footnote: OK
  1546. 1190.42 s [pandoc] divs
  1547. 1190.42 s [pandoc] admonition: OK
  1548. 1190.42 s [pandoc] admonition-with-title: OK
  1549. 1190.43 s [pandoc] admonition-with-title-in-para: OK
  1550. 1190.43 s [pandoc] single-child: OK
  1551. 1190.43 s [pandoc] single-literal-child: OK
  1552. 1190.43 s [pandoc] multiple-children: OK
  1553. 1190.43 s [pandoc] compact lists
  1554. 1190.43 s [pandoc] bullet
  1555. 1190.43 s [pandoc] compact: OK
  1556. 1190.43 s [pandoc] loose: OK
  1557. 1190.43 s [pandoc] ordered
  1558. 1190.43 s [pandoc] compact: OK
  1559. 1190.43 s [pandoc] loose: OK
  1560. 1190.43 s [pandoc] definition
  1561. 1190.43 s [pandoc] compact: OK
  1562. 1190.43 s [pandoc] loose: OK
  1563. 1190.43 s [pandoc] writer options
  1564. 1190.43 s [pandoc] top-level division
  1565. 1190.43 s [pandoc] sections as top-level: OK
  1566. 1190.43 s [pandoc] chapters as top-level: OK
  1567. 1190.43 s [pandoc] parts as top-level: OK
  1568. 1190.43 s [pandoc] default top-level: OK
  1569. 1190.43 s [pandoc] section attributes
  1570. 1190.43 s [pandoc] sections with attributes (db5): OK
  1571. 1190.43 s [pandoc] sections with attributes (db4): OK
  1572. 1190.43 s [pandoc] Markdown
  1573. 1190.43 s [pandoc] indented code after list: OK
  1574. 1190.43 s [pandoc] list with tight sublist: OK
  1575. 1190.43 s [pandoc] emph/strong with spaces (#10696): OK
  1576. 1190.43 s [pandoc] note and reference location
  1577. 1190.43 s [pandoc] footnotes at the end of a document: OK
  1578. 1190.43 s [pandoc] footnotes at the end of blocks: OK
  1579. 1190.43 s [pandoc] footnotes and reference links at the end of blocks: OK
  1580. 1190.43 s [pandoc] footnotes at the end of section: OK
  1581. 1190.43 s [pandoc] Shortcut reference links
  1582. 1190.43 s [pandoc] Simple link (shortcutable): OK
  1583. 1190.43 s [pandoc] Followed by another link (unshortcutable): OK
  1584. 1190.43 s [pandoc] Followed by space and another link (unshortcutable): OK
  1585. 1190.43 s [pandoc] Reference link is used multiple times (unshortcutable): OK
  1586. 1190.43 s [pandoc] Reference link is used multiple times (unshortcutable): OK
  1587. 1190.43 s [pandoc] Reference link is followed by text in brackets: OK
  1588. 1190.43 s [pandoc] Reference link is followed by space and text in brac...: OK
  1589. 1190.43 s [pandoc] Reference link is followed by RawInline: OK
  1590. 1190.44 s [pandoc] Reference link is followed by space and RawInline: OK
  1591. 1190.44 s [pandoc] Reference link is followed by RawInline with space: OK
  1592. 1190.44 s [pandoc] Reference link is followed by citation: OK
  1593. 1190.44 s [pandoc] Reference link is followed by space and citation: OK
  1594. 1190.44 s [pandoc] Org
  1595. 1190.44 s [pandoc] links
  1596. 1190.44 s [pandoc] simple link: OK
  1597. 1190.44 s [pandoc] internal link to anchor: OK
  1598. 1190.44 s [pandoc] lists
  1599. 1190.44 s [pandoc] bullet task list: OK
  1600. 1190.44 s [pandoc] ordered task list: OK
  1601. 1190.44 s [pandoc] ordered task list with starting number: OK
  1602. 1190.44 s [pandoc] bullet without task_lists: OK
  1603. 1190.44 s [pandoc] code blocks
  1604. 1190.44 s [pandoc] identifier: OK
  1605. 1190.44 s [pandoc] attributes: OK
  1606. 1190.44 s [pandoc] Plain
  1607. 1190.44 s [pandoc] strongly emphasized text to uppercase: OK
  1608. 1190.44 s [pandoc] AsciiDoc
  1609. 1190.44 s [pandoc] emphasis
  1610. 1190.44 s [pandoc] emph word before: OK
  1611. 1190.44 s [pandoc] emph word after: OK
  1612. 1190.44 s [pandoc] emph quoted: OK
  1613. 1190.44 s [pandoc] strong word before: OK
  1614. 1190.44 s [pandoc] strong word after: OK
  1615. 1190.44 s [pandoc] strong quoted: OK
  1616. 1190.44 s [pandoc] blocks
  1617. 1190.44 s [pandoc] code block without line numbers: OK
  1618. 1190.44 s [pandoc] code block with line numbers: OK
  1619. 1190.44 s [pandoc] sidebar block: OK
  1620. 1190.44 s [pandoc] tables
  1621. 1190.44 s [pandoc] empty cells: OK
  1622. 1190.44 s [pandoc] multiblock cells: OK
  1623. 1190.44 s [pandoc] lists
  1624. 1190.44 s [pandoc] bullet task list: OK
  1625. 1190.44 s [pandoc] Docx
  1626. 1190.44 s [pandoc] inlines
  1627. 1190.69 s [pandoc] font formatting: OK (0.25s)
  1628. 1190.78 s [pandoc] hyperlinks: OK (0.09s)
  1629. 1190.91 s [pandoc] inline image: OK (0.13s)
  1630. 1191.04 s [pandoc] inline images: OK (0.13s)
  1631. 1191.18 s [pandoc] handling unicode input: OK (0.14s)
  1632. 1191.33 s [pandoc] inline code: OK (0.15s)
  1633. 1191.52 s [pandoc] inline code in subscript and superscript: OK (0.19s)
  1634. 1191.52 s [pandoc] blocks
  1635. 1191.70 s [pandoc] headers: OK (0.18s)
  1636. 1191.91 s [pandoc] nested anchor spans in header: OK (0.20s)
  1637. 1192.15 s [pandoc] lists: OK (0.23s)
  1638. 1192.29 s [pandoc] lists continuing after interruption: OK (0.14s)
  1639. 1192.43 s [pandoc] lists restarting after interruption: OK (0.14s)
  1640. 1192.66 s [pandoc] lists with multiple initial list levels: OK (0.23s)
  1641. 1192.77 s [pandoc] lists with div bullets: OK (0.11s)
  1642. 1192.87 s [pandoc] definition lists: OK (0.10s)
  1643. 1193.03 s [pandoc] task lists: OK (0.14s)
  1644. 1193.17 s [pandoc] issue 9994: OK (0.14s)
  1645. 1193.31 s [pandoc] footnotes and endnotes: OK (0.14s)
  1646. 1193.41 s [pandoc] links in footnotes and endnotes: OK (0.09s)
  1647. 1193.47 s [pandoc] blockquotes: OK (0.06s)
  1648. 1193.52 s [pandoc] tables: OK (0.05s)
  1649. 1193.60 s [pandoc] tables without explicit column widths: OK (0.08s)
  1650. 1193.73 s [pandoc] tables with lists in cells: OK (0.12s)
  1651. 1193.88 s [pandoc] tables with one row: OK (0.15s)
  1652. 1194.17 s [pandoc] tables separated with RawBlock: OK (0.28s)
  1653. 1194.31 s [pandoc] code block: OK (0.14s)
  1654. 1194.42 s [pandoc] raw OOXML blocks: OK (0.11s)
  1655. 1194.57 s [pandoc] raw bookmark markers: OK (0.14s)
  1656. 1194.57 s [pandoc] track changes
  1657. 1194.70 s [pandoc] insertion: OK (0.13s)
  1658. 1194.82 s [pandoc] deletion: OK (0.12s)
  1659. 1194.98 s [pandoc] move text: OK (0.16s)
  1660. 1195.16 s [pandoc] comments: OK (0.19s)
  1661. 1195.33 s [pandoc] scrubbed metadata: OK (0.16s)
  1662. 1195.33 s [pandoc] custom styles
  1663. 1195.54 s [pandoc] custom styles without reference.docx: OK (0.21s)
  1664. 1195.84 s [pandoc] custom styles with reference.docx: OK (0.29s)
  1665. 1196.02 s [pandoc] suppress custom style for headers and blockquotes: OK (0.18s)
  1666. 1196.02 s [pandoc] metadata
  1667. 1196.17 s [pandoc] document properties (core, custom): OK (0.15s)
  1668. 1196.31 s [pandoc] document properties (short description): OK (0.14s)
  1669. 1196.31 s [pandoc] RST
  1670. 1196.31 s [pandoc] rubrics
  1671. 1196.31 s [pandoc] in list item: OK
  1672. 1196.31 s [pandoc] in definition list item: OK
  1673. 1196.31 s [pandoc] in block quote: OK
  1674. 1196.31 s [pandoc] with id: OK
  1675. 1196.31 s [pandoc] with id class: OK
  1676. 1196.31 s [pandoc] ligatures
  1677. 1196.31 s [pandoc] a list is closed by a comment before a quote: OK
  1678. 1196.31 s [pandoc] flatten
  1679. 1196.31 s [pandoc] emerges nested styles as expected: OK
  1680. 1196.31 s [pandoc] could introduce trailing spaces: OK
  1681. 1196.31 s [pandoc] preserves empty parents: OK
  1682. 1196.31 s [pandoc] inlines
  1683. 1196.31 s [pandoc] are removed when empty: OK
  1684. 1196.31 s [pandoc] do not cause the introduction of extra spaces when r...: OK
  1685. 1196.31 s [pandoc] spaces are stripped at beginning and end: OK
  1686. 1196.31 s [pandoc] single space stripped: OK
  1687. 1196.31 s [pandoc] give priority to strong style over emphasis: OK
  1688. 1196.31 s [pandoc] links are not elided by outer style: OK
  1689. 1196.31 s [pandoc] RST inlines cannot start nor end with spaces: OK
  1690. 1196.31 s [pandoc] keeps quotes: OK
  1691. 1196.31 s [pandoc] backslash inserted between str and code: OK
  1692. 1196.31 s [pandoc] headings
  1693. 1196.31 s [pandoc] normal heading: OK
  1694. 1196.31 s [pandoc] heading levels: OK
  1695. 1196.31 s [pandoc] minimal heading levels: OK
  1696. 1196.31 s [pandoc] subtitle: OK
  1697. 1196.31 s [pandoc] TEI
  1698. 1196.31 s [pandoc] block elements
  1699. 1196.31 s [pandoc] para: OK
  1700. 1196.31 s [pandoc] inlines
  1701. 1196.31 s [pandoc] Emphasis: OK
  1702. 1196.31 s [pandoc] SingleQuoted: OK
  1703. 1196.31 s [pandoc] DoubleQuoted: OK
  1704. 1196.31 s [pandoc] NestedQuoted: OK
  1705. 1196.31 s [pandoc] markua
  1706. 1196.31 s [pandoc] simple blurb/aside
  1707. 1196.31 s [pandoc] blurb: OK
  1708. 1196.31 s [pandoc] aside: OK
  1709. 1196.31 s [pandoc] multiclass blurb/aside
  1710. 1196.31 s [pandoc] blurb: OK
  1711. 1196.31 s [pandoc] aside: OK
  1712. 1196.31 s [pandoc] Muse
  1713. 1196.31 s [pandoc] block elements
  1714. 1196.31 s [pandoc] plain: OK
  1715. 1196.31 s [pandoc] paragraphs
  1716. 1196.31 s [pandoc] single paragraph: OK
  1717. 1196.31 s [pandoc] two paragraphs: OK
  1718. 1196.31 s [pandoc] line block: OK
  1719. 1196.31 s [pandoc] code block: OK
  1720. 1196.31 s [pandoc] html raw block: OK
  1721. 1196.31 s [pandoc] block quote: OK
  1722. 1196.31 s [pandoc] lists
  1723. 1196.31 s [pandoc] simple lists
  1724. 1196.31 s [pandoc] ordered list: OK
  1725. 1196.31 s [pandoc] ordered list with Roman numerals: OK
  1726. 1196.31 s [pandoc] bullet list: OK
  1727. 1196.31 s [pandoc] definition list: OK
  1728. 1196.31 s [pandoc] definition list with multiple descriptions: OK
  1729. 1196.31 s [pandoc] definition list with empty term: OK
  1730. 1196.31 s [pandoc] definition list terms starting with space: OK
  1731. 1196.31 s [pandoc] definition list terms starting with list markers: OK
  1732. 1196.31 s [pandoc] sequential lists
  1733. 1196.31 s [pandoc] bullet lists: OK
  1734. 1196.31 s [pandoc] ordered lists of the same style: OK
  1735. 1196.32 s [pandoc] ordered lists with equal styles: OK
  1736. 1196.32 s [pandoc] bullet and ordered lists: OK
  1737. 1196.32 s [pandoc] different style ordered lists: OK
  1738. 1196.32 s [pandoc] nested lists
  1739. 1196.32 s [pandoc] nested ordered list: OK
  1740. 1196.32 s [pandoc] nested bullet lists: OK
  1741. 1196.32 s [pandoc] nested definition lists: OK
  1742. 1196.32 s [pandoc] list item starting with list: OK
  1743. 1196.32 s [pandoc] List inside block quote: OK
  1744. 1196.32 s [pandoc] headings
  1745. 1196.32 s [pandoc] normal heading: OK
  1746. 1196.32 s [pandoc] heading levels: OK
  1747. 1196.32 s [pandoc] heading with ID: OK
  1748. 1196.32 s [pandoc] empty heading: OK
  1749. 1196.32 s [pandoc] horizontal rule: OK
  1750. 1196.32 s [pandoc] escape horizontal rule: OK
  1751. 1196.32 s [pandoc] escape long horizontal rule: OK
  1752. 1196.32 s [pandoc] don't escape horizontal inside paragraph: OK
  1753. 1196.32 s [pandoc] escape nonbreaking space: OK
  1754. 1196.32 s [pandoc] escape > in the beginning of line: OK
  1755. 1196.32 s [pandoc] escape string with > and space in the beginning of l...: OK
  1756. 1196.32 s [pandoc] tables
  1757. 1196.32 s [pandoc] table without header: OK
  1758. 1196.32 s [pandoc] table with header: OK
  1759. 1196.32 s [pandoc] table with header and caption: OK
  1760. 1196.32 s [pandoc] table inside bullet list: OK
  1761. 1196.32 s [pandoc] table with one column: OK
  1762. 1196.32 s [pandoc] div with bullet list: OK
  1763. 1196.32 s [pandoc] inline elements
  1764. 1196.32 s [pandoc] string
  1765. 1196.32 s [pandoc] string: OK
  1766. 1196.32 s [pandoc] escape footnote: OK
  1767. 1196.32 s [pandoc] escape secondary note: OK
  1768. 1196.32 s [pandoc] do not escape brackets: OK
  1769. 1196.32 s [pandoc] escape verbatim close tag: OK
  1770. 1196.32 s [pandoc] escape link-like text: OK
  1771. 1196.32 s [pandoc] escape pipe to avoid accidental tables: OK
  1772. 1196.32 s [pandoc] escape hash to avoid accidental anchors: OK
  1773. 1196.32 s [pandoc] escape definition list markers: OK
  1774. 1196.32 s [pandoc] normalize strings before escaping: OK
  1775. 1196.32 s [pandoc] do not escape colon: OK
  1776. 1196.32 s [pandoc] escape - to avoid accidental unordered lists: OK
  1777. 1196.32 s [pandoc] escape - inside a list to avoid accidental nested un...: OK
  1778. 1196.32 s [pandoc] escape strings starting with - inside a list: OK
  1779. 1196.32 s [pandoc] escape - inside a note: OK
  1780. 1196.32 s [pandoc] escape - after softbreak in note: OK
  1781. 1196.32 s [pandoc] escape ; to avoid accidental comments: OK
  1782. 1196.32 s [pandoc] escape strings starting with ; and space: OK
  1783. 1196.32 s [pandoc] escape ; after softbreak: OK
  1784. 1196.32 s [pandoc] escape ; after linebreak: OK
  1785. 1196.32 s [pandoc] do not escape ; inside paragraph: OK
  1786. 1196.32 s [pandoc] escape newlines: OK
  1787. 1196.32 s [pandoc] emphasis
  1788. 1196.33 s [pandoc] emphasis: OK
  1789. 1196.33 s [pandoc] emphasis inside word: OK
  1790. 1196.33 s [pandoc] emphasis before comma: OK
  1791. 1196.33 s [pandoc] emphasis before period: OK
  1792. 1196.33 s [pandoc] empty emphasis: OK
  1793. 1196.33 s [pandoc] empty strong: OK
  1794. 1196.33 s [pandoc] empty strong emphasis: OK
  1795. 1196.33 s [pandoc] empty emphasized strong: OK
  1796. 1196.33 s [pandoc] emphasized empty string: OK
  1797. 1196.33 s [pandoc] strong empty string: OK
  1798. 1196.33 s [pandoc] strong emphasized empty string: OK
  1799. 1196.33 s [pandoc] emphasized strong empty string: OK
  1800. 1196.33 s [pandoc] emphasized string with space: OK
  1801. 1196.33 s [pandoc] emphasized string ending with space: OK
  1802. 1196.33 s [pandoc] emphasized string with tab: OK
  1803. 1196.33 s [pandoc] emphasized space between empty strings: OK
  1804. 1196.33 s [pandoc] strong: OK
  1805. 1196.33 s [pandoc] strong inside word: OK
  1806. 1196.33 s [pandoc] strong emphasis: OK
  1807. 1196.33 s [pandoc] strong after emphasis: OK
  1808. 1196.33 s [pandoc] strong emphasis after emphasis: OK
  1809. 1196.33 s [pandoc] strong in the end of emphasis: OK
  1810. 1196.33 s [pandoc] switch to lightweight markup after <em> tag: OK
  1811. 1196.33 s [pandoc] strikeout: OK
  1812. 1196.33 s [pandoc] space at the beginning of emphasis: OK
  1813. 1196.33 s [pandoc] space at the end of emphasis: OK
  1814. 1196.33 s [pandoc] space at the beginning of strong: OK
  1815. 1196.33 s [pandoc] space at the end of strong: OK
  1816. 1196.33 s [pandoc] space at the beginning of strong emphasis: OK
  1817. 1196.33 s [pandoc] space at the end of strong emphasis: OK
  1818. 1196.33 s [pandoc] space at the beginning of emphasiszed strong: OK
  1819. 1196.33 s [pandoc] space at the end of emphasized strong: OK
  1820. 1196.33 s [pandoc] superscript: OK
  1821. 1196.33 s [pandoc] subscript: OK
  1822. 1196.33 s [pandoc] smallcaps: OK
  1823. 1196.33 s [pandoc] smallcaps near emphasis: OK
  1824. 1196.33 s [pandoc] single quoted: OK
  1825. 1196.33 s [pandoc] double quoted: OK
  1826. 1196.33 s [pandoc] code
  1827. 1196.33 s [pandoc] simple: OK
  1828. 1196.33 s [pandoc] empty: OK
  1829. 1196.33 s [pandoc] space: OK
  1830. 1196.33 s [pandoc] space at the beginning: OK
  1831. 1196.33 s [pandoc] space at the end: OK
  1832. 1196.33 s [pandoc] use tags for =: OK
  1833. 1196.33 s [pandoc] escape tag: OK
  1834. 1196.33 s [pandoc] normalization with attributes: OK
  1835. 1196.33 s [pandoc] code tag: OK
  1836. 1196.33 s [pandoc] normalization: OK
  1837. 1196.33 s [pandoc] normalization with empty string: OK
  1838. 1196.33 s [pandoc] emphasized code: OK
  1839. 1196.33 s [pandoc] strong code: OK
  1840. 1196.33 s [pandoc] spaces
  1841. 1196.33 s [pandoc] space: OK
  1842. 1196.33 s [pandoc] soft break: OK
  1843. 1196.33 s [pandoc] remove soft break: OK
  1844. 1196.33 s [pandoc] line break: OK
  1845. 1196.33 s [pandoc] line break at the end: OK
  1846. 1196.33 s [pandoc] no newline after line break in header: OK
  1847. 1196.33 s [pandoc] no softbreak in header: OK
  1848. 1196.33 s [pandoc] math
  1849. 1196.33 s [pandoc] inline math: OK
  1850. 1196.33 s [pandoc] display math: OK
  1851. 1196.33 s [pandoc] multiple letters in inline math: OK
  1852. 1196.33 s [pandoc] expand math before normalization: OK
  1853. 1196.33 s [pandoc] multiple math expressions inside one inline list: OK
  1854. 1196.33 s [pandoc] raw inline: OK
  1855. 1196.33 s [pandoc] links
  1856. 1196.33 s [pandoc] link with description: OK
  1857. 1196.33 s [pandoc] link without description: OK
  1858. 1196.33 s [pandoc] link to anchor: OK
  1859. 1196.34 s [pandoc] link to image with description: OK
  1860. 1196.34 s [pandoc] link to image without description: OK
  1861. 1196.34 s [pandoc] escape brackets in links
  1862. 1196.34 s [pandoc] link with description: OK
  1863. 1196.34 s [pandoc] link without description: OK
  1864. 1196.34 s [pandoc] image link with description: OK
  1865. 1196.34 s [pandoc] image link without description: OK
  1866. 1196.34 s [pandoc] image: OK
  1867. 1196.34 s [pandoc] image with width: OK
  1868. 1196.34 s [pandoc] left-aligned image with width: OK
  1869. 1196.34 s [pandoc] right-aligned image with width: OK
  1870. 1196.34 s [pandoc] escape brackets in image title: OK
  1871. 1196.34 s [pandoc] note: OK
  1872. 1196.34 s [pandoc] note location
  1873. 1196.34 s [pandoc] footnotes at the end of document: OK
  1874. 1196.34 s [pandoc] footnotes at the end of block: OK
  1875. 1196.34 s [pandoc] footnotes at the end of section: OK
  1876. 1196.34 s [pandoc] span with class: OK
  1877. 1196.34 s [pandoc] span without class: OK
  1878. 1196.34 s [pandoc] span with anchor: OK
  1879. 1196.34 s [pandoc] empty span with anchor: OK
  1880. 1196.34 s [pandoc] empty span without class and anchor: OK
  1881. 1196.34 s [pandoc] span with class and anchor: OK
  1882. 1196.34 s [pandoc] adjacent spans: OK
  1883. 1196.34 s [pandoc] RTL
  1884. 1196.34 s [pandoc] RTL span: OK
  1885. 1196.34 s [pandoc] LTR span: OK
  1886. 1196.34 s [pandoc] RTL span with a class: OK
  1887. 1196.34 s [pandoc] LTR span with a class: OK
  1888. 1196.34 s [pandoc] Escape <<< and >>>: OK
  1889. 1196.34 s [pandoc] combined
  1890. 1196.34 s [pandoc] emph word before: OK
  1891. 1196.34 s [pandoc] emph word after: OK
  1892. 1196.34 s [pandoc] emph quoted: OK
  1893. 1196.34 s [pandoc] strong word before: OK
  1894. 1196.34 s [pandoc] strong word after: OK
  1895. 1196.34 s [pandoc] strong quoted: OK
  1896. 1196.34 s [pandoc] FB2
  1897. 1196.34 s [pandoc] block elements
  1898. 1196.34 s [pandoc] para: OK
  1899. 1196.34 s [pandoc] inlines
  1900. 1196.34 s [pandoc] Emphasis: OK
  1901. 1196.34 s [pandoc] bullet list: OK
  1902. 1196.34 s [pandoc] PowerPoint
  1903. 1196.34 s [pandoc] Default slide formatting
  1904. 1196.46 s [pandoc] Inline formatting: OK (0.12s)
  1905. 1196.59 s [pandoc] Slide breaks (default slide-level): OK (0.13s)
  1906. 1196.71 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  1907. 1196.71 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  1908. 1196.77 s [pandoc] slide breaks (slide-level set to 1): OK (0.18s)
  1909. 1197.03 s [pandoc] lists: OK (0.25s)
  1910. 1197.37 s [pandoc] start ordered list at specified num: OK (0.32s)
  1911. 1197.60 s [pandoc] List continuation paragraph indentation: OK (0.26s)
  1912. 1197.86 s [pandoc] tables: OK (0.26s)
  1913. 1198.02 s [pandoc] table of contents: OK (0.16s)
  1914. 1198.14 s [pandoc] end notes: OK (0.12s)
  1915. 1198.45 s [pandoc] end notes, with table of contents: OK (0.31s)
  1916. 1198.75 s [pandoc] images: OK (0.31s)
  1917. 1198.92 s [pandoc] two-column layout: OK (0.16s)
  1918. 1199.13 s [pandoc] two-column (not comparison): OK (0.22s)
  1919. 1199.39 s [pandoc] speaker notes: OK (0.26s)
  1920. 1200.01 s [pandoc] speaker notes after a separating block: OK (0.61s)
  1921. 1200.26 s [pandoc] speaker notes after a separating header: OK (0.25s)
  1922. 1200.60 s [pandoc] speaker notes after metadata: OK (0.34s)
  1923. 1200.86 s [pandoc] remove empty slides: OK (0.27s)
  1924. 1201.16 s [pandoc] raw ooxml: OK (0.29s)
  1925. 1201.55 s [pandoc] metadata, custom properties: OK (0.40s)
  1926. 1201.83 s [pandoc] metadata, short description: OK (0.28s)
  1927. 1202.12 s [pandoc] inline code and code blocks: OK (0.29s)
  1928. 1202.40 s [pandoc] inline code and code blocks, custom formatting: OK (0.28s)
  1929. 1202.40 s [pandoc] Using slide level 0, if the first thing on a slide is
  1930. 1202.57 s [pandoc] a h1 it's used as the slide title: OK (0.17s)
  1931. 1202.77 s [pandoc] a h2 it's used as the slide title: OK (0.19s)
  1932. 1202.77 s [pandoc] a heading it's used as the slide title
  1933. 1203.05 s [pandoc] (works with a table): OK (0.28s)
  1934. 1203.26 s [pandoc] (content with caption layout): OK (0.22s)
  1935. 1203.26 s [pandoc] comparison layout
  1936. 1203.26 s [pandoc] comparison layout is used...
  1937. 1203.54 s [pandoc] when two columns contain text + non-text: OK (0.28s)
  1938. 1203.85 s [pandoc] even when only one col contains text + non-text: OK (0.30s)
  1939. 1203.85 s [pandoc] extra ... in one column gets overlaid
  1940. 1204.10 s [pandoc] text: OK (0.26s)
  1941. 1204.46 s [pandoc] image: OK (0.32s)
  1942. 1204.69 s [pandoc] is not used if the non-text comes first: OK (0.26s)
  1943. 1204.69 s [pandoc] Content with Caption layout is ...
  1944. 1204.92 s [pandoc] used for heading, text, image on the same slide: OK (0.23s)
  1945. 1205.14 s [pandoc] used for text and an image on the same slide: OK (0.22s)
  1946. 1205.40 s [pandoc] not used if the image comes first: OK (0.25s)
  1947. 1205.40 s [pandoc] The Blank layout is used if a slide contains only...
  1948. 1205.67 s [pandoc] speaker notes: OK (0.27s)
  1949. 1205.96 s [pandoc] an empty heading with a body of only NBSPs: OK (0.29s)
  1950. 1206.18 s [pandoc] a heading containing only non-breaking spaces: OK (0.22s)
  1951. 1206.68 s [pandoc] Incremental lists are supported: OK (0.50s)
  1952. 1207.16 s [pandoc] One-off incremental lists are supported: OK (0.48s)
  1953. 1207.51 s [pandoc] Background images: OK (0.35s)
  1954. 1207.51 s [pandoc] With `--reference-doc` pptx file
  1955. 1207.93 s [pandoc] Inline formatting: OK (0.42s)
  1956. 1208.35 s [pandoc] Slide breaks (default slide-level): OK (0.43s)
  1957. 1208.60 s [pandoc] slide breaks (slide-level set to 1): OK (0.25s)
  1958. 1208.84 s [pandoc] lists: OK (0.24s)
  1959. 1209.13 s [pandoc] start ordered list at specified num: OK (0.29s)
  1960. 1209.38 s [pandoc] List continuation paragraph indentation: OK (0.25s)
  1961. 1209.52 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  1962. 1209.52 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  1963. 1209.52 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  1964. 1209.52 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  1965. 1209.52 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  1966. 1209.67 s [pandoc] tables: OK (0.29s)
  1967. 1209.87 s [pandoc] table of contents: OK (0.20s)
  1968. 1210.21 s [pandoc] end notes: OK (0.32s)
  1969. 1210.38 s [pandoc] end notes, with table of contents: OK (0.18s)
  1970. 1210.52 s [pandoc] images: OK (0.14s)
  1971. 1210.52 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  1972. 1210.52 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  1973. 1210.63 s [pandoc] two-column layout: OK (0.11s)
  1974. 1210.77 s [pandoc] two-column (not comparison): OK (0.13s)
  1975. 1210.91 s [pandoc] speaker notes: OK (0.14s)
  1976. 1211.18 s [pandoc] speaker notes after a separating block: OK (0.28s)
  1977. 1211.36 s [pandoc] speaker notes after a separating header: OK (0.17s)
  1978. 1211.52 s [pandoc] speaker notes after metadata: OK (0.16s)
  1979. 1211.67 s [pandoc] remove empty slides: OK (0.14s)
  1980. 1211.82 s [pandoc] raw ooxml: OK (0.16s)
  1981. 1211.97 s [pandoc] metadata, custom properties: OK (0.14s)
  1982. 1212.16 s [pandoc] metadata, short description: OK (0.19s)
  1983. 1212.39 s [pandoc] inline code and code blocks: OK (0.23s)
  1984. 1212.66 s [pandoc] inline code and code blocks, custom formatting: OK (0.27s)
  1985. 1212.66 s [pandoc] Using slide level 0, if the first thing on a slide is
  1986. 1212.90 s [pandoc] a h1 it's used as the slide title: OK (0.24s)
  1987. 1213.18 s [pandoc] a h2 it's used as the slide title: OK (0.28s)
  1988. 1213.18 s [pandoc] a heading it's used as the slide title
  1989. 1213.29 s [pandoc] (works with a table): OK (0.12s)
  1990. 1213.46 s [pandoc] (content with caption layout): OK (0.16s)
  1991. 1213.46 s [pandoc] comparison layout
  1992. 1213.46 s [pandoc] comparison layout is used...
  1993. 1213.67 s [pandoc] when two columns contain text + non-text: OK (0.21s)
  1994. 1213.98 s [pandoc] even when only one col contains text + non-text: OK (0.31s)
  1995. 1213.98 s [pandoc] extra ... in one column gets overlaid
  1996. 1214.13 s [pandoc] text: OK (0.15s)
  1997. 1214.32 s [pandoc] image: OK (0.19s)
  1998. 1214.56 s [pandoc] is not used if the non-text comes first: OK (0.24s)
  1999. 1214.56 s [pandoc] Content with Caption layout is ...
  2000. 1214.77 s [pandoc] used for heading, text, image on the same slide: OK (0.21s)
  2001. 1214.98 s [pandoc] used for text and an image on the same slide: OK (0.21s)
  2002. 1215.14 s [pandoc] not used if the image comes first: OK (0.15s)
  2003. 1215.14 s [pandoc] The Blank layout is used if a slide contains only...
  2004. 1215.27 s [pandoc] speaker notes: OK (0.14s)
  2005. 1215.38 s [pandoc] an empty heading with a body of only NBSPs: OK (0.11s)
  2006. 1215.57 s [pandoc] a heading containing only non-breaking spaces: OK (0.19s)
  2007. 1215.96 s [pandoc] Incremental lists are supported: OK (0.39s)
  2008. 1216.12 s [pandoc] One-off incremental lists are supported: OK (0.16s)
  2009. 1216.38 s [pandoc] Background images: OK (0.26s)
  2010. 1216.51 s [pandoc] Basic footer: OK (0.13s)
  2011. 1216.71 s [pandoc] Footer with fixed date, replaced by meta block date: OK (0.20s)
  2012. 1216.95 s [pandoc] Footer not shown on title slide: OK (0.24s)
  2013. 1217.27 s [pandoc] Footer with slide number starting from 3: OK (0.31s)
  2014. 1217.74 s [pandoc] Layouts can be moved around in reference doc: OK (0.47s)
  2015. 1217.85 s [pandoc] Layouts can be missing from the reference doc: OK (0.11s)
  2016. 1217.85 s [pandoc] Ms
  2017. 1217.85 s [pandoc] code blocks
  2018. 1217.85 s [pandoc] basic: OK
  2019. 1217.85 s [pandoc] escape starting .: OK
  2020. 1217.85 s [pandoc] AnnotatedTable
  2021. 1217.85 s [pandoc] toTable
  2022. 1217.85 s [pandoc] annotates a sample table properly: OK
  2023. 1218.25 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  2024. 1218.62 s [pandoc] normalizes like the table builder: OK (0.76s)
  2025. 1218.62 s [pandoc] +++ OK, passed 50 tests.
  2026. 1218.63 s [pandoc] has valid final cell columns: OK
  2027. 1218.63 s [pandoc] +++ OK, passed 50 tests.
  2028. 1218.64 s [pandoc] has valid first row column data: OK
  2029. 1218.64 s [pandoc] +++ OK, passed 50 tests.
  2030. 1218.64 s [pandoc] has valid all row column data: OK
  2031. 1218.64 s [pandoc] +++ OK, passed 50 tests.
  2032. 1218.64 s [pandoc] has valid cell column data lengths: OK
  2033. 1218.64 s [pandoc] +++ OK, passed 50 tests.
  2034. 1218.64 s [pandoc] Readers
  2035. 1218.64 s [pandoc] LaTeX
  2036. 1218.64 s [pandoc] basic
  2037. 1218.64 s [pandoc] simple: OK
  2038. 1218.64 s [pandoc] space: OK
  2039. 1218.65 s [pandoc] emphasized: OK
  2040. 1218.65 s [pandoc] headers
  2041. 1218.65 s [pandoc] level 1: OK
  2042. 1218.65 s [pandoc] level 2: OK
  2043. 1218.65 s [pandoc] level 3: OK
  2044. 1218.65 s [pandoc] emph: OK
  2045. 1218.65 s [pandoc] link: OK
  2046. 1218.65 s [pandoc] math
  2047. 1218.65 s [pandoc] escaped $: OK
  2048. 1218.65 s [pandoc] space and comments
  2049. 1218.65 s [pandoc] blank lines + space at beginning: OK
  2050. 1218.65 s [pandoc] blank lines + space + comments: OK
  2051. 1218.65 s [pandoc] comment in paragraph: OK
  2052. 1218.65 s [pandoc] code blocks
  2053. 1218.65 s [pandoc] identifier: OK
  2054. 1218.65 s [pandoc] no identifier: OK
  2055. 1218.65 s [pandoc] tables
  2056. 1218.65 s [pandoc] Single cell table: OK
  2057. 1218.65 s [pandoc] Multi cell table: OK
  2058. 1218.65 s [pandoc] Multi line table: OK
  2059. 1218.65 s [pandoc] Empty table: OK
  2060. 1218.65 s [pandoc] Table with fixed column width: OK
  2061. 1218.65 s [pandoc] Table with empty column separators: OK
  2062. 1218.66 s [pandoc] Table with custom column separators: OK
  2063. 1218.66 s [pandoc] Table with vertical alignment argument: OK
  2064. 1218.66 s [pandoc] Table with multicolumn item: OK
  2065. 1218.66 s [pandoc] table with multicolumn item (#6596): OK
  2066. 1218.66 s [pandoc] Table with multirow item: OK
  2067. 1218.67 s [pandoc] Table with multirow item using full prototype: OK
  2068. 1218.67 s [pandoc] Table with nested multirow/multicolumn item: OK
  2069. 1218.67 s [pandoc] Table with multicolumn header: OK
  2070. 1218.67 s [pandoc] Table with normal empty cells: OK
  2071. 1218.67 s [pandoc] citations
  2072. 1218.67 s [pandoc] natbib
  2073. 1218.67 s [pandoc] citet: OK
  2074. 1218.68 s [pandoc] suffix: OK
  2075. 1218.68 s [pandoc] suffix long: OK
  2076. 1218.68 s [pandoc] multiple: OK
  2077. 1218.68 s [pandoc] group: OK
  2078. 1218.68 s [pandoc] suffix and locator: OK
  2079. 1218.68 s [pandoc] suffix only: OK
  2080. 1218.68 s [pandoc] no author: OK
  2081. 1218.68 s [pandoc] markup: OK
  2082. 1218.68 s [pandoc] biblatex
  2083. 1218.68 s [pandoc] textcite: OK
  2084. 1218.68 s [pandoc] suffix: OK
  2085. 1218.68 s [pandoc] suffix long: OK
  2086. 1218.68 s [pandoc] multiple: OK
  2087. 1218.68 s [pandoc] group: OK
  2088. 1218.69 s [pandoc] suffix and locator: OK
  2089. 1218.69 s [pandoc] suffix only: OK
  2090. 1218.69 s [pandoc] no author: OK
  2091. 1218.69 s [pandoc] markup: OK
  2092. 1218.69 s [pandoc] parencite: OK
  2093. 1218.69 s [pandoc] images
  2094. 1218.69 s [pandoc] Basic image: OK
  2095. 1218.69 s [pandoc] Basic image with blank options: OK
  2096. 1218.69 s [pandoc] Image with both width and height: OK
  2097. 1218.69 s [pandoc] Image with width and height and a bunch of other opt...: OK
  2098. 1218.69 s [pandoc] Image with just width: OK
  2099. 1218.69 s [pandoc] Image with just height: OK
  2100. 1218.69 s [pandoc] Image width relative to textsize: OK
  2101. 1218.69 s [pandoc] Image with options with spaces: OK
  2102. 1218.69 s [pandoc] Character Escapes
  2103. 1218.69 s [pandoc] Two-character escapes: OK
  2104. 1218.69 s [pandoc] One-character escapes: OK
  2105. 1218.69 s [pandoc] memoir scene breaks
  2106. 1218.69 s [pandoc] plainbreak: OK
  2107. 1218.69 s [pandoc] plainbreak*: OK
  2108. 1218.69 s [pandoc] fancybreak: OK
  2109. 1218.69 s [pandoc] fancybreak*: OK
  2110. 1218.69 s [pandoc] plainfancybreak: OK
  2111. 1218.69 s [pandoc] plainfancybreak*: OK
  2112. 1218.69 s [pandoc] pfbreak: OK
  2113. 1218.69 s [pandoc] pfbreak*: OK
  2114. 1218.69 s [pandoc] biblatex roman numerals
  2115. 1218.69 s [pandoc] upper: OK
  2116. 1218.69 s [pandoc] lower: OK
  2117. 1218.69 s [pandoc] leading zero: OK
  2118. 1218.70 s [pandoc] surrounding spaces: OK
  2119. 1218.70 s [pandoc] zero: OK
  2120. 1218.70 s [pandoc] space then unbraced argument: OK
  2121. 1218.70 s [pandoc] space before braced argument: OK
  2122. 1218.70 s [pandoc] polyglossia language spans
  2123. 1218.70 s [pandoc] french: OK
  2124. 1218.70 s [pandoc] nested: OK
  2125. 1218.70 s [pandoc] with formatting: OK
  2126. 1218.70 s [pandoc] language options: OK
  2127. 1218.70 s [pandoc] unknown option fallback: OK
  2128. 1218.70 s [pandoc] Markdown
  2129. 1218.70 s [pandoc] inline code
  2130. 1218.70 s [pandoc] with attribute: OK
  2131. 1218.70 s [pandoc] with attribute space: OK
  2132. 1218.70 s [pandoc] inline code in lists (regression tests for #6284)
  2133. 1218.70 s [pandoc] code with list marker in text in ordered list: OK
  2134. 1218.70 s [pandoc] code with list marker at start in ordered list: OK
  2135. 1218.70 s [pandoc] code with list marker at start in ordered list: OK
  2136. 1218.70 s [pandoc] code with list marker after literal backticks in ord...: OK
  2137. 1218.70 s [pandoc] code with list marker after literal backticks in ord...: OK
  2138. 1218.70 s [pandoc] code with list marker in text in bullet list: OK
  2139. 1218.70 s [pandoc] code with list marker at start in bullet list: OK
  2140. 1218.70 s [pandoc] code with list marker at start in bullet list: OK
  2141. 1218.70 s [pandoc] code with list marker after literal backticks in bul...: OK
  2142. 1218.70 s [pandoc] code with list marker after literal backticks in bul...: OK
  2143. 1218.70 s [pandoc] lists with newlines in backticks: OK
  2144. 1218.70 s [pandoc] lists with newlines in backticks: OK
  2145. 1218.70 s [pandoc] lists with newlines in backticks: OK
  2146. 1218.70 s [pandoc] lists with newlines in backticks: OK
  2147. 1218.71 s [pandoc] lists with newlines in backticks: OK
  2148. 1218.71 s [pandoc] lists with newlines in backticks: OK
  2149. 1218.71 s [pandoc] lists with newlines in backticks: OK
  2150. 1218.71 s [pandoc] lists with newlines in backticks: OK
  2151. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2152. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2153. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2154. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2155. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2156. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2157. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2158. 1218.71 s [pandoc] lists with blank lines and indent in backticks: OK
  2159. 1218.71 s [pandoc] emph and strong
  2160. 1218.71 s [pandoc] two strongs in emph: OK
  2161. 1218.71 s [pandoc] emph and strong emph alternating: OK
  2162. 1218.71 s [pandoc] emph with spaced strong: OK
  2163. 1218.71 s [pandoc] intraword underscore with opening underscore (#1121): OK
  2164. 1218.71 s [pandoc] raw LaTeX
  2165. 1218.71 s [pandoc] in URL: OK
  2166. 1218.71 s [pandoc] raw HTML
  2167. 1218.71 s [pandoc] nesting (issue #1330): OK
  2168. 1218.71 s [pandoc] invalid tag (issue #1820: OK
  2169. 1218.71 s [pandoc] technically invalid comment: OK
  2170. 1218.72 s [pandoc] issue 2469: OK
  2171. 1218.72 s [pandoc] raw email addresses
  2172. 1218.72 s [pandoc] issue 2940: OK
  2173. 1218.72 s [pandoc] emoji
  2174. 1218.73 s [pandoc] emoji symbols: OK
  2175. 1218.96 s [pandoc] unbalanced brackets: OK (0.25s)
  2176. 1218.96 s [pandoc] backslash escapes
  2177. 1218.96 s [pandoc] in URL: OK
  2178. 1218.97 s [pandoc] in title: OK
  2179. 1218.97 s [pandoc] in reference link title: OK
  2180. 1218.97 s [pandoc] in reference link URL: OK
  2181. 1218.97 s [pandoc] bare URIs
  2182. 1218.97 s [pandoc] http://google.com is a search engine.: OK
  2183. 1218.97 s [pandoc] <a href="http://foo.bar.baz">http://foo.bar.baz</a>: OK
  2184. 1218.97 s [pandoc] Try this query: http://google.com?search=fish&time=h...: OK
  2185. 1218.97 s [pandoc] HTTPS://GOOGLE.COM,: OK
  2186. 1218.97 s [pandoc] http://el.wikipedia.org/wiki/Τεχνολογία,: OK
  2187. 1218.97 s [pandoc] doi:10.1000/182,: OK
  2188. 1218.97 s [pandoc] git://github.com/foo/bar.git,: OK
  2189. 1218.97 s [pandoc] file:///Users/joe/joe.txt, and: OK
  2190. 1218.97 s [pandoc] mailto:someone@somedomain.com.: OK
  2191. 1218.97 s [pandoc] Use http: this is not a link!: OK
  2192. 1218.97 s [pandoc] (http://google.com).: OK
  2193. 1218.98 s [pandoc] http://en.wikipedia.org/wiki/Sprite_(computer_graphi...: OK
  2194. 1218.98 s [pandoc] http://en.wikipedia.org/wiki/Sprite_[computer_graphi...: OK
  2195. 1218.98 s [pandoc] http://en.wikipedia.org/wiki/Sprite_{computer_graphi...: OK
  2196. 1218.98 s [pandoc] http://example.com/Notification_Center-GitHub-201011...: OK
  2197. 1218.98 s [pandoc] https://github.com/github/hubot/blob/master/scripts/...: OK
  2198. 1218.98 s [pandoc] http://www.rubyonrails.com: OK
  2199. 1218.98 s [pandoc] http://www.rubyonrails.com:80: OK
  2200. 1218.98 s [pandoc] http://www.rubyonrails.com/~minam: OK
  2201. 1218.98 s [pandoc] https://www.rubyonrails.com/~minam: OK
  2202. 1218.98 s [pandoc] http://www.rubyonrails.com/~minam/url%20with%20spaces: OK
  2203. 1218.98 s [pandoc] http://www.rubyonrails.com/foo.cgi?something=here: OK
  2204. 1218.98 s [pandoc] http://www.rubyonrails.com/foo.cgi?something=here&an...: OK
  2205. 1218.98 s [pandoc] http://www.rubyonrails.com/contact;new: OK
  2206. 1218.98 s [pandoc] http://www.rubyonrails.com/contact;new%20with%20spaces: OK
  2207. 1218.98 s [pandoc] http://www.rubyonrails.com/contact;new?with=query&st...: OK
  2208. 1218.98 s [pandoc] http://www.rubyonrails.com/~minam/contact;new?with=q...: OK
  2209. 1218.98 s [pandoc] http://en.wikipedia.org/wiki/Wikipedia:Today%27s_fea...: OK
  2210. 1218.98 s [pandoc] http://www.mail-archive.com/rails@lists.rubyonrails....: OK
  2211. 1218.99 s [pandoc] http://www.amazon.com/Testing-Equal-Sign-In-Path/ref...: OK
  2212. 1218.99 s [pandoc] http://en.wikipedia.org/wiki/Texas_hold%27em: OK
  2213. 1218.99 s [pandoc] https://www.google.com/doku.php?id=gps:resource:scs:...: OK
  2214. 1218.99 s [pandoc] http://www.rubyonrails.com: OK
  2215. 1218.99 s [pandoc] http://manuals.ruby-on-rails.com/read/chapter.need_a...: OK
  2216. 1218.99 s [pandoc] http://foo.example.com/controller/action?parm=value&...: OK
  2217. 1218.99 s [pandoc] http://foo.example.com:3000/controller/action: OK
  2218. 1218.99 s [pandoc] http://foo.example.com:3000/controller/action+pack: OK
  2219. 1218.99 s [pandoc] http://business.timesonline.co.uk/article/0,,9065-24...: OK
  2220. 1218.99 s [pandoc] http://www.mail-archive.com/ruby-talk@ruby-lang.org/: OK
  2221. 1218.99 s [pandoc] https://example.org/?anchor=lala-: OK
  2222. 1218.99 s [pandoc] https://example.org/?anchor=-lala: OK
  2223. 1218.99 s [pandoc] autolinks
  2224. 1218.99 s [pandoc] with unicode dash following: OK
  2225. 1218.99 s [pandoc] a partial URL (#2277): OK
  2226. 1218.99 s [pandoc] with some attributes: OK
  2227. 1218.99 s [pandoc] with some attributes and spaces: OK
  2228. 1218.99 s [pandoc] links
  2229. 1218.99 s [pandoc] no autolink inside link: OK
  2230. 1218.99 s [pandoc] no inline link inside link: OK
  2231. 1219.00 s [pandoc] no bare URI inside link: OK
  2232. 1219.00 s [pandoc] Github wiki links
  2233. 1219.00 s [pandoc] autolink: OK
  2234. 1219.00 s [pandoc] link with title: OK
  2235. 1219.00 s [pandoc] bad link with title: OK
  2236. 1219.00 s [pandoc] autolink not being a link: OK
  2237. 1219.00 s [pandoc] autolink not being a link with a square bracket: OK
  2238. 1219.01 s [pandoc] link with inline start should be a link: OK
  2239. 1219.01 s [pandoc] Headers
  2240. 1219.01 s [pandoc] blank line before header: OK
  2241. 1219.01 s [pandoc] bracketed text (#2062): OK
  2242. 1219.01 s [pandoc] ATX header without trailing #s: OK
  2243. 1219.01 s [pandoc] ATX header without trailing #s: OK
  2244. 1219.01 s [pandoc] setext header: OK
  2245. 1219.01 s [pandoc] Implicit header references
  2246. 1219.01 s [pandoc] ATX header without trailing #s: OK
  2247. 1219.01 s [pandoc] ATX header with trailing #s: OK
  2248. 1219.01 s [pandoc] setext header: OK
  2249. 1219.01 s [pandoc] smart punctuation
  2250. 1219.01 s [pandoc] quote before ellipses: OK
  2251. 1219.01 s [pandoc] apostrophe before emph: OK
  2252. 1219.01 s [pandoc] apostrophe in French: OK
  2253. 1219.02 s [pandoc] apostrophe after math: OK
  2254. 1219.02 s [pandoc] unclosed double quote: OK
  2255. 1219.02 s [pandoc] sub- and superscripts
  2256. 1219.02 s [pandoc] normal subscript: OK
  2257. 1219.02 s [pandoc] normal superscript: OK
  2258. 1219.02 s [pandoc] short subscript delimited by space: OK
  2259. 1219.02 s [pandoc] short subscript delimited by newline: OK
  2260. 1219.02 s [pandoc] short subscript delimited by EOF: OK
  2261. 1219.02 s [pandoc] short subscript delimited by punctuation: OK
  2262. 1219.02 s [pandoc] short subscript delimited by emph: OK
  2263. 1219.02 s [pandoc] no nesting in short subscripts: OK
  2264. 1219.02 s [pandoc] short superscript delimited by space: OK
  2265. 1219.02 s [pandoc] short superscript delimited by newline: OK
  2266. 1219.02 s [pandoc] short superscript delimited by ExF: OK
  2267. 1219.02 s [pandoc] short superscript delimited by punctuation: OK
  2268. 1219.02 s [pandoc] short superscript delimited by emph: OK
  2269. 1219.02 s [pandoc] no nesting in short superscripts: OK
  2270. 1219.02 s [pandoc] footnotes
  2271. 1219.02 s [pandoc] indent followed by newline and flush-left text: OK
  2272. 1219.02 s [pandoc] indent followed by newline and indented text: OK
  2273. 1219.02 s [pandoc] recursive note: OK
  2274. 1219.02 s [pandoc] lhs
  2275. 1219.02 s [pandoc] inverse bird tracks and html: OK
  2276. 1219.02 s [pandoc] definition lists
  2277. 1219.02 s [pandoc] no blank space: OK
  2278. 1219.02 s [pandoc] blank space before first def: OK
  2279. 1219.03 s [pandoc] blank space before second def: OK
  2280. 1219.03 s [pandoc] laziness: OK
  2281. 1219.03 s [pandoc] no blank space before first of two paragraphs: OK
  2282. 1219.03 s [pandoc] first line not indented: OK
  2283. 1219.03 s [pandoc] list in definition: OK
  2284. 1219.03 s [pandoc] in div: OK
  2285. 1219.03 s [pandoc] +compact_definition_lists
  2286. 1219.03 s [pandoc] basic compact list: OK
  2287. 1219.03 s [pandoc] lists
  2288. 1219.03 s [pandoc] issue #1154: OK
  2289. 1219.03 s [pandoc] issue #1636: OK
  2290. 1219.03 s [pandoc] entities
  2291. 1219.03 s [pandoc] character references: OK
  2292. 1219.03 s [pandoc] numeric: OK
  2293. 1219.03 s [pandoc] in link title: OK
  2294. 1219.03 s [pandoc] citations
  2295. 1219.03 s [pandoc] simple: OK
  2296. 1219.03 s [pandoc] key starts with digit: OK
  2297. 1219.03 s [pandoc] footnote/link following citation
  2298. 1219.03 s [pandoc] footnote: OK
  2299. 1219.03 s [pandoc] normal link: OK
  2300. 1219.03 s [pandoc] reference link: OK
  2301. 1219.03 s [pandoc] short reference link: OK
  2302. 1219.03 s [pandoc] implicit header link: OK
  2303. 1219.04 s [pandoc] regular citation: OK
  2304. 1219.04 s [pandoc] HTML
  2305. 1219.04 s [pandoc] base tag
  2306. 1219.04 s [pandoc] simple: OK
  2307. 1219.04 s [pandoc] slash at end of base: OK
  2308. 1219.04 s [pandoc] slash at beginning of href: OK
  2309. 1219.04 s [pandoc] absolute URL: OK
  2310. 1219.04 s [pandoc] anchors
  2311. 1219.04 s [pandoc] anchor without href: OK
  2312. 1219.04 s [pandoc] img
  2313. 1219.04 s [pandoc] data-external attribute: OK
  2314. 1219.04 s [pandoc] title: OK
  2315. 1219.04 s [pandoc] lang
  2316. 1219.04 s [pandoc] lang on <html>: OK
  2317. 1219.04 s [pandoc] xml:lang on <html>: OK
  2318. 1219.04 s [pandoc] main
  2319. 1219.04 s [pandoc] <main> contents are parsed: OK
  2320. 1219.04 s [pandoc] <main role=X> becomes <div role=X>: OK
  2321. 1219.04 s [pandoc] <main> has attributes preserved: OK
  2322. 1219.04 s [pandoc] <main> closes <p>: OK
  2323. 1219.04 s [pandoc] <main> followed by text: OK
  2324. 1219.04 s [pandoc] code
  2325. 1219.04 s [pandoc] inline code block: OK
  2326. 1219.04 s [pandoc] tt
  2327. 1219.04 s [pandoc] inline tt block: OK
  2328. 1219.04 s [pandoc] samp
  2329. 1219.04 s [pandoc] inline samp block: OK
  2330. 1219.04 s [pandoc] var
  2331. 1219.04 s [pandoc] inline var block: OK
  2332. 1219.04 s [pandoc] header
  2333. 1219.04 s [pandoc] <header> is parsed as a div: OK
  2334. 1219.04 s [pandoc] code block
  2335. 1219.04 s [pandoc] attributes in pre > code element: OK
  2336. 1219.05 s [pandoc] attributes in pre take precedence: OK
  2337. 1220.18 s [pandoc] Round trip: OK (1.14s)
  2338. 1220.18 s [pandoc] +++ OK, passed 25 tests.
  2339. 1220.18 s [pandoc] JATS
  2340. 1220.18 s [pandoc] inline code
  2341. 1220.18 s [pandoc] basic: OK
  2342. 1220.18 s [pandoc] block code
  2343. 1220.18 s [pandoc] basic: OK
  2344. 1220.18 s [pandoc] lang: OK
  2345. 1220.18 s [pandoc] images
  2346. 1220.18 s [pandoc] basic: OK
  2347. 1220.18 s [pandoc] alt-text: OK
  2348. 1220.18 s [pandoc] bullet list: OK
  2349. 1220.18 s [pandoc] definition lists
  2350. 1220.18 s [pandoc] with internal link: OK
  2351. 1220.18 s [pandoc] math
  2352. 1220.18 s [pandoc] escape |: OK
  2353. 1220.18 s [pandoc] tex-math only: OK
  2354. 1220.18 s [pandoc] math ml only: OK
  2355. 1220.19 s [pandoc] headers
  2356. 1220.19 s [pandoc] unnumbered sub header: OK
  2357. 1220.19 s [pandoc] containing image: OK
  2358. 1220.19 s [pandoc] metadata
  2359. 1220.19 s [pandoc] abstract: OK
  2360. 1220.19 s [pandoc] Jira
  2361. 1220.19 s [pandoc] para
  2362. 1220.19 s [pandoc] Simple sentence: OK
  2363. 1220.19 s [pandoc] leading blank lines: OK
  2364. 1220.19 s [pandoc] header
  2365. 1220.19 s [pandoc] header: OK
  2366. 1220.19 s [pandoc] list
  2367. 1220.19 s [pandoc] simple list: OK
  2368. 1220.19 s [pandoc] list with minus as bullets: OK
  2369. 1220.19 s [pandoc] ordered list / enumeration: OK
  2370. 1220.19 s [pandoc] block quote
  2371. 1220.19 s [pandoc] simple block quote: OK
  2372. 1220.19 s [pandoc] block quote between paragraphs: OK
  2373. 1220.19 s [pandoc] table
  2374. 1220.19 s [pandoc] table without header: OK
  2375. 1220.20 s [pandoc] table with header: OK
  2376. 1220.20 s [pandoc] table with column header: OK
  2377. 1220.20 s [pandoc] table after paragraph: OK
  2378. 1220.20 s [pandoc] panel
  2379. 1220.20 s [pandoc] simple panel: OK
  2380. 1220.20 s [pandoc] inlines
  2381. 1220.20 s [pandoc] emphasis: OK
  2382. 1220.20 s [pandoc] deleted: OK
  2383. 1220.20 s [pandoc] monospaced: OK
  2384. 1220.20 s [pandoc] sub- and superscript: OK
  2385. 1220.20 s [pandoc] citation: OK
  2386. 1220.20 s [pandoc] color: OK
  2387. 1220.20 s [pandoc] hexcolor: OK
  2388. 1220.20 s [pandoc] linebreak: OK
  2389. 1220.20 s [pandoc] links
  2390. 1220.20 s [pandoc] external: OK
  2391. 1220.20 s [pandoc] URL in alias: OK
  2392. 1220.20 s [pandoc] email: OK
  2393. 1220.20 s [pandoc] email with description: OK
  2394. 1220.20 s [pandoc] attachment: OK
  2395. 1220.20 s [pandoc] attachment with description: OK
  2396. 1220.20 s [pandoc] user: OK
  2397. 1220.20 s [pandoc] user with description: OK
  2398. 1220.20 s [pandoc] 'smart' link: OK
  2399. 1220.20 s [pandoc] 'smart' card: OK
  2400. 1220.20 s [pandoc] image: OK
  2401. 1220.20 s [pandoc] thumbnail image: OK
  2402. 1220.20 s [pandoc] image with attributes: OK
  2403. 1220.20 s [pandoc] inserted text: OK
  2404. 1220.20 s [pandoc] HTML entity: OK
  2405. 1220.20 s [pandoc] non-strikeout dashes: OK
  2406. 1220.20 s [pandoc] Org
  2407. 1220.20 s [pandoc] Inlines
  2408. 1220.20 s [pandoc] Plain String: OK
  2409. 1220.20 s [pandoc] Emphasis: OK
  2410. 1220.21 s [pandoc] Strong: OK
  2411. 1220.21 s [pandoc] Strong Emphasis: OK
  2412. 1220.21 s [pandoc] Emphasized Strong preceded by space: OK
  2413. 1220.21 s [pandoc] Underline: OK
  2414. 1220.21 s [pandoc] Strikeout: OK
  2415. 1220.21 s [pandoc] Verbatim: OK
  2416. 1220.21 s [pandoc] Code: OK
  2417. 1220.21 s [pandoc] Math $..$: OK
  2418. 1220.21 s [pandoc] Math $$..$$: OK
  2419. 1220.21 s [pandoc] Math \[..\]: OK
  2420. 1220.21 s [pandoc] Math \(..\): OK
  2421. 1220.21 s [pandoc] Symbol: OK
  2422. 1220.21 s [pandoc] Superscript simple expression: OK
  2423. 1220.21 s [pandoc] Superscript multi char: OK
  2424. 1220.21 s [pandoc] Subscript simple expression: OK
  2425. 1220.21 s [pandoc] Subscript multi char: OK
  2426. 1220.21 s [pandoc] Linebreak: OK
  2427. 1220.21 s [pandoc] Inline note: OK
  2428. 1220.22 s [pandoc] By default, markup-chars not occurring on word break...: OK
  2429. 1220.22 s [pandoc] No empty markup: OK
  2430. 1220.22 s [pandoc] Adherence to Org's rules for markup borders: OK
  2431. 1220.22 s [pandoc] Quotes are allowed border chars: OK
  2432. 1220.22 s [pandoc] Spaces are forbidden border chars: OK
  2433. 1220.22 s [pandoc] Zero width spaces are forbidden border chars: OK
  2434. 1220.22 s [pandoc] Markup should work properly after a blank line: OK
  2435. 1220.22 s [pandoc] Inline math must stay within three lines: OK
  2436. 1220.22 s [pandoc] Single-character math: OK
  2437. 1220.23 s [pandoc] Markup may not span more than two lines: OK
  2438. 1220.23 s [pandoc] Sub- and superscript expressions: OK
  2439. 1220.23 s [pandoc] Verbatim text can contain equal signs (=): OK
  2440. 1220.23 s [pandoc] Images
  2441. 1220.23 s [pandoc] Image: OK
  2442. 1220.23 s [pandoc] Image with explicit file: prefix: OK
  2443. 1220.23 s [pandoc] Multiple images within a paragraph: OK
  2444. 1220.23 s [pandoc] Image with html attributes: OK
  2445. 1220.23 s [pandoc] HTML attributes can have trailing spaces: OK
  2446. 1220.23 s [pandoc] Uppercase extension: OK
  2447. 1220.23 s [pandoc] Explicit link: OK
  2448. 1220.23 s [pandoc] Self-link: OK
  2449. 1220.23 s [pandoc] Internal self-link (reference): OK
  2450. 1220.23 s [pandoc] Absolute file link: OK
  2451. 1220.23 s [pandoc] Link to file in parent directory: OK
  2452. 1220.24 s [pandoc] Empty link (for gitit interop): OK
  2453. 1220.24 s [pandoc] Image link: OK
  2454. 1220.24 s [pandoc] Image link with non-image target: OK
  2455. 1220.24 s [pandoc] Link to image: OK
  2456. 1220.24 s [pandoc] Plain link: OK
  2457. 1220.24 s [pandoc] Angle link: OK
  2458. 1220.24 s [pandoc] Absolute file link: OK
  2459. 1220.24 s [pandoc] File link: OK
  2460. 1220.24 s [pandoc] Anchor: OK
  2461. 1220.24 s [pandoc] Inline code block: OK
  2462. 1220.24 s [pandoc] Inline code block with arguments: OK
  2463. 1220.24 s [pandoc] Inline code block with a blank argument array: OK
  2464. 1220.24 s [pandoc] Inline code block with toggle: OK
  2465. 1220.24 s [pandoc] Inline LaTeX symbol: OK
  2466. 1220.24 s [pandoc] Inline LaTeX command: OK
  2467. 1220.25 s [pandoc] Inline LaTeX command with spaces: OK
  2468. 1220.25 s [pandoc] Inline math symbols: OK
  2469. 1220.25 s [pandoc] Inline LaTeX math command: OK
  2470. 1220.25 s [pandoc] Unknown inline LaTeX command: OK
  2471. 1220.25 s [pandoc] Export snippet: OK
  2472. 1220.25 s [pandoc] MathML symbol in LaTeX-style: OK
  2473. 1220.25 s [pandoc] MathML symbol in LaTeX-style, including braces: OK
  2474. 1220.25 s [pandoc] MathML copy sign: OK
  2475. 1220.25 s [pandoc] MathML symbols, space separated: OK
  2476. 1220.25 s [pandoc] Macro: OK
  2477. 1220.25 s [pandoc] Macro duplicating its argument: OK
  2478. 1220.25 s [pandoc] Macro called with too few arguments: OK
  2479. 1220.25 s [pandoc] Macro called with an escaped comma: OK
  2480. 1220.25 s [pandoc] Citations
  2481. 1220.26 s [pandoc] Org-cite citations
  2482. 1220.26 s [pandoc] Citation: OK
  2483. 1220.26 s [pandoc] Citation containing text: OK
  2484. 1220.26 s [pandoc] Author-in-text citation with locator and suffix: OK
  2485. 1220.26 s [pandoc] org-ref citations
  2486. 1220.26 s [pandoc] simple citation: OK
  2487. 1220.26 s [pandoc] simple citation with underscores: OK
  2488. 1220.26 s [pandoc] simple citation succeeded by comma: OK
  2489. 1220.26 s [pandoc] simple citation succeeded by dot: OK
  2490. 1220.26 s [pandoc] simple citation succeeded by colon: OK
  2491. 1220.26 s [pandoc] simple citep citation: OK
  2492. 1220.26 s [pandoc] multiple simple citations: OK
  2493. 1220.26 s [pandoc] multiple simple citations succeeded by comma: OK
  2494. 1220.26 s [pandoc] extended citation: OK
  2495. 1220.26 s [pandoc] LaTeX citation: OK
  2496. 1220.26 s [pandoc] Footnotes
  2497. 1220.26 s [pandoc] Footnote: OK
  2498. 1220.26 s [pandoc] Two footnotes: OK
  2499. 1220.26 s [pandoc] Emphasized text before footnote: OK
  2500. 1220.26 s [pandoc] Footnote that starts with emphasized text: OK
  2501. 1220.26 s [pandoc] Footnote followed by header: OK
  2502. 1220.26 s [pandoc] Footnote followed by two blank lines: OK
  2503. 1220.26 s [pandoc] Smart punctuation
  2504. 1220.26 s [pandoc] quote before ellipses: OK
  2505. 1220.26 s [pandoc] apostrophe before emph: OK
  2506. 1220.27 s [pandoc] apostrophe in French: OK
  2507. 1220.27 s [pandoc] Quotes cannot occur at the end of emphasized text: OK
  2508. 1220.27 s [pandoc] Dashes are allowed at the borders of emphasis': OK
  2509. 1220.27 s [pandoc] Single quotes can be followed by emphasized text: OK
  2510. 1220.27 s [pandoc] Double quotes can be followed by emphasized text: OK
  2511. 1220.27 s [pandoc] Basic Blocks
  2512. 1220.27 s [pandoc] Paragraph: OK
  2513. 1220.27 s [pandoc] Paragraph starting with an asterisk: OK
  2514. 1220.27 s [pandoc] Paragraph containing asterisk at beginning of line: OK
  2515. 1220.27 s [pandoc] Example block: OK
  2516. 1220.27 s [pandoc] Example block surrounded by text: OK
  2517. 1220.27 s [pandoc] Horizontal Rule: OK
  2518. 1220.27 s [pandoc] Not a Horizontal Rule: OK
  2519. 1220.27 s [pandoc] Comments
  2520. 1220.27 s [pandoc] Comment Block: OK
  2521. 1220.27 s [pandoc] Comment line: OK
  2522. 1220.27 s [pandoc] Empty comment line: OK
  2523. 1220.27 s [pandoc] Blocks and fragments
  2524. 1220.27 s [pandoc] HTML block: OK
  2525. 1220.27 s [pandoc] Quote block: OK
  2526. 1220.27 s [pandoc] Verse block: OK
  2527. 1220.27 s [pandoc] Verse block with blank lines: OK
  2528. 1220.27 s [pandoc] Verse block with varying indentation: OK
  2529. 1220.27 s [pandoc] Raw block LaTeX: OK
  2530. 1220.27 s [pandoc] Raw LaTeX line: OK
  2531. 1220.27 s [pandoc] Raw Beamer line: OK
  2532. 1220.27 s [pandoc] Raw HTML line: OK
  2533. 1220.28 s [pandoc] Export block HTML: OK
  2534. 1220.28 s [pandoc] LaTeX fragment: OK
  2535. 1220.28 s [pandoc] One-line LaTeX fragment: OK
  2536. 1220.28 s [pandoc] LaTeX fragment with more arguments: OK
  2537. 1220.28 s [pandoc] Convert blank lines in blocks to single newlines: OK
  2538. 1220.28 s [pandoc] Accept `attr_html` attributes for generic block: OK
  2539. 1220.28 s [pandoc] Headers
  2540. 1220.28 s [pandoc] First Level Header: OK
  2541. 1220.28 s [pandoc] Third Level Header: OK
  2542. 1220.28 s [pandoc] Compact Headers with Paragraph: OK
  2543. 1220.28 s [pandoc] Separated Headers with Paragraph: OK
  2544. 1220.28 s [pandoc] Headers not preceded by a blank line: OK
  2545. 1220.28 s [pandoc] Todo keywords
  2546. 1220.28 s [pandoc] Header with known todo keyword: OK
  2547. 1220.28 s [pandoc] Header marked as done: OK
  2548. 1220.28 s [pandoc] emphasis in first word: OK
  2549. 1220.28 s [pandoc] Header with unknown todo keyword: OK
  2550. 1220.28 s [pandoc] Custom todo keywords: OK
  2551. 1220.28 s [pandoc] Custom todo keywords with multiple done-states: OK
  2552. 1220.28 s [pandoc] Tagged headers: OK
  2553. 1220.28 s [pandoc] Untagged header containing colons: OK
  2554. 1220.28 s [pandoc] Untagged header time followed by colon: OK
  2555. 1220.28 s [pandoc] tag followed by text: OK
  2556. 1220.28 s [pandoc] Header starting with strokeout text: OK
  2557. 1220.29 s [pandoc] Comment Trees: OK
  2558. 1220.29 s [pandoc] Nothing but a COMMENT header: OK
  2559. 1220.29 s [pandoc] Tree with :noexport:: OK
  2560. 1220.29 s [pandoc] Subtree with :noexport:: OK
  2561. 1220.29 s [pandoc] Preferences are treated as header attributes: OK
  2562. 1220.29 s [pandoc] Headers marked with a unnumbered property get a clas...: OK
  2563. 1220.29 s [pandoc] planning information
  2564. 1220.29 s [pandoc] Planning info is not included in output: OK
  2565. 1220.29 s [pandoc] Properties after planning info are recognized: OK
  2566. 1220.29 s [pandoc] Planning info followed by test: OK
  2567. 1220.29 s [pandoc] third and forth level headers: OK
  2568. 1220.29 s [pandoc] Figures
  2569. 1220.29 s [pandoc] Figure: OK
  2570. 1220.29 s [pandoc] Figure with no name: OK
  2571. 1220.29 s [pandoc] Figure with `fig:` prefix in name: OK
  2572. 1220.30 s [pandoc] Figure with HTML attributes: OK
  2573. 1220.30 s [pandoc] LaTeX attributes are ignored: OK
  2574. 1220.30 s [pandoc] Labelled figure: OK
  2575. 1220.30 s [pandoc] Figure with empty caption: OK
  2576. 1220.30 s [pandoc] Lists
  2577. 1220.30 s [pandoc] Simple Bullet Lists: OK
  2578. 1220.30 s [pandoc] Simple Bullet List with Ignored Counter Cookie: OK
  2579. 1220.30 s [pandoc] Indented Bullet Lists: OK
  2580. 1220.30 s [pandoc] Unindented *: OK
  2581. 1220.30 s [pandoc] Multi-line Bullet Lists: OK
  2582. 1220.30 s [pandoc] Nested Bullet Lists: OK
  2583. 1220.30 s [pandoc] Bullet List with Decreasing Indent: OK
  2584. 1220.30 s [pandoc] Header follows Bullet List: OK
  2585. 1220.30 s [pandoc] Bullet List Unindented with trailing Header: OK
  2586. 1220.30 s [pandoc] Empty bullet points: OK
  2587. 1220.30 s [pandoc] Task list: OK
  2588. 1220.30 s [pandoc] Task List with Counter Cookies: OK
  2589. 1220.30 s [pandoc] Task with alphabetical markers and counter cookie: OK
  2590. 1220.30 s [pandoc] Simple Ordered List: OK
  2591. 1220.31 s [pandoc] Simple Ordered List with fancy lists extension: OK
  2592. 1220.31 s [pandoc] Simple Ordered List with lower alpha marker: OK
  2593. 1220.31 s [pandoc] Simple Ordered List with upper and lower alpha markers: OK
  2594. 1220.31 s [pandoc] Simple Ordered List with Counter Cookie: OK
  2595. 1220.31 s [pandoc] Simple Ordered List with Alphabetical Counter Cookie: OK
  2596. 1220.31 s [pandoc] Simple Ordered List with Ignored Counter Cookie: OK
  2597. 1220.31 s [pandoc] Simple Ordered List with Parens: OK
  2598. 1220.31 s [pandoc] Indented Ordered List: OK
  2599. 1220.31 s [pandoc] Empty ordered list item: OK
  2600. 1220.31 s [pandoc] Empty ordered list item with fancy lists extension: OK
  2601. 1220.31 s [pandoc] Empty ordered list item with counter cookie: OK
  2602. 1220.31 s [pandoc] Nested Ordered Lists: OK
  2603. 1220.31 s [pandoc] Ordered List in Bullet List: OK
  2604. 1220.31 s [pandoc] Bullet List in Ordered List: OK
  2605. 1220.31 s [pandoc] Definition List: OK
  2606. 1220.31 s [pandoc] Definition list with multi-word term: OK
  2607. 1220.31 s [pandoc] Compact definition list: OK
  2608. 1220.31 s [pandoc] Definition List With Trailing Header: OK
  2609. 1220.31 s [pandoc] Definition lists double-colon markers must be surrou...: OK
  2610. 1220.31 s [pandoc] Loose bullet list: OK
  2611. 1220.32 s [pandoc] Recognize preceding paragraphs in non-list contexts: OK
  2612. 1220.32 s [pandoc] Markup after header and list: OK
  2613. 1220.32 s [pandoc] CodeBlocks
  2614. 1220.32 s [pandoc] Source block: OK
  2615. 1220.32 s [pandoc] Source block with indented code: OK
  2616. 1220.32 s [pandoc] Source block with tab-indented code: OK
  2617. 1220.32 s [pandoc] Empty source block: OK
  2618. 1220.32 s [pandoc] Source block between paragraphs: OK
  2619. 1220.32 s [pandoc] Source block with babel arguments: OK
  2620. 1220.32 s [pandoc] Source block with results and :exports both: OK
  2621. 1220.32 s [pandoc] Source block with results and :exports code: OK
  2622. 1220.32 s [pandoc] Source block with results and :exports results: OK
  2623. 1220.32 s [pandoc] Source block with results and :exports none: OK
  2624. 1220.32 s [pandoc] Source block with toggling header arguments: OK
  2625. 1220.32 s [pandoc] Source block with line number switch: OK
  2626. 1220.32 s [pandoc] Source block with multi-word parameter values: OK
  2627. 1220.32 s [pandoc] Example block: OK
  2628. 1220.32 s [pandoc] Code block with caption: OK
  2629. 1220.32 s [pandoc] Non-letter chars in source block parameters: OK
  2630. 1220.32 s [pandoc] Tables
  2631. 1220.32 s [pandoc] Single cell table: OK
  2632. 1220.32 s [pandoc] Multi cell table: OK
  2633. 1220.32 s [pandoc] Multi line table: OK
  2634. 1220.32 s [pandoc] Empty table: OK
  2635. 1220.33 s [pandoc] Glider Table: OK
  2636. 1220.33 s [pandoc] Table between Paragraphs: OK
  2637. 1220.33 s [pandoc] Table with Header: OK
  2638. 1220.33 s [pandoc] Table with final hline: OK
  2639. 1220.33 s [pandoc] Table in a box: OK
  2640. 1220.33 s [pandoc] Table with empty cells: OK
  2641. 1220.33 s [pandoc] Table with empty rows: OK
  2642. 1220.33 s [pandoc] Table with alignment row: OK
  2643. 1220.33 s [pandoc] Pipe within text doesn't start a table: OK
  2644. 1220.34 s [pandoc] Missing pipe at end of row: OK
  2645. 1220.34 s [pandoc] Table with differing row lengths: OK
  2646. 1220.34 s [pandoc] Table with caption: OK
  2647. 1220.34 s [pandoc] named table: OK
  2648. 1220.34 s [pandoc] Meta Information
  2649. 1220.34 s [pandoc] Comments
  2650. 1220.34 s [pandoc] Comment: OK
  2651. 1220.34 s [pandoc] Hash not followed by space is text: OK
  2652. 1220.34 s [pandoc] Comment surrounded by Text: OK
  2653. 1220.34 s [pandoc] Export settings
  2654. 1220.34 s [pandoc] Title: OK
  2655. 1220.34 s [pandoc] Author
  2656. 1220.34 s [pandoc] sets 'author' field: OK
  2657. 1220.34 s [pandoc] Multiple author lines: OK
  2658. 1220.34 s [pandoc] Date: OK
  2659. 1220.34 s [pandoc] Description
  2660. 1220.34 s [pandoc] Single line: OK
  2661. 1220.34 s [pandoc] Multiline: OK
  2662. 1220.34 s [pandoc] Subtitle: OK
  2663. 1220.34 s [pandoc] Keywords: OK
  2664. 1220.34 s [pandoc] Institute: OK
  2665. 1220.34 s [pandoc] Document language: OK
  2666. 1220.34 s [pandoc] Todo sequences
  2667. 1220.34 s [pandoc] not included in document: OK
  2668. 1220.34 s [pandoc] can contain multiple pipe characters: OK
  2669. 1220.34 s [pandoc] LaTeX
  2670. 1220.34 s [pandoc] LATEX_HEADER: OK
  2671. 1220.34 s [pandoc] LATEX_HEADER_EXTRA: OK
  2672. 1220.34 s [pandoc] LaTeX_CLASS
  2673. 1220.34 s [pandoc] stored as documentclass: OK
  2674. 1220.34 s [pandoc] last definition takes precedence: OK
  2675. 1220.34 s [pandoc] LATEX_CLASS_OPTIONS as classoption: OK
  2676. 1220.34 s [pandoc] HTML
  2677. 1220.34 s [pandoc] HTML_HEAD values are added to header-includes: OK
  2678. 1220.34 s [pandoc] HTML_HEAD_EXTRA behaves like HTML_HEAD: OK
  2679. 1220.34 s [pandoc] Non-export keywords
  2680. 1220.34 s [pandoc] #+link
  2681. 1220.34 s [pandoc] Link abbreviation: OK
  2682. 1220.35 s [pandoc] Link abbreviation, defined after first use: OK
  2683. 1220.35 s [pandoc] Link abbreviation, URL encoded arguments: OK
  2684. 1220.35 s [pandoc] Link abbreviation, append arguments: OK
  2685. 1220.35 s [pandoc] emphasis config
  2686. 1220.35 s [pandoc] Changing pre chars for emphasis: OK
  2687. 1220.35 s [pandoc] Changing post chars for emphasis: OK
  2688. 1220.35 s [pandoc] setting an invalid value restores the default: OK
  2689. 1220.35 s [pandoc] Unknown keyword: OK
  2690. 1220.35 s [pandoc] Properties drawer: OK
  2691. 1220.35 s [pandoc] Logbook drawer: OK
  2692. 1220.35 s [pandoc] Drawer surrounded by text: OK
  2693. 1220.35 s [pandoc] Drawer markers must be the only text in the line: OK
  2694. 1220.35 s [pandoc] Drawers can be arbitrary: OK
  2695. 1220.35 s [pandoc] Anchor reference: OK
  2696. 1220.35 s [pandoc] Search links are read as emph: OK
  2697. 1220.35 s [pandoc] Link to nonexistent anchor: OK
  2698. 1220.35 s [pandoc] Directives
  2699. 1220.35 s [pandoc] export options
  2700. 1220.35 s [pandoc] disable simple sub/superscript syntax: OK
  2701. 1220.35 s [pandoc] directly select drawers to be exported: OK
  2702. 1220.35 s [pandoc] exclude drawers from being exported: OK
  2703. 1220.35 s [pandoc] don't include archive trees: OK
  2704. 1220.35 s [pandoc] include complete archive trees: OK
  2705. 1220.35 s [pandoc] include archive tree header only: OK
  2706. 1220.35 s [pandoc] limit headline depth: OK
  2707. 1220.36 s [pandoc] turn all headlines into lists: OK
  2708. 1220.36 s [pandoc] preserve linebreaks as hard breaks: OK
  2709. 1220.36 s [pandoc] disable author export: OK
  2710. 1220.36 s [pandoc] disable creator export: OK
  2711. 1220.36 s [pandoc] disable email export: OK
  2712. 1220.36 s [pandoc] disable MathML-like entities: OK
  2713. 1220.36 s [pandoc] Option f
  2714. 1220.36 s [pandoc] disable inline footnotes: OK
  2715. 1220.36 s [pandoc] disable reference footnotes: OK
  2716. 1220.36 s [pandoc] disable inclusion of todo keywords: OK
  2717. 1220.36 s [pandoc] remove tags from headlines: OK
  2718. 1220.36 s [pandoc] LaTeX
  2719. 1220.36 s [pandoc] Include LaTeX fragments
  2720. 1220.36 s [pandoc] Inline command: OK
  2721. 1220.36 s [pandoc] Alpha: OK
  2722. 1220.36 s [pandoc] equation environment: OK
  2723. 1220.36 s [pandoc] Ignore LaTeX fragments
  2724. 1220.36 s [pandoc] Inline command: OK
  2725. 1220.36 s [pandoc] MathML symbol (alpha): OK
  2726. 1220.36 s [pandoc] equation environment: OK
  2727. 1220.36 s [pandoc] Verbatim LaTeX
  2728. 1220.36 s [pandoc] Inline command: OK
  2729. 1220.36 s [pandoc] MathML symbol (alpha): OK
  2730. 1220.36 s [pandoc] equation environment: OK
  2731. 1220.36 s [pandoc] planning information
  2732. 1220.36 s [pandoc] include planning info after headlines: OK
  2733. 1220.36 s [pandoc] empty planning info is not included: OK
  2734. 1220.36 s [pandoc] Option |
  2735. 1220.37 s [pandoc] disable export of tables: OK
  2736. 1220.37 s [pandoc] unknown options
  2737. 1220.37 s [pandoc] unknown options are ignored: OK
  2738. 1220.37 s [pandoc] highlighting after unknown option: OK
  2739. 1220.37 s [pandoc] unknown option interleaved with known: OK
  2740. 1220.37 s [pandoc] Include
  2741. 1220.37 s [pandoc] file inclusion: OK
  2742. 1220.37 s [pandoc] Included file belongs to item: OK
  2743. 1220.37 s [pandoc] Default include preserves level: OK
  2744. 1220.37 s [pandoc] Minlevel shifts level leftward: OK
  2745. 1220.37 s [pandoc] Minlevel shifts level rightward: OK
  2746. 1220.37 s [pandoc] Include file as source code snippet: OK
  2747. 1220.37 s [pandoc] Include file as export snippet: OK
  2748. 1220.37 s [pandoc] include directive is limited to one line: OK
  2749. 1220.37 s [pandoc] RST
  2750. 1220.37 s [pandoc] line block with blank line: OK
  2751. 1220.37 s [pandoc] field list
  2752. 1220.38 s [pandoc] general: OK
  2753. 1220.38 s [pandoc] metadata: OK
  2754. 1220.38 s [pandoc] with inline markup: OK
  2755. 1220.38 s [pandoc] URLs with following punctuation: OK
  2756. 1220.38 s [pandoc] Reference names with special characters: OK
  2757. 1220.38 s [pandoc] Code directive with class and number-lines: OK
  2758. 1220.38 s [pandoc] Code directive with number-lines, no line specified: OK
  2759. 1220.38 s [pandoc] literal / line / code blocks
  2760. 1220.38 s [pandoc] indented literal block: OK
  2761. 1220.38 s [pandoc] line block with 3 lines: OK
  2762. 1220.38 s [pandoc] line blocks with blank lines: OK
  2763. 1220.46 s [pandoc] quoted literal block using >: OK
  2764. 1220.46 s [pandoc] quoted literal block using | (not a line block): OK
  2765. 1220.46 s [pandoc] class directive with single paragraph: OK
  2766. 1220.46 s [pandoc] class directive with two paragraphs: OK
  2767. 1220.46 s [pandoc] class directive around literal block: OK
  2768. 1220.46 s [pandoc] interpreted text roles
  2769. 1220.46 s [pandoc] literal role prefix: OK
  2770. 1220.46 s [pandoc] literal role postfix: OK
  2771. 1220.46 s [pandoc] literal text: OK
  2772. 1220.46 s [pandoc] code role: OK
  2773. 1220.46 s [pandoc] inherited code role: OK
  2774. 1220.46 s [pandoc] custom code role with language field: OK
  2775. 1220.46 s [pandoc] custom role with class field: OK
  2776. 1220.46 s [pandoc] custom role with class field containing multiple whi...: OK
  2777. 1220.46 s [pandoc] custom role with inherited class field: OK
  2778. 1220.46 s [pandoc] custom role with unspecified parent role: OK
  2779. 1220.46 s [pandoc] role with recursive inheritance: OK
  2780. 1220.46 s [pandoc] unknown role: OK
  2781. 1220.46 s [pandoc] footnotes
  2782. 1220.46 s [pandoc] remove space before note: OK
  2783. 1220.46 s [pandoc] inlines
  2784. 1220.46 s [pandoc] links can contain an URI without being parsed twice ...: OK
  2785. 1220.46 s [pandoc] inline markup cannot be nested: OK
  2786. 1220.46 s [pandoc] bare URI parsing disabled inside emphasis (#4561): OK
  2787. 1220.46 s [pandoc] include newlines: OK
  2788. 1220.46 s [pandoc] RTF
  2789. 1220.48 s [pandoc] footnote: OK (0.08s)
  2790. 1220.48 s [pandoc] accent: OK
  2791. 1220.48 s [pandoc] unicode: OK
  2792. 1220.49 s [pandoc] image: OK (0.01s)
  2793. 1220.49 s [pandoc] link: OK
  2794. 1220.51 s [pandoc] heading: OK (0.01s)
  2795. 1220.51 s [pandoc] formatting: OK
  2796. 1220.52 s [pandoc] list_simple: OK
  2797. 1220.55 s [pandoc] list_complex: OK (0.03s)
  2798. 1220.55 s [pandoc] bookmark: OK
  2799. 1220.55 s [pandoc] table_simple: OK
  2800. 1220.57 s [pandoc] table_error_codes: OK (0.01s)
  2801. 1220.57 s [pandoc] Docx
  2802. 1220.57 s [pandoc] document
  2803. 1220.57 s [pandoc] allow different document.xml file as defined in _rel...: OK
  2804. 1220.57 s [pandoc] inlines
  2805. 1220.57 s [pandoc] font formatting: OK
  2806. 1220.57 s [pandoc] font formatting with character styles: OK
  2807. 1220.57 s [pandoc] hyperlinks: OK
  2808. 1220.57 s [pandoc] hyperlinks in <w:instrText> tag: OK
  2809. 1220.58 s [pandoc] nested fields with <w:instrText> tag: OK
  2810. 1220.58 s [pandoc] empty fields with <w:instrText> tag: OK
  2811. 1220.58 s [pandoc] pageref hyperlinks in <w:instrText> tag: OK
  2812. 1220.58 s [pandoc] inline image: OK
  2813. 1220.58 s [pandoc] VML image: OK
  2814. 1220.58 s [pandoc] VML image as object: OK
  2815. 1220.58 s [pandoc] inline image in links: OK
  2816. 1220.58 s [pandoc] handling unicode input: OK
  2817. 1220.58 s [pandoc] literal tabs: OK
  2818. 1220.58 s [pandoc] special punctuation: OK
  2819. 1220.58 s [pandoc] normalizing inlines: OK
  2820. 1220.58 s [pandoc] normalizing inlines deep inside blocks: OK
  2821. 1220.58 s [pandoc] move trailing spaces outside of formatting: OK
  2822. 1220.58 s [pandoc] remove trailing spaces from last inline: OK
  2823. 1220.58 s [pandoc] inline code (with VerbatimChar style): OK
  2824. 1220.58 s [pandoc] inline code in subscript and superscript: OK
  2825. 1220.59 s [pandoc] inlines inside of Structured Document Tags: OK
  2826. 1220.59 s [pandoc] Structured Document Tags in footnotes: OK
  2827. 1220.59 s [pandoc] nested Structured Document Tags: OK
  2828. 1220.60 s [pandoc] nested Smart Tags: OK (0.01s)
  2829. 1220.60 s [pandoc] remove anchor spans with nothing pointing to them: OK
  2830. 1220.60 s [pandoc] collapse overlapping targets (anchor spans): OK
  2831. 1220.60 s [pandoc] anchor in header after anchor: OK
  2832. 1220.61 s [pandoc] text in shape format: OK
  2833. 1220.61 s [pandoc] blocks
  2834. 1220.61 s [pandoc] headers: OK
  2835. 1220.61 s [pandoc] headers already having auto identifiers: OK
  2836. 1220.61 s [pandoc] avoid zero-level headers: OK
  2837. 1220.61 s [pandoc] nested anchor spans in header: OK
  2838. 1220.61 s [pandoc] single numbered item not made into list: OK
  2839. 1220.61 s [pandoc] enumerated headers not made into numbered list: OK
  2840. 1220.62 s [pandoc] i18n blocks (headers and blockquotes): OK
  2841. 1220.62 s [pandoc] lists: OK
  2842. 1220.62 s [pandoc] compact lists: OK
  2843. 1220.62 s [pandoc] lists with level overrides: OK
  2844. 1220.62 s [pandoc] lists continuing after interruption: OK
  2845. 1220.62 s [pandoc] lists restarting after interruption: OK
  2846. 1220.62 s [pandoc] sublists reset numbering to 1: OK
  2847. 1220.62 s [pandoc] definition lists: OK
  2848. 1220.62 s [pandoc] task lists: OK
  2849. 1220.62 s [pandoc] custom defined lists in styles: OK
  2850. 1220.62 s [pandoc] user deletes bullet after list item (=> part of item...: OK
  2851. 1220.63 s [pandoc] user deletes bullet after par (=> new par): OK
  2852. 1220.63 s [pandoc] footnotes and endnotes: OK
  2853. 1220.63 s [pandoc] links in footnotes and endnotes: OK
  2854. 1220.63 s [pandoc] blockquotes (parsing indent as blockquote): OK
  2855. 1220.63 s [pandoc] blockquotes (parsing indent relative to the indent o...: OK
  2856. 1220.63 s [pandoc] hanging indents: OK
  2857. 1220.64 s [pandoc] tables: OK
  2858. 1220.65 s [pandoc] tables with lists in cells: OK
  2859. 1220.66 s [pandoc] a table with a header which contains rowspans greate...: OK (0.02s)
  2860. 1220.67 s [pandoc] tables with one row: OK
  2861. 1220.67 s [pandoc] tables with just one row, which is a header: OK
  2862. 1220.67 s [pandoc] tables with variable width: OK
  2863. 1220.67 s [pandoc] tables with captions which contain a Table field: OK
  2864. 1220.67 s [pandoc] tables with captions which don't contain a Table field: OK
  2865. 1220.67 s [pandoc] code block: OK
  2866. 1220.68 s [pandoc] combine adjacent code blocks: OK
  2867. 1220.69 s [pandoc] dropcap paragraphs: OK
  2868. 1220.69 s [pandoc] citations
  2869. 1220.70 s [pandoc] zotero with -citations: OK
  2870. 1220.71 s [pandoc] zotero with +citations: OK (0.02s)
  2871. 1220.71 s [pandoc] mendeley with -citations: OK
  2872. 1220.73 s [pandoc] mendeley with +citations: OK (0.02s)
  2873. 1220.73 s [pandoc] track changes
  2874. 1220.73 s [pandoc] insertion (default): OK
  2875. 1220.73 s [pandoc] insert insertion (accept): OK
  2876. 1220.73 s [pandoc] remove insertion (reject): OK
  2877. 1220.73 s [pandoc] deletion (default): OK
  2878. 1220.73 s [pandoc] remove deletion (accept): OK
  2879. 1220.73 s [pandoc] insert deletion (reject): OK
  2880. 1220.74 s [pandoc] keep insertion (all): OK
  2881. 1220.74 s [pandoc] keep deletion (all): OK
  2882. 1220.74 s [pandoc] move text (accept): OK
  2883. 1220.74 s [pandoc] move text (reject): OK
  2884. 1220.74 s [pandoc] move text (all): OK
  2885. 1220.74 s [pandoc] comments (accept -- no comments): OK
  2886. 1220.74 s [pandoc] comments (reject -- comments): OK
  2887. 1220.74 s [pandoc] comments (all comments): OK
  2888. 1220.74 s [pandoc] paragraph insertion/deletion (accept): OK
  2889. 1220.74 s [pandoc] paragraph insertion/deletion (reject): OK
  2890. 1220.75 s [pandoc] paragraph insertion/deletion (all): OK
  2891. 1220.75 s [pandoc] paragraph insertion/deletion (all): OK
  2892. 1220.75 s [pandoc] comment warnings (accept -- no warnings): OK
  2893. 1220.75 s [pandoc] comment warnings (reject -- no warnings): OK
  2894. 1220.75 s [pandoc] comment warnings (all): OK
  2895. 1220.75 s [pandoc] comments (with styles extension): OK
  2896. 1220.75 s [pandoc] media
  2897. 1220.75 s [pandoc] image extraction: OK
  2898. 1220.75 s [pandoc] custom styles
  2899. 1220.75 s [pandoc] custom styles (`+styles`) not enabled (default): OK
  2900. 1220.75 s [pandoc] custom styles (`+styles`) enabled: OK
  2901. 1220.75 s [pandoc] custom styles (`+styles`): Compact style is removed ...: OK
  2902. 1220.75 s [pandoc] metadata
  2903. 1220.75 s [pandoc] metadata fields: OK
  2904. 1220.76 s [pandoc] stop recording metadata with normal text: OK
  2905. 1220.76 s [pandoc] ODT
  2906. 1220.76 s [pandoc] blockquote2: OK
  2907. 1220.76 s [pandoc] bold: OK
  2908. 1220.76 s [pandoc] endnote: OK
  2909. 1220.77 s [pandoc] externalLink: OK
  2910. 1220.77 s [pandoc] footnote: OK
  2911. 1220.77 s [pandoc] formula: OK
  2912. 1220.77 s [pandoc] headers: OK
  2913. 1220.77 s [pandoc] italic: OK
  2914. 1220.77 s [pandoc] paragraph: OK
  2915. 1220.77 s [pandoc] strikeout: OK
  2916. 1220.77 s [pandoc] underlined: OK
  2917. 1220.77 s [pandoc] blockquote: OK
  2918. 1220.78 s [pandoc] image: OK
  2919. 1220.78 s [pandoc] imageIndex: OK
  2920. 1220.79 s [pandoc] imageWithCaption: OK
  2921. 1220.79 s [pandoc] inlinedCode: OK
  2922. 1220.79 s [pandoc] listContinueNumbering: OK
  2923. 1220.80 s [pandoc] listContinueNumbering2: OK
  2924. 1220.80 s [pandoc] orderedListMixed: OK
  2925. 1220.80 s [pandoc] orderedListRoman: OK
  2926. 1220.81 s [pandoc] orderedListSimple: OK
  2927. 1220.81 s [pandoc] orderedListHeader: OK
  2928. 1220.81 s [pandoc] referenceToChapter: OK
  2929. 1220.82 s [pandoc] referenceToListItem: OK
  2930. 1220.82 s [pandoc] referenceToText: OK
  2931. 1220.83 s [pandoc] simpleTable: OK
  2932. 1220.83 s [pandoc] simpleTableWithCaption: OK
  2933. 1220.83 s [pandoc] tab: OK
  2934. 1220.83 s [pandoc] textMixedStyles: OK
  2935. 1220.84 s [pandoc] tableWithContents: OK
  2936. 1220.84 s [pandoc] unicode: OK
  2937. 1220.84 s [pandoc] unorderedList: OK
  2938. 1220.85 s [pandoc] unorderedListHeader: OK
  2939. 1220.85 s [pandoc] Txt2Tags
  2940. 1220.85 s [pandoc] Inlines
  2941. 1220.85 s [pandoc] Plain String: OK
  2942. 1220.85 s [pandoc] Emphasis: OK
  2943. 1220.85 s [pandoc] Strong: OK
  2944. 1220.85 s [pandoc] Strong Emphasis: OK
  2945. 1220.85 s [pandoc] Strikeout: OK
  2946. 1220.85 s [pandoc] Verbatim: OK
  2947. 1220.85 s [pandoc] Symbol: OK
  2948. 1220.85 s [pandoc] No empty markup: OK
  2949. 1220.85 s [pandoc] Inline markup is greedy: OK
  2950. 1220.85 s [pandoc] Markup must be greedy: OK
  2951. 1220.85 s [pandoc] Inlines must be glued: OK
  2952. 1220.85 s [pandoc] Macros: Date: OK
  2953. 1220.85 s [pandoc] Macros: Mod Time: OK
  2954. 1220.85 s [pandoc] Macros: Infile: OK
  2955. 1220.85 s [pandoc] Macros: Outfile: OK
  2956. 1220.85 s [pandoc] Autolink: OK
  2957. 1220.85 s [pandoc] JPEG Image: OK
  2958. 1220.85 s [pandoc] PNG Image: OK
  2959. 1220.85 s [pandoc] Link: OK
  2960. 1220.85 s [pandoc] Image link: OK
  2961. 1220.85 s [pandoc] Invalid link: No trailing space: OK
  2962. 1220.85 s [pandoc] Basic Blocks
  2963. 1220.85 s [pandoc] Paragraph, lines grouped together: OK
  2964. 1220.85 s [pandoc] Paragraph, ignore leading and trailing spaces: OK
  2965. 1220.86 s [pandoc] Comment line in paragraph: OK
  2966. 1220.86 s [pandoc] Paragraph: OK
  2967. 1220.86 s [pandoc] First Level Header: OK
  2968. 1220.86 s [pandoc] Third Level Header: OK
  2969. 1220.86 s [pandoc] Header with label: OK
  2970. 1220.86 s [pandoc] Invalid header, mismatched delimiters: OK
  2971. 1220.86 s [pandoc] Invalid header, spaces in label: OK
  2972. 1220.86 s [pandoc] Invalid header, invalid label character: OK
  2973. 1220.86 s [pandoc] Headers not preceded by a blank line: OK
  2974. 1220.86 s [pandoc] Paragraph starting with an equals: OK
  2975. 1220.86 s [pandoc] Paragraph containing asterisk at beginning of line: OK
  2976. 1220.86 s [pandoc] Horizontal Rule: OK
  2977. 1220.86 s [pandoc] Comment Block: OK
  2978. 1220.86 s [pandoc] Lists
  2979. 1220.86 s [pandoc] Simple Bullet Lists: OK
  2980. 1220.86 s [pandoc] Indented Bullet Lists: OK
  2981. 1220.86 s [pandoc] Nested Bullet Lists: OK
  2982. 1220.86 s [pandoc] Simple Ordered List: OK
  2983. 1220.86 s [pandoc] Indented Ordered List: OK
  2984. 1220.86 s [pandoc] Nested Ordered Lists: OK
  2985. 1220.86 s [pandoc] Ordered List in Bullet List: OK
  2986. 1220.86 s [pandoc] Bullet List in Ordered List: OK
  2987. 1220.87 s [pandoc] Definition List: OK
  2988. 1220.87 s [pandoc] Loose bullet list: OK
  2989. 1220.87 s [pandoc] Tables
  2990. 1220.87 s [pandoc] Single cell table: OK
  2991. 1220.87 s [pandoc] Multi cell table: OK
  2992. 1220.87 s [pandoc] Multi line table: OK
  2993. 1220.87 s [pandoc] Empty table: OK
  2994. 1220.87 s [pandoc] Glider Table: OK
  2995. 1220.88 s [pandoc] Table with Header: OK
  2996. 1220.88 s [pandoc] Table alignment determined by spacing: OK
  2997. 1220.88 s [pandoc] Pipe within text doesn't start a table: OK
  2998. 1220.88 s [pandoc] Table with differing row lengths: OK
  2999. 1220.88 s [pandoc] Blocks and fragments
  3000. 1220.88 s [pandoc] Source block: OK
  3001. 1220.88 s [pandoc] tagged block: OK
  3002. 1220.88 s [pandoc] Quote block: OK
  3003. 1220.88 s [pandoc] EPUB
  3004. 1220.88 s [pandoc] EPUB Mediabag
  3005. 1220.88 s [pandoc] features bag: OK
  3006. 1220.91 s [pandoc] EPUB3 cover bag: OK (0.03s)
  3007. 1220.92 s [pandoc] EPUB3 no cover bag: OK
  3008. 1220.92 s [pandoc] EPUB2 picture bag: OK
  3009. 1220.92 s [pandoc] EPUB2 cover bag: OK
  3010. 1220.92 s [pandoc] EPUB2 no cover bag: OK
  3011. 1220.92 s [pandoc] Muse
  3012. 1220.92 s [pandoc] Inlines
  3013. 1220.92 s [pandoc] Plain String: OK
  3014. 1220.92 s [pandoc] Muse is not XML: OK
  3015. 1220.92 s [pandoc] Emphasis: OK
  3016. 1220.92 s [pandoc] Newline in the beginning of emphasis: OK
  3017. 1220.92 s [pandoc] Newline in the end of emphasis: OK
  3018. 1220.92 s [pandoc] Comma after closing *: OK
  3019. 1220.92 s [pandoc] Letter after closing *: OK
  3020. 1220.93 s [pandoc] Letter before opening *: OK
  3021. 1220.93 s [pandoc] Digit after closing *: OK
  3022. 1220.93 s [pandoc] Emphasis tag: OK
  3023. 1220.93 s [pandoc] Strong: OK
  3024. 1220.93 s [pandoc] Strong tag: OK
  3025. 1220.93 s [pandoc] Strong Emphasis: OK
  3026. 1220.93 s [pandoc] Strong inside emphasis: OK
  3027. 1220.93 s [pandoc] Emphasis inside strong: OK
  3028. 1220.93 s [pandoc] Opening asterisk can't be preceded by another one: OK
  3029. 1220.93 s [pandoc] Asterisk between words does not terminate emphasis: OK
  3030. 1220.93 s [pandoc] Two asterisks between words do not terminate emphasis: OK
  3031. 1220.93 s [pandoc] Three asterisks between words do not terminate empha...: OK
  3032. 1220.93 s [pandoc] Two asterisks between words do not terminate strong: OK
  3033. 1220.93 s [pandoc] Three asterisks between words do not terminate strong: OK
  3034. 1220.93 s [pandoc] Three asterisks between words do not terminate stron...: OK
  3035. 1220.93 s [pandoc] Six asterisks between words do not terminate strong ...: OK
  3036. 1220.93 s [pandoc] Underline: OK
  3037. 1220.93 s [pandoc] Superscript tag: OK
  3038. 1220.93 s [pandoc] Subscript tag: OK
  3039. 1220.93 s [pandoc] Strikeout tag: OK
  3040. 1220.93 s [pandoc] Opening inline tags: OK
  3041. 1220.94 s [pandoc] Closing inline tags: OK
  3042. 1220.94 s [pandoc] Tag soup: OK
  3043. 1220.94 s [pandoc] No multiparagraph inline tags: OK
  3044. 1220.94 s [pandoc] Linebreak: OK
  3045. 1220.94 s [pandoc] Trailing whitespace inside paragraph: OK
  3046. 1220.94 s [pandoc] Non-breaking space: OK
  3047. 1220.94 s [pandoc] Single ~: OK
  3048. 1220.94 s [pandoc] Code markup
  3049. 1220.94 s [pandoc] Code: OK
  3050. 1220.94 s [pandoc] Not code: OK
  3051. 1220.94 s [pandoc] Not code if closing = is detached: OK
  3052. 1220.94 s [pandoc] Not code if opening = is detached: OK
  3053. 1220.94 s [pandoc] Code if followed by comma: OK
  3054. 1220.94 s [pandoc] Not code if followed by digit: OK
  3055. 1220.94 s [pandoc] One character code: OK
  3056. 1220.94 s [pandoc] Code with equal sign: OK
  3057. 1220.94 s [pandoc] Three = characters is not a code: OK
  3058. 1220.94 s [pandoc] Multiline code markup: OK
  3059. 1220.94 s [pandoc] No multiparagraph code: OK
  3060. 1220.94 s [pandoc] Code at the beginning of paragraph but not first col...: OK
  3061. 1220.94 s [pandoc] Code tag: OK
  3062. 1220.94 s [pandoc] Math tag: OK
  3063. 1220.94 s [pandoc] Verbatim tag: OK
  3064. 1220.94 s [pandoc] Verbatim inside code: OK
  3065. 1220.95 s [pandoc] Verbatim tag after text: OK
  3066. 1220.95 s [pandoc] Verbatim tag escapes block level markup: OK
  3067. 1220.95 s [pandoc] Class tag: OK
  3068. 1220.95 s [pandoc] Class tag without name: OK
  3069. 1220.95 s [pandoc] RTL: OK
  3070. 1220.95 s [pandoc] LTR: OK
  3071. 1220.95 s [pandoc] Nested "</em>" inside em tag: OK
  3072. 1220.95 s [pandoc] Links
  3073. 1220.95 s [pandoc] Link without description: OK
  3074. 1220.95 s [pandoc] Link with description: OK
  3075. 1220.95 s [pandoc] Link with empty description: OK
  3076. 1220.95 s [pandoc] Image: OK
  3077. 1220.95 s [pandoc] Closing bracket is not allowed in image filename: OK
  3078. 1220.95 s [pandoc] Image with description: OK
  3079. 1220.95 s [pandoc] Image with space in filename: OK
  3080. 1220.95 s [pandoc] Image with width: OK
  3081. 1220.95 s [pandoc] At least one space is required between image filenam...: OK
  3082. 1220.95 s [pandoc] Left-aligned image with width: OK
  3083. 1220.95 s [pandoc] Right-aligned image with width: OK
  3084. 1220.95 s [pandoc] Image link: OK
  3085. 1220.95 s [pandoc] Image link with description: OK
  3086. 1220.96 s [pandoc] No implicit links: OK
  3087. 1220.96 s [pandoc] Link with empty URL: OK
  3088. 1220.96 s [pandoc] No footnotes inside links: OK
  3089. 1220.96 s [pandoc] Image inside link: OK
  3090. 1220.96 s [pandoc] Link inside image description: OK
  3091. 1220.96 s [pandoc] Literal
  3092. 1220.96 s [pandoc] Inline literal: OK
  3093. 1220.96 s [pandoc] Single inline literal in paragraph: OK
  3094. 1220.96 s [pandoc] Blocks
  3095. 1220.96 s [pandoc] Block elements end paragraphs: OK
  3096. 1220.96 s [pandoc] Horizontal rule
  3097. 1220.96 s [pandoc] Less than 4 dashes is not a horizontal rule: OK
  3098. 1220.96 s [pandoc] 4 dashes is a horizontal rule: OK
  3099. 1220.96 s [pandoc] 5 dashes is a horizontal rule: OK
  3100. 1220.96 s [pandoc] 4 dashes with spaces is a horizontal rule: OK
  3101. 1220.96 s [pandoc] Page breaks
  3102. 1220.96 s [pandoc] Page break: OK
  3103. 1220.96 s [pandoc] Page break with trailing space: OK
  3104. 1220.96 s [pandoc] Paragraphs
  3105. 1220.96 s [pandoc] Simple paragraph: OK
  3106. 1220.96 s [pandoc] Indented paragraph: OK
  3107. 1220.96 s [pandoc] Indentation in the middle of paragraph: OK
  3108. 1220.96 s [pandoc] Quote: OK
  3109. 1220.96 s [pandoc] Indentation does not indicate quote inside quote tag: OK
  3110. 1220.96 s [pandoc] Multiline quote: OK
  3111. 1220.96 s [pandoc] Div
  3112. 1220.96 s [pandoc] Div without id: OK
  3113. 1220.96 s [pandoc] Div with id: OK
  3114. 1220.97 s [pandoc] Biblio: OK
  3115. 1220.97 s [pandoc] Play: OK
  3116. 1220.97 s [pandoc] Verse: OK
  3117. 1220.97 s [pandoc] Verse in list: OK
  3118. 1220.97 s [pandoc] Verse line starting with emphasis: OK
  3119. 1220.97 s [pandoc] Multiline verse in list: OK
  3120. 1220.97 s [pandoc] Paragraph after verse in list: OK
  3121. 1220.97 s [pandoc] Empty quote tag: OK
  3122. 1220.97 s [pandoc] Quote tag: OK
  3123. 1220.97 s [pandoc] Nested quote tag: OK
  3124. 1220.97 s [pandoc] Indented quote inside list: OK
  3125. 1220.97 s [pandoc] Verse tag: OK
  3126. 1220.97 s [pandoc] Verse tag with empty line inside: OK
  3127. 1220.97 s [pandoc] Verse tag with verbatim close tag inside: OK
  3128. 1220.97 s [pandoc] Example
  3129. 1220.97 s [pandoc] Braces on separate lines: OK
  3130. 1220.97 s [pandoc] Spaces after opening braces: OK
  3131. 1220.97 s [pandoc] One blank line in the beginning: OK
  3132. 1220.97 s [pandoc] One blank line in the end: OK
  3133. 1220.97 s [pandoc] Indented braces: OK
  3134. 1220.97 s [pandoc] Tabs: OK
  3135. 1220.97 s [pandoc] One line: OK
  3136. 1220.97 s [pandoc] Example tag
  3137. 1220.97 s [pandoc] Tags on separate lines: OK
  3138. 1220.97 s [pandoc] One line: OK
  3139. 1220.97 s [pandoc] One blank line in the beginning: OK
  3140. 1220.97 s [pandoc] One blank line in the end: OK
  3141. 1220.97 s [pandoc] Example inside list: OK
  3142. 1220.97 s [pandoc] Empty example inside list: OK
  3143. 1220.97 s [pandoc] Example inside list with empty lines: OK
  3144. 1220.97 s [pandoc] Indented example inside list: OK
  3145. 1220.97 s [pandoc] Example inside definition list: OK
  3146. 1220.97 s [pandoc] Example inside list definition with empty lines: OK
  3147. 1220.97 s [pandoc] Example inside note: OK
  3148. 1220.97 s [pandoc] Literal blocks
  3149. 1220.97 s [pandoc] Literal block: OK
  3150. 1220.97 s [pandoc] Center: OK
  3151. 1220.97 s [pandoc] Right: OK
  3152. 1220.97 s [pandoc] Comments
  3153. 1220.97 s [pandoc] Comment tag: OK
  3154. 1220.98 s [pandoc] Line comment: OK
  3155. 1220.98 s [pandoc] Empty comment: OK
  3156. 1220.98 s [pandoc] Text after empty comment: OK
  3157. 1220.98 s [pandoc] Not a comment (does not start with a semicolon): OK
  3158. 1220.98 s [pandoc] Not a comment (has no space after semicolon): OK
  3159. 1220.98 s [pandoc] Not a comment (semicolon not in the first column): OK
  3160. 1220.98 s [pandoc] Headers
  3161. 1220.98 s [pandoc] Part: OK
  3162. 1220.98 s [pandoc] Chapter: OK
  3163. 1220.98 s [pandoc] Section: OK
  3164. 1220.98 s [pandoc] Subsection: OK
  3165. 1220.98 s [pandoc] Subsubsection: OK
  3166. 1220.98 s [pandoc] Whitespace is required after *: OK
  3167. 1220.98 s [pandoc] No headers in footnotes: OK
  3168. 1220.98 s [pandoc] No headers in quotes: OK
  3169. 1220.98 s [pandoc] Headers consume anchors: OK
  3170. 1220.98 s [pandoc] Headers don't consume anchors separated with a blank...: OK
  3171. 1220.98 s [pandoc] Headers terminate paragraph: OK
  3172. 1220.98 s [pandoc] Headers terminate lists: OK
  3173. 1220.98 s [pandoc] Paragraphs terminate Emacs Muse headers: OK
  3174. 1220.98 s [pandoc] Paragraphs don't terminate Text::Amuse headers: OK
  3175. 1220.98 s [pandoc] Empty header: OK
  3176. 1220.98 s [pandoc] Auto identifiers: OK
  3177. 1220.98 s [pandoc] Directives
  3178. 1220.98 s [pandoc] Title: OK
  3179. 1220.98 s [pandoc] Disable tables: OK
  3180. 1220.98 s [pandoc] Multiple directives: OK
  3181. 1220.98 s [pandoc] Multiline directive: OK
  3182. 1220.98 s [pandoc] Amusewiki's #cover is translated to pandoc's #cover-...: OK
  3183. 1220.98 s [pandoc] Anchors
  3184. 1220.98 s [pandoc] Anchor: OK
  3185. 1220.98 s [pandoc] Anchor cannot start with a number: OK
  3186. 1220.98 s [pandoc] Not anchor if starts with a space: OK
  3187. 1220.98 s [pandoc] Anchor inside a paragraph: OK
  3188. 1220.99 s [pandoc] Anchor with "-": OK
  3189. 1220.99 s [pandoc] Footnotes
  3190. 1220.99 s [pandoc] Simple footnote: OK
  3191. 1220.99 s [pandoc] Simple secondary footnote: OK
  3192. 1220.99 s [pandoc] Missing footnote: OK
  3193. 1220.99 s [pandoc] Missing secondary note: OK
  3194. 1220.99 s [pandoc] Wrong note type: OK
  3195. 1220.99 s [pandoc] Recursive footnote: OK
  3196. 1220.99 s [pandoc] Nested footnotes: OK
  3197. 1220.99 s [pandoc] No zero footnotes: OK
  3198. 1220.99 s [pandoc] Footnotes can't start with zero: OK
  3199. 1220.99 s [pandoc] Multiparagraph footnotes
  3200. 1220.99 s [pandoc] Amusewiki multiparagraph footnotes: OK
  3201. 1220.99 s [pandoc] Note continuation with verse: OK
  3202. 1220.99 s [pandoc] Footnote ending in self-terminating element and foll...: OK
  3203. 1221.00 s [pandoc] Footnote starting with empty line: OK
  3204. 1221.00 s [pandoc] Indentation in footnote starting with empty line: OK
  3205. 1221.00 s [pandoc] Emacs multiparagraph footnotes: OK
  3206. 1221.00 s [pandoc] Tables
  3207. 1221.00 s [pandoc] Two cell table: OK
  3208. 1221.00 s [pandoc] Table with multiple words: OK
  3209. 1221.00 s [pandoc] Not a table: OK
  3210. 1221.00 s [pandoc] Not a table again: OK
  3211. 1221.00 s [pandoc] Two line table: OK
  3212. 1221.00 s [pandoc] Table with one header: OK
  3213. 1221.00 s [pandoc] Table with two headers: OK
  3214. 1221.01 s [pandoc] Header and footer reordering: OK
  3215. 1221.01 s [pandoc] Table with caption: OK
  3216. 1221.01 s [pandoc] Table caption with +: OK
  3217. 1221.01 s [pandoc] Caption without table: OK
  3218. 1221.01 s [pandoc] Table indented with space: OK
  3219. 1221.01 s [pandoc] Empty cells: OK
  3220. 1221.01 s [pandoc] Empty cell in the middle: OK
  3221. 1221.01 s [pandoc] Grid table: OK
  3222. 1221.02 s [pandoc] Grid table inside list: OK
  3223. 1221.02 s [pandoc] Grid table with two rows: OK
  3224. 1221.02 s [pandoc] Grid table inside grid table: OK
  3225. 1221.02 s [pandoc] Grid table with example: OK
  3226. 1221.02 s [pandoc] Lists
  3227. 1221.02 s [pandoc] Bullet list: OK
  3228. 1221.02 s [pandoc] Ordered list: OK
  3229. 1221.02 s [pandoc] Ordered list with implicit numbers: OK
  3230. 1221.02 s [pandoc] Ordered list with roman numerals: OK
  3231. 1221.02 s [pandoc] Bullet list with empty items: OK
  3232. 1221.02 s [pandoc] Ordered list with empty items: OK
  3233. 1221.02 s [pandoc] Bullet list with last item empty: OK
  3234. 1221.03 s [pandoc] Nested lists
  3235. 1221.03 s [pandoc] Nested bullet list: OK
  3236. 1221.03 s [pandoc] Nested ordered list: OK
  3237. 1221.03 s [pandoc] Mixed nested list: OK
  3238. 1221.03 s [pandoc] Text::Amuse includes only one space in list marker: OK
  3239. 1221.03 s [pandoc] List continuation: OK
  3240. 1221.03 s [pandoc] List continuation after nested list: OK
  3241. 1221.03 s [pandoc] Blank lines
  3242. 1221.03 s [pandoc] Blank lines between list items are not required: OK
  3243. 1221.03 s [pandoc] One blank line between list items is allowed: OK
  3244. 1221.03 s [pandoc] Two blank lines separate lists: OK
  3245. 1221.03 s [pandoc] No blank line after multiline first item: OK
  3246. 1221.03 s [pandoc] One blank line after multiline first item: OK
  3247. 1221.04 s [pandoc] Two blank lines after multiline first item: OK
  3248. 1221.04 s [pandoc] No blank line after list continuation: OK
  3249. 1221.04 s [pandoc] One blank line after list continuation: OK
  3250. 1221.04 s [pandoc] Two blank lines after list continuation: OK
  3251. 1221.04 s [pandoc] No blank line after blockquote: OK
  3252. 1221.04 s [pandoc] One blank line after blockquote: OK
  3253. 1221.04 s [pandoc] Two blank lines after blockquote: OK
  3254. 1221.04 s [pandoc] No blank line after verse: OK
  3255. 1221.04 s [pandoc] One blank line after verse: OK
  3256. 1221.04 s [pandoc] Two blank lines after verse: OK
  3257. 1221.04 s [pandoc] List ending in self-terminating element and followed...: OK
  3258. 1221.04 s [pandoc] Not a definition list: OK
  3259. 1221.04 s [pandoc] Emacs Muse definition list: OK
  3260. 1221.04 s [pandoc] Definition list: OK
  3261. 1221.04 s [pandoc] Definition list term cannot include newline: OK
  3262. 1221.04 s [pandoc] One-line definition list: OK
  3263. 1221.05 s [pandoc] Definition list term may include single colon: OK
  3264. 1221.05 s [pandoc] Definition list term with emphasis: OK
  3265. 1221.05 s [pandoc] Definition list term with :: inside code: OK
  3266. 1221.05 s [pandoc] Multi-line definition lists: OK
  3267. 1221.05 s [pandoc] Definition list with verse: OK
  3268. 1221.05 s [pandoc] Definition list with table: OK
  3269. 1221.05 s [pandoc] Definition list with table inside bullet list: OK
  3270. 1221.05 s [pandoc] Multi-line definition lists from Emacs Muse manual: OK
  3271. 1221.06 s [pandoc] Multi-line definition lists from Emacs Muse manual w...: OK
  3272. 1221.06 s [pandoc] One-line nested definition list: OK
  3273. 1221.06 s [pandoc] Nested definition list: OK
  3274. 1221.06 s [pandoc] Definition lists with multiple descriptions
  3275. 1221.06 s [pandoc] Correctly indented second description: OK
  3276. 1221.06 s [pandoc] Incorrectly indented second description: OK
  3277. 1221.06 s [pandoc] Two blank lines separate definition lists: OK
  3278. 1221.06 s [pandoc] No headers in list continuation: OK
  3279. 1221.06 s [pandoc] Bullet list inside a tag: OK
  3280. 1221.06 s [pandoc] Ordered list inside a tag: OK
  3281. 1221.06 s [pandoc] Do not consume whitespace while looking for end tag: OK
  3282. 1221.06 s [pandoc] Unclosed quote tag: OK
  3283. 1221.06 s [pandoc] Unclosed quote tag inside list: OK
  3284. 1221.06 s [pandoc] No indented closing tags: OK
  3285. 1221.06 s [pandoc] Creole
  3286. 1221.06 s [pandoc] Basic Text Formatting
  3287. 1221.06 s [pandoc] bold, single line, fully delimited: OK
  3288. 1221.06 s [pandoc] italics, single line, fully delimited: OK
  3289. 1221.07 s [pandoc] bold in italics, fully delimited: OK
  3290. 1221.07 s [pandoc] italics in bold, fully delimited: OK
  3291. 1221.07 s [pandoc] escape bold marker: OK
  3292. 1221.07 s [pandoc] escape italics marker: OK
  3293. 1221.07 s [pandoc] inline nowiki, simple: OK
  3294. 1221.07 s [pandoc] inline nowiki, curly braces inside: OK
  3295. 1221.07 s [pandoc] placeholder: OK
  3296. 1221.07 s [pandoc] placeholder escaped: OK
  3297. 1221.07 s [pandoc] Headers
  3298. 1221.07 s [pandoc] header level 1, no space, no trailing =: OK
  3299. 1221.07 s [pandoc] header level 1, leading space, trailing =: OK
  3300. 1221.07 s [pandoc] header level 2, no space, no trailing =: OK
  3301. 1221.07 s [pandoc] header level 2, leading space, no trailing =: OK
  3302. 1221.07 s [pandoc] header level 3, no space, no trailing =: OK
  3303. 1221.07 s [pandoc] header level 3, no space, > 3 trailing =: OK
  3304. 1221.07 s [pandoc] header level 4, no space, no trailing =: OK
  3305. 1221.07 s [pandoc] header level 4, no space, < 4 trailing =: OK
  3306. 1221.07 s [pandoc] header level 5, no space, no trailing =: OK
  3307. 1221.07 s [pandoc] header level 6, no space, no trailing =: OK
  3308. 1221.07 s [pandoc] Paragraphs
  3309. 1221.07 s [pandoc] paragraphs: multiple, one line: OK
  3310. 1221.07 s [pandoc] Lists
  3311. 1221.07 s [pandoc] unordered list, two entries, one separating space: OK
  3312. 1221.07 s [pandoc] unordered list, three entries, one separating space: OK
  3313. 1221.07 s [pandoc] para followed by, unordered list, two entries, one s...: OK
  3314. 1221.07 s [pandoc] nested unordered list, one separating space: OK
  3315. 1221.07 s [pandoc] nested many unordered lists, one separating space: OK
  3316. 1221.08 s [pandoc] nested unordered list, mixed separating space: OK
  3317. 1221.08 s [pandoc] nested unordered list, one separating space, trailin...: OK
  3318. 1221.08 s [pandoc] ordered list, two entries, one separating space: OK
  3319. 1221.08 s [pandoc] ordered list, three entries, one separating space: OK
  3320. 1221.08 s [pandoc] para followed by, ordered list, two entries, one sep...: OK
  3321. 1221.08 s [pandoc] nested ordered list, one separating space: OK
  3322. 1221.08 s [pandoc] nested ordered list, one separating space, trailing ...: OK
  3323. 1221.08 s [pandoc] nested many ordered lists, one separating space: OK
  3324. 1221.08 s [pandoc] nested ordered list, mixed separating space: OK
  3325. 1221.08 s [pandoc] mixed nested ordered and unordered lists, one separa...: OK
  3326. 1221.08 s [pandoc] NoWiki
  3327. 1221.08 s [pandoc] quoted block, simple: OK
  3328. 1221.08 s [pandoc] quoted block, curly bracket exception: OK
  3329. 1221.09 s [pandoc] forced line breaks: OK
  3330. 1221.09 s [pandoc] quoted block, after trailing white space: OK
  3331. 1221.09 s [pandoc] Images and Links
  3332. 1221.09 s [pandoc] image simple: OK
  3333. 1221.09 s [pandoc] image with alt text: OK
  3334. 1221.09 s [pandoc] auto link: OK
  3335. 1221.09 s [pandoc] escaped auto link: OK
  3336. 1221.09 s [pandoc] wiki link simple: OK
  3337. 1221.09 s [pandoc] wiki link with name: OK
  3338. 1221.09 s [pandoc] image link: OK
  3339. 1221.09 s [pandoc] Table
  3340. 1221.09 s [pandoc] Table with Header: OK
  3341. 1221.09 s [pandoc] Table without Header: OK
  3342. 1221.10 s [pandoc] Table without Header, no markers at line ends: OK
  3343. 1221.10 s [pandoc] Table with Header, with formatting: OK
  3344. 1221.10 s [pandoc] Man
  3345. 1221.10 s [pandoc] Macros
  3346. 1221.10 s [pandoc] Bold: OK
  3347. 1221.10 s [pandoc] Italic: OK
  3348. 1221.10 s [pandoc] BoldItalic: OK
  3349. 1221.10 s [pandoc] H1: OK
  3350. 1221.10 s [pandoc] H2: OK
  3351. 1221.10 s [pandoc] Macro args: OK
  3352. 1221.10 s [pandoc] Argument from next line: OK
  3353. 1221.10 s [pandoc] comment: OK
  3354. 1221.10 s [pandoc] link: OK
  3355. 1221.10 s [pandoc] Escapes
  3356. 1221.10 s [pandoc] fonts: OK
  3357. 1221.10 s [pandoc] nested fonts: OK
  3358. 1221.10 s [pandoc] nested fonts 2: OK
  3359. 1221.10 s [pandoc] skip: OK
  3360. 1221.10 s [pandoc] replace: OK
  3361. 1221.10 s [pandoc] replace2: OK
  3362. 1221.10 s [pandoc] comment with \": OK
  3363. 1221.10 s [pandoc] comment with \#: OK
  3364. 1221.10 s [pandoc] two letter escapes: OK
  3365. 1221.10 s [pandoc] bracketed escapes: OK
  3366. 1221.10 s [pandoc] unicode escapes: OK
  3367. 1221.10 s [pandoc] unicode escapes (combined): OK
  3368. 1221.10 s [pandoc] unknown escape (#5034): OK
  3369. 1221.10 s [pandoc] Lists
  3370. 1221.10 s [pandoc] bullet: OK
  3371. 1221.10 s [pandoc] ordered: OK
  3372. 1221.10 s [pandoc] upper: OK
  3373. 1221.10 s [pandoc] nested: OK
  3374. 1221.10 s [pandoc] change in list style: OK
  3375. 1221.10 s [pandoc] CodeBlocks
  3376. 1221.10 s [pandoc] cb1: OK
  3377. 1221.10 s [pandoc] Tables
  3378. 1221.10 s [pandoc] t1: OK
  3379. 1221.10 s [pandoc] longcell: OK
  3380. 1221.10 s [pandoc] Mdoc
  3381. 1221.10 s [pandoc] one-line enclosures
  3382. 1221.10 s [pandoc] Dq: OK
  3383. 1221.10 s [pandoc] Sq: OK
  3384. 1221.10 s [pandoc] empty: OK
  3385. 1221.10 s [pandoc] nested: OK
  3386. 1221.11 s [pandoc] nested with closing delimiters: OK
  3387. 1221.11 s [pandoc] nested multiline enclosure: OK
  3388. 1221.11 s [pandoc] with inlines: OK
  3389. 1221.11 s [pandoc] with text production: OK
  3390. 1221.11 s [pandoc] with Ns: OK
  3391. 1221.11 s [pandoc] ending with open delimiter: OK
  3392. 1221.11 s [pandoc] multiline enclosures
  3393. 1221.11 s [pandoc] nested multiline: OK
  3394. 1221.11 s [pandoc] nested on one line: OK
  3395. 1221.11 s [pandoc] with wacky delimiters: OK
  3396. 1221.11 s [pandoc] simple inlines
  3397. 1221.11 s [pandoc] Sy: OK
  3398. 1221.11 s [pandoc] Em: OK
  3399. 1221.11 s [pandoc] Ev: OK
  3400. 1221.11 s [pandoc] Ar: OK
  3401. 1221.11 s [pandoc] In: OK
  3402. 1221.11 s [pandoc] Mt: OK
  3403. 1221.11 s [pandoc] No: OK
  3404. 1221.11 s [pandoc] empty Pa with closing punctuation: OK
  3405. 1221.11 s [pandoc] delimiters: OK
  3406. 1221.11 s [pandoc] multiple: OK
  3407. 1221.11 s [pandoc] Fl
  3408. 1221.11 s [pandoc] simple: OK
  3409. 1221.11 s [pandoc] multiple: OK
  3410. 1221.11 s [pandoc] empty with following macro: OK
  3411. 1221.11 s [pandoc] enclosed with following macro: OK
  3412. 1221.11 s [pandoc] enclosed with following delimiters: OK
  3413. 1221.11 s [pandoc] following Ns: OK
  3414. 1221.11 s [pandoc] GNU: OK
  3415. 1221.11 s [pandoc] GNU escaped: OK
  3416. 1221.11 s [pandoc] GNU Fl Fl: OK
  3417. 1221.11 s [pandoc] punctuation: OK
  3418. 1221.11 s [pandoc] middle close paren: OK
  3419. 1221.12 s [pandoc] empty with close paren: OK
  3420. 1221.12 s [pandoc] empty with pipe: OK
  3421. 1221.12 s [pandoc] empty with parens: OK
  3422. 1221.12 s [pandoc] links
  3423. 1221.12 s [pandoc] basic: OK
  3424. 1221.12 s [pandoc] complicated: OK
  3425. 1221.12 s [pandoc] unnamed: OK
  3426. 1221.12 s [pandoc] Ns macro
  3427. 1221.12 s [pandoc] at the beginning of a macro line (mandoc delta): OK
  3428. 1221.12 s [pandoc] after a block closing macro: OK
  3429. 1221.12 s [pandoc] in the middle of a macro line: OK
  3430. 1221.12 s [pandoc] before closing punctuation: OK
  3431. 1221.12 s [pandoc] after closing punctuation: OK
  3432. 1221.12 s [pandoc] at the end of a macro line: OK
  3433. 1221.12 s [pandoc] at the end of a partial-implicit line: OK
  3434. 1221.12 s [pandoc] normal words: OK
  3435. 1221.13 s [pandoc] opening punctuation: OK
  3436. 1221.13 s [pandoc] closing punctuation: OK
  3437. 1221.13 s [pandoc] spacing mode
  3438. 1221.13 s [pandoc] all text: OK
  3439. 1221.13 s [pandoc] text around macro: OK
  3440. 1221.13 s [pandoc] mulitple macros: OK
  3441. 1221.13 s [pandoc] mulitple control lines: OK
  3442. 1221.13 s [pandoc] mixed control and text lines: OK
  3443. 1221.13 s [pandoc] delimiters: OK
  3444. 1221.13 s [pandoc] Ap macro
  3445. 1221.13 s [pandoc] in the middle of a macro line: OK
  3446. 1221.13 s [pandoc] with punctuation and called macro: OK
  3447. 1221.13 s [pandoc] Pf macro
  3448. 1221.14 s [pandoc] closing punctuation: OK
  3449. 1221.14 s [pandoc] double punctuation: OK
  3450. 1221.14 s [pandoc] opening punctuation: OK
  3451. 1221.14 s [pandoc] unparsed argument: OK
  3452. 1221.14 s [pandoc] text production
  3453. 1221.14 s [pandoc] early NetBSD versions: OK
  3454. 1221.14 s [pandoc] with Ns: OK
  3455. 1221.14 s [pandoc] with punctuation: OK
  3456. 1221.14 s [pandoc] with argument and punctuation: OK
  3457. 1221.14 s [pandoc] BSD alone: OK
  3458. 1221.14 s [pandoc] BSD with macro: OK
  3459. 1221.14 s [pandoc] BSD with version: OK
  3460. 1221.14 s [pandoc] BSD with variant: OK
  3461. 1221.14 s [pandoc] inline punctuation
  3462. 1221.14 s [pandoc] leading punctuation
  3463. 1221.14 s [pandoc] open paren: OK
  3464. 1221.14 s [pandoc] open square bracket: OK
  3465. 1221.14 s [pandoc] pipe: OK
  3466. 1221.14 s [pandoc] period: OK
  3467. 1221.14 s [pandoc] comma: OK
  3468. 1221.14 s [pandoc] semicolon: OK
  3469. 1221.14 s [pandoc] colon: OK
  3470. 1221.14 s [pandoc] question mark: OK
  3471. 1221.14 s [pandoc] exclamation: OK
  3472. 1221.14 s [pandoc] close paren: OK
  3473. 1221.14 s [pandoc] close square bracket: OK
  3474. 1221.14 s [pandoc] trailing punctuation
  3475. 1221.14 s [pandoc] open paren: OK
  3476. 1221.14 s [pandoc] open square bracket: OK
  3477. 1221.14 s [pandoc] pipe: OK
  3478. 1221.14 s [pandoc] period: OK
  3479. 1221.14 s [pandoc] comma: OK
  3480. 1221.14 s [pandoc] semicolon: OK
  3481. 1221.14 s [pandoc] colon: OK
  3482. 1221.14 s [pandoc] question mark: OK
  3483. 1221.14 s [pandoc] exclamation: OK
  3484. 1221.14 s [pandoc] close parens: OK
  3485. 1221.14 s [pandoc] close square bracket: OK
  3486. 1221.15 s [pandoc] middle punctuation
  3487. 1221.15 s [pandoc] open paren: OK
  3488. 1221.15 s [pandoc] open square bracket: OK
  3489. 1221.15 s [pandoc] pipe: OK
  3490. 1221.15 s [pandoc] period: OK
  3491. 1221.15 s [pandoc] comma: OK
  3492. 1221.15 s [pandoc] semicolon: OK
  3493. 1221.15 s [pandoc] colon: OK
  3494. 1221.15 s [pandoc] question mark: OK
  3495. 1221.15 s [pandoc] exclamation: OK
  3496. 1221.15 s [pandoc] close paren: OK
  3497. 1221.15 s [pandoc] close square bracket: OK
  3498. 1221.15 s [pandoc] FB2
  3499. 1221.15 s [pandoc] Emphasis: OK
  3500. 1221.15 s [pandoc] Titles: OK
  3501. 1221.15 s [pandoc] Epigraph: OK
  3502. 1221.15 s [pandoc] Poem: OK
  3503. 1221.15 s [pandoc] Meta: OK
  3504. 1221.15 s [pandoc] Notes: OK
  3505. 1221.15 s [pandoc] DokuWiki
  3506. 1221.15 s [pandoc] inlines
  3507. 1221.15 s [pandoc] Bold: OK
  3508. 1221.15 s [pandoc] Italic: OK
  3509. 1221.15 s [pandoc] Underlined: OK
  3510. 1221.15 s [pandoc] Monospaced: OK
  3511. 1221.15 s [pandoc] Monospaced with nowiki: OK
  3512. 1221.15 s [pandoc] Combined: OK
  3513. 1221.15 s [pandoc] Nowiki: OK
  3514. 1221.15 s [pandoc] Percent: OK
  3515. 1221.16 s [pandoc] Subscript: OK
  3516. 1221.16 s [pandoc] Superscript: OK
  3517. 1221.16 s [pandoc] Deleted: OK
  3518. 1221.16 s [pandoc] Inline code: OK
  3519. 1221.16 s [pandoc] Inline file: OK
  3520. 1221.16 s [pandoc] Inline HTML: OK
  3521. 1221.16 s [pandoc] Inline PHP: OK
  3522. 1221.16 s [pandoc] Linebreak: OK
  3523. 1221.16 s [pandoc] External links
  3524. 1221.16 s [pandoc] Autolink: OK
  3525. 1221.16 s [pandoc] Link without description: OK
  3526. 1221.16 s [pandoc] Link with description: OK
  3527. 1221.16 s [pandoc] Trim whitespace around link and description: OK
  3528. 1221.16 s [pandoc] Email address: OK
  3529. 1221.16 s [pandoc] Internal links
  3530. 1221.16 s [pandoc] Current namespace: OK
  3531. 1221.16 s [pandoc] Current namespace starting with dot: OK
  3532. 1221.16 s [pandoc] Current namespace starting with dot and colon: OK
  3533. 1221.16 s [pandoc] Root namespace: OK
  3534. 1221.16 s [pandoc] Parent namespace: OK
  3535. 1221.16 s [pandoc] Parent namespace with colon: OK
  3536. 1221.16 s [pandoc] Beneath the root namespace: OK
  3537. 1221.16 s [pandoc] Explicitly beneath the root namespace: OK
  3538. 1221.16 s [pandoc] Interwiki links
  3539. 1221.16 s [pandoc] Interwiki without description: OK
  3540. 1221.16 s [pandoc] Interwiki link with description: OK
  3541. 1221.16 s [pandoc] Footnote: OK
  3542. 1221.16 s [pandoc] Images
  3543. 1221.16 s [pandoc] Image: OK
  3544. 1221.16 s [pandoc] Image with caption: OK
  3545. 1221.16 s [pandoc] Image with } in caption: OK
  3546. 1221.16 s [pandoc] Wiki namespace starting with dot: OK
  3547. 1221.16 s [pandoc] Left aligned image: OK
  3548. 1221.16 s [pandoc] Right aligned image: OK
  3549. 1221.16 s [pandoc] Centered image: OK
  3550. 1221.16 s [pandoc] Image with width: OK
  3551. 1221.16 s [pandoc] Image with width and height: OK
  3552. 1221.16 s [pandoc] Linkonly: OK
  3553. 1221.16 s [pandoc] Ignore ~~NOTOC~~: OK
  3554. 1221.16 s [pandoc] Ignore ~~NOCACHE~~: OK
  3555. 1221.16 s [pandoc] Sectioning
  3556. 1221.16 s [pandoc] Headline level 1: OK
  3557. 1221.16 s [pandoc] Headline level 2: OK
  3558. 1221.16 s [pandoc] Headline level 3: OK
  3559. 1221.16 s [pandoc] Headline level 4: OK
  3560. 1221.16 s [pandoc] Headline level 5: OK
  3561. 1221.16 s [pandoc] Only two closing = are required: OK
  3562. 1221.17 s [pandoc] One closing = is not enough: OK
  3563. 1221.17 s [pandoc] One closing = is not enough: OK
  3564. 1221.17 s [pandoc] Horizontal line: OK
  3565. 1221.17 s [pandoc] Lists
  3566. 1221.17 s [pandoc] Unordered list: OK
  3567. 1221.17 s [pandoc] Ordered list: OK
  3568. 1221.17 s [pandoc] Multiline list items: OK
  3569. 1221.17 s [pandoc] Block HTML: OK
  3570. 1221.17 s [pandoc] Block PHP: OK
  3571. 1221.17 s [pandoc] Quote: OK
  3572. 1221.17 s [pandoc] Code block: OK
  3573. 1221.17 s [pandoc] Java code block: OK
  3574. 1221.17 s [pandoc] File with filename and no language: OK
  3575. 1221.17 s [pandoc] Table: OK
  3576. 1221.17 s [pandoc] Table with header: OK
  3577. 1221.17 s [pandoc] Table with alignment: OK
  3578. 1221.18 s [pandoc] Table with colspan: OK
  3579. 1221.18 s [pandoc] Indented code block: OK
  3580. 1221.18 s [pandoc] Pod
  3581. 1221.18 s [pandoc] inlines
  3582. 1221.18 s [pandoc] code with nested inlines: OK
  3583. 1221.18 s [pandoc] compact in compact: OK
  3584. 1221.18 s [pandoc] expanded in compact: OK
  3585. 1221.18 s [pandoc] compact in expanded: OK
  3586. 1221.18 s [pandoc] expanded in expanded: OK
  3587. 1221.18 s [pandoc] links
  3588. 1221.18 s [pandoc] compact
  3589. 1221.18 s [pandoc] URL: OK
  3590. 1221.18 s [pandoc] URL with link text: OK
  3591. 1221.18 s [pandoc] perl manual: OK
  3592. 1221.18 s [pandoc] manual with quoted section: OK
  3593. 1221.18 s [pandoc] manual with section and formatted link text: OK
  3594. 1221.18 s [pandoc] internal link: OK
  3595. 1221.18 s [pandoc] internal link with formatting: OK
  3596. 1221.18 s [pandoc] link with angle bracket: OK
  3597. 1221.18 s [pandoc] empty name: OK
  3598. 1221.18 s [pandoc] expanded
  3599. 1221.18 s [pandoc] URL: OK
  3600. 1221.18 s [pandoc] URL with link text: OK
  3601. 1221.18 s [pandoc] perl manual: OK
  3602. 1221.18 s [pandoc] manual with quoted section: OK
  3603. 1221.18 s [pandoc] manual with section and formatted link text: OK
  3604. 1221.18 s [pandoc] internal link: OK
  3605. 1221.18 s [pandoc] internal link with formatting: OK
  3606. 1221.18 s [pandoc] link with angle bracket: OK
  3607. 1221.18 s [pandoc] empty name: OK
  3608. 1221.18 s [pandoc] entities
  3609. 1221.18 s [pandoc] required
  3610. 1221.18 s [pandoc] quot: OK
  3611. 1221.18 s [pandoc] amp: OK
  3612. 1221.18 s [pandoc] apos: OK
  3613. 1221.18 s [pandoc] lt: OK
  3614. 1221.18 s [pandoc] gt: OK
  3615. 1221.18 s [pandoc] sol: OK
  3616. 1221.18 s [pandoc] verbar: OK
  3617. 1221.18 s [pandoc] lchevron: OK
  3618. 1221.18 s [pandoc] rchevron: OK
  3619. 1221.18 s [pandoc] numeric
  3620. 1221.18 s [pandoc] decimal: OK
  3621. 1221.18 s [pandoc] octal: OK
  3622. 1221.18 s [pandoc] hexadecimal: OK
  3623. 1221.18 s [pandoc] hexadecimal variant: OK
  3624. 1221.18 s [pandoc] actually decimal: OK
  3625. 1221.18 s [pandoc] bogus
  3626. 1221.18 s [pandoc] 0XA2: OK
  3627. 1221.18 s [pandoc] not a real entity: OK
  3628. 1221.18 s [pandoc] 162 1: OK
  3629. 1221.18 s [pandoc] 99 bottles of beer: OK
  3630. 1221.19 s [pandoc] 0xhh: OK
  3631. 1221.19 s [pandoc] 077x: OK
  3632. 1221.19 s [pandoc] 0x63 skidoo: OK
  3633. 1221.19 s [pandoc]
  3634. 1221.19 s [pandoc] All 3625 tests passed (81.69s)
  3635. 1221.25 s [pandoc] Test suite test-pandoc: PASS
  3636. 1221.25 s [pandoc] Test suite logged to: dist/test/pandoc-3.7.0.2-test-pandoc.log
  3637. 1221.26 s [pandoc] 1 of 1 test suites (1 of 1 test cases) passed.
  3638. 1221.29 s [pandoc] checkPhase completed in 1 minutes 25 seconds
  3639. 1221.29 s [pandoc] Phase: haddockPhase
  3640. 1221.74 s [pandoc] Phase: installPhase
  3641. 1222.07 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
  3642. 1222.16 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
  3643. 1226.06 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  3644. 1231.15 s [pandoc] Phase: fixupPhase
  3645. 1231.16 s [pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
  3646. 1231.16 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
  3647. 1231.33 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
  3648. 1231.50 s [pandoc] checking for references to /build/ in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2...
  3649. 1231.69 s [pandoc] patching script interpreter paths in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
  3650. 1231.70 s [pandoc] stripping (with command strip and flags -S -p) in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib
  3651. 1234.64 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  3652. 1236.25 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  3653. 1236.25 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  3654. 1236.60 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 )
  3655. 1237.02 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 )
  3656. 1240.04 s [pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
  3657. 1240.12 s [pandoc] checking for references to /build/ in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data...
  3658. 1240.13 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 )
  3659. 1240.13 s [vector]
  3660. 1240.13 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  3661. 1240.13 s [vector] In the use of ‘tail’
  3662. 1240.13 s [vector] (imported from Prelude, but defined in GHC.List):
  3663. 1240.13 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3664. 1240.13 s [vector] |
  3665. 1240.13 s [vector] 244 | postscanl f z = tail . scanl f z
  3666. 1240.13 s [vector] | ^^^^
  3667. 1240.13 s [vector]
  3668. 1240.13 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  3669. 1240.13 s [vector] In the use of ‘tail’
  3670. 1240.13 s [vector] (imported from Prelude, but defined in GHC.List):
  3671. 1240.13 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3672. 1240.13 s [vector] |
  3673. 1240.13 s [vector] 245 | prescanr f z = tail . scanr f z
  3674. 1240.13 s [vector] | ^^^^
  3675. 1240.13 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 )
  3676. 1240.22 s [pandoc] patching script interpreter paths in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
  3677. 1240.22 s [vector]
  3678. 1240.22 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  3679. 1240.22 s [vector] In the use of ‘head’
  3680. 1240.22 s [vector] (imported from Data.List, but defined in GHC.List):
  3681. 1240.22 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3682. 1240.22 s [vector] |
  3683. 1240.22 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  3684. 1240.22 s [vector] | ^^^^
  3685. 1240.22 s [vector]
  3686. 1240.22 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  3687. 1240.22 s [vector] In the use of ‘head’
  3688. 1240.22 s [vector] (imported from Data.List, but defined in GHC.List):
  3689. 1240.22 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3690. 1240.22 s [vector] |
  3691. 1240.22 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  3692. 1240.22 s [vector] | ^^^^
  3693. 1240.22 s [vector]
  3694. 1240.22 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  3695. 1240.22 s [vector] In the use of ‘tail’
  3696. 1240.22 s [vector] (imported from Data.List, but defined in GHC.List):
  3697. 1240.22 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3698. 1240.22 s [vector] |
  3699. 1240.22 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  3700. 1240.23 s [vector] | ^^^^
  3701. 1240.23 s [vector]
  3702. 1240.23 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  3703. 1240.23 s [vector] In the use of ‘head’
  3704. 1240.23 s [vector] (imported from Data.List, but defined in GHC.List):
  3705. 1240.23 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3706. 1240.23 s [vector] |
  3707. 1240.23 s [vector] 439 | = V.uniq `eq` (map head . group)
  3708. 1240.23 s [vector] | ^^^^
  3709. 1241.30 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
  3710. 1241.72 s [pandoc:post-build] Nothing to push - all store paths are already on Cachix.
  3711. 1241.75 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
  3712. 1241.80 s [pandoc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3713. 1241.92 s [pandoc:post-build] copying 1 paths...
  3714. 1241.92 s [pandoc:post-build] copying path '/nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2' to 'https://cache.nix-ci.com'...
  3715. 1415.30 s [pandoc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3716. 1415.43 s [pandoc:post-build] copying 0 paths...
  3717. 1415.45 s Progress: 22 of 38 built (1 building), 559 of 559 downloaded from cache
  3718. 1415.59 s Building /nix/store/97khgz4lrmr215dy798mkwnwd89b9kzw-pandoc-lua-engine-0.4.3.drv
  3719. 1415.68 s Building /nix/store/s3jg3bgm7jkn4xv5miw4v3w05qrkza0r-pandoc-server-0.1.0.11.drv
  3720. 1415.68 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 )
  3721. 1415.68 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 )
  3722. 1415.68 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 )
  3723. 1415.68 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 )
  3724. 1415.68 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 )
  3725. 1415.68 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 )
  3726. 1415.68 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 )
  3727. 1415.68 s [vector]
  3728. 1415.68 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  3729. 1415.68 s [vector] In the use of ‘head’
  3730. 1415.68 s [vector] (imported from Prelude, but defined in GHC.List):
  3731. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3732. 1415.68 s [vector] |
  3733. 1415.68 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  3734. 1415.68 s [vector] | ^^^^
  3735. 1415.68 s [vector]
  3736. 1415.68 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  3737. 1415.68 s [vector] In the use of ‘tail’
  3738. 1415.68 s [vector] (imported from Prelude, but defined in GHC.List):
  3739. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3740. 1415.68 s [vector] |
  3741. 1415.68 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  3742. 1415.68 s [vector] | ^^^^
  3743. 1415.68 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 )
  3744. 1415.68 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  3745. 1415.68 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  3746. 1415.68 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  3747. 1415.68 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.dyn_o )
  3748. 1415.68 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.dyn_o )
  3749. 1415.68 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
  3750. 1415.68 s [vector]
  3751. 1415.68 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  3752. 1415.68 s [vector] In the use of ‘tail’
  3753. 1415.68 s [vector] (imported from Prelude, but defined in GHC.List):
  3754. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3755. 1415.68 s [vector] |
  3756. 1415.68 s [vector] 244 | postscanl f z = tail . scanl f z
  3757. 1415.68 s [vector] | ^^^^
  3758. 1415.68 s [vector]
  3759. 1415.68 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  3760. 1415.68 s [vector] In the use of ‘tail’
  3761. 1415.68 s [vector] (imported from Prelude, but defined in GHC.List):
  3762. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3763. 1415.68 s [vector] |
  3764. 1415.68 s [vector] 245 | prescanr f z = tail . scanr f z
  3765. 1415.68 s [vector] | ^^^^
  3766. 1415.68 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.dyn_o )
  3767. 1415.68 s [vector]
  3768. 1415.68 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  3769. 1415.68 s [vector] In the use of ‘head’
  3770. 1415.68 s [vector] (imported from Data.List, but defined in GHC.List):
  3771. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3772. 1415.68 s [vector] |
  3773. 1415.68 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  3774. 1415.68 s [vector] | ^^^^
  3775. 1415.68 s [vector]
  3776. 1415.68 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  3777. 1415.68 s [vector] In the use of ‘head’
  3778. 1415.68 s [vector] (imported from Data.List, but defined in GHC.List):
  3779. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3780. 1415.68 s [vector] |
  3781. 1415.68 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  3782. 1415.68 s [vector] | ^^^^
  3783. 1415.68 s [vector]
  3784. 1415.68 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  3785. 1415.68 s [vector] In the use of ‘tail’
  3786. 1415.68 s [vector] (imported from Data.List, but defined in GHC.List):
  3787. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3788. 1415.68 s [vector] |
  3789. 1415.68 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  3790. 1415.68 s [vector] | ^^^^
  3791. 1415.68 s [vector]
  3792. 1415.68 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  3793. 1415.68 s [vector] In the use of ‘head’
  3794. 1415.68 s [vector] (imported from Data.List, but defined in GHC.List):
  3795. 1415.68 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3796. 1415.68 s [vector] |
  3797. 1415.68 s [vector] 439 | = V.uniq `eq` (map head . group)
  3798. 1415.68 s [vector] | ^^^^
  3799. 1415.68 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.dyn_o )
  3800. 1415.68 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 )
  3801. 1415.68 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 )
  3802. 1415.68 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 )
  3803. 1415.68 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 )
  3804. 1415.68 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 )
  3805. 1415.68 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 )
  3806. 1415.69 s [vector]
  3807. 1415.69 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  3808. 1415.69 s [vector] In the use of ‘head’
  3809. 1415.69 s [vector] (imported from Prelude, but defined in GHC.List):
  3810. 1415.69 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3811. 1415.69 s [vector] |
  3812. 1415.69 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  3813. 1415.69 s [vector] | ^^^^
  3814. 1415.69 s [vector]
  3815. 1415.69 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  3816. 1415.69 s [vector] In the use of ‘tail’
  3817. 1415.69 s [vector] (imported from Prelude, but defined in GHC.List):
  3818. 1415.69 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  3819. 1415.69 s [vector] |
  3820. 1415.69 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  3821. 1415.69 s [vector] | ^^^^
  3822. 1415.69 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 )
  3823. 1415.69 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  3824. 1415.69 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  3825. 1415.69 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  3826. 1415.69 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 )
  3827. 1415.69 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 )
  3828. 1415.69 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 )
  3829. 1415.69 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 )
  3830. 1415.69 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 )
  3831. 1415.69 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 )
  3832. 1415.69 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 )
  3833. 1415.69 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 )
  3834. 1415.69 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 )
  3835. 1415.69 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 )
  3836. 1415.69 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 )
  3837. 1415.69 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 )
  3838. 1415.69 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 )
  3839. 1415.69 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 )
  3840. 1415.69 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 )
  3841. 1415.69 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 )
  3842. 1415.69 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 )
  3843. 1415.69 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 )
  3844. 1415.69 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 )
  3845. 1415.69 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 )
  3846. 1415.69 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 )
  3847. 1415.69 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 )
  3848. 1415.69 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 )
  3849. 1415.69 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 )
  3850. 1415.69 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 )
  3851. 1415.69 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  3852. 1415.69 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 )
  3853. 1415.69 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 )
  3854. 1415.69 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  3855. 1415.69 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  3856. 1415.69 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  3857. 1415.69 s [vector] [2 of 4] Compiling Inspect.DerivingVia.OtherFoo ( tests-inspect/Inspect/DerivingVia/OtherFoo.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.dyn_o )
  3858. 1415.69 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  3859. 1415.69 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  3860. 1415.69 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  3861. 1415.69 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  3862. 1415.69 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  3863. 1415.69 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  3864. 1415.69 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  3865. 1415.69 s [vector] buildPhase completed in 4 minutes 4 seconds
  3866. 1415.69 s [vector] Phase: checkPhase
  3867. 1415.69 s [vector] Running 2 test suites...
  3868. 1415.69 s [vector] Test suite vector-tests-O0: RUNNING...
  3869. 1415.69 s [vector] toplevel
  3870. 1415.69 s [vector] Data.Vector.Fusion.Bundle
  3871. 1415.69 s [vector] fromList.toList == id: OK
  3872. 1415.69 s [vector] +++ OK, passed 100 tests.
  3873. 1415.69 s [vector] toList.fromList == id: OK
  3874. 1415.69 s [vector] +++ OK, passed 100 tests.
  3875. 1415.69 s [vector] eq: OK
  3876. 1415.69 s [vector] +++ OK, passed 100 tests.
  3877. 1415.69 s [vector] length: OK
  3878. 1415.69 s [vector] +++ OK, passed 100 tests.
  3879. 1415.69 s [vector] null: OK
  3880. 1415.69 s [vector] +++ OK, passed 100 tests.
  3881. 1415.69 s [vector] empty: OK
  3882. 1415.69 s [vector] +++ OK, passed 100 tests.
  3883. 1415.69 s [vector] singleton: OK
  3884. 1415.69 s [vector] +++ OK, passed 100 tests.
  3885. 1415.69 s [vector] replicate: OK
  3886. 1415.69 s [vector] +++ OK, passed 100 tests.
  3887. 1415.69 s [vector] cons: OK
  3888. 1415.69 s [vector] +++ OK, passed 100 tests.
  3889. 1415.69 s [vector] snoc: OK
  3890. 1415.69 s [vector] +++ OK, passed 100 tests.
  3891. 1415.69 s [vector] append: OK
  3892. 1415.69 s [vector] +++ OK, passed 100 tests.
  3893. 1415.69 s [vector] head: OK
  3894. 1415.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3895. 1415.69 s [vector] last: OK
  3896. 1415.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3897. 1415.69 s [vector] index: OK
  3898. 1415.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3899. 1415.69 s [vector] extract: OK
  3900. 1415.69 s [vector] +++ OK, passed 100 tests.
  3901. 1415.69 s [vector] init: OK
  3902. 1415.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3903. 1415.69 s [vector] tail: OK
  3904. 1415.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3905. 1415.69 s [vector] take: OK
  3906. 1415.69 s [vector] +++ OK, passed 100 tests.
  3907. 1415.69 s [vector] drop: OK
  3908. 1415.69 s [vector] +++ OK, passed 100 tests.
  3909. 1415.69 s [vector] map: OK
  3910. 1415.69 s [vector] +++ OK, passed 100 tests.
  3911. 1415.69 s [vector] zipWith: OK
  3912. 1415.69 s [vector] +++ OK, passed 100 tests.
  3913. 1415.69 s [vector] zipWith3: OK
  3914. 1415.69 s [vector] +++ OK, passed 100 tests.
  3915. 1415.69 s [vector] filter: OK
  3916. 1415.69 s [vector] +++ OK, passed 100 tests.
  3917. 1415.69 s [vector] takeWhile: OK
  3918. 1415.69 s [vector] +++ OK, passed 100 tests.
  3919. 1415.69 s [vector] dropWhile: OK
  3920. 1415.69 s [vector] +++ OK, passed 100 tests.
  3921. 1415.69 s [vector] elem: OK
  3922. 1415.69 s [vector] +++ OK, passed 100 tests.
  3923. 1415.69 s [vector] notElem: OK
  3924. 1415.69 s [vector] +++ OK, passed 100 tests.
  3925. 1415.69 s [vector] find: OK
  3926. 1415.69 s [vector] +++ OK, passed 100 tests.
  3927. 1415.69 s [vector] findIndex: OK
  3928. 1415.69 s [vector] +++ OK, passed 100 tests.
  3929. 1415.69 s [vector] foldl: OK
  3930. 1415.69 s [vector] +++ OK, passed 100 tests.
  3931. 1415.69 s [vector] foldl1: OK
  3932. 1415.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3933. 1415.69 s [vector] foldl': OK
  3934. 1415.69 s [vector] +++ OK, passed 100 tests.
  3935. 1415.69 s [vector] foldl1': OK
  3936. 1415.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3937. 1415.69 s [vector] foldr: OK
  3938. 1415.69 s [vector] +++ OK, passed 100 tests.
  3939. 1415.69 s [vector] foldr1: OK
  3940. 1415.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3941. 1415.69 s [vector] prescanl: OK
  3942. 1415.69 s [vector] +++ OK, passed 100 tests.
  3943. 1415.69 s [vector] prescanl': OK
  3944. 1415.69 s [vector] +++ OK, passed 100 tests.
  3945. 1415.69 s [vector] postscanl: OK
  3946. 1415.69 s [vector] +++ OK, passed 100 tests.
  3947. 1415.69 s [vector] postscanl': OK
  3948. 1415.69 s [vector] +++ OK, passed 100 tests.
  3949. 1415.69 s [vector] scanl: OK
  3950. 1415.69 s [vector] +++ OK, passed 100 tests.
  3951. 1415.69 s [vector] scanl': OK
  3952. 1415.69 s [vector] +++ OK, passed 100 tests.
  3953. 1415.69 s [vector] scanl1: OK
  3954. 1415.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3955. 1415.69 s [vector] scanl1': OK
  3956. 1415.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3957. 1415.69 s [vector] concatMap: OK
  3958. 1415.69 s [vector] +++ OK, passed 100 tests.
  3959. 1415.69 s [vector] unfoldr: OK
  3960. 1415.69 s [vector] +++ OK, passed 100 tests.
  3961. 1415.69 s [vector] and: OK
  3962. 1415.69 s [vector] +++ OK, passed 100 tests.
  3963. 1415.69 s [vector] or: OK
  3964. 1415.69 s [vector] +++ OK, passed 100 tests.
  3965. 1415.69 s [vector] Tests.Vector.Boxed
  3966. 1415.69 s [vector] Bool
  3967. 1415.69 s [vector] fromList.toList == id: OK
  3968. 1415.69 s [vector] +++ OK, passed 100 tests.
  3969. 1415.69 s [vector] toList.fromList == id: OK
  3970. 1415.69 s [vector] +++ OK, passed 100 tests.
  3971. 1415.69 s [vector] unstream.stream == id: OK
  3972. 1415.69 s [vector] +++ OK, passed 100 tests.
  3973. 1415.69 s [vector] stream.unstream == id: OK
  3974. 1415.69 s [vector] +++ OK, passed 100 tests.
  3975. 1415.69 s [vector] eq: OK
  3976. 1415.69 s [vector] +++ OK, passed 100 tests.
  3977. 1415.69 s [vector] length: OK
  3978. 1415.69 s [vector] +++ OK, passed 100 tests.
  3979. 1415.69 s [vector] null: OK
  3980. 1415.69 s [vector] +++ OK, passed 100 tests.
  3981. 1415.69 s [vector] index: OK
  3982. 1415.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3983. 1415.69 s [vector] safeIndex: OK
  3984. 1415.69 s [vector] +++ OK, passed 100 tests.
  3985. 1415.69 s [vector] head: OK
  3986. 1415.69 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3987. 1415.69 s [vector] last: OK
  3988. 1415.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3989. 1415.69 s [vector] unsafeIndex: OK
  3990. 1415.69 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3991. 1415.69 s [vector] unsafeHead: OK
  3992. 1415.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3993. 1415.69 s [vector] unsafeLast: OK
  3994. 1415.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3995. 1415.69 s [vector] slice: OK
  3996. 1415.69 s [vector] +++ OK, passed 100 tests.
  3997. 1415.69 s [vector] init: OK
  3998. 1415.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3999. 1415.69 s [vector] tail: OK
  4000. 1415.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4001. 1415.69 s [vector] take: OK
  4002. 1415.69 s [vector] +++ OK, passed 100 tests.
  4003. 1415.69 s [vector] drop: OK
  4004. 1415.69 s [vector] +++ OK, passed 100 tests.
  4005. 1415.69 s [vector] splitAt: OK
  4006. 1415.69 s [vector] +++ OK, passed 100 tests.
  4007. 1415.69 s [vector] empty: OK
  4008. 1415.69 s [vector] +++ OK, passed 100 tests.
  4009. 1415.69 s [vector] singleton: OK
  4010. 1415.69 s [vector] +++ OK, passed 100 tests.
  4011. 1415.69 s [vector] replicate: OK
  4012. 1415.69 s [vector] +++ OK, passed 100 tests.
  4013. 1415.69 s [vector] generate: OK
  4014. 1415.69 s [vector] +++ OK, passed 100 tests.
  4015. 1415.69 s [vector] iterateN: OK
  4016. 1415.69 s [vector] +++ OK, passed 100 tests.
  4017. 1415.69 s [vector] iterateNM: OK (0.09s)
  4018. 1415.69 s [vector] +++ OK, passed 100 tests.
  4019. 1415.69 s [vector] generateM: OK (0.02s)
  4020. 1415.69 s [vector] +++ OK, passed 100 tests.
  4021. 1415.69 s [vector] replicateM: OK (0.02s)
  4022. 1415.69 s [vector] +++ OK, passed 100 tests.
  4023. 1415.69 s [vector] create: OK
  4024. 1415.69 s [vector] +++ OK, passed 100 tests.
  4025. 1415.69 s [vector] createT: OK
  4026. 1415.69 s [vector] +++ OK, passed 100 tests.
  4027. 1415.69 s [vector] unfoldr: OK
  4028. 1415.69 s [vector] +++ OK, passed 100 tests.
  4029. 1415.69 s [vector] unfoldrN: OK
  4030. 1415.69 s [vector] +++ OK, passed 100 tests.
  4031. 1415.69 s [vector] unfoldrExactN: OK
  4032. 1415.69 s [vector] +++ OK, passed 100 tests.
  4033. 1415.69 s [vector] unfoldrM: OK
  4034. 1415.69 s [vector] +++ OK, passed 100 tests.
  4035. 1415.69 s [vector] unfoldrNM: OK
  4036. 1415.69 s [vector] +++ OK, passed 100 tests.
  4037. 1415.69 s [vector] unfoldrExactNM: OK (0.07s)
  4038. 1415.69 s [vector] +++ OK, passed 100 tests.
  4039. 1415.69 s [vector] constructN: OK
  4040. 1415.69 s [vector] +++ OK, passed 100 tests.
  4041. 1415.69 s [vector] constructrN: OK
  4042. 1415.69 s [vector] +++ OK, passed 100 tests.
  4043. 1415.69 s [vector] cons: OK
  4044. 1415.69 s [vector] +++ OK, passed 100 tests.
  4045. 1415.69 s [vector] snoc: OK
  4046. 1415.69 s [vector] +++ OK, passed 100 tests.
  4047. 1415.69 s [vector] append: OK
  4048. 1415.69 s [vector] +++ OK, passed 100 tests.
  4049. 1415.69 s [vector] concat: OK
  4050. 1415.69 s [vector] +++ OK, passed 100 tests.
  4051. 1415.69 s [vector] force: OK
  4052. 1415.69 s [vector] +++ OK, passed 100 tests.
  4053. 1415.69 s [vector] upd: OK
  4054. 1415.69 s [vector] +++ OK, passed 100 tests.
  4055. 1415.69 s [vector] accum: OK
  4056. 1415.69 s [vector] +++ OK, passed 100 tests.
  4057. 1415.69 s [vector] reverse: OK
  4058. 1415.69 s [vector] +++ OK, passed 100 tests.
  4059. 1415.69 s [vector] backpermute: OK
  4060. 1415.69 s [vector] +++ OK, passed 100 tests.
  4061. 1415.69 s [vector] map: OK
  4062. 1415.69 s [vector] +++ OK, passed 100 tests.
  4063. 1415.69 s [vector] imap: OK
  4064. 1415.69 s [vector] +++ OK, passed 100 tests.
  4065. 1415.69 s [vector] concatMap: OK
  4066. 1415.69 s [vector] +++ OK, passed 100 tests.
  4067. 1415.69 s [vector] mapM: OK
  4068. 1415.69 s [vector] +++ OK, passed 100 tests.
  4069. 1415.69 s [vector] mapM_: OK (0.01s)
  4070. 1415.69 s [vector] +++ OK, passed 100 tests.
  4071. 1415.69 s [vector] forM: OK
  4072. 1415.69 s [vector] +++ OK, passed 100 tests.
  4073. 1415.69 s [vector] forM_: OK (0.01s)
  4074. 1415.69 s [vector] +++ OK, passed 100 tests.
  4075. 1415.69 s [vector] imapM: OK
  4076. 1415.69 s [vector] +++ OK, passed 100 tests.
  4077. 1415.69 s [vector] imapM_: OK (0.01s)
  4078. 1415.69 s [vector] +++ OK, passed 100 tests.
  4079. 1415.69 s [vector] zipWith: OK
  4080. 1415.69 s [vector] +++ OK, passed 100 tests.
  4081. 1415.69 s [vector] zipWith3: OK
  4082. 1415.69 s [vector] +++ OK, passed 100 tests.
  4083. 1415.69 s [vector] izipWith: OK
  4084. 1415.69 s [vector] +++ OK, passed 100 tests.
  4085. 1415.69 s [vector] izipWith3: OK
  4086. 1415.69 s [vector] +++ OK, passed 100 tests.
  4087. 1415.69 s [vector] izipWithM: OK
  4088. 1415.69 s [vector] +++ OK, passed 100 tests.
  4089. 1415.69 s [vector] izipWithM_: OK (0.01s)
  4090. 1415.69 s [vector] +++ OK, passed 100 tests.
  4091. 1415.69 s [vector] zipWithM: OK
  4092. 1415.70 s [vector] +++ OK, passed 100 tests.
  4093. 1415.70 s [vector] zipWithM_: OK (0.01s)
  4094. 1415.70 s [vector] +++ OK, passed 100 tests.
  4095. 1415.70 s [vector] filter: OK
  4096. 1415.70 s [vector] +++ OK, passed 100 tests.
  4097. 1415.70 s [vector] ifilter: OK
  4098. 1415.70 s [vector] +++ OK, passed 100 tests.
  4099. 1415.70 s [vector] filterM: OK (0.02s)
  4100. 1415.70 s [vector] +++ OK, passed 100 tests.
  4101. 1415.70 s [vector] uniq: OK
  4102. 1415.70 s [vector] +++ OK, passed 100 tests.
  4103. 1415.70 s [vector] mapMaybe: OK
  4104. 1415.70 s [vector] +++ OK, passed 100 tests.
  4105. 1415.70 s [vector] imapMaybe: OK
  4106. 1415.70 s [vector] +++ OK, passed 100 tests.
  4107. 1415.70 s [vector] takeWhile: OK
  4108. 1415.70 s [vector] +++ OK, passed 100 tests.
  4109. 1415.70 s [vector] dropWhile: OK
  4110. 1415.70 s [vector] +++ OK, passed 100 tests.
  4111. 1415.70 s [vector] partition: OK
  4112. 1415.70 s [vector] +++ OK, passed 100 tests.
  4113. 1415.70 s [vector] partitionWith: OK
  4114. 1415.70 s [vector] +++ OK, passed 100 tests.
  4115. 1415.70 s [vector] span: OK
  4116. 1415.70 s [vector] +++ OK, passed 100 tests.
  4117. 1415.70 s [vector] break: OK
  4118. 1415.70 s [vector] +++ OK, passed 100 tests.
  4119. 1415.70 s [vector] spanR: OK
  4120. 1415.70 s [vector] +++ OK, passed 100 tests.
  4121. 1415.70 s [vector] breakR: OK
  4122. 1415.70 s [vector] +++ OK, passed 100 tests.
  4123. 1415.70 s [vector] groupBy: OK
  4124. 1415.70 s [vector] +++ OK, passed 100 tests.
  4125. 1415.70 s [vector] elem: OK
  4126. 1415.70 s [vector] +++ OK, passed 100 tests.
  4127. 1415.70 s [vector] notElem: OK
  4128. 1415.70 s [vector] +++ OK, passed 100 tests.
  4129. 1415.70 s [vector] find: OK
  4130. 1415.70 s [vector] +++ OK, passed 100 tests.
  4131. 1415.70 s [vector] findIndex: OK
  4132. 1415.70 s [vector] +++ OK, passed 100 tests.
  4133. 1415.70 s [vector] findIndexR: OK
  4134. 1415.70 s [vector] +++ OK, passed 100 tests.
  4135. 1415.70 s [vector] findIndices: OK
  4136. 1415.70 s [vector] +++ OK, passed 100 tests.
  4137. 1415.70 s [vector] elemIndex: OK
  4138. 1415.70 s [vector] +++ OK, passed 100 tests.
  4139. 1415.70 s [vector] elemIndices: OK
  4140. 1415.70 s [vector] +++ OK, passed 100 tests.
  4141. 1415.70 s [vector] foldl: OK
  4142. 1415.70 s [vector] +++ OK, passed 100 tests.
  4143. 1415.70 s [vector] foldl1: OK
  4144. 1415.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4145. 1415.70 s [vector] foldl': OK
  4146. 1415.70 s [vector] +++ OK, passed 100 tests.
  4147. 1415.70 s [vector] foldl1': OK
  4148. 1415.70 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4149. 1415.70 s [vector] foldr: OK
  4150. 1415.70 s [vector] +++ OK, passed 100 tests.
  4151. 1415.70 s [vector] foldr1: OK
  4152. 1415.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4153. 1415.70 s [vector] foldr': OK
  4154. 1415.70 s [vector] +++ OK, passed 100 tests.
  4155. 1415.70 s [vector] foldr1': OK
  4156. 1415.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4157. 1415.70 s [vector] ifoldl: OK
  4158. 1415.70 s [vector] +++ OK, passed 100 tests.
  4159. 1415.70 s [vector] ifoldl': OK
  4160. 1415.70 s [vector] +++ OK, passed 100 tests.
  4161. 1415.70 s [vector] ifoldr: OK
  4162. 1415.70 s [vector] +++ OK, passed 100 tests.
  4163. 1415.70 s [vector] ifoldr': OK
  4164. 1415.70 s [vector] +++ OK, passed 100 tests.
  4165. 1415.70 s [vector] ifoldM: OK
  4166. 1415.70 s [vector] +++ OK, passed 100 tests.
  4167. 1415.70 s [vector] ifoldM': OK
  4168. 1415.70 s [vector] +++ OK, passed 100 tests.
  4169. 1415.70 s [vector] ifoldM_: OK (0.01s)
  4170. 1415.70 s [vector] +++ OK, passed 100 tests.
  4171. 1415.70 s [vector] ifoldM'_: OK
  4172. 1415.70 s [vector] +++ OK, passed 100 tests.
  4173. 1415.70 s [vector] all: OK
  4174. 1415.70 s [vector] +++ OK, passed 100 tests.
  4175. 1415.70 s [vector] any: OK
  4176. 1415.70 s [vector] +++ OK, passed 100 tests.
  4177. 1415.70 s [vector] prescanl: OK
  4178. 1415.70 s [vector] +++ OK, passed 100 tests.
  4179. 1415.70 s [vector] prescanl': OK
  4180. 1415.70 s [vector] +++ OK, passed 100 tests.
  4181. 1415.70 s [vector] postscanl: OK
  4182. 1415.70 s [vector] +++ OK, passed 100 tests.
  4183. 1415.70 s [vector] postscanl': OK
  4184. 1415.70 s [vector] +++ OK, passed 100 tests.
  4185. 1415.70 s [vector] scanl: OK
  4186. 1415.70 s [vector] +++ OK, passed 100 tests.
  4187. 1415.70 s [vector] scanl': OK
  4188. 1415.70 s [vector] +++ OK, passed 100 tests.
  4189. 1415.70 s [vector] scanl1: OK
  4190. 1415.70 s [vector] +++ OK, passed 100 tests.
  4191. 1415.70 s [vector] scanl1': OK
  4192. 1415.70 s [vector] +++ OK, passed 100 tests.
  4193. 1415.70 s [vector] iscanl: OK
  4194. 1415.70 s [vector] +++ OK, passed 100 tests.
  4195. 1415.70 s [vector] iscanl': OK
  4196. 1415.70 s [vector] +++ OK, passed 100 tests.
  4197. 1415.70 s [vector] prescanr: OK
  4198. 1415.70 s [vector] +++ OK, passed 100 tests.
  4199. 1415.70 s [vector] prescanr': OK
  4200. 1415.70 s [vector] +++ OK, passed 100 tests.
  4201. 1415.70 s [vector] postscanr: OK
  4202. 1415.70 s [vector] +++ OK, passed 100 tests.
  4203. 1415.70 s [vector] postscanr': OK
  4204. 1415.70 s [vector] +++ OK, passed 100 tests.
  4205. 1415.70 s [vector] scanr: OK
  4206. 1415.70 s [vector] +++ OK, passed 100 tests.
  4207. 1415.70 s [vector] scanr': OK
  4208. 1415.70 s [vector] +++ OK, passed 100 tests.
  4209. 1415.70 s [vector] scanr1: OK
  4210. 1415.70 s [vector] +++ OK, passed 100 tests.
  4211. 1415.70 s [vector] scanr1': OK
  4212. 1415.70 s [vector] +++ OK, passed 100 tests.
  4213. 1415.70 s [vector] iscanr: OK
  4214. 1415.70 s [vector] +++ OK, passed 100 tests.
  4215. 1415.70 s [vector] iscanr': OK
  4216. 1415.70 s [vector] +++ OK, passed 100 tests.
  4217. 1415.70 s [vector] mut_read: OK
  4218. 1415.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4219. 1415.70 s [vector] mut_write: OK
  4220. 1415.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4221. 1415.70 s [vector] mut_modify: OK
  4222. 1415.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4223. 1415.70 s [vector] mut_generate: OK
  4224. 1415.70 s [vector] +++ OK, passed 100 tests.
  4225. 1415.70 s [vector] mut_generateM: OK
  4226. 1415.70 s [vector] +++ OK, passed 100 tests.
  4227. 1415.70 s [vector] mut_mapM_: OK (0.01s)
  4228. 1415.70 s [vector] +++ OK, passed 100 tests.
  4229. 1415.70 s [vector] mut_imapM_: OK (0.01s)
  4230. 1415.70 s [vector] +++ OK, passed 100 tests.
  4231. 1415.70 s [vector] mut_forM_: OK (0.01s)
  4232. 1415.70 s [vector] +++ OK, passed 100 tests.
  4233. 1415.70 s [vector] mut_iforM_: OK (0.01s)
  4234. 1415.70 s [vector] +++ OK, passed 100 tests.
  4235. 1415.70 s [vector] mut_foldr: OK
  4236. 1415.70 s [vector] +++ OK, passed 100 tests.
  4237. 1415.70 s [vector] mut_foldr': OK
  4238. 1415.70 s [vector] +++ OK, passed 100 tests.
  4239. 1415.70 s [vector] mut_foldl: OK
  4240. 1415.70 s [vector] +++ OK, passed 100 tests.
  4241. 1415.70 s [vector] mut_foldl': OK
  4242. 1415.70 s [vector] +++ OK, passed 100 tests.
  4243. 1415.70 s [vector] mut_ifoldr: OK
  4244. 1415.70 s [vector] +++ OK, passed 100 tests.
  4245. 1415.70 s [vector] mut_ifoldr': OK
  4246. 1415.70 s [vector] +++ OK, passed 100 tests.
  4247. 1415.70 s [vector] mut_ifoldl: OK
  4248. 1415.70 s [vector] +++ OK, passed 100 tests.
  4249. 1415.70 s [vector] mut_ifoldl': OK
  4250. 1415.70 s [vector] +++ OK, passed 100 tests.
  4251. 1415.70 s [vector] mut_foldM: OK
  4252. 1415.70 s [vector] +++ OK, passed 100 tests.
  4253. 1415.70 s [vector] mut_foldM': OK
  4254. 1415.70 s [vector] +++ OK, passed 100 tests.
  4255. 1415.70 s [vector] mut_foldrM: OK
  4256. 1415.70 s [vector] +++ OK, passed 100 tests.
  4257. 1415.70 s [vector] mut_foldrM': OK
  4258. 1415.70 s [vector] +++ OK, passed 100 tests.
  4259. 1415.70 s [vector] mut_ifoldM: OK
  4260. 1415.70 s [vector] +++ OK, passed 100 tests.
  4261. 1415.70 s [vector] mut_ifoldM': OK
  4262. 1415.70 s [vector] +++ OK, passed 100 tests.
  4263. 1415.70 s [vector] mut_ifoldrM: OK
  4264. 1415.70 s [vector] +++ OK, passed 100 tests.
  4265. 1415.70 s [vector] mut_ifoldrM': OK
  4266. 1415.70 s [vector] +++ OK, passed 100 tests.
  4267. 1415.70 s [vector] compare: OK
  4268. 1415.70 s [vector] +++ OK, passed 100 tests.
  4269. 1415.70 s [vector] maximum: OK
  4270. 1415.70 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4271. 1415.70 s [vector] minimum: OK
  4272. 1415.70 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4273. 1415.70 s [vector] minIndex: OK
  4274. 1415.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4275. 1415.70 s [vector] maxIndex: OK
  4276. 1415.70 s [vector] +++ OK, passed 100 tests; 25 discarded.
  4277. 1415.70 s [vector] maximumBy: OK
  4278. 1415.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4279. 1415.70 s [vector] minimumBy: OK
  4280. 1415.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4281. 1415.70 s [vector] maximumOn: OK
  4282. 1415.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4283. 1415.70 s [vector] minimumOn: OK
  4284. 1415.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4285. 1415.70 s [vector] maxIndexBy: OK
  4286. 1415.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4287. 1415.70 s [vector] minIndexBy: OK
  4288. 1415.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4289. 1415.70 s [vector] ListFirstMaxIndexWins: OK
  4290. 1415.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4291. 1415.70 s [vector] FalseListFirstMaxIndexWins: OK
  4292. 1415.70 s [vector] +++ OK, failed as expected. (after 1 test):
  4293. 1415.70 s [vector] Exception:
  4294. 1415.70 s [vector] Prelude.foldr1: empty list
  4295. 1415.70 s [vector] CallStack (from HasCallStack):
  4296. 1415.70 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  4297. 1415.70 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  4298. 1415.70 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4299. 1415.70 s [vector] []
  4300. 1415.70 s [vector] zip: OK
  4301. 1415.70 s [vector] +++ OK, passed 100 tests.
  4302. 1415.70 s [vector] zip3: OK
  4303. 1415.70 s [vector] +++ OK, passed 100 tests.
  4304. 1415.70 s [vector] unzip: OK
  4305. 1415.70 s [vector] +++ OK, passed 100 tests.
  4306. 1415.70 s [vector] unzip3: OK
  4307. 1415.70 s [vector] +++ OK, passed 100 tests.
  4308. 1415.70 s [vector] indexed: OK
  4309. 1415.70 s [vector] +++ OK, passed 100 tests.
  4310. 1415.70 s [vector] update: OK
  4311. 1415.70 s [vector] +++ OK, passed 100 tests.
  4312. 1415.70 s [vector] concat: OK
  4313. 1415.70 s [vector] +++ OK, passed 100 tests.
  4314. 1415.70 s [vector] mempty: OK
  4315. 1415.70 s [vector] +++ OK, passed 100 tests.
  4316. 1415.70 s [vector] mappend: OK
  4317. 1415.70 s [vector] +++ OK, passed 100 tests.
  4318. 1415.70 s [vector] mconcat: OK
  4319. 1415.70 s [vector] +++ OK, passed 100 tests.
  4320. 1415.70 s [vector] fmap: OK
  4321. 1415.70 s [vector] +++ OK, passed 100 tests.
  4322. 1415.70 s [vector] return: OK
  4323. 1415.70 s [vector] +++ OK, passed 100 tests.
  4324. 1415.70 s [vector] bind: OK (0.01s)
  4325. 1415.70 s [vector] +++ OK, passed 100 tests.
  4326. 1415.70 s [vector] mzip: OK
  4327. 1415.70 s [vector] +++ OK, passed 100 tests.
  4328. 1415.70 s [vector] munzip: OK
  4329. 1415.70 s [vector] +++ OK, passed 100 tests.
  4330. 1415.70 s [vector] applicative_pure: OK
  4331. 1415.70 s [vector] +++ OK, passed 100 tests.
  4332. 1415.70 s [vector] applicative_appl: OK (0.02s)
  4333. 1415.70 s [vector] +++ OK, passed 100 tests.
  4334. 1415.70 s [vector] alternative_empty: OK
  4335. 1415.70 s [vector] +++ OK, passed 100 tests.
  4336. 1415.70 s [vector] alternative_or: OK
  4337. 1415.70 s [vector] +++ OK, passed 100 tests.
  4338. 1415.70 s [vector] sequence: OK (0.02s)
  4339. 1415.70 s [vector] +++ OK, passed 100 tests.
  4340. 1415.70 s [vector] sequence_: OK (0.01s)
  4341. 1415.70 s [vector] +++ OK, passed 100 tests.
  4342. 1415.70 s [vector] glength: OK
  4343. 1415.70 s [vector] +++ OK, passed 100 tests.
  4344. 1415.70 s [vector] and: OK
  4345. 1415.70 s [vector] +++ OK, passed 100 tests.
  4346. 1415.70 s [vector] or: OK
  4347. 1415.70 s [vector] +++ OK, passed 100 tests.
  4348. 1415.70 s [vector] Int
  4349. 1415.70 s [vector] fromList.toList == id: OK
  4350. 1415.70 s [vector] +++ OK, passed 100 tests.
  4351. 1415.70 s [vector] toList.fromList == id: OK
  4352. 1415.70 s [vector] +++ OK, passed 100 tests.
  4353. 1415.70 s [vector] unstream.stream == id: OK
  4354. 1415.70 s [vector] +++ OK, passed 100 tests.
  4355. 1415.70 s [vector] stream.unstream == id: OK
  4356. 1415.70 s [vector] +++ OK, passed 100 tests.
  4357. 1415.70 s [vector] eq: OK
  4358. 1415.70 s [vector] +++ OK, passed 100 tests.
  4359. 1415.70 s [vector] length: OK
  4360. 1415.70 s [vector] +++ OK, passed 100 tests.
  4361. 1415.70 s [vector] null: OK
  4362. 1415.70 s [vector] +++ OK, passed 100 tests.
  4363. 1415.70 s [vector] index: OK
  4364. 1415.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4365. 1415.70 s [vector] safeIndex: OK
  4366. 1415.70 s [vector] +++ OK, passed 100 tests.
  4367. 1415.70 s [vector] head: OK
  4368. 1415.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4369. 1415.70 s [vector] last: OK
  4370. 1415.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4371. 1415.70 s [vector] unsafeIndex: OK
  4372. 1415.70 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4373. 1415.70 s [vector] unsafeHead: OK
  4374. 1415.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4375. 1415.70 s [vector] unsafeLast: OK
  4376. 1415.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4377. 1415.70 s [vector] slice: OK
  4378. 1415.70 s [vector] +++ OK, passed 100 tests.
  4379. 1415.70 s [vector] init: OK
  4380. 1415.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4381. 1415.70 s [vector] tail: OK
  4382. 1415.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4383. 1415.70 s [vector] take: OK
  4384. 1415.70 s [vector] +++ OK, passed 100 tests.
  4385. 1415.70 s [vector] drop: OK
  4386. 1415.70 s [vector] +++ OK, passed 100 tests.
  4387. 1415.70 s [vector] splitAt: OK
  4388. 1415.70 s [vector] +++ OK, passed 100 tests.
  4389. 1415.70 s [vector] empty: OK
  4390. 1415.70 s [vector] +++ OK, passed 100 tests.
  4391. 1415.70 s [vector] singleton: OK
  4392. 1415.70 s [vector] +++ OK, passed 100 tests.
  4393. 1415.70 s [vector] replicate: OK
  4394. 1415.70 s [vector] +++ OK, passed 100 tests.
  4395. 1415.70 s [vector] generate: OK
  4396. 1415.70 s [vector] +++ OK, passed 100 tests.
  4397. 1415.70 s [vector] iterateN: OK
  4398. 1415.70 s [vector] +++ OK, passed 100 tests.
  4399. 1415.70 s [vector] iterateNM: OK (0.05s)
  4400. 1415.70 s [vector] +++ OK, passed 100 tests.
  4401. 1415.70 s [vector] generateM: OK (0.02s)
  4402. 1415.70 s [vector] +++ OK, passed 100 tests.
  4403. 1415.70 s [vector] replicateM: OK (0.02s)
  4404. 1415.70 s [vector] +++ OK, passed 100 tests.
  4405. 1415.70 s [vector] create: OK
  4406. 1415.70 s [vector] +++ OK, passed 100 tests.
  4407. 1415.70 s [vector] createT: OK
  4408. 1415.70 s [vector] +++ OK, passed 100 tests.
  4409. 1415.70 s [vector] unfoldr: OK
  4410. 1415.70 s [vector] +++ OK, passed 100 tests.
  4411. 1415.70 s [vector] unfoldrN: OK
  4412. 1415.70 s [vector] +++ OK, passed 100 tests.
  4413. 1415.70 s [vector] unfoldrExactN: OK
  4414. 1415.70 s [vector] +++ OK, passed 100 tests.
  4415. 1415.70 s [vector] unfoldrM: OK
  4416. 1415.70 s [vector] +++ OK, passed 100 tests.
  4417. 1415.70 s [vector] unfoldrNM: OK
  4418. 1415.70 s [vector] +++ OK, passed 100 tests.
  4419. 1415.70 s [vector] unfoldrExactNM: OK (0.05s)
  4420. 1415.70 s [vector] +++ OK, passed 100 tests.
  4421. 1415.70 s [vector] constructN: OK
  4422. 1415.70 s [vector] +++ OK, passed 100 tests.
  4423. 1415.70 s [vector] constructrN: OK
  4424. 1415.70 s [vector] +++ OK, passed 100 tests.
  4425. 1415.70 s [vector] cons: OK
  4426. 1415.70 s [vector] +++ OK, passed 100 tests.
  4427. 1415.70 s [vector] snoc: OK
  4428. 1415.70 s [vector] +++ OK, passed 100 tests.
  4429. 1415.70 s [vector] append: OK
  4430. 1415.70 s [vector] +++ OK, passed 100 tests.
  4431. 1415.70 s [vector] concat: OK (0.01s)
  4432. 1415.70 s [vector] +++ OK, passed 100 tests.
  4433. 1415.70 s [vector] force: OK
  4434. 1415.70 s [vector] +++ OK, passed 100 tests.
  4435. 1415.70 s [vector] upd: OK
  4436. 1415.70 s [vector] +++ OK, passed 100 tests.
  4437. 1415.70 s [vector] accum: OK
  4438. 1415.70 s [vector] +++ OK, passed 100 tests.
  4439. 1415.70 s [vector] reverse: OK
  4440. 1415.70 s [vector] +++ OK, passed 100 tests.
  4441. 1415.70 s [vector] backpermute: OK
  4442. 1415.70 s [vector] +++ OK, passed 100 tests.
  4443. 1415.70 s [vector] map: OK
  4444. 1415.70 s [vector] +++ OK, passed 100 tests.
  4445. 1415.70 s [vector] imap: OK
  4446. 1415.70 s [vector] +++ OK, passed 100 tests.
  4447. 1415.70 s [vector] concatMap: OK
  4448. 1415.70 s [vector] +++ OK, passed 100 tests.
  4449. 1415.70 s [vector] mapM: OK
  4450. 1415.70 s [vector] +++ OK, passed 100 tests.
  4451. 1415.70 s [vector] mapM_: OK (0.02s)
  4452. 1415.70 s [vector] +++ OK, passed 100 tests.
  4453. 1415.70 s [vector] forM: OK
  4454. 1415.70 s [vector] +++ OK, passed 100 tests.
  4455. 1415.70 s [vector] forM_: OK (0.02s)
  4456. 1415.70 s [vector] +++ OK, passed 100 tests.
  4457. 1415.70 s [vector] imapM: OK
  4458. 1415.70 s [vector] +++ OK, passed 100 tests.
  4459. 1415.70 s [vector] imapM_: OK (0.02s)
  4460. 1415.70 s [vector] +++ OK, passed 100 tests.
  4461. 1415.70 s [vector] zipWith: OK
  4462. 1415.70 s [vector] +++ OK, passed 100 tests.
  4463. 1415.70 s [vector] zipWith3: OK
  4464. 1415.70 s [vector] +++ OK, passed 100 tests.
  4465. 1415.71 s [vector] izipWith: OK
  4466. 1415.71 s [vector] +++ OK, passed 100 tests.
  4467. 1415.71 s [vector] izipWith3: OK
  4468. 1415.71 s [vector] +++ OK, passed 100 tests.
  4469. 1415.71 s [vector] izipWithM: OK
  4470. 1415.71 s [vector] +++ OK, passed 100 tests.
  4471. 1415.71 s [vector] izipWithM_: OK (0.02s)
  4472. 1415.71 s [vector] +++ OK, passed 100 tests.
  4473. 1415.71 s [vector] zipWithM: OK
  4474. 1415.71 s [vector] +++ OK, passed 100 tests.
  4475. 1415.71 s [vector] zipWithM_: OK (0.02s)
  4476. 1415.71 s [vector] +++ OK, passed 100 tests.
  4477. 1415.71 s [vector] filter: OK
  4478. 1415.71 s [vector] +++ OK, passed 100 tests.
  4479. 1415.71 s [vector] ifilter: OK
  4480. 1415.71 s [vector] +++ OK, passed 100 tests.
  4481. 1415.71 s [vector] filterM: OK (0.03s)
  4482. 1415.71 s [vector] +++ OK, passed 100 tests.
  4483. 1415.71 s [vector] uniq: OK
  4484. 1415.71 s [vector] +++ OK, passed 100 tests.
  4485. 1415.71 s [vector] mapMaybe: OK
  4486. 1415.71 s [vector] +++ OK, passed 100 tests.
  4487. 1415.71 s [vector] imapMaybe: OK
  4488. 1415.71 s [vector] +++ OK, passed 100 tests.
  4489. 1415.71 s [vector] takeWhile: OK
  4490. 1415.71 s [vector] +++ OK, passed 100 tests.
  4491. 1415.71 s [vector] dropWhile: OK
  4492. 1415.71 s [vector] +++ OK, passed 100 tests.
  4493. 1415.71 s [vector] partition: OK
  4494. 1415.71 s [vector] +++ OK, passed 100 tests.
  4495. 1415.71 s [vector] partitionWith: OK
  4496. 1415.71 s [vector] +++ OK, passed 100 tests.
  4497. 1415.71 s [vector] span: OK
  4498. 1415.71 s [vector] +++ OK, passed 100 tests.
  4499. 1415.71 s [vector] break: OK
  4500. 1415.71 s [vector] +++ OK, passed 100 tests.
  4501. 1415.71 s [vector] spanR: OK
  4502. 1415.71 s [vector] +++ OK, passed 100 tests.
  4503. 1415.71 s [vector] breakR: OK
  4504. 1415.71 s [vector] +++ OK, passed 100 tests.
  4505. 1415.71 s [vector] groupBy: OK
  4506. 1415.71 s [vector] +++ OK, passed 100 tests.
  4507. 1415.71 s [vector] elem: OK
  4508. 1415.71 s [vector] +++ OK, passed 100 tests.
  4509. 1415.71 s [vector] notElem: OK
  4510. 1415.71 s [vector] +++ OK, passed 100 tests.
  4511. 1415.71 s [vector] find: OK
  4512. 1415.71 s [vector] +++ OK, passed 100 tests.
  4513. 1415.71 s [vector] findIndex: OK
  4514. 1415.71 s [vector] +++ OK, passed 100 tests.
  4515. 1415.71 s [vector] findIndexR: OK
  4516. 1415.71 s [vector] +++ OK, passed 100 tests.
  4517. 1415.71 s [vector] findIndices: OK
  4518. 1415.71 s [vector] +++ OK, passed 100 tests.
  4519. 1415.71 s [vector] elemIndex: OK
  4520. 1415.71 s [vector] +++ OK, passed 100 tests.
  4521. 1415.71 s [vector] elemIndices: OK
  4522. 1415.71 s [vector] +++ OK, passed 100 tests.
  4523. 1415.71 s [vector] foldl: OK
  4524. 1415.71 s [vector] +++ OK, passed 100 tests.
  4525. 1415.71 s [vector] foldl1: OK
  4526. 1415.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4527. 1415.71 s [vector] foldl': OK
  4528. 1415.71 s [vector] +++ OK, passed 100 tests.
  4529. 1415.71 s [vector] foldl1': OK
  4530. 1415.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4531. 1415.71 s [vector] foldr: OK
  4532. 1415.71 s [vector] +++ OK, passed 100 tests.
  4533. 1415.71 s [vector] foldr1: OK
  4534. 1415.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4535. 1415.71 s [vector] foldr': OK
  4536. 1415.71 s [vector] +++ OK, passed 100 tests.
  4537. 1415.71 s [vector] foldr1': OK
  4538. 1415.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4539. 1415.71 s [vector] ifoldl: OK
  4540. 1415.71 s [vector] +++ OK, passed 100 tests.
  4541. 1415.71 s [vector] ifoldl': OK
  4542. 1415.71 s [vector] +++ OK, passed 100 tests.
  4543. 1415.71 s [vector] ifoldr: OK
  4544. 1415.71 s [vector] +++ OK, passed 100 tests.
  4545. 1415.71 s [vector] ifoldr': OK
  4546. 1415.71 s [vector] +++ OK, passed 100 tests.
  4547. 1415.71 s [vector] ifoldM: OK
  4548. 1415.71 s [vector] +++ OK, passed 100 tests.
  4549. 1415.71 s [vector] ifoldM': OK
  4550. 1415.71 s [vector] +++ OK, passed 100 tests.
  4551. 1415.71 s [vector] ifoldM_: OK (0.02s)
  4552. 1415.71 s [vector] +++ OK, passed 100 tests.
  4553. 1415.71 s [vector] ifoldM'_: OK (0.02s)
  4554. 1415.71 s [vector] +++ OK, passed 100 tests.
  4555. 1415.71 s [vector] all: OK
  4556. 1415.71 s [vector] +++ OK, passed 100 tests.
  4557. 1415.71 s [vector] any: OK
  4558. 1415.71 s [vector] +++ OK, passed 100 tests.
  4559. 1415.71 s [vector] prescanl: OK
  4560. 1415.71 s [vector] +++ OK, passed 100 tests.
  4561. 1415.71 s [vector] prescanl': OK
  4562. 1415.71 s [vector] +++ OK, passed 100 tests.
  4563. 1415.71 s [vector] postscanl: OK
  4564. 1415.71 s [vector] +++ OK, passed 100 tests.
  4565. 1415.71 s [vector] postscanl': OK
  4566. 1415.71 s [vector] +++ OK, passed 100 tests.
  4567. 1415.71 s [vector] scanl: OK
  4568. 1415.71 s [vector] +++ OK, passed 100 tests.
  4569. 1415.71 s [vector] scanl': OK
  4570. 1415.71 s [vector] +++ OK, passed 100 tests.
  4571. 1415.71 s [vector] scanl1: OK
  4572. 1415.71 s [vector] +++ OK, passed 100 tests.
  4573. 1415.71 s [vector] scanl1': OK
  4574. 1415.71 s [vector] +++ OK, passed 100 tests.
  4575. 1415.71 s [vector] iscanl: OK
  4576. 1415.71 s [vector] +++ OK, passed 100 tests.
  4577. 1415.71 s [vector] iscanl': OK
  4578. 1415.71 s [vector] +++ OK, passed 100 tests.
  4579. 1415.71 s [vector] prescanr: OK
  4580. 1415.71 s [vector] +++ OK, passed 100 tests.
  4581. 1415.71 s [vector] prescanr': OK
  4582. 1415.71 s [vector] +++ OK, passed 100 tests.
  4583. 1415.71 s [vector] postscanr: OK
  4584. 1415.71 s [vector] +++ OK, passed 100 tests.
  4585. 1415.71 s [vector] postscanr': OK
  4586. 1415.71 s [vector] +++ OK, passed 100 tests.
  4587. 1415.71 s [vector] scanr: OK
  4588. 1415.71 s [vector] +++ OK, passed 100 tests.
  4589. 1415.71 s [vector] scanr': OK
  4590. 1415.71 s [vector] +++ OK, passed 100 tests.
  4591. 1415.71 s [vector] scanr1: OK
  4592. 1415.71 s [vector] +++ OK, passed 100 tests.
  4593. 1415.71 s [vector] scanr1': OK
  4594. 1415.71 s [vector] +++ OK, passed 100 tests.
  4595. 1415.71 s [vector] iscanr: OK
  4596. 1415.71 s [vector] +++ OK, passed 100 tests.
  4597. 1415.71 s [vector] iscanr': OK
  4598. 1415.71 s [vector] +++ OK, passed 100 tests.
  4599. 1415.71 s [vector] mut_read: OK
  4600. 1415.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4601. 1415.71 s [vector] mut_write: OK
  4602. 1415.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4603. 1415.71 s [vector] mut_modify: OK
  4604. 1415.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4605. 1415.71 s [vector] mut_generate: OK
  4606. 1415.71 s [vector] +++ OK, passed 100 tests.
  4607. 1415.71 s [vector] mut_generateM: OK
  4608. 1415.71 s [vector] +++ OK, passed 100 tests.
  4609. 1415.71 s [vector] mut_mapM_: OK (0.02s)
  4610. 1415.71 s [vector] +++ OK, passed 100 tests.
  4611. 1415.71 s [vector] mut_imapM_: OK (0.02s)
  4612. 1415.71 s [vector] +++ OK, passed 100 tests.
  4613. 1415.71 s [vector] mut_forM_: OK (0.02s)
  4614. 1415.71 s [vector] +++ OK, passed 100 tests.
  4615. 1415.71 s [vector] mut_iforM_: OK (0.02s)
  4616. 1415.71 s [vector] +++ OK, passed 100 tests.
  4617. 1415.71 s [vector] mut_foldr: OK
  4618. 1415.71 s [vector] +++ OK, passed 100 tests.
  4619. 1415.71 s [vector] mut_foldr': OK
  4620. 1415.71 s [vector] +++ OK, passed 100 tests.
  4621. 1415.71 s [vector] mut_foldl: OK
  4622. 1415.71 s [vector] +++ OK, passed 100 tests.
  4623. 1415.71 s [vector] mut_foldl': OK
  4624. 1415.71 s [vector] +++ OK, passed 100 tests.
  4625. 1415.71 s [vector] mut_ifoldr: OK
  4626. 1415.71 s [vector] +++ OK, passed 100 tests.
  4627. 1415.71 s [vector] mut_ifoldr': OK
  4628. 1415.71 s [vector] +++ OK, passed 100 tests.
  4629. 1415.71 s [vector] mut_ifoldl: OK
  4630. 1415.71 s [vector] +++ OK, passed 100 tests.
  4631. 1415.71 s [vector] mut_ifoldl': OK
  4632. 1415.71 s [vector] +++ OK, passed 100 tests.
  4633. 1415.71 s [vector] mut_foldM: OK
  4634. 1415.71 s [vector] +++ OK, passed 100 tests.
  4635. 1415.71 s [vector] mut_foldM': OK
  4636. 1415.71 s [vector] +++ OK, passed 100 tests.
  4637. 1415.71 s [vector] mut_foldrM: OK
  4638. 1415.71 s [vector] +++ OK, passed 100 tests.
  4639. 1415.71 s [vector] mut_foldrM': OK
  4640. 1415.71 s [vector] +++ OK, passed 100 tests.
  4641. 1415.71 s [vector] mut_ifoldM: OK
  4642. 1415.71 s [vector] +++ OK, passed 100 tests.
  4643. 1415.71 s [vector] mut_ifoldM': OK
  4644. 1415.71 s [vector] +++ OK, passed 100 tests.
  4645. 1415.71 s [vector] mut_ifoldrM: OK
  4646. 1415.71 s [vector] +++ OK, passed 100 tests.
  4647. 1415.71 s [vector] mut_ifoldrM': OK
  4648. 1415.71 s [vector] +++ OK, passed 100 tests.
  4649. 1415.71 s [vector] compare: OK
  4650. 1415.71 s [vector] +++ OK, passed 100 tests.
  4651. 1415.71 s [vector] maximum: OK
  4652. 1415.71 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4653. 1415.71 s [vector] minimum: OK
  4654. 1415.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4655. 1415.71 s [vector] minIndex: OK
  4656. 1415.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4657. 1415.71 s [vector] maxIndex: OK
  4658. 1415.71 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4659. 1415.71 s [vector] maximumBy: OK
  4660. 1415.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4661. 1415.71 s [vector] minimumBy: OK
  4662. 1415.71 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4663. 1415.71 s [vector] maximumOn: OK
  4664. 1415.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4665. 1415.71 s [vector] minimumOn: OK
  4666. 1415.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4667. 1415.71 s [vector] maxIndexBy: OK
  4668. 1415.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4669. 1415.71 s [vector] minIndexBy: OK
  4670. 1415.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4671. 1415.71 s [vector] ListFirstMaxIndexWins: OK
  4672. 1415.71 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4673. 1415.71 s [vector] FalseListFirstMaxIndexWins: OK
  4674. 1415.71 s [vector] +++ OK, failed as expected. (after 1 test):
  4675. 1415.71 s [vector] Exception:
  4676. 1415.71 s [vector] Prelude.foldr1: empty list
  4677. 1415.71 s [vector] CallStack (from HasCallStack):
  4678. 1415.71 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  4679. 1415.71 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  4680. 1415.71 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4681. 1415.71 s [vector] []
  4682. 1415.71 s [vector] zip: OK
  4683. 1415.71 s [vector] +++ OK, passed 100 tests.
  4684. 1415.71 s [vector] zip3: OK
  4685. 1415.71 s [vector] +++ OK, passed 100 tests.
  4686. 1415.71 s [vector] unzip: OK
  4687. 1415.71 s [vector] +++ OK, passed 100 tests.
  4688. 1415.71 s [vector] unzip3: OK
  4689. 1415.71 s [vector] +++ OK, passed 100 tests.
  4690. 1415.71 s [vector] indexed: OK
  4691. 1415.71 s [vector] +++ OK, passed 100 tests.
  4692. 1415.71 s [vector] update: OK
  4693. 1415.71 s [vector] +++ OK, passed 100 tests.
  4694. 1415.71 s [vector] concat: OK (0.01s)
  4695. 1415.71 s [vector] +++ OK, passed 100 tests.
  4696. 1415.71 s [vector] mempty: OK
  4697. 1415.71 s [vector] +++ OK, passed 100 tests.
  4698. 1415.71 s [vector] mappend: OK
  4699. 1415.71 s [vector] +++ OK, passed 100 tests.
  4700. 1415.71 s [vector] mconcat: OK (0.03s)
  4701. 1415.71 s [vector] +++ OK, passed 100 tests.
  4702. 1415.71 s [vector] fmap: OK
  4703. 1415.71 s [vector] +++ OK, passed 100 tests.
  4704. 1415.71 s [vector] return: OK
  4705. 1415.71 s [vector] +++ OK, passed 100 tests.
  4706. 1415.71 s [vector] bind: OK (0.02s)
  4707. 1415.71 s [vector] +++ OK, passed 100 tests.
  4708. 1415.71 s [vector] mzip: OK
  4709. 1415.71 s [vector] +++ OK, passed 100 tests.
  4710. 1415.71 s [vector] munzip: OK
  4711. 1415.71 s [vector] +++ OK, passed 100 tests.
  4712. 1415.71 s [vector] applicative_pure: OK
  4713. 1415.71 s [vector] +++ OK, passed 100 tests.
  4714. 1415.71 s [vector] applicative_appl: OK (0.05s)
  4715. 1415.71 s [vector] +++ OK, passed 100 tests.
  4716. 1415.71 s [vector] alternative_empty: OK
  4717. 1415.71 s [vector] +++ OK, passed 100 tests.
  4718. 1415.71 s [vector] alternative_or: OK
  4719. 1415.71 s [vector] +++ OK, passed 100 tests.
  4720. 1415.71 s [vector] sequence: OK (0.03s)
  4721. 1415.71 s [vector] +++ OK, passed 100 tests.
  4722. 1415.71 s [vector] sequence_: OK (0.01s)
  4723. 1415.71 s [vector] +++ OK, passed 100 tests.
  4724. 1415.71 s [vector] glength: OK
  4725. 1415.71 s [vector] +++ OK, passed 100 tests.
  4726. 1415.71 s [vector] sum: OK
  4727. 1415.71 s [vector] +++ OK, passed 100 tests.
  4728. 1415.71 s [vector] product: OK
  4729. 1415.71 s [vector] +++ OK, passed 100 tests.
  4730. 1415.71 s [vector] enumFromN: OK
  4731. 1415.71 s [vector] +++ OK, passed 100 tests.
  4732. 1415.71 s [vector] enumFromThenN: OK
  4733. 1415.71 s [vector] +++ OK, passed 100 tests.
  4734. 1415.71 s [vector] enumFromTo: OK
  4735. 1415.71 s [vector] +++ OK, passed 100 tests.
  4736. 1415.71 s [vector] enumFromThenTo: OK
  4737. 1415.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4738. 1415.71 s [vector] unstream
  4739. 1415.71 s [vector] unstream == vunstream (exact): OK
  4740. 1415.71 s [vector] +++ OK, passed 100 tests.
  4741. 1415.71 s [vector] unstream == vunstream (unknown): OK
  4742. 1415.71 s [vector] +++ OK, passed 100 tests.
  4743. 1415.71 s [vector] unstreamR ~= vunstream (exact): OK
  4744. 1415.71 s [vector] +++ OK, passed 100 tests.
  4745. 1415.71 s [vector] unstreamR ~= vunstream (unknown): OK
  4746. 1415.71 s [vector] +++ OK, passed 100 tests.
  4747. 1415.71 s [vector] Tests.Vector.Primitive
  4748. 1415.71 s [vector] Int
  4749. 1415.71 s [vector] fromList.toList == id: OK
  4750. 1415.71 s [vector] +++ OK, passed 100 tests.
  4751. 1415.71 s [vector] toList.fromList == id: OK
  4752. 1415.71 s [vector] +++ OK, passed 100 tests.
  4753. 1415.71 s [vector] unstream.stream == id: OK
  4754. 1415.71 s [vector] +++ OK, passed 100 tests.
  4755. 1415.71 s [vector] stream.unstream == id: OK
  4756. 1415.71 s [vector] +++ OK, passed 100 tests.
  4757. 1415.71 s [vector] eq: OK
  4758. 1415.71 s [vector] +++ OK, passed 100 tests.
  4759. 1415.71 s [vector] length: OK
  4760. 1415.71 s [vector] +++ OK, passed 100 tests.
  4761. 1415.71 s [vector] null: OK
  4762. 1415.71 s [vector] +++ OK, passed 100 tests.
  4763. 1415.71 s [vector] index: OK
  4764. 1415.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4765. 1415.71 s [vector] safeIndex: OK
  4766. 1415.71 s [vector] +++ OK, passed 100 tests.
  4767. 1415.71 s [vector] head: OK
  4768. 1415.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4769. 1415.71 s [vector] last: OK
  4770. 1415.71 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4771. 1415.71 s [vector] unsafeIndex: OK
  4772. 1415.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4773. 1415.71 s [vector] unsafeHead: OK
  4774. 1415.71 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4775. 1415.71 s [vector] unsafeLast: OK
  4776. 1415.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4777. 1415.71 s [vector] slice: OK
  4778. 1415.71 s [vector] +++ OK, passed 100 tests.
  4779. 1415.71 s [vector] init: OK
  4780. 1415.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4781. 1415.71 s [vector] tail: OK
  4782. 1415.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4783. 1415.71 s [vector] take: OK
  4784. 1415.71 s [vector] +++ OK, passed 100 tests.
  4785. 1415.71 s [vector] drop: OK
  4786. 1415.71 s [vector] +++ OK, passed 100 tests.
  4787. 1415.71 s [vector] splitAt: OK
  4788. 1415.71 s [vector] +++ OK, passed 100 tests.
  4789. 1415.71 s [vector] empty: OK
  4790. 1415.71 s [vector] +++ OK, passed 100 tests.
  4791. 1415.71 s [vector] singleton: OK
  4792. 1415.71 s [vector] +++ OK, passed 100 tests.
  4793. 1415.71 s [vector] replicate: OK
  4794. 1415.71 s [vector] +++ OK, passed 100 tests.
  4795. 1415.71 s [vector] generate: OK
  4796. 1415.71 s [vector] +++ OK, passed 100 tests.
  4797. 1415.71 s [vector] iterateN: OK
  4798. 1415.71 s [vector] +++ OK, passed 100 tests.
  4799. 1415.71 s [vector] iterateNM: OK (0.03s)
  4800. 1415.71 s [vector] +++ OK, passed 100 tests.
  4801. 1415.71 s [vector] generateM: OK
  4802. 1415.71 s [vector] +++ OK, passed 100 tests.
  4803. 1415.71 s [vector] replicateM: OK (0.03s)
  4804. 1415.71 s [vector] +++ OK, passed 100 tests.
  4805. 1415.71 s [vector] create: OK
  4806. 1415.71 s [vector] +++ OK, passed 100 tests.
  4807. 1415.71 s [vector] createT: OK
  4808. 1415.71 s [vector] +++ OK, passed 100 tests.
  4809. 1415.71 s [vector] unfoldr: OK
  4810. 1415.71 s [vector] +++ OK, passed 100 tests.
  4811. 1415.71 s [vector] unfoldrN: OK
  4812. 1415.71 s [vector] +++ OK, passed 100 tests.
  4813. 1415.71 s [vector] unfoldrExactN: OK
  4814. 1415.71 s [vector] +++ OK, passed 100 tests.
  4815. 1415.71 s [vector] unfoldrM: OK
  4816. 1415.71 s [vector] +++ OK, passed 100 tests.
  4817. 1415.71 s [vector] unfoldrNM: OK
  4818. 1415.71 s [vector] +++ OK, passed 100 tests.
  4819. 1415.71 s [vector] unfoldrExactNM: OK (0.01s)
  4820. 1415.72 s [vector] +++ OK, passed 100 tests.
  4821. 1415.72 s [vector] constructN: OK
  4822. 1415.72 s [vector] +++ OK, passed 100 tests.
  4823. 1415.72 s [vector] constructrN: OK
  4824. 1415.72 s [vector] +++ OK, passed 100 tests.
  4825. 1415.72 s [vector] cons: OK
  4826. 1415.72 s [vector] +++ OK, passed 100 tests.
  4827. 1415.72 s [vector] snoc: OK
  4828. 1415.72 s [vector] +++ OK, passed 100 tests.
  4829. 1415.72 s [vector] append: OK
  4830. 1415.72 s [vector] +++ OK, passed 100 tests.
  4831. 1415.72 s [vector] concat: OK (0.02s)
  4832. 1415.72 s [vector] +++ OK, passed 100 tests.
  4833. 1415.72 s [vector] force: OK
  4834. 1415.72 s [vector] +++ OK, passed 100 tests.
  4835. 1415.72 s [vector] upd: OK
  4836. 1415.72 s [vector] +++ OK, passed 100 tests.
  4837. 1415.72 s [vector] accum: OK
  4838. 1415.72 s [vector] +++ OK, passed 100 tests.
  4839. 1415.72 s [vector] reverse: OK
  4840. 1415.72 s [vector] +++ OK, passed 100 tests.
  4841. 1415.72 s [vector] backpermute: OK
  4842. 1415.72 s [vector] +++ OK, passed 100 tests.
  4843. 1415.72 s [vector] map: OK
  4844. 1415.72 s [vector] +++ OK, passed 100 tests.
  4845. 1415.72 s [vector] imap: OK
  4846. 1415.72 s [vector] +++ OK, passed 100 tests.
  4847. 1415.72 s [vector] concatMap: OK
  4848. 1415.72 s [vector] +++ OK, passed 100 tests.
  4849. 1415.72 s [vector] mapM: OK
  4850. 1415.72 s [vector] +++ OK, passed 100 tests.
  4851. 1415.72 s [vector] mapM_: OK (0.02s)
  4852. 1415.72 s [vector] +++ OK, passed 100 tests.
  4853. 1415.72 s [vector] forM: OK
  4854. 1415.72 s [vector] +++ OK, passed 100 tests.
  4855. 1415.72 s [vector] forM_: OK (0.02s)
  4856. 1415.72 s [vector] +++ OK, passed 100 tests.
  4857. 1415.72 s [vector] imapM: OK
  4858. 1415.72 s [vector] +++ OK, passed 100 tests.
  4859. 1415.72 s [vector] imapM_: OK (0.02s)
  4860. 1415.72 s [vector] +++ OK, passed 100 tests.
  4861. 1415.72 s [vector] zipWith: OK
  4862. 1415.72 s [vector] +++ OK, passed 100 tests.
  4863. 1415.72 s [vector] zipWith3: OK
  4864. 1415.72 s [vector] +++ OK, passed 100 tests.
  4865. 1415.72 s [vector] izipWith: OK
  4866. 1415.72 s [vector] +++ OK, passed 100 tests.
  4867. 1415.72 s [vector] izipWith3: OK
  4868. 1415.72 s [vector] +++ OK, passed 100 tests.
  4869. 1415.72 s [vector] izipWithM: OK
  4870. 1415.72 s [vector] +++ OK, passed 100 tests.
  4871. 1415.72 s [vector] izipWithM_: OK (0.01s)
  4872. 1415.72 s [vector] +++ OK, passed 100 tests.
  4873. 1415.72 s [vector] zipWithM: OK
  4874. 1415.72 s [vector] +++ OK, passed 100 tests.
  4875. 1415.72 s [vector] zipWithM_: OK (0.02s)
  4876. 1415.72 s [vector] +++ OK, passed 100 tests.
  4877. 1415.72 s [vector] filter: OK
  4878. 1415.72 s [vector] +++ OK, passed 100 tests.
  4879. 1415.72 s [vector] ifilter: OK
  4880. 1415.72 s [vector] +++ OK, passed 100 tests.
  4881. 1415.72 s [vector] filterM: OK (0.03s)
  4882. 1415.72 s [vector] +++ OK, passed 100 tests.
  4883. 1415.72 s [vector] uniq: OK
  4884. 1415.72 s [vector] +++ OK, passed 100 tests.
  4885. 1415.72 s [vector] mapMaybe: OK
  4886. 1415.72 s [vector] +++ OK, passed 100 tests.
  4887. 1415.72 s [vector] imapMaybe: OK
  4888. 1415.72 s [vector] +++ OK, passed 100 tests.
  4889. 1415.72 s [vector] takeWhile: OK
  4890. 1415.72 s [vector] +++ OK, passed 100 tests.
  4891. 1415.72 s [vector] dropWhile: OK
  4892. 1415.72 s [vector] +++ OK, passed 100 tests.
  4893. 1415.72 s [vector] partition: OK
  4894. 1415.72 s [vector] +++ OK, passed 100 tests.
  4895. 1415.72 s [vector] partitionWith: OK
  4896. 1415.72 s [vector] +++ OK, passed 100 tests.
  4897. 1415.72 s [vector] span: OK
  4898. 1415.72 s [vector] +++ OK, passed 100 tests.
  4899. 1415.72 s [vector] break: OK
  4900. 1415.72 s [vector] +++ OK, passed 100 tests.
  4901. 1415.72 s [vector] spanR: OK
  4902. 1415.72 s [vector] +++ OK, passed 100 tests.
  4903. 1415.72 s [vector] breakR: OK
  4904. 1415.72 s [vector] +++ OK, passed 100 tests.
  4905. 1415.72 s [vector] groupBy: OK
  4906. 1415.72 s [vector] +++ OK, passed 100 tests.
  4907. 1415.72 s [vector] elem: OK
  4908. 1415.72 s [vector] +++ OK, passed 100 tests.
  4909. 1415.72 s [vector] notElem: OK
  4910. 1415.72 s [vector] +++ OK, passed 100 tests.
  4911. 1415.72 s [vector] find: OK
  4912. 1415.72 s [vector] +++ OK, passed 100 tests.
  4913. 1415.72 s [vector] findIndex: OK
  4914. 1415.72 s [vector] +++ OK, passed 100 tests.
  4915. 1415.72 s [vector] findIndexR: OK
  4916. 1415.72 s [vector] +++ OK, passed 100 tests.
  4917. 1415.72 s [vector] findIndices: OK
  4918. 1415.72 s [vector] +++ OK, passed 100 tests.
  4919. 1415.72 s [vector] elemIndex: OK
  4920. 1415.72 s [vector] +++ OK, passed 100 tests.
  4921. 1415.72 s [vector] elemIndices: OK
  4922. 1415.72 s [vector] +++ OK, passed 100 tests.
  4923. 1415.72 s [vector] foldl: OK
  4924. 1415.72 s [vector] +++ OK, passed 100 tests.
  4925. 1415.72 s [vector] foldl1: OK
  4926. 1415.72 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4927. 1415.72 s [vector] foldl': OK
  4928. 1415.72 s [vector] +++ OK, passed 100 tests.
  4929. 1415.72 s [vector] foldl1': OK
  4930. 1415.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4931. 1415.72 s [vector] foldr: OK
  4932. 1415.72 s [vector] +++ OK, passed 100 tests.
  4933. 1415.72 s [vector] foldr1: OK
  4934. 1415.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4935. 1415.72 s [vector] foldr': OK
  4936. 1415.72 s [vector] +++ OK, passed 100 tests.
  4937. 1415.72 s [vector] foldr1': OK
  4938. 1415.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4939. 1415.72 s [vector] ifoldl: OK
  4940. 1415.72 s [vector] +++ OK, passed 100 tests.
  4941. 1415.72 s [vector] ifoldl': OK
  4942. 1415.72 s [vector] +++ OK, passed 100 tests.
  4943. 1415.72 s [vector] ifoldr: OK
  4944. 1415.72 s [vector] +++ OK, passed 100 tests.
  4945. 1415.72 s [vector] ifoldr': OK
  4946. 1415.72 s [vector] +++ OK, passed 100 tests.
  4947. 1415.72 s [vector] ifoldM: OK
  4948. 1415.72 s [vector] +++ OK, passed 100 tests.
  4949. 1415.72 s [vector] ifoldM': OK
  4950. 1415.72 s [vector] +++ OK, passed 100 tests.
  4951. 1415.72 s [vector] ifoldM_: OK (0.02s)
  4952. 1415.72 s [vector] +++ OK, passed 100 tests.
  4953. 1415.72 s [vector] ifoldM'_: OK (0.02s)
  4954. 1415.72 s [vector] +++ OK, passed 100 tests.
  4955. 1415.72 s [vector] all: OK
  4956. 1415.72 s [vector] +++ OK, passed 100 tests.
  4957. 1415.72 s [vector] any: OK
  4958. 1415.72 s [vector] +++ OK, passed 100 tests.
  4959. 1415.72 s [vector] prescanl: OK
  4960. 1415.72 s [vector] +++ OK, passed 100 tests.
  4961. 1415.72 s [vector] prescanl': OK
  4962. 1415.72 s [vector] +++ OK, passed 100 tests.
  4963. 1415.72 s [vector] postscanl: OK
  4964. 1415.72 s [vector] +++ OK, passed 100 tests.
  4965. 1415.72 s [vector] postscanl': OK
  4966. 1415.72 s [vector] +++ OK, passed 100 tests.
  4967. 1415.72 s [vector] scanl: OK
  4968. 1415.72 s [vector] +++ OK, passed 100 tests.
  4969. 1415.72 s [vector] scanl': OK
  4970. 1415.72 s [vector] +++ OK, passed 100 tests.
  4971. 1415.72 s [vector] scanl1: OK
  4972. 1415.72 s [vector] +++ OK, passed 100 tests.
  4973. 1415.72 s [vector] scanl1': OK
  4974. 1415.72 s [vector] +++ OK, passed 100 tests.
  4975. 1415.72 s [vector] iscanl: OK
  4976. 1415.72 s [vector] +++ OK, passed 100 tests.
  4977. 1415.72 s [vector] iscanl': OK
  4978. 1415.72 s [vector] +++ OK, passed 100 tests.
  4979. 1415.72 s [vector] prescanr: OK
  4980. 1415.72 s [vector] +++ OK, passed 100 tests.
  4981. 1415.72 s [vector] prescanr': OK
  4982. 1415.72 s [vector] +++ OK, passed 100 tests.
  4983. 1415.72 s [vector] postscanr: OK
  4984. 1415.72 s [vector] +++ OK, passed 100 tests.
  4985. 1415.72 s [vector] postscanr': OK
  4986. 1415.72 s [vector] +++ OK, passed 100 tests.
  4987. 1415.72 s [vector] scanr: OK
  4988. 1415.72 s [vector] +++ OK, passed 100 tests.
  4989. 1415.72 s [vector] scanr': OK
  4990. 1415.72 s [vector] +++ OK, passed 100 tests.
  4991. 1415.72 s [vector] scanr1: OK
  4992. 1415.72 s [vector] +++ OK, passed 100 tests.
  4993. 1415.72 s [vector] scanr1': OK
  4994. 1415.72 s [vector] +++ OK, passed 100 tests.
  4995. 1415.72 s [vector] iscanr: OK
  4996. 1415.72 s [vector] +++ OK, passed 100 tests.
  4997. 1415.72 s [vector] iscanr': OK
  4998. 1415.72 s [vector] +++ OK, passed 100 tests.
  4999. 1415.72 s [vector] mut_read: OK
  5000. 1415.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5001. 1415.72 s [vector] mut_write: OK
  5002. 1415.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5003. 1415.72 s [vector] mut_modify: OK
  5004. 1415.72 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5005. 1415.72 s [vector] mut_generate: OK
  5006. 1415.72 s [vector] +++ OK, passed 100 tests.
  5007. 1415.72 s [vector] mut_generateM: OK (0.01s)
  5008. 1415.72 s [vector] +++ OK, passed 100 tests.
  5009. 1415.72 s [vector] mut_mapM_: OK (0.02s)
  5010. 1415.72 s [vector] +++ OK, passed 100 tests.
  5011. 1415.72 s [vector] mut_imapM_: OK (0.02s)
  5012. 1415.72 s [vector] +++ OK, passed 100 tests.
  5013. 1415.72 s [vector] mut_forM_: OK (0.01s)
  5014. 1415.72 s [vector] +++ OK, passed 100 tests.
  5015. 1415.72 s [vector] mut_iforM_: OK (0.02s)
  5016. 1415.72 s [vector] +++ OK, passed 100 tests.
  5017. 1415.72 s [vector] mut_foldr: OK
  5018. 1415.72 s [vector] +++ OK, passed 100 tests.
  5019. 1415.72 s [vector] mut_foldr': OK
  5020. 1415.72 s [vector] +++ OK, passed 100 tests.
  5021. 1415.72 s [vector] mut_foldl: OK
  5022. 1415.72 s [vector] +++ OK, passed 100 tests.
  5023. 1415.72 s [vector] mut_foldl': OK
  5024. 1415.72 s [vector] +++ OK, passed 100 tests.
  5025. 1415.72 s [vector] mut_ifoldr: OK
  5026. 1415.72 s [vector] +++ OK, passed 100 tests.
  5027. 1415.72 s [vector] mut_ifoldr': OK
  5028. 1415.72 s [vector] +++ OK, passed 100 tests.
  5029. 1415.72 s [vector] mut_ifoldl: OK
  5030. 1415.72 s [vector] +++ OK, passed 100 tests.
  5031. 1415.72 s [vector] mut_ifoldl': OK
  5032. 1415.72 s [vector] +++ OK, passed 100 tests.
  5033. 1415.72 s [vector] mut_foldM: OK
  5034. 1415.72 s [vector] +++ OK, passed 100 tests.
  5035. 1415.72 s [vector] mut_foldM': OK
  5036. 1415.72 s [vector] +++ OK, passed 100 tests.
  5037. 1415.72 s [vector] mut_foldrM: OK
  5038. 1415.72 s [vector] +++ OK, passed 100 tests.
  5039. 1415.72 s [vector] mut_foldrM': OK
  5040. 1415.72 s [vector] +++ OK, passed 100 tests.
  5041. 1415.72 s [vector] mut_ifoldM: OK
  5042. 1415.72 s [vector] +++ OK, passed 100 tests.
  5043. 1415.72 s [vector] mut_ifoldM': OK
  5044. 1415.72 s [vector] +++ OK, passed 100 tests.
  5045. 1415.72 s [vector] mut_ifoldrM: OK
  5046. 1415.72 s [vector] +++ OK, passed 100 tests.
  5047. 1415.72 s [vector] mut_ifoldrM': OK
  5048. 1415.72 s [vector] +++ OK, passed 100 tests.
  5049. 1415.72 s [vector] compare: OK
  5050. 1415.72 s [vector] +++ OK, passed 100 tests.
  5051. 1415.72 s [vector] maximum: OK
  5052. 1415.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5053. 1415.72 s [vector] minimum: OK
  5054. 1415.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5055. 1415.72 s [vector] minIndex: OK
  5056. 1415.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5057. 1415.72 s [vector] maxIndex: OK
  5058. 1415.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5059. 1415.72 s [vector] maximumBy: OK
  5060. 1415.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5061. 1415.72 s [vector] minimumBy: OK
  5062. 1415.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5063. 1415.72 s [vector] maximumOn: OK
  5064. 1415.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5065. 1415.72 s [vector] minimumOn: OK
  5066. 1415.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5067. 1415.72 s [vector] maxIndexBy: OK
  5068. 1415.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5069. 1415.72 s [vector] minIndexBy: OK
  5070. 1415.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5071. 1415.72 s [vector] ListFirstMaxIndexWins: OK
  5072. 1415.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5073. 1415.72 s [vector] FalseListFirstMaxIndexWins: OK
  5074. 1415.72 s [vector] +++ OK, failed as expected. (after 1 test):
  5075. 1415.72 s [vector] Exception:
  5076. 1415.72 s [vector] Prelude.foldr1: empty list
  5077. 1415.72 s [vector] CallStack (from HasCallStack):
  5078. 1415.72 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  5079. 1415.72 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  5080. 1415.72 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5081. 1415.72 s [vector] []
  5082. 1415.72 s [vector] mempty: OK
  5083. 1415.72 s [vector] +++ OK, passed 100 tests.
  5084. 1415.72 s [vector] mappend: OK
  5085. 1415.72 s [vector] +++ OK, passed 100 tests.
  5086. 1415.72 s [vector] mconcat: OK (0.02s)
  5087. 1415.72 s [vector] +++ OK, passed 100 tests.
  5088. 1415.72 s [vector] glength: OK
  5089. 1415.72 s [vector] +++ OK, passed 100 tests.
  5090. 1415.72 s [vector] sum: OK
  5091. 1415.72 s [vector] +++ OK, passed 100 tests.
  5092. 1415.72 s [vector] product: OK
  5093. 1415.72 s [vector] +++ OK, passed 100 tests.
  5094. 1415.72 s [vector] enumFromN: OK
  5095. 1415.72 s [vector] +++ OK, passed 100 tests.
  5096. 1415.72 s [vector] enumFromThenN: OK
  5097. 1415.72 s [vector] +++ OK, passed 100 tests.
  5098. 1415.72 s [vector] enumFromTo: OK
  5099. 1415.72 s [vector] +++ OK, passed 100 tests.
  5100. 1415.72 s [vector] enumFromThenTo: OK
  5101. 1415.72 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5102. 1415.72 s [vector] Double
  5103. 1415.72 s [vector] fromList.toList == id: OK
  5104. 1415.72 s [vector] +++ OK, passed 100 tests.
  5105. 1415.72 s [vector] toList.fromList == id: OK
  5106. 1415.72 s [vector] +++ OK, passed 100 tests.
  5107. 1415.72 s [vector] unstream.stream == id: OK
  5108. 1415.72 s [vector] +++ OK, passed 100 tests.
  5109. 1415.72 s [vector] stream.unstream == id: OK
  5110. 1415.72 s [vector] +++ OK, passed 100 tests.
  5111. 1415.72 s [vector] eq: OK
  5112. 1415.72 s [vector] +++ OK, passed 100 tests.
  5113. 1415.72 s [vector] length: OK
  5114. 1415.72 s [vector] +++ OK, passed 100 tests.
  5115. 1415.72 s [vector] null: OK
  5116. 1415.72 s [vector] +++ OK, passed 100 tests.
  5117. 1415.72 s [vector] index: OK
  5118. 1415.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5119. 1415.72 s [vector] safeIndex: OK
  5120. 1415.72 s [vector] +++ OK, passed 100 tests.
  5121. 1415.72 s [vector] head: OK
  5122. 1415.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5123. 1415.72 s [vector] last: OK
  5124. 1415.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5125. 1415.72 s [vector] unsafeIndex: OK
  5126. 1415.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5127. 1415.72 s [vector] unsafeHead: OK
  5128. 1415.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5129. 1415.72 s [vector] unsafeLast: OK
  5130. 1415.72 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5131. 1415.72 s [vector] slice: OK
  5132. 1415.72 s [vector] +++ OK, passed 100 tests.
  5133. 1415.72 s [vector] init: OK
  5134. 1415.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5135. 1415.72 s [vector] tail: OK
  5136. 1415.72 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5137. 1415.72 s [vector] take: OK
  5138. 1415.72 s [vector] +++ OK, passed 100 tests.
  5139. 1415.72 s [vector] drop: OK
  5140. 1415.72 s [vector] +++ OK, passed 100 tests.
  5141. 1415.72 s [vector] splitAt: OK
  5142. 1415.72 s [vector] +++ OK, passed 100 tests.
  5143. 1415.72 s [vector] empty: OK
  5144. 1415.72 s [vector] +++ OK, passed 100 tests.
  5145. 1415.72 s [vector] singleton: OK
  5146. 1415.72 s [vector] +++ OK, passed 100 tests.
  5147. 1415.72 s [vector] replicate: OK
  5148. 1415.72 s [vector] +++ OK, passed 100 tests.
  5149. 1415.72 s [vector] generate: OK
  5150. 1415.72 s [vector] +++ OK, passed 100 tests.
  5151. 1415.72 s [vector] iterateN: OK
  5152. 1415.72 s [vector] +++ OK, passed 100 tests.
  5153. 1415.72 s [vector] iterateNM: OK (0.04s)
  5154. 1415.72 s [vector] +++ OK, passed 100 tests.
  5155. 1415.72 s [vector] generateM: OK (0.04s)
  5156. 1415.72 s [vector] +++ OK, passed 100 tests.
  5157. 1415.72 s [vector] replicateM: OK
  5158. 1415.72 s [vector] +++ OK, passed 100 tests.
  5159. 1415.72 s [vector] create: OK
  5160. 1415.72 s [vector] +++ OK, passed 100 tests.
  5161. 1415.72 s [vector] createT: OK
  5162. 1415.72 s [vector] +++ OK, passed 100 tests.
  5163. 1415.72 s [vector] unfoldr: OK
  5164. 1415.72 s [vector] +++ OK, passed 100 tests.
  5165. 1415.72 s [vector] unfoldrN: OK
  5166. 1415.72 s [vector] +++ OK, passed 100 tests.
  5167. 1415.72 s [vector] unfoldrExactN: OK
  5168. 1415.72 s [vector] +++ OK, passed 100 tests.
  5169. 1415.72 s [vector] unfoldrM: OK
  5170. 1415.72 s [vector] +++ OK, passed 100 tests.
  5171. 1415.72 s [vector] unfoldrNM: OK
  5172. 1415.72 s [vector] +++ OK, passed 100 tests.
  5173. 1415.72 s [vector] unfoldrExactNM: OK (0.02s)
  5174. 1415.72 s [vector] +++ OK, passed 100 tests.
  5175. 1415.72 s [vector] constructN: OK
  5176. 1415.72 s [vector] +++ OK, passed 100 tests.
  5177. 1415.73 s [vector] constructrN: OK (0.02s)
  5178. 1415.73 s [vector] +++ OK, passed 100 tests.
  5179. 1415.73 s [vector] cons: OK
  5180. 1415.73 s [vector] +++ OK, passed 100 tests.
  5181. 1415.73 s [vector] snoc: OK
  5182. 1415.73 s [vector] +++ OK, passed 100 tests.
  5183. 1415.73 s [vector] append: OK
  5184. 1415.73 s [vector] +++ OK, passed 100 tests.
  5185. 1415.73 s [vector] concat: OK (0.03s)
  5186. 1415.73 s [vector] +++ OK, passed 100 tests.
  5187. 1415.73 s [vector] force: OK
  5188. 1415.73 s [vector] +++ OK, passed 100 tests.
  5189. 1415.73 s [vector] upd: OK
  5190. 1415.73 s [vector] +++ OK, passed 100 tests.
  5191. 1415.73 s [vector] accum: OK (0.02s)
  5192. 1415.73 s [vector] +++ OK, passed 100 tests.
  5193. 1415.73 s [vector] reverse: OK
  5194. 1415.73 s [vector] +++ OK, passed 100 tests.
  5195. 1415.73 s [vector] backpermute: OK
  5196. 1415.73 s [vector] +++ OK, passed 100 tests.
  5197. 1415.73 s [vector] map: OK
  5198. 1415.73 s [vector] +++ OK, passed 100 tests.
  5199. 1415.73 s [vector] imap: OK
  5200. 1415.73 s [vector] +++ OK, passed 100 tests.
  5201. 1415.73 s [vector] concatMap: OK
  5202. 1415.73 s [vector] +++ OK, passed 100 tests.
  5203. 1415.73 s [vector] mapM: OK
  5204. 1415.73 s [vector] +++ OK, passed 100 tests.
  5205. 1415.73 s [vector] mapM_: OK (0.03s)
  5206. 1415.73 s [vector] +++ OK, passed 100 tests.
  5207. 1415.73 s [vector] forM: OK
  5208. 1415.73 s [vector] +++ OK, passed 100 tests.
  5209. 1415.73 s [vector] forM_: OK (0.04s)
  5210. 1415.73 s [vector] +++ OK, passed 100 tests.
  5211. 1415.73 s [vector] imapM: OK
  5212. 1415.73 s [vector] +++ OK, passed 100 tests.
  5213. 1415.73 s [vector] imapM_: OK (0.03s)
  5214. 1415.73 s [vector] +++ OK, passed 100 tests.
  5215. 1415.73 s [vector] zipWith: OK
  5216. 1415.73 s [vector] +++ OK, passed 100 tests.
  5217. 1415.73 s [vector] zipWith3: OK (0.01s)
  5218. 1415.73 s [vector] +++ OK, passed 100 tests.
  5219. 1415.73 s [vector] izipWith: OK
  5220. 1415.73 s [vector] +++ OK, passed 100 tests.
  5221. 1415.73 s [vector] izipWith3: OK (0.02s)
  5222. 1415.73 s [vector] +++ OK, passed 100 tests.
  5223. 1415.73 s [vector] izipWithM: OK (0.01s)
  5224. 1415.73 s [vector] +++ OK, passed 100 tests.
  5225. 1415.73 s [vector] izipWithM_: OK (0.04s)
  5226. 1415.73 s [vector] +++ OK, passed 100 tests.
  5227. 1415.73 s [vector] zipWithM: OK (0.01s)
  5228. 1415.73 s [vector] +++ OK, passed 100 tests.
  5229. 1415.73 s [vector] zipWithM_: OK (0.03s)
  5230. 1415.73 s [vector] +++ OK, passed 100 tests.
  5231. 1415.73 s [vector] filter: OK
  5232. 1415.73 s [vector] +++ OK, passed 100 tests.
  5233. 1415.73 s [vector] ifilter: OK
  5234. 1415.73 s [vector] +++ OK, passed 100 tests.
  5235. 1415.73 s [vector] filterM: OK (0.05s)
  5236. 1415.73 s [vector] +++ OK, passed 100 tests.
  5237. 1415.73 s [vector] uniq: OK
  5238. 1415.73 s [vector] +++ OK, passed 100 tests.
  5239. 1415.73 s [vector] mapMaybe: OK
  5240. 1415.73 s [vector] +++ OK, passed 100 tests.
  5241. 1415.73 s [vector] imapMaybe: OK
  5242. 1415.73 s [vector] +++ OK, passed 100 tests.
  5243. 1415.73 s [vector] takeWhile: OK
  5244. 1415.73 s [vector] +++ OK, passed 100 tests.
  5245. 1415.73 s [vector] dropWhile: OK
  5246. 1415.73 s [vector] +++ OK, passed 100 tests.
  5247. 1415.73 s [vector] partition: OK
  5248. 1415.73 s [vector] +++ OK, passed 100 tests.
  5249. 1415.73 s [vector] partitionWith: OK
  5250. 1415.73 s [vector] +++ OK, passed 100 tests.
  5251. 1415.73 s [vector] span: OK
  5252. 1415.73 s [vector] +++ OK, passed 100 tests.
  5253. 1415.73 s [vector] break: OK
  5254. 1415.73 s [vector] +++ OK, passed 100 tests.
  5255. 1415.73 s [vector] spanR: OK
  5256. 1415.73 s [vector] +++ OK, passed 100 tests.
  5257. 1415.73 s [vector] breakR: OK
  5258. 1415.73 s [vector] +++ OK, passed 100 tests.
  5259. 1415.73 s [vector] groupBy: OK
  5260. 1415.73 s [vector] +++ OK, passed 100 tests.
  5261. 1415.73 s [vector] elem: OK
  5262. 1415.73 s [vector] +++ OK, passed 100 tests.
  5263. 1415.73 s [vector] notElem: OK
  5264. 1415.73 s [vector] +++ OK, passed 100 tests.
  5265. 1415.73 s [vector] find: OK
  5266. 1415.73 s [vector] +++ OK, passed 100 tests.
  5267. 1415.73 s [vector] findIndex: OK
  5268. 1415.73 s [vector] +++ OK, passed 100 tests.
  5269. 1415.73 s [vector] findIndexR: OK
  5270. 1415.73 s [vector] +++ OK, passed 100 tests.
  5271. 1415.73 s [vector] findIndices: OK
  5272. 1415.73 s [vector] +++ OK, passed 100 tests.
  5273. 1415.73 s [vector] elemIndex: OK
  5274. 1415.73 s [vector] +++ OK, passed 100 tests.
  5275. 1415.73 s [vector] elemIndices: OK
  5276. 1415.73 s [vector] +++ OK, passed 100 tests.
  5277. 1415.73 s [vector] foldl: OK (0.01s)
  5278. 1415.73 s [vector] +++ OK, passed 100 tests.
  5279. 1415.73 s [vector] foldl1: OK (0.02s)
  5280. 1415.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5281. 1415.73 s [vector] foldl': OK (0.02s)
  5282. 1415.73 s [vector] +++ OK, passed 100 tests.
  5283. 1415.73 s [vector] foldl1': OK (0.02s)
  5284. 1415.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5285. 1415.73 s [vector] foldr: OK (0.02s)
  5286. 1415.73 s [vector] +++ OK, passed 100 tests.
  5287. 1415.73 s [vector] foldr1: OK (0.01s)
  5288. 1415.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5289. 1415.73 s [vector] foldr': OK (0.01s)
  5290. 1415.73 s [vector] +++ OK, passed 100 tests.
  5291. 1415.73 s [vector] foldr1': OK (0.02s)
  5292. 1415.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5293. 1415.73 s [vector] ifoldl: OK (0.02s)
  5294. 1415.73 s [vector] +++ OK, passed 100 tests.
  5295. 1415.73 s [vector] ifoldl': OK (0.02s)
  5296. 1415.73 s [vector] +++ OK, passed 100 tests.
  5297. 1415.73 s [vector] ifoldr: OK (0.02s)
  5298. 1415.73 s [vector] +++ OK, passed 100 tests.
  5299. 1415.73 s [vector] ifoldr': OK (0.02s)
  5300. 1415.73 s [vector] +++ OK, passed 100 tests.
  5301. 1415.73 s [vector] ifoldM: OK (0.02s)
  5302. 1415.73 s [vector] +++ OK, passed 100 tests.
  5303. 1415.73 s [vector] ifoldM': OK (0.01s)
  5304. 1415.73 s [vector] +++ OK, passed 100 tests.
  5305. 1415.73 s [vector] ifoldM_: OK (0.04s)
  5306. 1415.73 s [vector] +++ OK, passed 100 tests.
  5307. 1415.73 s [vector] ifoldM'_: OK (0.05s)
  5308. 1415.73 s [vector] +++ OK, passed 100 tests.
  5309. 1415.73 s [vector] all: OK
  5310. 1415.73 s [vector] +++ OK, passed 100 tests.
  5311. 1415.73 s [vector] any: OK
  5312. 1415.73 s [vector] +++ OK, passed 100 tests.
  5313. 1415.73 s [vector] prescanl: OK (0.01s)
  5314. 1415.73 s [vector] +++ OK, passed 100 tests.
  5315. 1415.73 s [vector] prescanl': OK (0.02s)
  5316. 1415.73 s [vector] +++ OK, passed 100 tests.
  5317. 1415.73 s [vector] postscanl: OK (0.02s)
  5318. 1415.73 s [vector] +++ OK, passed 100 tests.
  5319. 1415.73 s [vector] postscanl': OK (0.01s)
  5320. 1415.73 s [vector] +++ OK, passed 100 tests.
  5321. 1415.73 s [vector] scanl: OK (0.01s)
  5322. 1415.73 s [vector] +++ OK, passed 100 tests.
  5323. 1415.73 s [vector] scanl': OK (0.01s)
  5324. 1415.73 s [vector] +++ OK, passed 100 tests.
  5325. 1415.73 s [vector] scanl1: OK (0.01s)
  5326. 1415.73 s [vector] +++ OK, passed 100 tests.
  5327. 1415.73 s [vector] scanl1': OK (0.01s)
  5328. 1415.73 s [vector] +++ OK, passed 100 tests.
  5329. 1415.73 s [vector] iscanl: OK (0.01s)
  5330. 1415.73 s [vector] +++ OK, passed 100 tests.
  5331. 1415.73 s [vector] iscanl': OK (0.02s)
  5332. 1415.73 s [vector] +++ OK, passed 100 tests.
  5333. 1415.73 s [vector] prescanr: OK (0.01s)
  5334. 1415.73 s [vector] +++ OK, passed 100 tests.
  5335. 1415.73 s [vector] prescanr': OK (0.01s)
  5336. 1415.73 s [vector] +++ OK, passed 100 tests.
  5337. 1415.73 s [vector] postscanr: OK (0.01s)
  5338. 1415.73 s [vector] +++ OK, passed 100 tests.
  5339. 1415.73 s [vector] postscanr': OK (0.02s)
  5340. 1415.73 s [vector] +++ OK, passed 100 tests.
  5341. 1415.73 s [vector] scanr: OK (0.02s)
  5342. 1415.73 s [vector] +++ OK, passed 100 tests.
  5343. 1415.73 s [vector] scanr': OK
  5344. 1415.73 s [vector] +++ OK, passed 100 tests.
  5345. 1415.73 s [vector] scanr1: OK (0.01s)
  5346. 1415.73 s [vector] +++ OK, passed 100 tests.
  5347. 1415.73 s [vector] scanr1': OK (0.01s)
  5348. 1415.73 s [vector] +++ OK, passed 100 tests.
  5349. 1415.73 s [vector] iscanr: OK (0.01s)
  5350. 1415.73 s [vector] +++ OK, passed 100 tests.
  5351. 1415.73 s [vector] iscanr': OK (0.01s)
  5352. 1415.73 s [vector] +++ OK, passed 100 tests.
  5353. 1415.73 s [vector] mut_read: OK
  5354. 1415.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5355. 1415.73 s [vector] mut_write: OK
  5356. 1415.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5357. 1415.73 s [vector] mut_modify: OK
  5358. 1415.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5359. 1415.73 s [vector] mut_generate: OK
  5360. 1415.73 s [vector] +++ OK, passed 100 tests.
  5361. 1415.73 s [vector] mut_generateM: OK (0.03s)
  5362. 1415.73 s [vector] +++ OK, passed 100 tests.
  5363. 1415.73 s [vector] mut_mapM_: OK (0.04s)
  5364. 1415.73 s [vector] +++ OK, passed 100 tests.
  5365. 1415.73 s [vector] mut_imapM_: OK (0.05s)
  5366. 1415.73 s [vector] +++ OK, passed 100 tests.
  5367. 1415.73 s [vector] mut_forM_: OK (0.04s)
  5368. 1415.73 s [vector] +++ OK, passed 100 tests.
  5369. 1415.73 s [vector] mut_iforM_: OK (0.04s)
  5370. 1415.73 s [vector] +++ OK, passed 100 tests.
  5371. 1415.73 s [vector] mut_foldr: OK (0.01s)
  5372. 1415.73 s [vector] +++ OK, passed 100 tests.
  5373. 1415.73 s [vector] mut_foldr': OK (0.01s)
  5374. 1415.73 s [vector] +++ OK, passed 100 tests.
  5375. 1415.73 s [vector] mut_foldl: OK (0.01s)
  5376. 1415.73 s [vector] +++ OK, passed 100 tests.
  5377. 1415.73 s [vector] mut_foldl': OK (0.01s)
  5378. 1415.73 s [vector] +++ OK, passed 100 tests.
  5379. 1415.73 s [vector] mut_ifoldr: OK (0.01s)
  5380. 1415.73 s [vector] +++ OK, passed 100 tests.
  5381. 1415.73 s [vector] mut_ifoldr': OK (0.01s)
  5382. 1415.73 s [vector] +++ OK, passed 100 tests.
  5383. 1415.73 s [vector] mut_ifoldl: OK (0.01s)
  5384. 1415.73 s [vector] +++ OK, passed 100 tests.
  5385. 1415.73 s [vector] mut_ifoldl': OK (0.02s)
  5386. 1415.73 s [vector] +++ OK, passed 100 tests.
  5387. 1415.73 s [vector] mut_foldM: OK (0.01s)
  5388. 1415.73 s [vector] +++ OK, passed 100 tests.
  5389. 1415.73 s [vector] mut_foldM': OK (0.01s)
  5390. 1415.73 s [vector] +++ OK, passed 100 tests.
  5391. 1415.73 s [vector] mut_foldrM: OK (0.01s)
  5392. 1415.73 s [vector] +++ OK, passed 100 tests.
  5393. 1415.73 s [vector] mut_foldrM': OK (0.01s)
  5394. 1415.73 s [vector] +++ OK, passed 100 tests.
  5395. 1415.73 s [vector] mut_ifoldM: OK (0.01s)
  5396. 1415.73 s [vector] +++ OK, passed 100 tests.
  5397. 1415.73 s [vector] mut_ifoldM': OK (0.02s)
  5398. 1415.73 s [vector] +++ OK, passed 100 tests.
  5399. 1415.73 s [vector] mut_ifoldrM: OK (0.02s)
  5400. 1415.73 s [vector] +++ OK, passed 100 tests.
  5401. 1415.73 s [vector] mut_ifoldrM': OK (0.02s)
  5402. 1415.73 s [vector] +++ OK, passed 100 tests.
  5403. 1415.73 s [vector] compare: OK
  5404. 1415.73 s [vector] +++ OK, passed 100 tests.
  5405. 1415.73 s [vector] maximum: OK
  5406. 1415.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5407. 1415.73 s [vector] minimum: OK
  5408. 1415.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5409. 1415.73 s [vector] minIndex: OK
  5410. 1415.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5411. 1415.73 s [vector] maxIndex: OK
  5412. 1415.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5413. 1415.73 s [vector] maximumBy: OK
  5414. 1415.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5415. 1415.73 s [vector] minimumBy: OK
  5416. 1415.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5417. 1415.73 s [vector] maximumOn: OK
  5418. 1415.73 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5419. 1415.73 s [vector] minimumOn: OK
  5420. 1415.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5421. 1415.73 s [vector] maxIndexBy: OK
  5422. 1415.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5423. 1415.73 s [vector] minIndexBy: OK
  5424. 1415.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5425. 1415.73 s [vector] ListFirstMaxIndexWins: OK
  5426. 1415.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5427. 1415.73 s [vector] FalseListFirstMaxIndexWins: OK
  5428. 1415.73 s [vector] +++ OK, failed as expected. (after 1 test):
  5429. 1415.73 s [vector] Exception:
  5430. 1415.73 s [vector] Prelude.foldr1: empty list
  5431. 1415.73 s [vector] CallStack (from HasCallStack):
  5432. 1415.73 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  5433. 1415.73 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  5434. 1415.73 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5435. 1415.73 s [vector] []
  5436. 1415.73 s [vector] mempty: OK
  5437. 1415.73 s [vector] +++ OK, passed 100 tests.
  5438. 1415.73 s [vector] mappend: OK
  5439. 1415.73 s [vector] +++ OK, passed 100 tests.
  5440. 1415.73 s [vector] mconcat: OK (0.03s)
  5441. 1415.73 s [vector] +++ OK, passed 100 tests.
  5442. 1415.73 s [vector] glength: OK
  5443. 1415.73 s [vector] +++ OK, passed 100 tests.
  5444. 1415.73 s [vector] sum: OK
  5445. 1415.73 s [vector] +++ OK, passed 100 tests.
  5446. 1415.73 s [vector] product: OK
  5447. 1415.73 s [vector] +++ OK, passed 100 tests.
  5448. 1415.73 s [vector] enumFromN: OK
  5449. 1415.73 s [vector] +++ OK, passed 100 tests.
  5450. 1415.73 s [vector] enumFromThenN: OK
  5451. 1415.73 s [vector] +++ OK, passed 100 tests.
  5452. 1415.73 s [vector] enumFromTo: OK
  5453. 1415.73 s [vector] +++ OK, passed 100 tests.
  5454. 1415.73 s [vector] enumFromThenTo: OK
  5455. 1415.73 s [vector] +++ OK, passed 100 tests; 3 discarded.
  5456. 1415.73 s [vector] unstream
  5457. 1415.73 s [vector] unstream == vunstream (exact): OK
  5458. 1415.73 s [vector] +++ OK, passed 100 tests.
  5459. 1415.73 s [vector] unstream == vunstream (unknown): OK
  5460. 1415.73 s [vector] +++ OK, passed 100 tests.
  5461. 1415.73 s [vector] unstreamR ~= vunstream (exact): OK
  5462. 1415.73 s [vector] +++ OK, passed 100 tests.
  5463. 1415.73 s [vector] unstreamR ~= vunstream (unknown): OK
  5464. 1415.73 s [vector] +++ OK, passed 100 tests.
  5465. 1415.73 s [vector] Tests.Vector.Storable
  5466. 1415.73 s [vector] Data.Vector.Storable.Vector (Int)
  5467. 1415.73 s [vector] fromList.toList == id: OK
  5468. 1415.73 s [vector] +++ OK, passed 100 tests.
  5469. 1415.73 s [vector] toList.fromList == id: OK
  5470. 1415.73 s [vector] +++ OK, passed 100 tests.
  5471. 1415.73 s [vector] unstream.stream == id: OK
  5472. 1415.73 s [vector] +++ OK, passed 100 tests.
  5473. 1415.73 s [vector] stream.unstream == id: OK
  5474. 1415.73 s [vector] +++ OK, passed 100 tests.
  5475. 1415.73 s [vector] eq: OK
  5476. 1415.74 s [vector] +++ OK, passed 100 tests.
  5477. 1415.74 s [vector] length: OK
  5478. 1415.74 s [vector] +++ OK, passed 100 tests.
  5479. 1415.74 s [vector] null: OK
  5480. 1415.74 s [vector] +++ OK, passed 100 tests.
  5481. 1415.74 s [vector] index: OK
  5482. 1415.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5483. 1415.74 s [vector] safeIndex: OK
  5484. 1415.74 s [vector] +++ OK, passed 100 tests.
  5485. 1415.74 s [vector] head: OK
  5486. 1415.74 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5487. 1415.74 s [vector] last: OK
  5488. 1415.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5489. 1415.74 s [vector] unsafeIndex: OK
  5490. 1415.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5491. 1415.74 s [vector] unsafeHead: OK
  5492. 1415.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5493. 1415.74 s [vector] unsafeLast: OK
  5494. 1415.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5495. 1415.74 s [vector] slice: OK
  5496. 1415.74 s [vector] +++ OK, passed 100 tests.
  5497. 1415.74 s [vector] init: OK
  5498. 1415.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5499. 1415.74 s [vector] tail: OK
  5500. 1415.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5501. 1415.74 s [vector] take: OK
  5502. 1415.74 s [vector] +++ OK, passed 100 tests.
  5503. 1415.74 s [vector] drop: OK
  5504. 1415.74 s [vector] +++ OK, passed 100 tests.
  5505. 1415.74 s [vector] splitAt: OK
  5506. 1415.74 s [vector] +++ OK, passed 100 tests.
  5507. 1415.74 s [vector] empty: OK
  5508. 1415.74 s [vector] +++ OK, passed 100 tests.
  5509. 1415.74 s [vector] singleton: OK
  5510. 1415.74 s [vector] +++ OK, passed 100 tests.
  5511. 1415.74 s [vector] replicate: OK
  5512. 1415.74 s [vector] +++ OK, passed 100 tests.
  5513. 1415.74 s [vector] generate: OK
  5514. 1415.74 s [vector] +++ OK, passed 100 tests.
  5515. 1415.74 s [vector] iterateN: OK
  5516. 1415.74 s [vector] +++ OK, passed 100 tests.
  5517. 1415.74 s [vector] iterateNM: OK (0.01s)
  5518. 1415.74 s [vector] +++ OK, passed 100 tests.
  5519. 1415.74 s [vector] generateM: OK (0.03s)
  5520. 1415.74 s [vector] +++ OK, passed 100 tests.
  5521. 1415.74 s [vector] replicateM: OK (0.02s)
  5522. 1415.74 s [vector] +++ OK, passed 100 tests.
  5523. 1415.74 s [vector] create: OK
  5524. 1415.74 s [vector] +++ OK, passed 100 tests.
  5525. 1415.74 s [vector] createT: OK
  5526. 1415.74 s [vector] +++ OK, passed 100 tests.
  5527. 1415.74 s [vector] unfoldr: OK
  5528. 1415.74 s [vector] +++ OK, passed 100 tests.
  5529. 1415.74 s [vector] unfoldrN: OK
  5530. 1415.74 s [vector] +++ OK, passed 100 tests.
  5531. 1415.74 s [vector] unfoldrExactN: OK
  5532. 1415.74 s [vector] +++ OK, passed 100 tests.
  5533. 1415.74 s [vector] unfoldrM: OK
  5534. 1415.74 s [vector] +++ OK, passed 100 tests.
  5535. 1415.74 s [vector] unfoldrNM: OK
  5536. 1415.74 s [vector] +++ OK, passed 100 tests.
  5537. 1415.74 s [vector] unfoldrExactNM: OK (0.05s)
  5538. 1415.74 s [vector] +++ OK, passed 100 tests.
  5539. 1415.74 s [vector] constructN: OK
  5540. 1415.74 s [vector] +++ OK, passed 100 tests.
  5541. 1415.74 s [vector] constructrN: OK
  5542. 1415.74 s [vector] +++ OK, passed 100 tests.
  5543. 1415.74 s [vector] cons: OK
  5544. 1415.74 s [vector] +++ OK, passed 100 tests.
  5545. 1415.74 s [vector] snoc: OK
  5546. 1415.74 s [vector] +++ OK, passed 100 tests.
  5547. 1415.74 s [vector] append: OK
  5548. 1415.74 s [vector] +++ OK, passed 100 tests.
  5549. 1415.74 s [vector] concat: OK (0.01s)
  5550. 1415.74 s [vector] +++ OK, passed 100 tests.
  5551. 1415.74 s [vector] force: OK
  5552. 1415.74 s [vector] +++ OK, passed 100 tests.
  5553. 1415.74 s [vector] upd: OK
  5554. 1415.74 s [vector] +++ OK, passed 100 tests.
  5555. 1415.74 s [vector] accum: OK
  5556. 1415.74 s [vector] +++ OK, passed 100 tests.
  5557. 1415.74 s [vector] reverse: OK
  5558. 1415.74 s [vector] +++ OK, passed 100 tests.
  5559. 1415.74 s [vector] backpermute: OK
  5560. 1415.74 s [vector] +++ OK, passed 100 tests.
  5561. 1415.74 s [vector] map: OK
  5562. 1415.74 s [vector] +++ OK, passed 100 tests.
  5563. 1415.74 s [vector] imap: OK
  5564. 1415.74 s [vector] +++ OK, passed 100 tests.
  5565. 1415.74 s [vector] concatMap: OK
  5566. 1415.74 s [vector] +++ OK, passed 100 tests.
  5567. 1415.74 s [vector] mapM: OK
  5568. 1415.74 s [vector] +++ OK, passed 100 tests.
  5569. 1415.74 s [vector] mapM_: OK (0.02s)
  5570. 1415.74 s [vector] +++ OK, passed 100 tests.
  5571. 1415.74 s [vector] forM: OK
  5572. 1415.74 s [vector] +++ OK, passed 100 tests.
  5573. 1415.74 s [vector] forM_: OK (0.02s)
  5574. 1415.74 s [vector] +++ OK, passed 100 tests.
  5575. 1415.74 s [vector] imapM: OK
  5576. 1415.74 s [vector] +++ OK, passed 100 tests.
  5577. 1415.74 s [vector] imapM_: OK (0.02s)
  5578. 1415.74 s [vector] +++ OK, passed 100 tests.
  5579. 1415.74 s [vector] zipWith: OK
  5580. 1415.74 s [vector] +++ OK, passed 100 tests.
  5581. 1415.74 s [vector] zipWith3: OK
  5582. 1415.74 s [vector] +++ OK, passed 100 tests.
  5583. 1415.74 s [vector] izipWith: OK
  5584. 1415.74 s [vector] +++ OK, passed 100 tests.
  5585. 1415.74 s [vector] izipWith3: OK
  5586. 1415.74 s [vector] +++ OK, passed 100 tests.
  5587. 1415.74 s [vector] izipWithM: OK
  5588. 1415.74 s [vector] +++ OK, passed 100 tests.
  5589. 1415.74 s [vector] izipWithM_: OK (0.01s)
  5590. 1415.74 s [vector] +++ OK, passed 100 tests.
  5591. 1415.74 s [vector] zipWithM: OK
  5592. 1415.74 s [vector] +++ OK, passed 100 tests.
  5593. 1415.74 s [vector] zipWithM_: OK (0.01s)
  5594. 1415.74 s [vector] +++ OK, passed 100 tests.
  5595. 1415.74 s [vector] filter: OK
  5596. 1415.74 s [vector] +++ OK, passed 100 tests.
  5597. 1415.74 s [vector] ifilter: OK
  5598. 1415.74 s [vector] +++ OK, passed 100 tests.
  5599. 1415.74 s [vector] filterM: OK (0.03s)
  5600. 1415.74 s [vector] +++ OK, passed 100 tests.
  5601. 1415.74 s [vector] uniq: OK
  5602. 1415.74 s [vector] +++ OK, passed 100 tests.
  5603. 1415.74 s [vector] mapMaybe: OK
  5604. 1415.74 s [vector] +++ OK, passed 100 tests.
  5605. 1415.74 s [vector] imapMaybe: OK
  5606. 1415.74 s [vector] +++ OK, passed 100 tests.
  5607. 1415.74 s [vector] takeWhile: OK
  5608. 1415.74 s [vector] +++ OK, passed 100 tests.
  5609. 1415.74 s [vector] dropWhile: OK
  5610. 1415.74 s [vector] +++ OK, passed 100 tests.
  5611. 1415.74 s [vector] partition: OK
  5612. 1415.74 s [vector] +++ OK, passed 100 tests.
  5613. 1415.74 s [vector] partitionWith: OK
  5614. 1415.74 s [vector] +++ OK, passed 100 tests.
  5615. 1415.74 s [vector] span: OK
  5616. 1415.74 s [vector] +++ OK, passed 100 tests.
  5617. 1415.74 s [vector] break: OK
  5618. 1415.74 s [vector] +++ OK, passed 100 tests.
  5619. 1415.74 s [vector] spanR: OK
  5620. 1415.74 s [vector] +++ OK, passed 100 tests.
  5621. 1415.74 s [vector] breakR: OK
  5622. 1415.74 s [vector] +++ OK, passed 100 tests.
  5623. 1415.74 s [vector] groupBy: OK
  5624. 1415.74 s [vector] +++ OK, passed 100 tests.
  5625. 1415.74 s [vector] elem: OK
  5626. 1415.74 s [vector] +++ OK, passed 100 tests.
  5627. 1415.74 s [vector] notElem: OK
  5628. 1415.74 s [vector] +++ OK, passed 100 tests.
  5629. 1415.74 s [vector] find: OK
  5630. 1415.74 s [vector] +++ OK, passed 100 tests.
  5631. 1415.74 s [vector] findIndex: OK
  5632. 1415.74 s [vector] +++ OK, passed 100 tests.
  5633. 1415.74 s [vector] findIndexR: OK
  5634. 1415.74 s [vector] +++ OK, passed 100 tests.
  5635. 1415.74 s [vector] findIndices: OK
  5636. 1415.74 s [vector] +++ OK, passed 100 tests.
  5637. 1415.74 s [vector] elemIndex: OK
  5638. 1415.74 s [vector] +++ OK, passed 100 tests.
  5639. 1415.74 s [vector] elemIndices: OK
  5640. 1415.74 s [vector] +++ OK, passed 100 tests.
  5641. 1415.74 s [vector] foldl: OK
  5642. 1415.74 s [vector] +++ OK, passed 100 tests.
  5643. 1415.74 s [vector] foldl1: OK
  5644. 1415.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5645. 1415.74 s [vector] foldl': OK
  5646. 1415.74 s [vector] +++ OK, passed 100 tests.
  5647. 1415.74 s [vector] foldl1': OK
  5648. 1415.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5649. 1415.74 s [vector] foldr: OK
  5650. 1415.74 s [vector] +++ OK, passed 100 tests.
  5651. 1415.74 s [vector] foldr1: OK
  5652. 1415.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5653. 1415.74 s [vector] foldr': OK
  5654. 1415.74 s [vector] +++ OK, passed 100 tests.
  5655. 1415.74 s [vector] foldr1': OK
  5656. 1415.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5657. 1415.74 s [vector] ifoldl: OK
  5658. 1415.74 s [vector] +++ OK, passed 100 tests.
  5659. 1415.74 s [vector] ifoldl': OK
  5660. 1415.74 s [vector] +++ OK, passed 100 tests.
  5661. 1415.74 s [vector] ifoldr: OK
  5662. 1415.74 s [vector] +++ OK, passed 100 tests.
  5663. 1415.74 s [vector] ifoldr': OK
  5664. 1415.74 s [vector] +++ OK, passed 100 tests.
  5665. 1415.74 s [vector] ifoldM: OK
  5666. 1415.74 s [vector] +++ OK, passed 100 tests.
  5667. 1415.74 s [vector] ifoldM': OK
  5668. 1415.74 s [vector] +++ OK, passed 100 tests.
  5669. 1415.74 s [vector] ifoldM_: OK (0.02s)
  5670. 1415.74 s [vector] +++ OK, passed 100 tests.
  5671. 1415.74 s [vector] ifoldM'_: OK (0.02s)
  5672. 1415.74 s [vector] +++ OK, passed 100 tests.
  5673. 1415.74 s [vector] all: OK
  5674. 1415.74 s [vector] +++ OK, passed 100 tests.
  5675. 1415.74 s [vector] any: OK
  5676. 1415.74 s [vector] +++ OK, passed 100 tests.
  5677. 1415.74 s [vector] prescanl: OK
  5678. 1415.74 s [vector] +++ OK, passed 100 tests.
  5679. 1415.74 s [vector] prescanl': OK
  5680. 1415.74 s [vector] +++ OK, passed 100 tests.
  5681. 1415.74 s [vector] postscanl: OK
  5682. 1415.74 s [vector] +++ OK, passed 100 tests.
  5683. 1415.74 s [vector] postscanl': OK
  5684. 1415.74 s [vector] +++ OK, passed 100 tests.
  5685. 1415.74 s [vector] scanl: OK
  5686. 1415.74 s [vector] +++ OK, passed 100 tests.
  5687. 1415.74 s [vector] scanl': OK
  5688. 1415.74 s [vector] +++ OK, passed 100 tests.
  5689. 1415.74 s [vector] scanl1: OK
  5690. 1415.74 s [vector] +++ OK, passed 100 tests.
  5691. 1415.74 s [vector] scanl1': OK
  5692. 1415.74 s [vector] +++ OK, passed 100 tests.
  5693. 1415.74 s [vector] iscanl: OK
  5694. 1415.74 s [vector] +++ OK, passed 100 tests.
  5695. 1415.74 s [vector] iscanl': OK
  5696. 1415.74 s [vector] +++ OK, passed 100 tests.
  5697. 1415.74 s [vector] prescanr: OK
  5698. 1415.74 s [vector] +++ OK, passed 100 tests.
  5699. 1415.75 s [vector] prescanr': OK
  5700. 1415.75 s [vector] +++ OK, passed 100 tests.
  5701. 1415.75 s [vector] postscanr: OK
  5702. 1415.75 s [vector] +++ OK, passed 100 tests.
  5703. 1415.75 s [vector] postscanr': OK
  5704. 1415.75 s [vector] +++ OK, passed 100 tests.
  5705. 1415.75 s [vector] scanr: OK
  5706. 1415.75 s [vector] +++ OK, passed 100 tests.
  5707. 1415.75 s [vector] scanr': OK
  5708. 1415.75 s [vector] +++ OK, passed 100 tests.
  5709. 1415.75 s [vector] scanr1: OK
  5710. 1415.75 s [vector] +++ OK, passed 100 tests.
  5711. 1415.75 s [vector] scanr1': OK
  5712. 1415.75 s [vector] +++ OK, passed 100 tests.
  5713. 1415.75 s [vector] iscanr: OK
  5714. 1415.75 s [vector] +++ OK, passed 100 tests.
  5715. 1415.75 s [vector] iscanr': OK
  5716. 1415.75 s [vector] +++ OK, passed 100 tests.
  5717. 1415.75 s [vector] mut_read: OK
  5718. 1415.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5719. 1415.75 s [vector] mut_write: OK
  5720. 1415.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5721. 1415.75 s [vector] mut_modify: OK
  5722. 1415.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5723. 1415.75 s [vector] mut_generate: OK
  5724. 1415.75 s [vector] +++ OK, passed 100 tests.
  5725. 1415.75 s [vector] mut_generateM: OK (0.01s)
  5726. 1415.75 s [vector] +++ OK, passed 100 tests.
  5727. 1415.75 s [vector] mut_mapM_: OK (0.02s)
  5728. 1415.75 s [vector] +++ OK, passed 100 tests.
  5729. 1415.75 s [vector] mut_imapM_: OK (0.02s)
  5730. 1415.75 s [vector] +++ OK, passed 100 tests.
  5731. 1415.75 s [vector] mut_forM_: OK (0.02s)
  5732. 1415.75 s [vector] +++ OK, passed 100 tests.
  5733. 1415.75 s [vector] mut_iforM_: OK (0.02s)
  5734. 1415.75 s [vector] +++ OK, passed 100 tests.
  5735. 1415.75 s [vector] mut_foldr: OK
  5736. 1415.75 s [vector] +++ OK, passed 100 tests.
  5737. 1415.75 s [vector] mut_foldr': OK
  5738. 1415.75 s [vector] +++ OK, passed 100 tests.
  5739. 1415.75 s [vector] mut_foldl: OK
  5740. 1415.75 s [vector] +++ OK, passed 100 tests.
  5741. 1415.75 s [vector] mut_foldl': OK
  5742. 1415.75 s [vector] +++ OK, passed 100 tests.
  5743. 1415.75 s [vector] mut_ifoldr: OK
  5744. 1415.75 s [vector] +++ OK, passed 100 tests.
  5745. 1415.75 s [vector] mut_ifoldr': OK
  5746. 1415.75 s [vector] +++ OK, passed 100 tests.
  5747. 1415.75 s [vector] mut_ifoldl: OK
  5748. 1415.75 s [vector] +++ OK, passed 100 tests.
  5749. 1415.75 s [vector] mut_ifoldl': OK
  5750. 1415.75 s [vector] +++ OK, passed 100 tests.
  5751. 1415.75 s [vector] mut_foldM: OK (0.01s)
  5752. 1415.75 s [vector] +++ OK, passed 100 tests.
  5753. 1415.75 s [vector] mut_foldM': OK
  5754. 1415.75 s [vector] +++ OK, passed 100 tests.
  5755. 1415.75 s [vector] mut_foldrM: OK
  5756. 1415.75 s [vector] +++ OK, passed 100 tests.
  5757. 1415.75 s [vector] mut_foldrM': OK
  5758. 1415.75 s [vector] +++ OK, passed 100 tests.
  5759. 1415.75 s [vector] mut_ifoldM: OK
  5760. 1415.75 s [vector] +++ OK, passed 100 tests.
  5761. 1415.75 s [vector] mut_ifoldM': OK
  5762. 1415.75 s [vector] +++ OK, passed 100 tests.
  5763. 1415.75 s [vector] mut_ifoldrM: OK
  5764. 1415.75 s [vector] +++ OK, passed 100 tests.
  5765. 1415.75 s [vector] mut_ifoldrM': OK
  5766. 1415.75 s [vector] +++ OK, passed 100 tests.
  5767. 1415.75 s [vector] compare: OK
  5768. 1415.75 s [vector] +++ OK, passed 100 tests.
  5769. 1415.75 s [vector] maximum: OK
  5770. 1415.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5771. 1415.75 s [vector] minimum: OK
  5772. 1415.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5773. 1415.75 s [vector] minIndex: OK
  5774. 1415.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5775. 1415.75 s [vector] maxIndex: OK
  5776. 1415.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5777. 1415.75 s [vector] maximumBy: OK
  5778. 1415.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5779. 1415.75 s [vector] minimumBy: OK
  5780. 1415.75 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5781. 1415.75 s [vector] maximumOn: OK
  5782. 1415.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5783. 1415.75 s [vector] minimumOn: OK
  5784. 1415.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5785. 1415.75 s [vector] maxIndexBy: OK
  5786. 1415.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5787. 1415.75 s [vector] minIndexBy: OK
  5788. 1415.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5789. 1415.75 s [vector] ListFirstMaxIndexWins: OK
  5790. 1415.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5791. 1415.75 s [vector] FalseListFirstMaxIndexWins: OK
  5792. 1415.75 s [vector] +++ OK, failed as expected. (after 1 test):
  5793. 1415.75 s [vector] Exception:
  5794. 1415.75 s [vector] Prelude.foldr1: empty list
  5795. 1415.75 s [vector] CallStack (from HasCallStack):
  5796. 1415.75 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  5797. 1415.75 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  5798. 1415.75 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5799. 1415.75 s [vector] []
  5800. 1415.75 s [vector] mempty: OK
  5801. 1415.75 s [vector] +++ OK, passed 100 tests.
  5802. 1415.75 s [vector] mappend: OK
  5803. 1415.75 s [vector] +++ OK, passed 100 tests.
  5804. 1415.75 s [vector] mconcat: OK
  5805. 1415.75 s [vector] +++ OK, passed 100 tests.
  5806. 1415.75 s [vector] glength: OK
  5807. 1415.75 s [vector] +++ OK, passed 100 tests.
  5808. 1415.75 s [vector] sum: OK
  5809. 1415.75 s [vector] +++ OK, passed 100 tests.
  5810. 1415.75 s [vector] product: OK
  5811. 1415.75 s [vector] +++ OK, passed 100 tests.
  5812. 1415.75 s [vector] enumFromN: OK
  5813. 1415.75 s [vector] +++ OK, passed 100 tests.
  5814. 1415.75 s [vector] enumFromThenN: OK
  5815. 1415.75 s [vector] +++ OK, passed 100 tests.
  5816. 1415.75 s [vector] enumFromTo: OK
  5817. 1415.75 s [vector] +++ OK, passed 100 tests.
  5818. 1415.75 s [vector] enumFromThenTo: OK
  5819. 1415.75 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5820. 1415.75 s [vector] Data.Vector.Storable.Vector (Double)
  5821. 1415.75 s [vector] fromList.toList == id: OK
  5822. 1415.75 s [vector] +++ OK, passed 100 tests.
  5823. 1415.75 s [vector] toList.fromList == id: OK
  5824. 1415.75 s [vector] +++ OK, passed 100 tests.
  5825. 1415.75 s [vector] unstream.stream == id: OK
  5826. 1415.75 s [vector] +++ OK, passed 100 tests.
  5827. 1415.75 s [vector] stream.unstream == id: OK
  5828. 1415.75 s [vector] +++ OK, passed 100 tests.
  5829. 1415.75 s [vector] eq: OK
  5830. 1415.75 s [vector] +++ OK, passed 100 tests.
  5831. 1415.75 s [vector] length: OK
  5832. 1415.75 s [vector] +++ OK, passed 100 tests.
  5833. 1415.75 s [vector] null: OK
  5834. 1415.75 s [vector] +++ OK, passed 100 tests.
  5835. 1415.75 s [vector] index: OK
  5836. 1415.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5837. 1415.75 s [vector] safeIndex: OK
  5838. 1415.75 s [vector] +++ OK, passed 100 tests.
  5839. 1415.75 s [vector] head: OK
  5840. 1415.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5841. 1415.75 s [vector] last: OK
  5842. 1415.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5843. 1415.75 s [vector] unsafeIndex: OK
  5844. 1415.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5845. 1415.75 s [vector] unsafeHead: OK
  5846. 1415.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5847. 1415.75 s [vector] unsafeLast: OK
  5848. 1415.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5849. 1415.75 s [vector] slice: OK
  5850. 1415.75 s [vector] +++ OK, passed 100 tests.
  5851. 1415.75 s [vector] init: OK
  5852. 1415.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5853. 1415.75 s [vector] tail: OK
  5854. 1415.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5855. 1415.75 s [vector] take: OK
  5856. 1415.75 s [vector] +++ OK, passed 100 tests.
  5857. 1415.75 s [vector] drop: OK
  5858. 1415.75 s [vector] +++ OK, passed 100 tests.
  5859. 1415.75 s [vector] splitAt: OK
  5860. 1415.75 s [vector] +++ OK, passed 100 tests.
  5861. 1415.75 s [vector] empty: OK
  5862. 1415.75 s [vector] +++ OK, passed 100 tests.
  5863. 1415.75 s [vector] singleton: OK
  5864. 1415.75 s [vector] +++ OK, passed 100 tests.
  5865. 1415.75 s [vector] replicate: OK
  5866. 1415.75 s [vector] +++ OK, passed 100 tests.
  5867. 1415.75 s [vector] generate: OK
  5868. 1415.75 s [vector] +++ OK, passed 100 tests.
  5869. 1415.75 s [vector] iterateN: OK
  5870. 1415.75 s [vector] +++ OK, passed 100 tests.
  5871. 1415.75 s [vector] iterateNM: OK (0.05s)
  5872. 1415.75 s [vector] +++ OK, passed 100 tests.
  5873. 1415.75 s [vector] generateM: OK (0.02s)
  5874. 1415.75 s [vector] +++ OK, passed 100 tests.
  5875. 1415.75 s [vector] replicateM: OK (0.01s)
  5876. 1415.75 s [vector] +++ OK, passed 100 tests.
  5877. 1415.75 s [vector] create: OK
  5878. 1415.75 s [vector] +++ OK, passed 100 tests.
  5879. 1415.75 s [vector] createT: OK
  5880. 1415.75 s [vector] +++ OK, passed 100 tests.
  5881. 1415.75 s [vector] unfoldr: OK
  5882. 1415.75 s [vector] +++ OK, passed 100 tests.
  5883. 1415.75 s [vector] unfoldrN: OK
  5884. 1415.75 s [vector] +++ OK, passed 100 tests.
  5885. 1415.75 s [vector] unfoldrExactN: OK
  5886. 1415.75 s [vector] +++ OK, passed 100 tests.
  5887. 1415.75 s [vector] unfoldrM: OK
  5888. 1415.75 s [vector] +++ OK, passed 100 tests.
  5889. 1415.75 s [vector] unfoldrNM: OK
  5890. 1415.75 s [vector] +++ OK, passed 100 tests.
  5891. 1415.75 s [vector] unfoldrExactNM: OK (0.08s)
  5892. 1415.75 s [vector] +++ OK, passed 100 tests.
  5893. 1415.75 s [vector] constructN: OK (0.02s)
  5894. 1415.75 s [vector] +++ OK, passed 100 tests.
  5895. 1415.75 s [vector] constructrN: OK (0.01s)
  5896. 1415.75 s [vector] +++ OK, passed 100 tests.
  5897. 1415.75 s [vector] cons: OK
  5898. 1415.75 s [vector] +++ OK, passed 100 tests.
  5899. 1415.75 s [vector] snoc: OK
  5900. 1415.75 s [vector] +++ OK, passed 100 tests.
  5901. 1415.75 s [vector] append: OK
  5902. 1415.75 s [vector] +++ OK, passed 100 tests.
  5903. 1415.75 s [vector] concat: OK (0.02s)
  5904. 1415.75 s [vector] +++ OK, passed 100 tests.
  5905. 1415.75 s [vector] force: OK
  5906. 1415.75 s [vector] +++ OK, passed 100 tests.
  5907. 1415.75 s [vector] upd: OK
  5908. 1415.75 s [vector] +++ OK, passed 100 tests.
  5909. 1415.75 s [vector] accum: OK (0.02s)
  5910. 1415.75 s [vector] +++ OK, passed 100 tests.
  5911. 1415.75 s [vector] reverse: OK
  5912. 1415.75 s [vector] +++ OK, passed 100 tests.
  5913. 1415.75 s [vector] backpermute: OK
  5914. 1415.75 s [vector] +++ OK, passed 100 tests.
  5915. 1415.75 s [vector] map: OK (0.01s)
  5916. 1415.75 s [vector] +++ OK, passed 100 tests.
  5917. 1415.75 s [vector] imap: OK (0.01s)
  5918. 1415.76 s [vector] +++ OK, passed 100 tests.
  5919. 1415.76 s [vector] concatMap: OK
  5920. 1415.76 s [vector] +++ OK, passed 100 tests.
  5921. 1415.76 s [vector] mapM: OK
  5922. 1415.76 s [vector] +++ OK, passed 100 tests.
  5923. 1415.76 s [vector] mapM_: OK (0.05s)
  5924. 1415.76 s [vector] +++ OK, passed 100 tests.
  5925. 1415.76 s [vector] forM: OK (0.01s)
  5926. 1415.76 s [vector] +++ OK, passed 100 tests.
  5927. 1415.76 s [vector] forM_: OK (0.07s)
  5928. 1415.76 s [vector] +++ OK, passed 100 tests.
  5929. 1415.76 s [vector] imapM: OK (0.02s)
  5930. 1415.76 s [vector] +++ OK, passed 100 tests.
  5931. 1415.76 s [vector] imapM_: OK (0.06s)
  5932. 1415.76 s [vector] +++ OK, passed 100 tests.
  5933. 1415.76 s [vector] zipWith: OK (0.02s)
  5934. 1415.76 s [vector] +++ OK, passed 100 tests.
  5935. 1415.76 s [vector] zipWith3: OK (0.02s)
  5936. 1415.76 s [vector] +++ OK, passed 100 tests.
  5937. 1415.76 s [vector] izipWith: OK (0.02s)
  5938. 1415.76 s [vector] +++ OK, passed 100 tests.
  5939. 1415.76 s [vector] izipWith3: OK (0.02s)
  5940. 1415.76 s [vector] +++ OK, passed 100 tests.
  5941. 1415.76 s [vector] izipWithM: OK (0.02s)
  5942. 1415.76 s [vector] +++ OK, passed 100 tests.
  5943. 1415.76 s [vector] izipWithM_: OK (0.04s)
  5944. 1415.76 s [vector] +++ OK, passed 100 tests.
  5945. 1415.76 s [vector] zipWithM: OK (0.01s)
  5946. 1415.76 s [vector] +++ OK, passed 100 tests.
  5947. 1415.76 s [vector] zipWithM_: OK (0.05s)
  5948. 1415.76 s [vector] +++ OK, passed 100 tests.
  5949. 1415.76 s [vector] filter: OK (0.01s)
  5950. 1415.76 s [vector] +++ OK, passed 100 tests.
  5951. 1415.76 s [vector] ifilter: OK (0.01s)
  5952. 1415.76 s [vector] +++ OK, passed 100 tests.
  5953. 1415.76 s [vector] filterM: OK (0.07s)
  5954. 1415.76 s [vector] +++ OK, passed 100 tests.
  5955. 1415.76 s [vector] uniq: OK
  5956. 1415.76 s [vector] +++ OK, passed 100 tests.
  5957. 1415.76 s [vector] mapMaybe: OK
  5958. 1415.76 s [vector] +++ OK, passed 100 tests.
  5959. 1415.76 s [vector] imapMaybe: OK
  5960. 1415.76 s [vector] +++ OK, passed 100 tests.
  5961. 1415.76 s [vector] takeWhile: OK
  5962. 1415.76 s [vector] +++ OK, passed 100 tests.
  5963. 1415.76 s [vector] dropWhile: OK
  5964. 1415.76 s [vector] +++ OK, passed 100 tests.
  5965. 1415.76 s [vector] partition: OK
  5966. 1415.76 s [vector] +++ OK, passed 100 tests.
  5967. 1415.76 s [vector] partitionWith: OK
  5968. 1415.76 s [vector] +++ OK, passed 100 tests.
  5969. 1415.76 s [vector] span: OK
  5970. 1415.76 s [vector] +++ OK, passed 100 tests.
  5971. 1415.76 s [vector] break: OK
  5972. 1415.76 s [vector] +++ OK, passed 100 tests.
  5973. 1415.76 s [vector] spanR: OK
  5974. 1415.76 s [vector] +++ OK, passed 100 tests.
  5975. 1415.76 s [vector] breakR: OK
  5976. 1415.76 s [vector] +++ OK, passed 100 tests.
  5977. 1415.76 s [vector] groupBy: OK (0.01s)
  5978. 1415.76 s [vector] +++ OK, passed 100 tests.
  5979. 1415.76 s [vector] elem: OK
  5980. 1415.76 s [vector] +++ OK, passed 100 tests.
  5981. 1415.76 s [vector] notElem: OK
  5982. 1415.76 s [vector] +++ OK, passed 100 tests.
  5983. 1415.76 s [vector] find: OK
  5984. 1415.76 s [vector] +++ OK, passed 100 tests.
  5985. 1415.76 s [vector] findIndex: OK
  5986. 1415.76 s [vector] +++ OK, passed 100 tests.
  5987. 1415.76 s [vector] findIndexR: OK
  5988. 1415.76 s [vector] +++ OK, passed 100 tests.
  5989. 1415.76 s [vector] findIndices: OK
  5990. 1415.76 s [vector] +++ OK, passed 100 tests.
  5991. 1415.76 s [vector] elemIndex: OK
  5992. 1415.76 s [vector] +++ OK, passed 100 tests.
  5993. 1415.76 s [vector] elemIndices: OK
  5994. 1415.76 s [vector] +++ OK, passed 100 tests.
  5995. 1415.76 s [vector] foldl: OK (0.01s)
  5996. 1415.76 s [vector] +++ OK, passed 100 tests.
  5997. 1415.76 s [vector] foldl1: OK (0.01s)
  5998. 1415.76 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5999. 1415.76 s [vector] foldl': OK (0.02s)
  6000. 1415.76 s [vector] +++ OK, passed 100 tests.
  6001. 1415.76 s [vector] foldl1': OK (0.02s)
  6002. 1415.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6003. 1415.76 s [vector] foldr: OK (0.02s)
  6004. 1415.76 s [vector] +++ OK, passed 100 tests.
  6005. 1415.76 s [vector] foldr1: OK (0.01s)
  6006. 1415.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6007. 1415.76 s [vector] foldr': OK (0.02s)
  6008. 1415.76 s [vector] +++ OK, passed 100 tests.
  6009. 1415.76 s [vector] foldr1': OK (0.01s)
  6010. 1415.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6011. 1415.76 s [vector] ifoldl: OK (0.01s)
  6012. 1415.76 s [vector] +++ OK, passed 100 tests.
  6013. 1415.76 s [vector] ifoldl': OK (0.01s)
  6014. 1415.76 s [vector] +++ OK, passed 100 tests.
  6015. 1415.76 s [vector] ifoldr: OK (0.01s)
  6016. 1415.76 s [vector] +++ OK, passed 100 tests.
  6017. 1415.76 s [vector] ifoldr': OK (0.01s)
  6018. 1415.76 s [vector] +++ OK, passed 100 tests.
  6019. 1415.76 s [vector] ifoldM: OK (0.02s)
  6020. 1415.76 s [vector] +++ OK, passed 100 tests.
  6021. 1415.76 s [vector] ifoldM': OK (0.03s)
  6022. 1415.76 s [vector] +++ OK, passed 100 tests.
  6023. 1415.76 s [vector] ifoldM_: OK (0.05s)
  6024. 1415.76 s [vector] +++ OK, passed 100 tests.
  6025. 1415.76 s [vector] ifoldM'_: OK (0.04s)
  6026. 1415.76 s [vector] +++ OK, passed 100 tests.
  6027. 1415.76 s [vector] all: OK
  6028. 1415.76 s [vector] +++ OK, passed 100 tests.
  6029. 1415.76 s [vector] any: OK
  6030. 1415.76 s [vector] +++ OK, passed 100 tests.
  6031. 1415.76 s [vector] prescanl: OK (0.01s)
  6032. 1415.76 s [vector] +++ OK, passed 100 tests.
  6033. 1415.76 s [vector] prescanl': OK (0.01s)
  6034. 1415.76 s [vector] +++ OK, passed 100 tests.
  6035. 1415.76 s [vector] postscanl: OK (0.02s)
  6036. 1415.76 s [vector] +++ OK, passed 100 tests.
  6037. 1415.76 s [vector] postscanl': OK (0.02s)
  6038. 1415.76 s [vector] +++ OK, passed 100 tests.
  6039. 1415.76 s [vector] scanl: OK (0.02s)
  6040. 1415.76 s [vector] +++ OK, passed 100 tests.
  6041. 1415.76 s [vector] scanl': OK (0.02s)
  6042. 1415.76 s [vector] +++ OK, passed 100 tests.
  6043. 1415.76 s [vector] scanl1: OK (0.02s)
  6044. 1415.76 s [vector] +++ OK, passed 100 tests.
  6045. 1415.76 s [vector] scanl1': OK
  6046. 1415.76 s [vector] +++ OK, passed 100 tests.
  6047. 1415.76 s [vector] iscanl: OK (0.02s)
  6048. 1415.76 s [vector] +++ OK, passed 100 tests.
  6049. 1415.76 s [vector] iscanl': OK (0.02s)
  6050. 1415.76 s [vector] +++ OK, passed 100 tests.
  6051. 1415.76 s [vector] prescanr: OK (0.01s)
  6052. 1415.76 s [vector] +++ OK, passed 100 tests.
  6053. 1415.76 s [vector] prescanr': OK (0.02s)
  6054. 1415.76 s [vector] +++ OK, passed 100 tests.
  6055. 1415.76 s [vector] postscanr: OK (0.01s)
  6056. 1415.76 s [vector] +++ OK, passed 100 tests.
  6057. 1415.76 s [vector] postscanr': OK (0.01s)
  6058. 1415.76 s [vector] +++ OK, passed 100 tests.
  6059. 1415.76 s [vector] scanr: OK (0.01s)
  6060. 1415.76 s [vector] +++ OK, passed 100 tests.
  6061. 1415.76 s [vector] scanr': OK (0.02s)
  6062. 1415.76 s [vector] +++ OK, passed 100 tests.
  6063. 1415.76 s [vector] scanr1: OK (0.01s)
  6064. 1415.76 s [vector] +++ OK, passed 100 tests.
  6065. 1415.76 s [vector] scanr1': OK (0.01s)
  6066. 1415.76 s [vector] +++ OK, passed 100 tests.
  6067. 1415.76 s [vector] iscanr: OK (0.01s)
  6068. 1415.76 s [vector] +++ OK, passed 100 tests.
  6069. 1415.76 s [vector] iscanr': OK (0.01s)
  6070. 1415.76 s [vector] +++ OK, passed 100 tests.
  6071. 1415.76 s [vector] mut_read: OK
  6072. 1415.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6073. 1415.76 s [vector] mut_write: OK
  6074. 1415.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6075. 1415.76 s [vector] mut_modify: OK
  6076. 1415.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6077. 1415.76 s [vector] mut_generate: OK
  6078. 1415.76 s [vector] +++ OK, passed 100 tests.
  6079. 1415.76 s [vector] mut_generateM: OK (0.02s)
  6080. 1415.76 s [vector] +++ OK, passed 100 tests.
  6081. 1415.76 s [vector] mut_mapM_: OK (0.04s)
  6082. 1415.76 s [vector] +++ OK, passed 100 tests.
  6083. 1415.76 s [vector] mut_imapM_: OK (0.04s)
  6084. 1415.76 s [vector] +++ OK, passed 100 tests.
  6085. 1415.76 s [vector] mut_forM_: OK (0.04s)
  6086. 1415.76 s [vector] +++ OK, passed 100 tests.
  6087. 1415.76 s [vector] mut_iforM_: OK (0.03s)
  6088. 1415.76 s [vector] +++ OK, passed 100 tests.
  6089. 1415.76 s [vector] mut_foldr: OK (0.01s)
  6090. 1415.77 s [vector] +++ OK, passed 100 tests.
  6091. 1415.77 s [vector] mut_foldr': OK (0.01s)
  6092. 1415.77 s [vector] +++ OK, passed 100 tests.
  6093. 1415.77 s [vector] mut_foldl: OK (0.01s)
  6094. 1415.77 s [vector] +++ OK, passed 100 tests.
  6095. 1415.77 s [vector] mut_foldl': OK (0.01s)
  6096. 1415.77 s [vector] +++ OK, passed 100 tests.
  6097. 1415.77 s [vector] mut_ifoldr: OK (0.01s)
  6098. 1415.77 s [vector] +++ OK, passed 100 tests.
  6099. 1415.77 s [vector] mut_ifoldr': OK (0.02s)
  6100. 1415.77 s [vector] +++ OK, passed 100 tests.
  6101. 1415.77 s [vector] mut_ifoldl: OK (0.01s)
  6102. 1415.77 s [vector] +++ OK, passed 100 tests.
  6103. 1415.77 s [vector] mut_ifoldl': OK
  6104. 1415.77 s [vector] +++ OK, passed 100 tests.
  6105. 1415.77 s [vector] mut_foldM: OK (0.01s)
  6106. 1415.77 s [vector] +++ OK, passed 100 tests.
  6107. 1415.77 s [vector] mut_foldM': OK (0.01s)
  6108. 1415.77 s [vector] +++ OK, passed 100 tests.
  6109. 1415.77 s [vector] mut_foldrM: OK
  6110. 1415.77 s [vector] +++ OK, passed 100 tests.
  6111. 1415.77 s [vector] mut_foldrM': OK (0.01s)
  6112. 1415.77 s [vector] +++ OK, passed 100 tests.
  6113. 1415.77 s [vector] mut_ifoldM: OK (0.02s)
  6114. 1415.77 s [vector] +++ OK, passed 100 tests.
  6115. 1415.77 s [vector] mut_ifoldM': OK (0.02s)
  6116. 1415.77 s [vector] +++ OK, passed 100 tests.
  6117. 1415.77 s [vector] mut_ifoldrM: OK (0.01s)
  6118. 1415.77 s [vector] +++ OK, passed 100 tests.
  6119. 1415.77 s [vector] mut_ifoldrM': OK (0.03s)
  6120. 1415.77 s [vector] +++ OK, passed 100 tests.
  6121. 1415.77 s [vector] compare: OK
  6122. 1415.77 s [vector] +++ OK, passed 100 tests.
  6123. 1415.77 s [vector] maximum: OK
  6124. 1415.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6125. 1415.77 s [vector] minimum: OK
  6126. 1415.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6127. 1415.77 s [vector] minIndex: OK
  6128. 1415.77 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6129. 1415.77 s [vector] maxIndex: OK
  6130. 1415.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6131. 1415.77 s [vector] maximumBy: OK
  6132. 1415.77 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6133. 1415.77 s [vector] minimumBy: OK
  6134. 1415.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6135. 1415.77 s [vector] maximumOn: OK
  6136. 1415.77 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6137. 1415.77 s [vector] minimumOn: OK
  6138. 1415.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6139. 1415.77 s [vector] maxIndexBy: OK
  6140. 1415.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6141. 1415.77 s [vector] minIndexBy: OK
  6142. 1415.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6143. 1415.77 s [vector] ListFirstMaxIndexWins: OK
  6144. 1415.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6145. 1415.77 s [vector] FalseListFirstMaxIndexWins: OK
  6146. 1415.77 s [vector] +++ OK, failed as expected. (after 1 test):
  6147. 1415.77 s [vector] Exception:
  6148. 1415.77 s [vector] Prelude.foldr1: empty list
  6149. 1415.77 s [vector] CallStack (from HasCallStack):
  6150. 1415.77 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6151. 1415.77 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6152. 1415.77 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6153. 1415.77 s [vector] []
  6154. 1415.77 s [vector] mempty: OK
  6155. 1415.77 s [vector] +++ OK, passed 100 tests.
  6156. 1415.77 s [vector] mappend: OK
  6157. 1415.77 s [vector] +++ OK, passed 100 tests.
  6158. 1415.77 s [vector] mconcat: OK (0.02s)
  6159. 1415.77 s [vector] +++ OK, passed 100 tests.
  6160. 1415.77 s [vector] glength: OK
  6161. 1415.77 s [vector] +++ OK, passed 100 tests.
  6162. 1415.77 s [vector] sum: OK
  6163. 1415.77 s [vector] +++ OK, passed 100 tests.
  6164. 1415.77 s [vector] product: OK
  6165. 1415.77 s [vector] +++ OK, passed 100 tests.
  6166. 1415.77 s [vector] enumFromN: OK
  6167. 1415.77 s [vector] +++ OK, passed 100 tests.
  6168. 1415.77 s [vector] enumFromThenN: OK
  6169. 1415.77 s [vector] +++ OK, passed 100 tests.
  6170. 1415.77 s [vector] enumFromTo: OK
  6171. 1415.77 s [vector] +++ OK, passed 100 tests.
  6172. 1415.77 s [vector] enumFromThenTo: OK
  6173. 1415.77 s [vector] +++ OK, passed 100 tests.
  6174. 1415.77 s [vector] unstream
  6175. 1415.77 s [vector] unstream == vunstream (exact): OK
  6176. 1415.77 s [vector] +++ OK, passed 100 tests.
  6177. 1415.77 s [vector] unstream == vunstream (unknown): OK
  6178. 1415.77 s [vector] +++ OK, passed 100 tests.
  6179. 1415.77 s [vector] unstreamR ~= vunstream (exact): OK
  6180. 1415.77 s [vector] +++ OK, passed 100 tests.
  6181. 1415.77 s [vector] unstreamR ~= vunstream (unknown): OK
  6182. 1415.77 s [vector] +++ OK, passed 100 tests.
  6183. 1415.77 s [vector] Tests.Vector.Strict
  6184. 1415.77 s [vector] Bool
  6185. 1415.77 s [vector] fromList.toList == id: OK
  6186. 1415.77 s [vector] +++ OK, passed 100 tests.
  6187. 1415.77 s [vector] toList.fromList == id: OK
  6188. 1415.77 s [vector] +++ OK, passed 100 tests.
  6189. 1415.77 s [vector] unstream.stream == id: OK
  6190. 1415.77 s [vector] +++ OK, passed 100 tests.
  6191. 1415.77 s [vector] stream.unstream == id: OK
  6192. 1415.77 s [vector] +++ OK, passed 100 tests.
  6193. 1415.77 s [vector] eq: OK
  6194. 1415.77 s [vector] +++ OK, passed 100 tests.
  6195. 1415.77 s [vector] length: OK
  6196. 1415.77 s [vector] +++ OK, passed 100 tests.
  6197. 1415.77 s [vector] null: OK
  6198. 1415.77 s [vector] +++ OK, passed 100 tests.
  6199. 1415.77 s [vector] index: OK
  6200. 1415.77 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6201. 1415.77 s [vector] safeIndex: OK
  6202. 1415.77 s [vector] +++ OK, passed 100 tests.
  6203. 1415.77 s [vector] head: OK
  6204. 1415.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6205. 1415.77 s [vector] last: OK
  6206. 1415.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6207. 1415.77 s [vector] unsafeIndex: OK
  6208. 1415.77 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6209. 1415.77 s [vector] unsafeHead: OK
  6210. 1415.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6211. 1415.77 s [vector] unsafeLast: OK
  6212. 1415.77 s [vector] +++ OK, passed 100 tests; 25 discarded.
  6213. 1415.77 s [vector] slice: OK
  6214. 1415.77 s [vector] +++ OK, passed 100 tests.
  6215. 1415.77 s [vector] init: OK
  6216. 1415.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6217. 1415.77 s [vector] tail: OK
  6218. 1415.77 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6219. 1415.77 s [vector] take: OK
  6220. 1415.77 s [vector] +++ OK, passed 100 tests.
  6221. 1415.77 s [vector] drop: OK
  6222. 1415.77 s [vector] +++ OK, passed 100 tests.
  6223. 1415.77 s [vector] splitAt: OK
  6224. 1415.77 s [vector] +++ OK, passed 100 tests.
  6225. 1415.77 s [vector] empty: OK
  6226. 1415.77 s [vector] +++ OK, passed 100 tests.
  6227. 1415.77 s [vector] singleton: OK
  6228. 1415.77 s [vector] +++ OK, passed 100 tests.
  6229. 1415.77 s [vector] replicate: OK
  6230. 1415.77 s [vector] +++ OK, passed 100 tests.
  6231. 1415.77 s [vector] generate: OK
  6232. 1415.77 s [vector] +++ OK, passed 100 tests.
  6233. 1415.77 s [vector] iterateN: OK
  6234. 1415.77 s [vector] +++ OK, passed 100 tests.
  6235. 1415.77 s [vector] iterateNM: OK (0.02s)
  6236. 1415.77 s [vector] +++ OK, passed 100 tests.
  6237. 1415.77 s [vector] generateM: OK (0.03s)
  6238. 1415.77 s [vector] +++ OK, passed 100 tests.
  6239. 1415.78 s [vector] replicateM: OK
  6240. 1415.78 s [vector] +++ OK, passed 100 tests.
  6241. 1415.78 s [vector] create: OK
  6242. 1415.78 s [vector] +++ OK, passed 100 tests.
  6243. 1415.78 s [vector] createT: OK
  6244. 1415.78 s [vector] +++ OK, passed 100 tests.
  6245. 1415.78 s [vector] unfoldr: OK
  6246. 1415.78 s [vector] +++ OK, passed 100 tests.
  6247. 1415.78 s [vector] unfoldrN: OK
  6248. 1415.78 s [vector] +++ OK, passed 100 tests.
  6249. 1415.78 s [vector] unfoldrExactN: OK
  6250. 1415.78 s [vector] +++ OK, passed 100 tests.
  6251. 1415.78 s [vector] unfoldrM: OK
  6252. 1415.78 s [vector] +++ OK, passed 100 tests.
  6253. 1415.78 s [vector] unfoldrNM: OK
  6254. 1415.78 s [vector] +++ OK, passed 100 tests.
  6255. 1415.78 s [vector] unfoldrExactNM: OK (0.05s)
  6256. 1415.78 s [vector] +++ OK, passed 100 tests.
  6257. 1415.78 s [vector] constructN: OK
  6258. 1415.78 s [vector] +++ OK, passed 100 tests.
  6259. 1415.78 s [vector] constructrN: OK
  6260. 1415.78 s [vector] +++ OK, passed 100 tests.
  6261. 1415.78 s [vector] cons: OK
  6262. 1415.78 s [vector] +++ OK, passed 100 tests.
  6263. 1415.78 s [vector] snoc: OK
  6264. 1415.78 s [vector] +++ OK, passed 100 tests.
  6265. 1415.78 s [vector] append: OK
  6266. 1415.78 s [vector] +++ OK, passed 100 tests.
  6267. 1415.78 s [vector] concat: OK (0.01s)
  6268. 1415.78 s [vector] +++ OK, passed 100 tests.
  6269. 1415.78 s [vector] force: OK
  6270. 1415.78 s [vector] +++ OK, passed 100 tests.
  6271. 1415.78 s [vector] upd: OK
  6272. 1415.78 s [vector] +++ OK, passed 100 tests.
  6273. 1415.78 s [vector] accum: OK
  6274. 1415.78 s [vector] +++ OK, passed 100 tests.
  6275. 1415.78 s [vector] reverse: OK
  6276. 1415.78 s [vector] +++ OK, passed 100 tests.
  6277. 1415.78 s [vector] backpermute: OK
  6278. 1415.78 s [vector] +++ OK, passed 100 tests.
  6279. 1415.78 s [vector] map: OK
  6280. 1415.78 s [vector] +++ OK, passed 100 tests.
  6281. 1415.78 s [vector] imap: OK
  6282. 1415.78 s [vector] +++ OK, passed 100 tests.
  6283. 1415.78 s [vector] concatMap: OK
  6284. 1415.78 s [vector] +++ OK, passed 100 tests.
  6285. 1415.78 s [vector] mapM: OK
  6286. 1415.78 s [vector] +++ OK, passed 100 tests.
  6287. 1415.78 s [vector] mapM_: OK
  6288. 1415.78 s [vector] +++ OK, passed 100 tests.
  6289. 1415.78 s [vector] forM: OK
  6290. 1415.78 s [vector] +++ OK, passed 100 tests.
  6291. 1415.78 s [vector] forM_: OK
  6292. 1415.78 s [vector] +++ OK, passed 100 tests.
  6293. 1415.78 s [vector] imapM: OK
  6294. 1415.78 s [vector] +++ OK, passed 100 tests.
  6295. 1415.78 s [vector] imapM_: OK (0.01s)
  6296. 1415.78 s [vector] +++ OK, passed 100 tests.
  6297. 1415.78 s [vector] zipWith: OK
  6298. 1415.78 s [vector] +++ OK, passed 100 tests.
  6299. 1415.78 s [vector] zipWith3: OK
  6300. 1415.78 s [vector] +++ OK, passed 100 tests.
  6301. 1415.78 s [vector] izipWith: OK
  6302. 1415.78 s [vector] +++ OK, passed 100 tests.
  6303. 1415.78 s [vector] izipWith3: OK
  6304. 1415.78 s [vector] +++ OK, passed 100 tests.
  6305. 1415.78 s [vector] izipWithM: OK
  6306. 1415.78 s [vector] +++ OK, passed 100 tests.
  6307. 1415.78 s [vector] izipWithM_: OK
  6308. 1415.78 s [vector] +++ OK, passed 100 tests.
  6309. 1415.78 s [vector] zipWithM: OK
  6310. 1415.78 s [vector] +++ OK, passed 100 tests.
  6311. 1415.78 s [vector] zipWithM_: OK
  6312. 1415.78 s [vector] +++ OK, passed 100 tests.
  6313. 1415.78 s [vector] filter: OK
  6314. 1415.78 s [vector] +++ OK, passed 100 tests.
  6315. 1415.78 s [vector] ifilter: OK
  6316. 1415.78 s [vector] +++ OK, passed 100 tests.
  6317. 1415.78 s [vector] filterM: OK (0.01s)
  6318. 1415.78 s [vector] +++ OK, passed 100 tests.
  6319. 1415.78 s [vector] uniq: OK
  6320. 1415.78 s [vector] +++ OK, passed 100 tests.
  6321. 1415.78 s [vector] mapMaybe: OK
  6322. 1415.78 s [vector] +++ OK, passed 100 tests.
  6323. 1415.78 s [vector] imapMaybe: OK
  6324. 1415.78 s [vector] +++ OK, passed 100 tests.
  6325. 1415.78 s [vector] takeWhile: OK
  6326. 1415.78 s [vector] +++ OK, passed 100 tests.
  6327. 1415.78 s [vector] dropWhile: OK
  6328. 1415.78 s [vector] +++ OK, passed 100 tests.
  6329. 1415.78 s [vector] partition: OK
  6330. 1415.78 s [vector] +++ OK, passed 100 tests.
  6331. 1415.78 s [vector] partitionWith: OK
  6332. 1415.78 s [vector] +++ OK, passed 100 tests.
  6333. 1415.78 s [vector] span: OK
  6334. 1415.78 s [vector] +++ OK, passed 100 tests.
  6335. 1415.78 s [vector] break: OK
  6336. 1415.78 s [vector] +++ OK, passed 100 tests.
  6337. 1415.78 s [vector] spanR: OK
  6338. 1415.78 s [vector] +++ OK, passed 100 tests.
  6339. 1415.78 s [vector] breakR: OK
  6340. 1415.78 s [vector] +++ OK, passed 100 tests.
  6341. 1415.78 s [vector] groupBy: OK
  6342. 1415.78 s [vector] +++ OK, passed 100 tests.
  6343. 1415.78 s [vector] elem: OK
  6344. 1415.78 s [vector] +++ OK, passed 100 tests.
  6345. 1415.78 s [vector] notElem: OK
  6346. 1415.78 s [vector] +++ OK, passed 100 tests.
  6347. 1415.78 s [vector] find: OK
  6348. 1415.78 s [vector] +++ OK, passed 100 tests.
  6349. 1415.78 s [vector] findIndex: OK
  6350. 1415.78 s [vector] +++ OK, passed 100 tests.
  6351. 1415.78 s [vector] findIndexR: OK
  6352. 1415.78 s [vector] +++ OK, passed 100 tests.
  6353. 1415.78 s [vector] findIndices: OK
  6354. 1415.78 s [vector] +++ OK, passed 100 tests.
  6355. 1415.78 s [vector] elemIndex: OK
  6356. 1415.78 s [vector] +++ OK, passed 100 tests.
  6357. 1415.78 s [vector] elemIndices: OK
  6358. 1415.78 s [vector] +++ OK, passed 100 tests.
  6359. 1415.78 s [vector] foldl: OK
  6360. 1415.78 s [vector] +++ OK, passed 100 tests.
  6361. 1415.78 s [vector] foldl1: OK
  6362. 1415.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6363. 1415.78 s [vector] foldl': OK
  6364. 1415.78 s [vector] +++ OK, passed 100 tests.
  6365. 1415.78 s [vector] foldl1': OK
  6366. 1415.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6367. 1415.78 s [vector] foldr: OK
  6368. 1415.78 s [vector] +++ OK, passed 100 tests.
  6369. 1415.78 s [vector] foldr1: OK
  6370. 1415.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6371. 1415.78 s [vector] foldr': OK
  6372. 1415.78 s [vector] +++ OK, passed 100 tests.
  6373. 1415.78 s [vector] foldr1': OK
  6374. 1415.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6375. 1415.78 s [vector] ifoldl: OK
  6376. 1415.78 s [vector] +++ OK, passed 100 tests.
  6377. 1415.78 s [vector] ifoldl': OK
  6378. 1415.78 s [vector] +++ OK, passed 100 tests.
  6379. 1415.78 s [vector] ifoldr: OK
  6380. 1415.78 s [vector] +++ OK, passed 100 tests.
  6381. 1415.78 s [vector] ifoldr': OK
  6382. 1415.78 s [vector] +++ OK, passed 100 tests.
  6383. 1415.78 s [vector] ifoldM: OK
  6384. 1415.78 s [vector] +++ OK, passed 100 tests.
  6385. 1415.78 s [vector] ifoldM': OK
  6386. 1415.78 s [vector] +++ OK, passed 100 tests.
  6387. 1415.78 s [vector] ifoldM_: OK (0.01s)
  6388. 1415.78 s [vector] +++ OK, passed 100 tests.
  6389. 1415.78 s [vector] ifoldM'_: OK (0.01s)
  6390. 1415.78 s [vector] +++ OK, passed 100 tests.
  6391. 1415.78 s [vector] all: OK
  6392. 1415.78 s [vector] +++ OK, passed 100 tests.
  6393. 1415.78 s [vector] any: OK
  6394. 1415.78 s [vector] +++ OK, passed 100 tests.
  6395. 1415.78 s [vector] prescanl: OK
  6396. 1415.78 s [vector] +++ OK, passed 100 tests.
  6397. 1415.78 s [vector] prescanl': OK
  6398. 1415.78 s [vector] +++ OK, passed 100 tests.
  6399. 1415.78 s [vector] postscanl: OK
  6400. 1415.78 s [vector] +++ OK, passed 100 tests.
  6401. 1415.78 s [vector] postscanl': OK
  6402. 1415.78 s [vector] +++ OK, passed 100 tests.
  6403. 1415.78 s [vector] scanl: OK
  6404. 1415.78 s [vector] +++ OK, passed 100 tests.
  6405. 1415.78 s [vector] scanl': OK
  6406. 1415.78 s [vector] +++ OK, passed 100 tests.
  6407. 1415.78 s [vector] scanl1: OK
  6408. 1415.78 s [vector] +++ OK, passed 100 tests.
  6409. 1415.78 s [vector] scanl1': OK
  6410. 1415.78 s [vector] +++ OK, passed 100 tests.
  6411. 1415.78 s [vector] iscanl: OK
  6412. 1415.78 s [vector] +++ OK, passed 100 tests.
  6413. 1415.78 s [vector] iscanl': OK
  6414. 1415.78 s [vector] +++ OK, passed 100 tests.
  6415. 1415.78 s [vector] prescanr: OK
  6416. 1415.78 s [vector] +++ OK, passed 100 tests.
  6417. 1415.78 s [vector] prescanr': OK
  6418. 1415.78 s [vector] +++ OK, passed 100 tests.
  6419. 1415.78 s [vector] postscanr: OK
  6420. 1415.78 s [vector] +++ OK, passed 100 tests.
  6421. 1415.78 s [vector] postscanr': OK
  6422. 1415.78 s [vector] +++ OK, passed 100 tests.
  6423. 1415.78 s [vector] scanr: OK
  6424. 1415.78 s [vector] +++ OK, passed 100 tests.
  6425. 1415.78 s [vector] scanr': OK
  6426. 1415.78 s [vector] +++ OK, passed 100 tests.
  6427. 1415.79 s [vector] scanr1: OK
  6428. 1415.79 s [vector] +++ OK, passed 100 tests.
  6429. 1415.79 s [vector] scanr1': OK
  6430. 1415.79 s [vector] +++ OK, passed 100 tests.
  6431. 1415.79 s [vector] iscanr: OK
  6432. 1415.79 s [vector] +++ OK, passed 100 tests.
  6433. 1415.79 s [vector] iscanr': OK
  6434. 1415.79 s [vector] +++ OK, passed 100 tests.
  6435. 1415.79 s [vector] mut_read: OK
  6436. 1415.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6437. 1415.79 s [vector] mut_write: OK
  6438. 1415.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6439. 1415.79 s [vector] mut_modify: OK
  6440. 1415.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6441. 1415.79 s [vector] mut_generate: OK
  6442. 1415.79 s [vector] +++ OK, passed 100 tests.
  6443. 1415.79 s [vector] mut_generateM: OK
  6444. 1415.79 s [vector] +++ OK, passed 100 tests.
  6445. 1415.79 s [vector] mut_mapM_: OK (0.01s)
  6446. 1415.79 s [vector] +++ OK, passed 100 tests.
  6447. 1415.79 s [vector] mut_imapM_: OK (0.01s)
  6448. 1415.79 s [vector] +++ OK, passed 100 tests.
  6449. 1415.79 s [vector] mut_forM_: OK (0.01s)
  6450. 1415.79 s [vector] +++ OK, passed 100 tests.
  6451. 1415.79 s [vector] mut_iforM_: OK (0.01s)
  6452. 1415.79 s [vector] +++ OK, passed 100 tests.
  6453. 1415.79 s [vector] mut_foldr: OK
  6454. 1415.79 s [vector] +++ OK, passed 100 tests.
  6455. 1415.79 s [vector] mut_foldr': OK
  6456. 1415.79 s [vector] +++ OK, passed 100 tests.
  6457. 1415.79 s [vector] mut_foldl: OK
  6458. 1415.79 s [vector] +++ OK, passed 100 tests.
  6459. 1415.79 s [vector] mut_foldl': OK
  6460. 1415.79 s [vector] +++ OK, passed 100 tests.
  6461. 1415.79 s [vector] mut_ifoldr: OK
  6462. 1415.79 s [vector] +++ OK, passed 100 tests.
  6463. 1415.79 s [vector] mut_ifoldr': OK
  6464. 1415.79 s [vector] +++ OK, passed 100 tests.
  6465. 1415.79 s [vector] mut_ifoldl: OK
  6466. 1415.79 s [vector] +++ OK, passed 100 tests.
  6467. 1415.79 s [vector] mut_ifoldl': OK
  6468. 1415.79 s [vector] +++ OK, passed 100 tests.
  6469. 1415.79 s [vector] mut_foldM: OK
  6470. 1415.79 s [vector] +++ OK, passed 100 tests.
  6471. 1415.79 s [vector] mut_foldM': OK
  6472. 1415.79 s [vector] +++ OK, passed 100 tests.
  6473. 1415.79 s [vector] mut_foldrM: OK
  6474. 1415.79 s [vector] +++ OK, passed 100 tests.
  6475. 1415.79 s [vector] mut_foldrM': OK
  6476. 1415.79 s [vector] +++ OK, passed 100 tests.
  6477. 1415.79 s [vector] mut_ifoldM: OK
  6478. 1415.79 s [vector] +++ OK, passed 100 tests.
  6479. 1415.79 s [vector] mut_ifoldM': OK
  6480. 1415.79 s [vector] +++ OK, passed 100 tests.
  6481. 1415.79 s [vector] mut_ifoldrM: OK
  6482. 1415.79 s [vector] +++ OK, passed 100 tests.
  6483. 1415.79 s [vector] mut_ifoldrM': OK
  6484. 1415.79 s [vector] +++ OK, passed 100 tests.
  6485. 1415.79 s [vector] compare: OK
  6486. 1415.79 s [vector] +++ OK, passed 100 tests.
  6487. 1415.79 s [vector] maximum: OK
  6488. 1415.79 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6489. 1415.79 s [vector] minimum: OK
  6490. 1415.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6491. 1415.79 s [vector] minIndex: OK
  6492. 1415.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6493. 1415.79 s [vector] maxIndex: OK
  6494. 1415.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6495. 1415.79 s [vector] maximumBy: OK
  6496. 1415.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6497. 1415.79 s [vector] minimumBy: OK
  6498. 1415.79 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6499. 1415.79 s [vector] maximumOn: OK
  6500. 1415.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6501. 1415.79 s [vector] minimumOn: OK
  6502. 1415.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6503. 1415.79 s [vector] maxIndexBy: OK
  6504. 1415.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6505. 1415.79 s [vector] minIndexBy: OK
  6506. 1415.79 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6507. 1415.79 s [vector] ListFirstMaxIndexWins: OK
  6508. 1415.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6509. 1415.79 s [vector] FalseListFirstMaxIndexWins: OK
  6510. 1415.79 s [vector] +++ OK, failed as expected. (after 1 test):
  6511. 1415.79 s [vector] Exception:
  6512. 1415.79 s [vector] Prelude.foldr1: empty list
  6513. 1415.79 s [vector] CallStack (from HasCallStack):
  6514. 1415.79 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6515. 1415.79 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6516. 1415.79 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6517. 1415.79 s [vector] []
  6518. 1415.79 s [vector] zip: OK
  6519. 1415.79 s [vector] +++ OK, passed 100 tests.
  6520. 1415.79 s [vector] zip3: OK
  6521. 1415.79 s [vector] +++ OK, passed 100 tests.
  6522. 1415.79 s [vector] unzip: OK
  6523. 1415.79 s [vector] +++ OK, passed 100 tests.
  6524. 1415.79 s [vector] unzip3: OK
  6525. 1415.79 s [vector] +++ OK, passed 100 tests.
  6526. 1415.79 s [vector] indexed: OK
  6527. 1415.79 s [vector] +++ OK, passed 100 tests.
  6528. 1415.79 s [vector] update: OK
  6529. 1415.79 s [vector] +++ OK, passed 100 tests.
  6530. 1415.79 s [vector] concat: OK
  6531. 1415.79 s [vector] +++ OK, passed 100 tests.
  6532. 1415.79 s [vector] mempty: OK
  6533. 1415.79 s [vector] +++ OK, passed 100 tests.
  6534. 1415.79 s [vector] mappend: OK
  6535. 1415.79 s [vector] +++ OK, passed 100 tests.
  6536. 1415.79 s [vector] mconcat: OK
  6537. 1415.79 s [vector] +++ OK, passed 100 tests.
  6538. 1415.79 s [vector] fmap: OK
  6539. 1415.79 s [vector] +++ OK, passed 100 tests.
  6540. 1415.79 s [vector] return: OK
  6541. 1415.79 s [vector] +++ OK, passed 100 tests.
  6542. 1415.79 s [vector] bind: OK (0.01s)
  6543. 1415.79 s [vector] +++ OK, passed 100 tests.
  6544. 1415.79 s [vector] mzip: OK
  6545. 1415.79 s [vector] +++ OK, passed 100 tests.
  6546. 1415.79 s [vector] munzip: OK
  6547. 1415.79 s [vector] +++ OK, passed 100 tests.
  6548. 1415.79 s [vector] applicative_pure: OK
  6549. 1415.79 s [vector] +++ OK, passed 100 tests.
  6550. 1415.79 s [vector] applicative_appl: OK (0.02s)
  6551. 1415.79 s [vector] +++ OK, passed 100 tests.
  6552. 1415.79 s [vector] alternative_empty: OK
  6553. 1415.79 s [vector] +++ OK, passed 100 tests.
  6554. 1415.79 s [vector] alternative_or: OK
  6555. 1415.79 s [vector] +++ OK, passed 100 tests.
  6556. 1415.79 s [vector] sequence: OK (0.02s)
  6557. 1415.79 s [vector] +++ OK, passed 100 tests.
  6558. 1415.79 s [vector] sequence_: OK
  6559. 1415.79 s [vector] +++ OK, passed 100 tests.
  6560. 1415.79 s [vector] glength: OK
  6561. 1415.79 s [vector] +++ OK, passed 100 tests.
  6562. 1415.79 s [vector] and: OK
  6563. 1415.79 s [vector] +++ OK, passed 100 tests.
  6564. 1415.79 s [vector] or: OK
  6565. 1415.79 s [vector] +++ OK, passed 100 tests.
  6566. 1415.79 s [vector] Int
  6567. 1415.79 s [vector] fromList.toList == id: OK
  6568. 1415.79 s [vector] +++ OK, passed 100 tests.
  6569. 1415.79 s [vector] toList.fromList == id: OK
  6570. 1415.79 s [vector] +++ OK, passed 100 tests.
  6571. 1415.79 s [vector] unstream.stream == id: OK
  6572. 1415.79 s [vector] +++ OK, passed 100 tests.
  6573. 1415.79 s [vector] stream.unstream == id: OK
  6574. 1415.79 s [vector] +++ OK, passed 100 tests.
  6575. 1415.79 s [vector] eq: OK
  6576. 1415.79 s [vector] +++ OK, passed 100 tests.
  6577. 1415.79 s [vector] length: OK
  6578. 1415.79 s [vector] +++ OK, passed 100 tests.
  6579. 1415.79 s [vector] null: OK
  6580. 1415.79 s [vector] +++ OK, passed 100 tests.
  6581. 1415.79 s [vector] index: OK
  6582. 1415.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6583. 1415.79 s [vector] safeIndex: OK
  6584. 1415.79 s [vector] +++ OK, passed 100 tests.
  6585. 1415.79 s [vector] head: OK
  6586. 1415.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6587. 1415.79 s [vector] last: OK
  6588. 1415.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6589. 1415.79 s [vector] unsafeIndex: OK
  6590. 1415.79 s [vector] +++ OK, passed 100 tests; 26 discarded.
  6591. 1415.79 s [vector] unsafeHead: OK
  6592. 1415.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6593. 1415.79 s [vector] unsafeLast: OK
  6594. 1415.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6595. 1415.79 s [vector] slice: OK
  6596. 1415.79 s [vector] +++ OK, passed 100 tests.
  6597. 1415.79 s [vector] init: OK
  6598. 1415.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6599. 1415.79 s [vector] tail: OK
  6600. 1415.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6601. 1415.79 s [vector] take: OK
  6602. 1415.79 s [vector] +++ OK, passed 100 tests.
  6603. 1415.79 s [vector] drop: OK
  6604. 1415.79 s [vector] +++ OK, passed 100 tests.
  6605. 1415.79 s [vector] splitAt: OK
  6606. 1415.79 s [vector] +++ OK, passed 100 tests.
  6607. 1415.79 s [vector] empty: OK
  6608. 1415.79 s [vector] +++ OK, passed 100 tests.
  6609. 1415.79 s [vector] singleton: OK
  6610. 1415.79 s [vector] +++ OK, passed 100 tests.
  6611. 1415.79 s [vector] replicate: OK
  6612. 1415.79 s [vector] +++ OK, passed 100 tests.
  6613. 1415.79 s [vector] generate: OK
  6614. 1415.79 s [vector] +++ OK, passed 100 tests.
  6615. 1415.79 s [vector] iterateN: OK
  6616. 1415.79 s [vector] +++ OK, passed 100 tests.
  6617. 1415.79 s [vector] iterateNM: OK (0.03s)
  6618. 1415.79 s [vector] +++ OK, passed 100 tests.
  6619. 1415.79 s [vector] generateM: OK (0.02s)
  6620. 1415.79 s [vector] +++ OK, passed 100 tests.
  6621. 1415.79 s [vector] replicateM: OK (0.03s)
  6622. 1415.79 s [vector] +++ OK, passed 100 tests.
  6623. 1415.79 s [vector] create: OK
  6624. 1415.79 s [vector] +++ OK, passed 100 tests.
  6625. 1415.79 s [vector] createT: OK
  6626. 1415.79 s [vector] +++ OK, passed 100 tests.
  6627. 1415.79 s [vector] unfoldr: OK
  6628. 1415.79 s [vector] +++ OK, passed 100 tests.
  6629. 1415.79 s [vector] unfoldrN: OK
  6630. 1415.79 s [vector] +++ OK, passed 100 tests.
  6631. 1415.79 s [vector] unfoldrExactN: OK
  6632. 1415.79 s [vector] +++ OK, passed 100 tests.
  6633. 1415.79 s [vector] unfoldrM: OK
  6634. 1415.79 s [vector] +++ OK, passed 100 tests.
  6635. 1415.79 s [vector] unfoldrNM: OK (0.02s)
  6636. 1415.79 s [vector] +++ OK, passed 100 tests.
  6637. 1415.79 s [vector] unfoldrExactNM: OK (0.04s)
  6638. 1415.79 s [vector] +++ OK, passed 100 tests.
  6639. 1415.79 s [vector] constructN: OK
  6640. 1415.79 s [vector] +++ OK, passed 100 tests.
  6641. 1415.79 s [vector] constructrN: OK
  6642. 1415.79 s [vector] +++ OK, passed 100 tests.
  6643. 1415.79 s [vector] cons: OK
  6644. 1415.79 s [vector] +++ OK, passed 100 tests.
  6645. 1415.79 s [vector] snoc: OK
  6646. 1415.79 s [vector] +++ OK, passed 100 tests.
  6647. 1415.79 s [vector] append: OK
  6648. 1415.79 s [vector] +++ OK, passed 100 tests.
  6649. 1415.79 s [vector] concat: OK (0.01s)
  6650. 1415.79 s [vector] +++ OK, passed 100 tests.
  6651. 1415.79 s [vector] force: OK
  6652. 1415.79 s [vector] +++ OK, passed 100 tests.
  6653. 1415.79 s [vector] upd: OK
  6654. 1415.79 s [vector] +++ OK, passed 100 tests.
  6655. 1415.79 s [vector] accum: OK
  6656. 1415.79 s [vector] +++ OK, passed 100 tests.
  6657. 1415.79 s [vector] reverse: OK
  6658. 1415.79 s [vector] +++ OK, passed 100 tests.
  6659. 1415.79 s [vector] backpermute: OK
  6660. 1415.79 s [vector] +++ OK, passed 100 tests.
  6661. 1415.79 s [vector] map: OK
  6662. 1415.79 s [vector] +++ OK, passed 100 tests.
  6663. 1415.79 s [vector] imap: OK
  6664. 1415.79 s [vector] +++ OK, passed 100 tests.
  6665. 1415.79 s [vector] concatMap: OK
  6666. 1415.79 s [vector] +++ OK, passed 100 tests.
  6667. 1415.79 s [vector] mapM: OK
  6668. 1415.79 s [vector] +++ OK, passed 100 tests.
  6669. 1415.79 s [vector] mapM_: OK (0.02s)
  6670. 1415.79 s [vector] +++ OK, passed 100 tests.
  6671. 1415.79 s [vector] forM: OK
  6672. 1415.79 s [vector] +++ OK, passed 100 tests.
  6673. 1415.79 s [vector] forM_: OK (0.02s)
  6674. 1415.79 s [vector] +++ OK, passed 100 tests.
  6675. 1415.79 s [vector] imapM: OK
  6676. 1415.79 s [vector] +++ OK, passed 100 tests.
  6677. 1415.79 s [vector] imapM_: OK (0.02s)
  6678. 1415.80 s [vector] +++ OK, passed 100 tests.
  6679. 1415.80 s [vector] zipWith: OK
  6680. 1415.80 s [vector] +++ OK, passed 100 tests.
  6681. 1415.80 s [vector] zipWith3: OK
  6682. 1415.80 s [vector] +++ OK, passed 100 tests.
  6683. 1415.80 s [vector] izipWith: OK
  6684. 1415.80 s [vector] +++ OK, passed 100 tests.
  6685. 1415.80 s [vector] izipWith3: OK
  6686. 1415.80 s [vector] +++ OK, passed 100 tests.
  6687. 1415.80 s [vector] izipWithM: OK
  6688. 1415.80 s [vector] +++ OK, passed 100 tests.
  6689. 1415.80 s [vector] izipWithM_: OK (0.01s)
  6690. 1415.80 s [vector] +++ OK, passed 100 tests.
  6691. 1415.80 s [vector] zipWithM: OK
  6692. 1415.80 s [vector] +++ OK, passed 100 tests.
  6693. 1415.80 s [vector] zipWithM_: OK (0.02s)
  6694. 1415.80 s [vector] +++ OK, passed 100 tests.
  6695. 1415.80 s [vector] filter: OK
  6696. 1415.80 s [vector] +++ OK, passed 100 tests.
  6697. 1415.80 s [vector] ifilter: OK
  6698. 1415.80 s [vector] +++ OK, passed 100 tests.
  6699. 1415.80 s [vector] filterM: OK (0.02s)
  6700. 1415.80 s [vector] +++ OK, passed 100 tests.
  6701. 1415.80 s [vector] uniq: OK
  6702. 1415.80 s [vector] +++ OK, passed 100 tests.
  6703. 1415.80 s [vector] mapMaybe: OK
  6704. 1415.80 s [vector] +++ OK, passed 100 tests.
  6705. 1415.80 s [vector] imapMaybe: OK
  6706. 1415.80 s [vector] +++ OK, passed 100 tests.
  6707. 1415.80 s [vector] takeWhile: OK
  6708. 1415.80 s [vector] +++ OK, passed 100 tests.
  6709. 1415.80 s [vector] dropWhile: OK
  6710. 1415.80 s [vector] +++ OK, passed 100 tests.
  6711. 1415.80 s [vector] partition: OK
  6712. 1415.80 s [vector] +++ OK, passed 100 tests.
  6713. 1415.80 s [vector] partitionWith: OK
  6714. 1415.80 s [vector] +++ OK, passed 100 tests.
  6715. 1415.80 s [vector] span: OK
  6716. 1415.80 s [vector] +++ OK, passed 100 tests.
  6717. 1415.80 s [vector] break: OK
  6718. 1415.80 s [vector] +++ OK, passed 100 tests.
  6719. 1415.80 s [vector] spanR: OK
  6720. 1415.80 s [vector] +++ OK, passed 100 tests.
  6721. 1415.80 s [vector] breakR: OK
  6722. 1415.80 s [vector] +++ OK, passed 100 tests.
  6723. 1415.80 s [vector] groupBy: OK
  6724. 1415.80 s [vector] +++ OK, passed 100 tests.
  6725. 1415.80 s [vector] elem: OK
  6726. 1415.80 s [vector] +++ OK, passed 100 tests.
  6727. 1415.80 s [vector] notElem: OK
  6728. 1415.80 s [vector] +++ OK, passed 100 tests.
  6729. 1415.80 s [vector] find: OK
  6730. 1415.80 s [vector] +++ OK, passed 100 tests.
  6731. 1415.80 s [vector] findIndex: OK
  6732. 1415.80 s [vector] +++ OK, passed 100 tests.
  6733. 1415.80 s [vector] findIndexR: OK
  6734. 1415.80 s [vector] +++ OK, passed 100 tests.
  6735. 1415.80 s [vector] findIndices: OK
  6736. 1415.80 s [vector] +++ OK, passed 100 tests.
  6737. 1415.80 s [vector] elemIndex: OK
  6738. 1415.80 s [vector] +++ OK, passed 100 tests.
  6739. 1415.80 s [vector] elemIndices: OK
  6740. 1415.80 s [vector] +++ OK, passed 100 tests.
  6741. 1415.80 s [vector] foldl: OK
  6742. 1415.80 s [vector] +++ OK, passed 100 tests.
  6743. 1415.80 s [vector] foldl1: OK
  6744. 1415.80 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6745. 1415.80 s [vector] foldl': OK
  6746. 1415.80 s [vector] +++ OK, passed 100 tests.
  6747. 1415.80 s [vector] foldl1': OK
  6748. 1415.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6749. 1415.80 s [vector] foldr: OK
  6750. 1415.80 s [vector] +++ OK, passed 100 tests.
  6751. 1415.80 s [vector] foldr1: OK
  6752. 1415.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6753. 1415.80 s [vector] foldr': OK
  6754. 1415.80 s [vector] +++ OK, passed 100 tests.
  6755. 1415.80 s [vector] foldr1': OK
  6756. 1415.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6757. 1415.80 s [vector] ifoldl: OK
  6758. 1415.80 s [vector] +++ OK, passed 100 tests.
  6759. 1415.80 s [vector] ifoldl': OK
  6760. 1415.80 s [vector] +++ OK, passed 100 tests.
  6761. 1415.80 s [vector] ifoldr: OK
  6762. 1415.80 s [vector] +++ OK, passed 100 tests.
  6763. 1415.80 s [vector] ifoldr': OK
  6764. 1415.80 s [vector] +++ OK, passed 100 tests.
  6765. 1415.80 s [vector] ifoldM: OK
  6766. 1415.80 s [vector] +++ OK, passed 100 tests.
  6767. 1415.80 s [vector] ifoldM': OK
  6768. 1415.80 s [vector] +++ OK, passed 100 tests.
  6769. 1415.80 s [vector] ifoldM_: OK (0.02s)
  6770. 1415.80 s [vector] +++ OK, passed 100 tests.
  6771. 1415.80 s [vector] ifoldM'_: OK (0.02s)
  6772. 1415.80 s [vector] +++ OK, passed 100 tests.
  6773. 1415.80 s [vector] all: OK
  6774. 1415.80 s [vector] +++ OK, passed 100 tests.
  6775. 1415.80 s [vector] any: OK
  6776. 1415.80 s [vector] +++ OK, passed 100 tests.
  6777. 1415.80 s [vector] prescanl: OK
  6778. 1415.80 s [vector] +++ OK, passed 100 tests.
  6779. 1415.80 s [vector] prescanl': OK
  6780. 1415.80 s [vector] +++ OK, passed 100 tests.
  6781. 1415.80 s [vector] postscanl: OK
  6782. 1415.80 s [vector] +++ OK, passed 100 tests.
  6783. 1415.80 s [vector] postscanl': OK
  6784. 1415.80 s [vector] +++ OK, passed 100 tests.
  6785. 1415.80 s [vector] scanl: OK
  6786. 1415.80 s [vector] +++ OK, passed 100 tests.
  6787. 1415.80 s [vector] scanl': OK
  6788. 1415.80 s [vector] +++ OK, passed 100 tests.
  6789. 1415.80 s [vector] scanl1: OK
  6790. 1415.80 s [vector] +++ OK, passed 100 tests.
  6791. 1415.80 s [vector] scanl1': OK
  6792. 1415.80 s [vector] +++ OK, passed 100 tests.
  6793. 1415.80 s [vector] iscanl: OK
  6794. 1415.80 s [vector] +++ OK, passed 100 tests.
  6795. 1415.80 s [vector] iscanl': OK
  6796. 1415.80 s [vector] +++ OK, passed 100 tests.
  6797. 1415.80 s [vector] prescanr: OK
  6798. 1415.80 s [vector] +++ OK, passed 100 tests.
  6799. 1415.80 s [vector] prescanr': OK
  6800. 1415.80 s [vector] +++ OK, passed 100 tests.
  6801. 1415.80 s [vector] postscanr: OK
  6802. 1415.80 s [vector] +++ OK, passed 100 tests.
  6803. 1415.80 s [vector] postscanr': OK
  6804. 1415.80 s [vector] +++ OK, passed 100 tests.
  6805. 1415.80 s [vector] scanr: OK
  6806. 1415.80 s [vector] +++ OK, passed 100 tests.
  6807. 1415.80 s [vector] scanr': OK
  6808. 1415.80 s [vector] +++ OK, passed 100 tests.
  6809. 1415.80 s [vector] scanr1: OK
  6810. 1415.80 s [vector] +++ OK, passed 100 tests.
  6811. 1415.80 s [vector] scanr1': OK
  6812. 1415.80 s [vector] +++ OK, passed 100 tests.
  6813. 1415.80 s [vector] iscanr: OK
  6814. 1415.80 s [vector] +++ OK, passed 100 tests.
  6815. 1415.80 s [vector] iscanr': OK
  6816. 1415.80 s [vector] +++ OK, passed 100 tests.
  6817. 1415.80 s [vector] mut_read: OK
  6818. 1415.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6819. 1415.81 s [vector] mut_write: OK
  6820. 1415.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6821. 1415.81 s [vector] mut_modify: OK
  6822. 1415.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6823. 1415.81 s [vector] mut_generate: OK
  6824. 1415.81 s [vector] +++ OK, passed 100 tests.
  6825. 1415.81 s [vector] mut_generateM: OK
  6826. 1415.81 s [vector] +++ OK, passed 100 tests.
  6827. 1415.81 s [vector] mut_mapM_: OK (0.02s)
  6828. 1415.81 s [vector] +++ OK, passed 100 tests.
  6829. 1415.81 s [vector] mut_imapM_: OK (0.02s)
  6830. 1415.81 s [vector] +++ OK, passed 100 tests.
  6831. 1415.81 s [vector] mut_forM_: OK (0.02s)
  6832. 1415.81 s [vector] +++ OK, passed 100 tests.
  6833. 1415.81 s [vector] mut_iforM_: OK (0.02s)
  6834. 1415.81 s [vector] +++ OK, passed 100 tests.
  6835. 1415.81 s [vector] mut_foldr: OK
  6836. 1415.81 s [vector] +++ OK, passed 100 tests.
  6837. 1415.81 s [vector] mut_foldr': OK
  6838. 1415.81 s [vector] +++ OK, passed 100 tests.
  6839. 1415.81 s [vector] mut_foldl: OK
  6840. 1415.81 s [vector] +++ OK, passed 100 tests.
  6841. 1415.81 s [vector] mut_foldl': OK
  6842. 1415.81 s [vector] +++ OK, passed 100 tests.
  6843. 1415.81 s [vector] mut_ifoldr: OK
  6844. 1415.81 s [vector] +++ OK, passed 100 tests.
  6845. 1415.81 s [vector] mut_ifoldr': OK
  6846. 1415.81 s [vector] +++ OK, passed 100 tests.
  6847. 1415.81 s [vector] mut_ifoldl: OK
  6848. 1415.81 s [vector] +++ OK, passed 100 tests.
  6849. 1415.81 s [vector] mut_ifoldl': OK
  6850. 1415.81 s [vector] +++ OK, passed 100 tests.
  6851. 1415.81 s [vector] mut_foldM: OK
  6852. 1415.81 s [vector] +++ OK, passed 100 tests.
  6853. 1415.81 s [vector] mut_foldM': OK
  6854. 1415.81 s [vector] +++ OK, passed 100 tests.
  6855. 1415.81 s [vector] mut_foldrM: OK
  6856. 1415.81 s [vector] +++ OK, passed 100 tests.
  6857. 1415.81 s [vector] mut_foldrM': OK
  6858. 1415.81 s [vector] +++ OK, passed 100 tests.
  6859. 1415.81 s [vector] mut_ifoldM: OK
  6860. 1415.81 s [vector] +++ OK, passed 100 tests.
  6861. 1415.81 s [vector] mut_ifoldM': OK
  6862. 1415.81 s [vector] +++ OK, passed 100 tests.
  6863. 1415.81 s [vector] mut_ifoldrM: OK
  6864. 1415.81 s [vector] +++ OK, passed 100 tests.
  6865. 1415.81 s [vector] mut_ifoldrM': OK
  6866. 1415.81 s [vector] +++ OK, passed 100 tests.
  6867. 1415.81 s [vector] compare: OK
  6868. 1415.81 s [vector] +++ OK, passed 100 tests.
  6869. 1415.81 s [vector] maximum: OK
  6870. 1415.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6871. 1415.81 s [vector] minimum: OK
  6872. 1415.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6873. 1415.81 s [vector] minIndex: OK
  6874. 1415.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6875. 1415.81 s [vector] maxIndex: OK
  6876. 1415.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6877. 1415.81 s [vector] maximumBy: OK
  6878. 1415.81 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6879. 1415.81 s [vector] minimumBy: OK
  6880. 1415.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6881. 1415.81 s [vector] maximumOn: OK
  6882. 1415.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6883. 1415.81 s [vector] minimumOn: OK
  6884. 1415.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6885. 1415.81 s [vector] maxIndexBy: OK
  6886. 1415.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6887. 1415.81 s [vector] minIndexBy: OK
  6888. 1415.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6889. 1415.81 s [vector] ListFirstMaxIndexWins: OK
  6890. 1415.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6891. 1415.81 s [vector] FalseListFirstMaxIndexWins: OK
  6892. 1415.81 s [vector] +++ OK, failed as expected. (after 1 test):
  6893. 1415.81 s [vector] Exception:
  6894. 1415.81 s [vector] Prelude.foldr1: empty list
  6895. 1415.81 s [vector] CallStack (from HasCallStack):
  6896. 1415.81 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6897. 1415.81 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6898. 1415.81 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6899. 1415.81 s [vector] []
  6900. 1415.81 s [vector] zip: OK
  6901. 1415.81 s [vector] +++ OK, passed 100 tests.
  6902. 1415.81 s [vector] zip3: OK
  6903. 1415.81 s [vector] +++ OK, passed 100 tests.
  6904. 1415.81 s [vector] unzip: OK
  6905. 1415.81 s [vector] +++ OK, passed 100 tests.
  6906. 1415.81 s [vector] unzip3: OK
  6907. 1415.81 s [vector] +++ OK, passed 100 tests.
  6908. 1415.81 s [vector] indexed: OK
  6909. 1415.81 s [vector] +++ OK, passed 100 tests.
  6910. 1415.81 s [vector] update: OK
  6911. 1415.81 s [vector] +++ OK, passed 100 tests.
  6912. 1415.81 s [vector] concat: OK (0.01s)
  6913. 1415.81 s [vector] +++ OK, passed 100 tests.
  6914. 1415.81 s [vector] mempty: OK
  6915. 1415.81 s [vector] +++ OK, passed 100 tests.
  6916. 1415.81 s [vector] mappend: OK
  6917. 1415.81 s [vector] +++ OK, passed 100 tests.
  6918. 1415.81 s [vector] mconcat: OK
  6919. 1415.81 s [vector] +++ OK, passed 100 tests.
  6920. 1415.81 s [vector] fmap: OK
  6921. 1415.81 s [vector] +++ OK, passed 100 tests.
  6922. 1415.81 s [vector] return: OK
  6923. 1415.81 s [vector] +++ OK, passed 100 tests.
  6924. 1415.81 s [vector] bind: OK (0.02s)
  6925. 1415.81 s [vector] +++ OK, passed 100 tests.
  6926. 1415.81 s [vector] mzip: OK
  6927. 1415.81 s [vector] +++ OK, passed 100 tests.
  6928. 1415.81 s [vector] munzip: OK
  6929. 1415.81 s [vector] +++ OK, passed 100 tests.
  6930. 1415.81 s [vector] applicative_pure: OK
  6931. 1415.81 s [vector] +++ OK, passed 100 tests.
  6932. 1415.81 s [vector] applicative_appl: OK (0.04s)
  6933. 1415.81 s [vector] +++ OK, passed 100 tests.
  6934. 1415.81 s [vector] alternative_empty: OK
  6935. 1415.81 s [vector] +++ OK, passed 100 tests.
  6936. 1415.81 s [vector] alternative_or: OK
  6937. 1415.81 s [vector] +++ OK, passed 100 tests.
  6938. 1415.81 s [vector] sequence: OK (0.04s)
  6939. 1415.81 s [vector] +++ OK, passed 100 tests.
  6940. 1415.81 s [vector] sequence_: OK (0.01s)
  6941. 1415.81 s [vector] +++ OK, passed 100 tests.
  6942. 1415.81 s [vector] glength: OK
  6943. 1415.81 s [vector] +++ OK, passed 100 tests.
  6944. 1415.81 s [vector] sum: OK
  6945. 1415.81 s [vector] +++ OK, passed 100 tests.
  6946. 1415.81 s [vector] product: OK
  6947. 1415.81 s [vector] +++ OK, passed 100 tests.
  6948. 1415.81 s [vector] enumFromN: OK
  6949. 1415.81 s [vector] +++ OK, passed 100 tests.
  6950. 1415.81 s [vector] enumFromThenN: OK
  6951. 1415.81 s [vector] +++ OK, passed 100 tests.
  6952. 1415.81 s [vector] enumFromTo: OK
  6953. 1415.81 s [vector] +++ OK, passed 100 tests.
  6954. 1415.81 s [vector] enumFromThenTo: OK
  6955. 1415.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6956. 1415.81 s [vector] unstream
  6957. 1415.81 s [vector] unstream == vunstream (exact): OK
  6958. 1415.81 s [vector] +++ OK, passed 100 tests.
  6959. 1415.81 s [vector] unstream == vunstream (unknown): OK
  6960. 1415.81 s [vector] +++ OK, passed 100 tests.
  6961. 1415.81 s [vector] unstreamR ~= vunstream (exact): OK
  6962. 1415.81 s [vector] +++ OK, passed 100 tests.
  6963. 1415.81 s [vector] unstreamR ~= vunstream (unknown): OK
  6964. 1415.81 s [vector] +++ OK, passed 100 tests.
  6965. 1415.81 s [vector] Tests.Vector.Unboxed
  6966. 1415.81 s [vector] ()
  6967. 1415.81 s [vector] fromList.toList == id: OK
  6968. 1415.81 s [vector] +++ OK, passed 100 tests.
  6969. 1415.81 s [vector] toList.fromList == id: OK
  6970. 1415.81 s [vector] +++ OK, passed 100 tests.
  6971. 1415.81 s [vector] unstream.stream == id: OK
  6972. 1415.81 s [vector] +++ OK, passed 100 tests.
  6973. 1415.81 s [vector] stream.unstream == id: OK
  6974. 1415.81 s [vector] +++ OK, passed 100 tests.
  6975. 1415.81 s [vector] eq: OK
  6976. 1415.81 s [vector] +++ OK, passed 100 tests.
  6977. 1415.81 s [vector] length: OK
  6978. 1415.81 s [vector] +++ OK, passed 100 tests.
  6979. 1415.81 s [vector] null: OK
  6980. 1415.81 s [vector] +++ OK, passed 100 tests.
  6981. 1415.81 s [vector] index: OK
  6982. 1415.81 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6983. 1415.81 s [vector] safeIndex: OK
  6984. 1415.81 s [vector] +++ OK, passed 100 tests.
  6985. 1415.81 s [vector] head: OK
  6986. 1415.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6987. 1415.81 s [vector] last: OK
  6988. 1415.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6989. 1415.81 s [vector] unsafeIndex: OK
  6990. 1415.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6991. 1415.81 s [vector] unsafeHead: OK
  6992. 1415.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6993. 1415.81 s [vector] unsafeLast: OK
  6994. 1415.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6995. 1415.81 s [vector] slice: OK
  6996. 1415.81 s [vector] +++ OK, passed 100 tests.
  6997. 1415.81 s [vector] init: OK
  6998. 1415.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6999. 1415.81 s [vector] tail: OK
  7000. 1415.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7001. 1415.81 s [vector] take: OK
  7002. 1415.81 s [vector] +++ OK, passed 100 tests.
  7003. 1415.81 s [vector] drop: OK
  7004. 1415.81 s [vector] +++ OK, passed 100 tests.
  7005. 1415.81 s [vector] splitAt: OK
  7006. 1415.81 s [vector] +++ OK, passed 100 tests.
  7007. 1415.81 s [vector] empty: OK
  7008. 1415.81 s [vector] +++ OK, passed 100 tests.
  7009. 1415.81 s [vector] singleton: OK
  7010. 1415.81 s [vector] +++ OK, passed 100 tests.
  7011. 1415.81 s [vector] replicate: OK
  7012. 1415.81 s [vector] +++ OK, passed 100 tests.
  7013. 1415.81 s [vector] generate: OK
  7014. 1415.81 s [vector] +++ OK, passed 100 tests.
  7015. 1415.81 s [vector] iterateN: OK
  7016. 1415.81 s [vector] +++ OK, passed 100 tests.
  7017. 1415.81 s [vector] iterateNM: OK (0.04s)
  7018. 1415.81 s [vector] +++ OK, passed 100 tests.
  7019. 1415.81 s [vector] generateM: OK (0.03s)
  7020. 1415.81 s [vector] +++ OK, passed 100 tests.
  7021. 1415.81 s [vector] replicateM: OK
  7022. 1415.81 s [vector] +++ OK, passed 100 tests.
  7023. 1415.81 s [vector] create: OK
  7024. 1415.81 s [vector] +++ OK, passed 100 tests.
  7025. 1415.81 s [vector] createT: OK
  7026. 1415.81 s [vector] +++ OK, passed 100 tests.
  7027. 1415.81 s [vector] unfoldr: OK
  7028. 1415.81 s [vector] +++ OK, passed 100 tests.
  7029. 1415.81 s [vector] unfoldrN: OK
  7030. 1415.81 s [vector] +++ OK, passed 100 tests.
  7031. 1415.81 s [vector] unfoldrExactN: OK
  7032. 1415.81 s [vector] +++ OK, passed 100 tests.
  7033. 1415.81 s [vector] unfoldrM: OK
  7034. 1415.82 s [vector] +++ OK, passed 100 tests.
  7035. 1415.82 s [vector] unfoldrNM: OK
  7036. 1415.82 s [vector] +++ OK, passed 100 tests.
  7037. 1415.82 s [vector] unfoldrExactNM: OK (0.04s)
  7038. 1415.82 s [vector] +++ OK, passed 100 tests.
  7039. 1415.82 s [vector] constructN: OK
  7040. 1415.82 s [vector] +++ OK, passed 100 tests.
  7041. 1415.82 s [vector] constructrN: OK
  7042. 1415.82 s [vector] +++ OK, passed 100 tests.
  7043. 1415.82 s [vector] cons: OK
  7044. 1415.82 s [vector] +++ OK, passed 100 tests.
  7045. 1415.82 s [vector] snoc: OK
  7046. 1415.82 s [vector] +++ OK, passed 100 tests.
  7047. 1415.82 s [vector] append: OK
  7048. 1415.82 s [vector] +++ OK, passed 100 tests.
  7049. 1415.82 s [vector] concat: OK (0.01s)
  7050. 1415.82 s [vector] +++ OK, passed 100 tests.
  7051. 1415.82 s [vector] force: OK
  7052. 1415.82 s [vector] +++ OK, passed 100 tests.
  7053. 1415.82 s [vector] upd: OK
  7054. 1415.82 s [vector] +++ OK, passed 100 tests.
  7055. 1415.82 s [vector] accum: OK
  7056. 1415.82 s [vector] +++ OK, passed 100 tests.
  7057. 1415.82 s [vector] reverse: OK
  7058. 1415.82 s [vector] +++ OK, passed 100 tests.
  7059. 1415.82 s [vector] backpermute: OK
  7060. 1415.82 s [vector] +++ OK, passed 100 tests.
  7061. 1415.82 s [vector] map: OK
  7062. 1415.82 s [vector] +++ OK, passed 100 tests.
  7063. 1415.82 s [vector] imap: OK
  7064. 1415.82 s [vector] +++ OK, passed 100 tests.
  7065. 1415.82 s [vector] concatMap: OK
  7066. 1415.82 s [vector] +++ OK, passed 100 tests.
  7067. 1415.82 s [vector] mapM: OK
  7068. 1415.82 s [vector] +++ OK, passed 100 tests.
  7069. 1415.82 s [vector] mapM_: OK (0.01s)
  7070. 1415.82 s [vector] +++ OK, passed 100 tests.
  7071. 1415.82 s [vector] forM: OK
  7072. 1415.82 s [vector] +++ OK, passed 100 tests.
  7073. 1415.82 s [vector] forM_: OK
  7074. 1415.82 s [vector] +++ OK, passed 100 tests.
  7075. 1415.82 s [vector] imapM: OK
  7076. 1415.82 s [vector] +++ OK, passed 100 tests.
  7077. 1415.82 s [vector] imapM_: OK (0.01s)
  7078. 1415.82 s [vector] +++ OK, passed 100 tests.
  7079. 1415.82 s [vector] zipWith: OK
  7080. 1415.82 s [vector] +++ OK, passed 100 tests.
  7081. 1415.82 s [vector] zipWith3: OK
  7082. 1415.82 s [vector] +++ OK, passed 100 tests.
  7083. 1415.82 s [vector] izipWith: OK
  7084. 1415.82 s [vector] +++ OK, passed 100 tests.
  7085. 1415.82 s [vector] izipWith3: OK
  7086. 1415.82 s [vector] +++ OK, passed 100 tests.
  7087. 1415.82 s [vector] izipWithM: OK
  7088. 1415.82 s [vector] +++ OK, passed 100 tests.
  7089. 1415.82 s [vector] izipWithM_: OK
  7090. 1415.82 s [vector] +++ OK, passed 100 tests.
  7091. 1415.82 s [vector] zipWithM: OK
  7092. 1415.82 s [vector] +++ OK, passed 100 tests.
  7093. 1415.82 s [vector] zipWithM_: OK
  7094. 1415.82 s [vector] +++ OK, passed 100 tests.
  7095. 1415.82 s [vector] filter: OK
  7096. 1415.82 s [vector] +++ OK, passed 100 tests.
  7097. 1415.82 s [vector] ifilter: OK
  7098. 1415.82 s [vector] +++ OK, passed 100 tests.
  7099. 1415.82 s [vector] filterM: OK (0.02s)
  7100. 1415.82 s [vector] +++ OK, passed 100 tests.
  7101. 1415.82 s [vector] uniq: OK
  7102. 1415.82 s [vector] +++ OK, passed 100 tests.
  7103. 1415.82 s [vector] mapMaybe: OK
  7104. 1415.82 s [vector] +++ OK, passed 100 tests.
  7105. 1415.82 s [vector] imapMaybe: OK
  7106. 1415.82 s [vector] +++ OK, passed 100 tests.
  7107. 1415.82 s [vector] takeWhile: OK
  7108. 1415.82 s [vector] +++ OK, passed 100 tests.
  7109. 1415.82 s [vector] dropWhile: OK
  7110. 1415.82 s [vector] +++ OK, passed 100 tests.
  7111. 1415.82 s [vector] partition: OK
  7112. 1415.82 s [vector] +++ OK, passed 100 tests.
  7113. 1415.82 s [vector] partitionWith: OK
  7114. 1415.82 s [vector] +++ OK, passed 100 tests.
  7115. 1415.82 s [vector] span: OK
  7116. 1415.82 s [vector] +++ OK, passed 100 tests.
  7117. 1415.82 s [vector] break: OK
  7118. 1415.82 s [vector] +++ OK, passed 100 tests.
  7119. 1415.82 s [vector] spanR: OK
  7120. 1415.82 s [vector] +++ OK, passed 100 tests.
  7121. 1415.82 s [vector] breakR: OK
  7122. 1415.82 s [vector] +++ OK, passed 100 tests.
  7123. 1415.82 s [vector] groupBy: OK
  7124. 1415.82 s [vector] +++ OK, passed 100 tests.
  7125. 1415.82 s [vector] elem: OK
  7126. 1415.82 s [vector] +++ OK, passed 100 tests.
  7127. 1415.82 s [vector] notElem: OK
  7128. 1415.82 s [vector] +++ OK, passed 100 tests.
  7129. 1415.82 s [vector] find: OK
  7130. 1415.82 s [vector] +++ OK, passed 100 tests.
  7131. 1415.82 s [vector] findIndex: OK
  7132. 1415.82 s [vector] +++ OK, passed 100 tests.
  7133. 1415.82 s [vector] findIndexR: OK
  7134. 1415.82 s [vector] +++ OK, passed 100 tests.
  7135. 1415.82 s [vector] findIndices: OK
  7136. 1415.82 s [vector] +++ OK, passed 100 tests.
  7137. 1415.82 s [vector] elemIndex: OK
  7138. 1415.82 s [vector] +++ OK, passed 100 tests.
  7139. 1415.82 s [vector] elemIndices: OK
  7140. 1415.82 s [vector] +++ OK, passed 100 tests.
  7141. 1415.82 s [vector] foldl: OK
  7142. 1415.82 s [vector] +++ OK, passed 100 tests.
  7143. 1415.82 s [vector] foldl1: OK
  7144. 1415.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7145. 1415.82 s [vector] foldl': OK
  7146. 1415.82 s [vector] +++ OK, passed 100 tests.
  7147. 1415.82 s [vector] foldl1': OK
  7148. 1415.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7149. 1415.82 s [vector] foldr: OK
  7150. 1415.82 s [vector] +++ OK, passed 100 tests.
  7151. 1415.82 s [vector] foldr1: OK
  7152. 1415.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7153. 1415.82 s [vector] foldr': OK
  7154. 1415.82 s [vector] +++ OK, passed 100 tests.
  7155. 1415.82 s [vector] foldr1': OK
  7156. 1415.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7157. 1415.82 s [vector] ifoldl: OK
  7158. 1415.82 s [vector] +++ OK, passed 100 tests.
  7159. 1415.82 s [vector] ifoldl': OK
  7160. 1415.82 s [vector] +++ OK, passed 100 tests.
  7161. 1415.82 s [vector] ifoldr: OK
  7162. 1415.82 s [vector] +++ OK, passed 100 tests.
  7163. 1415.82 s [vector] ifoldr': OK
  7164. 1415.82 s [vector] +++ OK, passed 100 tests.
  7165. 1415.82 s [vector] ifoldM: OK
  7166. 1415.82 s [vector] +++ OK, passed 100 tests.
  7167. 1415.82 s [vector] ifoldM': OK
  7168. 1415.82 s [vector] +++ OK, passed 100 tests.
  7169. 1415.82 s [vector] ifoldM_: OK (0.01s)
  7170. 1415.82 s [vector] +++ OK, passed 100 tests.
  7171. 1415.82 s [vector] ifoldM'_: OK (0.01s)
  7172. 1415.82 s [vector] +++ OK, passed 100 tests.
  7173. 1415.82 s [vector] all: OK
  7174. 1415.82 s [vector] +++ OK, passed 100 tests.
  7175. 1415.82 s [vector] any: OK
  7176. 1415.82 s [vector] +++ OK, passed 100 tests.
  7177. 1415.82 s [vector] prescanl: OK
  7178. 1415.82 s [vector] +++ OK, passed 100 tests.
  7179. 1415.82 s [vector] prescanl': OK
  7180. 1415.82 s [vector] +++ OK, passed 100 tests.
  7181. 1415.82 s [vector] postscanl: OK
  7182. 1415.82 s [vector] +++ OK, passed 100 tests.
  7183. 1415.82 s [vector] postscanl': OK
  7184. 1415.82 s [vector] +++ OK, passed 100 tests.
  7185. 1415.82 s [vector] scanl: OK
  7186. 1415.82 s [vector] +++ OK, passed 100 tests.
  7187. 1415.82 s [vector] scanl': OK
  7188. 1415.82 s [vector] +++ OK, passed 100 tests.
  7189. 1415.82 s [vector] scanl1: OK
  7190. 1415.82 s [vector] +++ OK, passed 100 tests.
  7191. 1415.82 s [vector] scanl1': OK
  7192. 1415.82 s [vector] +++ OK, passed 100 tests.
  7193. 1415.82 s [vector] iscanl: OK
  7194. 1415.82 s [vector] +++ OK, passed 100 tests.
  7195. 1415.82 s [vector] iscanl': OK
  7196. 1415.82 s [vector] +++ OK, passed 100 tests.
  7197. 1415.82 s [vector] prescanr: OK
  7198. 1415.82 s [vector] +++ OK, passed 100 tests.
  7199. 1415.82 s [vector] prescanr': OK
  7200. 1415.82 s [vector] +++ OK, passed 100 tests.
  7201. 1415.82 s [vector] postscanr: OK
  7202. 1415.82 s [vector] +++ OK, passed 100 tests.
  7203. 1415.82 s [vector] postscanr': OK
  7204. 1415.82 s [vector] +++ OK, passed 100 tests.
  7205. 1415.82 s [vector] scanr: OK
  7206. 1415.82 s [vector] +++ OK, passed 100 tests.
  7207. 1415.82 s [vector] scanr': OK
  7208. 1415.82 s [vector] +++ OK, passed 100 tests.
  7209. 1415.82 s [vector] scanr1: OK
  7210. 1415.82 s [vector] +++ OK, passed 100 tests.
  7211. 1415.82 s [vector] scanr1': OK
  7212. 1415.82 s [vector] +++ OK, passed 100 tests.
  7213. 1415.82 s [vector] iscanr: OK
  7214. 1415.82 s [vector] +++ OK, passed 100 tests.
  7215. 1415.82 s [vector] iscanr': OK
  7216. 1415.82 s [vector] +++ OK, passed 100 tests.
  7217. 1415.82 s [vector] mut_read: OK
  7218. 1415.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7219. 1415.82 s [vector] mut_write: OK
  7220. 1415.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7221. 1415.82 s [vector] mut_modify: OK
  7222. 1415.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7223. 1415.82 s [vector] mut_generate: OK
  7224. 1415.82 s [vector] +++ OK, passed 100 tests.
  7225. 1415.82 s [vector] mut_generateM: OK
  7226. 1415.82 s [vector] +++ OK, passed 100 tests.
  7227. 1415.82 s [vector] mut_mapM_: OK (0.01s)
  7228. 1415.82 s [vector] +++ OK, passed 100 tests.
  7229. 1415.82 s [vector] mut_imapM_: OK (0.01s)
  7230. 1415.82 s [vector] +++ OK, passed 100 tests.
  7231. 1415.82 s [vector] mut_forM_: OK
  7232. 1415.82 s [vector] +++ OK, passed 100 tests.
  7233. 1415.82 s [vector] mut_iforM_: OK (0.01s)
  7234. 1415.82 s [vector] +++ OK, passed 100 tests.
  7235. 1415.82 s [vector] mut_foldr: OK
  7236. 1415.82 s [vector] +++ OK, passed 100 tests.
  7237. 1415.82 s [vector] mut_foldr': OK
  7238. 1415.82 s [vector] +++ OK, passed 100 tests.
  7239. 1415.82 s [vector] mut_foldl: OK
  7240. 1415.82 s [vector] +++ OK, passed 100 tests.
  7241. 1415.82 s [vector] mut_foldl': OK
  7242. 1415.82 s [vector] +++ OK, passed 100 tests.
  7243. 1415.82 s [vector] mut_ifoldr: OK
  7244. 1415.82 s [vector] +++ OK, passed 100 tests.
  7245. 1415.82 s [vector] mut_ifoldr': OK
  7246. 1415.82 s [vector] +++ OK, passed 100 tests.
  7247. 1415.82 s [vector] mut_ifoldl: OK
  7248. 1415.82 s [vector] +++ OK, passed 100 tests.
  7249. 1415.82 s [vector] mut_ifoldl': OK
  7250. 1415.82 s [vector] +++ OK, passed 100 tests.
  7251. 1415.82 s [vector] mut_foldM: OK
  7252. 1415.82 s [vector] +++ OK, passed 100 tests.
  7253. 1415.82 s [vector] mut_foldM': OK
  7254. 1415.82 s [vector] +++ OK, passed 100 tests.
  7255. 1415.82 s [vector] mut_foldrM: OK
  7256. 1415.82 s [vector] +++ OK, passed 100 tests.
  7257. 1415.82 s [vector] mut_foldrM': OK
  7258. 1415.82 s [vector] +++ OK, passed 100 tests.
  7259. 1415.82 s [vector] mut_ifoldM: OK
  7260. 1415.82 s [vector] +++ OK, passed 100 tests.
  7261. 1415.82 s [vector] mut_ifoldM': OK
  7262. 1415.82 s [vector] +++ OK, passed 100 tests.
  7263. 1415.82 s [vector] mut_ifoldrM: OK
  7264. 1415.82 s [vector] +++ OK, passed 100 tests.
  7265. 1415.82 s [vector] mut_ifoldrM': OK
  7266. 1415.82 s [vector] +++ OK, passed 100 tests.
  7267. 1415.82 s [vector] compare: OK
  7268. 1415.82 s [vector] +++ OK, passed 100 tests.
  7269. 1415.82 s [vector] maximum: OK
  7270. 1415.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7271. 1415.82 s [vector] minimum: OK
  7272. 1415.82 s [vector] +++ OK, passed 100 tests; 26 discarded.
  7273. 1415.82 s [vector] minIndex: OK
  7274. 1415.82 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7275. 1415.82 s [vector] maxIndex: OK
  7276. 1415.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7277. 1415.82 s [vector] maximumBy: OK
  7278. 1415.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7279. 1415.82 s [vector] minimumBy: OK
  7280. 1415.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7281. 1415.82 s [vector] maximumOn: OK
  7282. 1415.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7283. 1415.82 s [vector] minimumOn: OK
  7284. 1415.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7285. 1415.82 s [vector] maxIndexBy: OK
  7286. 1415.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7287. 1415.82 s [vector] minIndexBy: OK
  7288. 1415.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7289. 1415.82 s [vector] ListFirstMaxIndexWins: OK
  7290. 1415.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7291. 1415.82 s [vector] FalseListFirstMaxIndexWins: OK
  7292. 1415.82 s [vector] +++ OK, failed as expected. (after 1 test):
  7293. 1415.82 s [vector] Exception:
  7294. 1415.82 s [vector] Prelude.foldr1: empty list
  7295. 1415.82 s [vector] CallStack (from HasCallStack):
  7296. 1415.82 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  7297. 1415.82 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  7298. 1415.82 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7299. 1415.82 s [vector] []
  7300. 1415.82 s [vector] zip: OK
  7301. 1415.82 s [vector] +++ OK, passed 100 tests.
  7302. 1415.82 s [vector] zip3: OK
  7303. 1415.82 s [vector] +++ OK, passed 100 tests.
  7304. 1415.82 s [vector] unzip: OK
  7305. 1415.82 s [vector] +++ OK, passed 100 tests.
  7306. 1415.82 s [vector] unzip3: OK
  7307. 1415.82 s [vector] +++ OK, passed 100 tests.
  7308. 1415.82 s [vector] indexed: OK
  7309. 1415.82 s [vector] +++ OK, passed 100 tests.
  7310. 1415.82 s [vector] update: OK
  7311. 1415.82 s [vector] +++ OK, passed 100 tests.
  7312. 1415.82 s [vector] mempty: OK
  7313. 1415.82 s [vector] +++ OK, passed 100 tests.
  7314. 1415.82 s [vector] mappend: OK
  7315. 1415.82 s [vector] +++ OK, passed 100 tests.
  7316. 1415.82 s [vector] mconcat: OK
  7317. 1415.82 s [vector] +++ OK, passed 100 tests.
  7318. 1415.82 s [vector] glength: OK
  7319. 1415.82 s [vector] +++ OK, passed 100 tests.
  7320. 1415.82 s [vector] (Bool)
  7321. 1415.82 s [vector] fromList.toList == id: OK
  7322. 1415.82 s [vector] +++ OK, passed 100 tests.
  7323. 1415.82 s [vector] toList.fromList == id: OK
  7324. 1415.82 s [vector] +++ OK, passed 100 tests.
  7325. 1415.82 s [vector] unstream.stream == id: OK
  7326. 1415.82 s [vector] +++ OK, passed 100 tests.
  7327. 1415.82 s [vector] stream.unstream == id: OK
  7328. 1415.82 s [vector] +++ OK, passed 100 tests.
  7329. 1415.82 s [vector] eq: OK
  7330. 1415.82 s [vector] +++ OK, passed 100 tests.
  7331. 1415.82 s [vector] length: OK
  7332. 1415.82 s [vector] +++ OK, passed 100 tests.
  7333. 1415.82 s [vector] null: OK
  7334. 1415.82 s [vector] +++ OK, passed 100 tests.
  7335. 1415.82 s [vector] index: OK
  7336. 1415.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7337. 1415.82 s [vector] safeIndex: OK
  7338. 1415.82 s [vector] +++ OK, passed 100 tests.
  7339. 1415.82 s [vector] head: OK
  7340. 1415.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7341. 1415.82 s [vector] last: OK
  7342. 1415.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7343. 1415.82 s [vector] unsafeIndex: OK
  7344. 1415.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7345. 1415.82 s [vector] unsafeHead: OK
  7346. 1415.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7347. 1415.82 s [vector] unsafeLast: OK
  7348. 1415.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7349. 1415.82 s [vector] slice: OK
  7350. 1415.82 s [vector] +++ OK, passed 100 tests.
  7351. 1415.82 s [vector] init: OK
  7352. 1415.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7353. 1415.82 s [vector] tail: OK
  7354. 1415.82 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7355. 1415.82 s [vector] take: OK
  7356. 1415.82 s [vector] +++ OK, passed 100 tests.
  7357. 1415.82 s [vector] drop: OK
  7358. 1415.82 s [vector] +++ OK, passed 100 tests.
  7359. 1415.82 s [vector] splitAt: OK
  7360. 1415.82 s [vector] +++ OK, passed 100 tests.
  7361. 1415.82 s [vector] empty: OK
  7362. 1415.82 s [vector] +++ OK, passed 100 tests.
  7363. 1415.82 s [vector] singleton: OK
  7364. 1415.82 s [vector] +++ OK, passed 100 tests.
  7365. 1415.82 s [vector] replicate: OK
  7366. 1415.82 s [vector] +++ OK, passed 100 tests.
  7367. 1415.82 s [vector] generate: OK
  7368. 1415.82 s [vector] +++ OK, passed 100 tests.
  7369. 1415.82 s [vector] iterateN: OK
  7370. 1415.82 s [vector] +++ OK, passed 100 tests.
  7371. 1415.82 s [vector] iterateNM: OK (0.05s)
  7372. 1415.82 s [vector] +++ OK, passed 100 tests.
  7373. 1415.82 s [vector] generateM: OK (0.01s)
  7374. 1415.82 s [vector] +++ OK, passed 100 tests.
  7375. 1415.82 s [vector] replicateM: OK
  7376. 1415.82 s [vector] +++ OK, passed 100 tests.
  7377. 1415.82 s [vector] create: OK
  7378. 1415.82 s [vector] +++ OK, passed 100 tests.
  7379. 1415.82 s [vector] createT: OK
  7380. 1415.82 s [vector] +++ OK, passed 100 tests.
  7381. 1415.82 s [vector] unfoldr: OK
  7382. 1415.82 s [vector] +++ OK, passed 100 tests.
  7383. 1415.82 s [vector] unfoldrN: OK
  7384. 1415.82 s [vector] +++ OK, passed 100 tests.
  7385. 1415.82 s [vector] unfoldrExactN: OK
  7386. 1415.82 s [vector] +++ OK, passed 100 tests.
  7387. 1415.82 s [vector] unfoldrM: OK
  7388. 1415.82 s [vector] +++ OK, passed 100 tests.
  7389. 1415.82 s [vector] unfoldrNM: OK
  7390. 1415.82 s [vector] +++ OK, passed 100 tests.
  7391. 1415.82 s [vector] unfoldrExactNM: OK (0.04s)
  7392. 1415.82 s [vector] +++ OK, passed 100 tests.
  7393. 1415.82 s [vector] constructN: OK
  7394. 1415.82 s [vector] +++ OK, passed 100 tests.
  7395. 1415.83 s [vector] constructrN: OK
  7396. 1415.83 s [vector] +++ OK, passed 100 tests.
  7397. 1415.83 s [vector] cons: OK
  7398. 1415.83 s [vector] +++ OK, passed 100 tests.
  7399. 1415.83 s [vector] snoc: OK
  7400. 1415.83 s [vector] +++ OK, passed 100 tests.
  7401. 1415.83 s [vector] append: OK
  7402. 1415.83 s [vector] +++ OK, passed 100 tests.
  7403. 1415.83 s [vector] concat: OK (0.01s)
  7404. 1415.83 s [vector] +++ OK, passed 100 tests.
  7405. 1415.83 s [vector] force: OK
  7406. 1415.83 s [vector] +++ OK, passed 100 tests.
  7407. 1415.83 s [vector] upd: OK
  7408. 1415.83 s [vector] +++ OK, passed 100 tests.
  7409. 1415.83 s [vector] accum: OK
  7410. 1415.83 s [vector] +++ OK, passed 100 tests.
  7411. 1415.83 s [vector] reverse: OK
  7412. 1415.83 s [vector] +++ OK, passed 100 tests.
  7413. 1415.83 s [vector] backpermute: OK
  7414. 1415.83 s [vector] +++ OK, passed 100 tests.
  7415. 1415.83 s [vector] map: OK
  7416. 1415.83 s [vector] +++ OK, passed 100 tests.
  7417. 1415.83 s [vector] imap: OK
  7418. 1415.83 s [vector] +++ OK, passed 100 tests.
  7419. 1415.83 s [vector] concatMap: OK
  7420. 1415.83 s [vector] +++ OK, passed 100 tests.
  7421. 1415.83 s [vector] mapM: OK
  7422. 1415.83 s [vector] +++ OK, passed 100 tests.
  7423. 1415.83 s [vector] mapM_: OK (0.01s)
  7424. 1415.83 s [vector] +++ OK, passed 100 tests.
  7425. 1415.83 s [vector] forM: OK
  7426. 1415.83 s [vector] +++ OK, passed 100 tests.
  7427. 1415.83 s [vector] forM_: OK (0.01s)
  7428. 1415.83 s [vector] +++ OK, passed 100 tests.
  7429. 1415.83 s [vector] imapM: OK
  7430. 1415.83 s [vector] +++ OK, passed 100 tests.
  7431. 1415.83 s [vector] imapM_: OK (0.01s)
  7432. 1415.83 s [vector] +++ OK, passed 100 tests.
  7433. 1415.83 s [vector] zipWith: OK
  7434. 1415.83 s [vector] +++ OK, passed 100 tests.
  7435. 1415.83 s [vector] zipWith3: OK
  7436. 1415.83 s [vector] +++ OK, passed 100 tests.
  7437. 1415.83 s [vector] izipWith: OK
  7438. 1415.83 s [vector] +++ OK, passed 100 tests.
  7439. 1415.83 s [vector] izipWith3: OK
  7440. 1415.83 s [vector] +++ OK, passed 100 tests.
  7441. 1415.83 s [vector] izipWithM: OK
  7442. 1415.83 s [vector] +++ OK, passed 100 tests.
  7443. 1415.83 s [vector] izipWithM_: OK
  7444. 1415.83 s [vector] +++ OK, passed 100 tests.
  7445. 1415.83 s [vector] zipWithM: OK
  7446. 1415.83 s [vector] +++ OK, passed 100 tests.
  7447. 1415.83 s [vector] zipWithM_: OK
  7448. 1415.83 s [vector] +++ OK, passed 100 tests.
  7449. 1415.83 s [vector] filter: OK
  7450. 1415.83 s [vector] +++ OK, passed 100 tests.
  7451. 1415.83 s [vector] ifilter: OK
  7452. 1415.83 s [vector] +++ OK, passed 100 tests.
  7453. 1415.83 s [vector] filterM: OK (0.03s)
  7454. 1415.83 s [vector] +++ OK, passed 100 tests.
  7455. 1415.83 s [vector] uniq: OK
  7456. 1415.83 s [vector] +++ OK, passed 100 tests.
  7457. 1415.83 s [vector] mapMaybe: OK
  7458. 1415.83 s [vector] +++ OK, passed 100 tests.
  7459. 1415.83 s [vector] imapMaybe: OK
  7460. 1415.83 s [vector] +++ OK, passed 100 tests.
  7461. 1415.83 s [vector] takeWhile: OK
  7462. 1415.83 s [vector] +++ OK, passed 100 tests.
  7463. 1415.83 s [vector] dropWhile: OK
  7464. 1415.83 s [vector] +++ OK, passed 100 tests.
  7465. 1415.83 s [vector] partition: OK
  7466. 1415.83 s [vector] +++ OK, passed 100 tests.
  7467. 1415.83 s [vector] partitionWith: OK
  7468. 1415.83 s [vector] +++ OK, passed 100 tests.
  7469. 1415.83 s [vector] span: OK
  7470. 1415.83 s [vector] +++ OK, passed 100 tests.
  7471. 1415.83 s [vector] break: OK
  7472. 1415.83 s [vector] +++ OK, passed 100 tests.
  7473. 1415.83 s [vector] spanR: OK
  7474. 1415.83 s [vector] +++ OK, passed 100 tests.
  7475. 1415.83 s [vector] breakR: OK
  7476. 1415.83 s [vector] +++ OK, passed 100 tests.
  7477. 1415.83 s [vector] groupBy: OK
  7478. 1415.83 s [vector] +++ OK, passed 100 tests.
  7479. 1415.83 s [vector] elem: OK
  7480. 1415.83 s [vector] +++ OK, passed 100 tests.
  7481. 1415.83 s [vector] notElem: OK
  7482. 1415.83 s [vector] +++ OK, passed 100 tests.
  7483. 1415.83 s [vector] find: OK
  7484. 1415.83 s [vector] +++ OK, passed 100 tests.
  7485. 1415.83 s [vector] findIndex: OK
  7486. 1415.83 s [vector] +++ OK, passed 100 tests.
  7487. 1415.83 s [vector] findIndexR: OK
  7488. 1415.83 s [vector] +++ OK, passed 100 tests.
  7489. 1415.83 s [vector] findIndices: OK
  7490. 1415.83 s [vector] +++ OK, passed 100 tests.
  7491. 1415.83 s [vector] elemIndex: OK
  7492. 1415.83 s [vector] +++ OK, passed 100 tests.
  7493. 1415.83 s [vector] elemIndices: OK
  7494. 1415.83 s [vector] +++ OK, passed 100 tests.
  7495. 1415.83 s [vector] foldl: OK
  7496. 1415.83 s [vector] +++ OK, passed 100 tests.
  7497. 1415.83 s [vector] foldl1: OK
  7498. 1415.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7499. 1415.83 s [vector] foldl': OK
  7500. 1415.83 s [vector] +++ OK, passed 100 tests.
  7501. 1415.83 s [vector] foldl1': OK
  7502. 1415.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7503. 1415.83 s [vector] foldr: OK
  7504. 1415.83 s [vector] +++ OK, passed 100 tests.
  7505. 1415.83 s [vector] foldr1: OK
  7506. 1415.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7507. 1415.83 s [vector] foldr': OK
  7508. 1415.83 s [vector] +++ OK, passed 100 tests.
  7509. 1415.83 s [vector] foldr1': OK
  7510. 1415.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7511. 1415.83 s [vector] ifoldl: OK
  7512. 1415.83 s [vector] +++ OK, passed 100 tests.
  7513. 1415.83 s [vector] ifoldl': OK
  7514. 1415.83 s [vector] +++ OK, passed 100 tests.
  7515. 1415.83 s [vector] ifoldr: OK
  7516. 1415.83 s [vector] +++ OK, passed 100 tests.
  7517. 1415.83 s [vector] ifoldr': OK
  7518. 1415.83 s [vector] +++ OK, passed 100 tests.
  7519. 1415.83 s [vector] ifoldM: OK
  7520. 1415.83 s [vector] +++ OK, passed 100 tests.
  7521. 1415.83 s [vector] ifoldM': OK
  7522. 1415.83 s [vector] +++ OK, passed 100 tests.
  7523. 1415.83 s [vector] ifoldM_: OK (0.01s)
  7524. 1415.83 s [vector] +++ OK, passed 100 tests.
  7525. 1415.83 s [vector] ifoldM'_: OK (0.01s)
  7526. 1415.83 s [vector] +++ OK, passed 100 tests.
  7527. 1415.83 s [vector] all: OK
  7528. 1415.83 s [vector] +++ OK, passed 100 tests.
  7529. 1415.83 s [vector] any: OK
  7530. 1415.83 s [vector] +++ OK, passed 100 tests.
  7531. 1415.83 s [vector] prescanl: OK
  7532. 1415.83 s [vector] +++ OK, passed 100 tests.
  7533. 1415.83 s [vector] prescanl': OK
  7534. 1415.83 s [vector] +++ OK, passed 100 tests.
  7535. 1415.83 s [vector] postscanl: OK
  7536. 1415.83 s [vector] +++ OK, passed 100 tests.
  7537. 1415.83 s [vector] postscanl': OK
  7538. 1415.83 s [vector] +++ OK, passed 100 tests.
  7539. 1415.83 s [vector] scanl: OK
  7540. 1415.83 s [vector] +++ OK, passed 100 tests.
  7541. 1415.83 s [vector] scanl': OK
  7542. 1415.83 s [vector] +++ OK, passed 100 tests.
  7543. 1415.83 s [vector] scanl1: OK
  7544. 1415.83 s [vector] +++ OK, passed 100 tests.
  7545. 1415.83 s [vector] scanl1': OK
  7546. 1415.83 s [vector] +++ OK, passed 100 tests.
  7547. 1415.83 s [vector] iscanl: OK
  7548. 1415.83 s [vector] +++ OK, passed 100 tests.
  7549. 1415.83 s [vector] iscanl': OK
  7550. 1415.83 s [vector] +++ OK, passed 100 tests.
  7551. 1415.83 s [vector] prescanr: OK
  7552. 1415.83 s [vector] +++ OK, passed 100 tests.
  7553. 1415.83 s [vector] prescanr': OK
  7554. 1415.83 s [vector] +++ OK, passed 100 tests.
  7555. 1415.83 s [vector] postscanr: OK
  7556. 1415.83 s [vector] +++ OK, passed 100 tests.
  7557. 1415.83 s [vector] postscanr': OK
  7558. 1415.83 s [vector] +++ OK, passed 100 tests.
  7559. 1415.83 s [vector] scanr: OK
  7560. 1415.83 s [vector] +++ OK, passed 100 tests.
  7561. 1415.83 s [vector] scanr': OK
  7562. 1415.83 s [vector] +++ OK, passed 100 tests.
  7563. 1415.83 s [vector] scanr1: OK
  7564. 1415.83 s [vector] +++ OK, passed 100 tests.
  7565. 1415.83 s [vector] scanr1': OK
  7566. 1415.83 s [vector] +++ OK, passed 100 tests.
  7567. 1415.83 s [vector] iscanr: OK
  7568. 1415.83 s [vector] +++ OK, passed 100 tests.
  7569. 1415.83 s [vector] iscanr': OK
  7570. 1415.83 s [vector] +++ OK, passed 100 tests.
  7571. 1415.83 s [vector] mut_read: OK
  7572. 1415.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7573. 1415.83 s [vector] mut_write: OK
  7574. 1415.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7575. 1415.83 s [vector] mut_modify: OK
  7576. 1415.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7577. 1415.83 s [vector] mut_generate: OK
  7578. 1415.83 s [vector] +++ OK, passed 100 tests.
  7579. 1415.83 s [vector] mut_generateM: OK
  7580. 1415.83 s [vector] +++ OK, passed 100 tests.
  7581. 1415.83 s [vector] mut_mapM_: OK (0.01s)
  7582. 1415.83 s [vector] +++ OK, passed 100 tests.
  7583. 1415.83 s [vector] mut_imapM_: OK (0.01s)
  7584. 1415.83 s [vector] +++ OK, passed 100 tests.
  7585. 1415.83 s [vector] mut_forM_: OK
  7586. 1415.83 s [vector] +++ OK, passed 100 tests.
  7587. 1415.83 s [vector] mut_iforM_: OK (0.01s)
  7588. 1415.83 s [vector] +++ OK, passed 100 tests.
  7589. 1415.83 s [vector] mut_foldr: OK
  7590. 1415.83 s [vector] +++ OK, passed 100 tests.
  7591. 1415.83 s [vector] mut_foldr': OK
  7592. 1415.83 s [vector] +++ OK, passed 100 tests.
  7593. 1415.83 s [vector] mut_foldl: OK
  7594. 1415.83 s [vector] +++ OK, passed 100 tests.
  7595. 1415.83 s [vector] mut_foldl': OK
  7596. 1415.83 s [vector] +++ OK, passed 100 tests.
  7597. 1415.83 s [vector] mut_ifoldr: OK
  7598. 1415.83 s [vector] +++ OK, passed 100 tests.
  7599. 1415.83 s [vector] mut_ifoldr': OK
  7600. 1415.83 s [vector] +++ OK, passed 100 tests.
  7601. 1415.83 s [vector] mut_ifoldl: OK
  7602. 1415.83 s [vector] +++ OK, passed 100 tests.
  7603. 1415.83 s [vector] mut_ifoldl': OK
  7604. 1415.83 s [vector] +++ OK, passed 100 tests.
  7605. 1415.83 s [vector] mut_foldM: OK
  7606. 1415.83 s [vector] +++ OK, passed 100 tests.
  7607. 1415.83 s [vector] mut_foldM': OK
  7608. 1415.83 s [vector] +++ OK, passed 100 tests.
  7609. 1415.83 s [vector] mut_foldrM: OK
  7610. 1415.83 s [vector] +++ OK, passed 100 tests.
  7611. 1415.83 s [vector] mut_foldrM': OK
  7612. 1415.83 s [vector] +++ OK, passed 100 tests.
  7613. 1415.83 s [vector] mut_ifoldM: OK
  7614. 1415.83 s [vector] +++ OK, passed 100 tests.
  7615. 1415.83 s [vector] mut_ifoldM': OK
  7616. 1415.83 s [vector] +++ OK, passed 100 tests.
  7617. 1415.83 s [vector] mut_ifoldrM: OK
  7618. 1415.83 s [vector] +++ OK, passed 100 tests.
  7619. 1415.83 s [vector] mut_ifoldrM': OK
  7620. 1415.83 s [vector] +++ OK, passed 100 tests.
  7621. 1415.83 s [vector] compare: OK
  7622. 1415.83 s [vector] +++ OK, passed 100 tests.
  7623. 1415.83 s [vector] maximum: OK
  7624. 1415.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7625. 1415.83 s [vector] minimum: OK
  7626. 1415.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7627. 1415.83 s [vector] minIndex: OK
  7628. 1415.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7629. 1415.83 s [vector] maxIndex: OK
  7630. 1415.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7631. 1415.83 s [vector] maximumBy: OK
  7632. 1415.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7633. 1415.83 s [vector] minimumBy: OK
  7634. 1415.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7635. 1415.83 s [vector] maximumOn: OK
  7636. 1415.83 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7637. 1415.83 s [vector] minimumOn: OK
  7638. 1415.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7639. 1415.83 s [vector] maxIndexBy: OK
  7640. 1415.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7641. 1415.83 s [vector] minIndexBy: OK
  7642. 1415.83 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7643. 1415.83 s [vector] ListFirstMaxIndexWins: OK
  7644. 1415.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7645. 1415.83 s [vector] FalseListFirstMaxIndexWins: OK
  7646. 1415.83 s [vector] +++ OK, failed as expected. (after 1 test):
  7647. 1415.83 s [vector] Exception:
  7648. 1415.83 s [vector] Prelude.foldr1: empty list
  7649. 1415.83 s [vector] CallStack (from HasCallStack):
  7650. 1415.83 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  7651. 1415.83 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  7652. 1415.83 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7653. 1415.83 s [vector] []
  7654. 1415.83 s [vector] zip: OK
  7655. 1415.83 s [vector] +++ OK, passed 100 tests.
  7656. 1415.83 s [vector] zip3: OK
  7657. 1415.83 s [vector] +++ OK, passed 100 tests.
  7658. 1415.83 s [vector] unzip: OK
  7659. 1415.83 s [vector] +++ OK, passed 100 tests.
  7660. 1415.83 s [vector] unzip3: OK
  7661. 1415.83 s [vector] +++ OK, passed 100 tests.
  7662. 1415.83 s [vector] indexed: OK
  7663. 1415.83 s [vector] +++ OK, passed 100 tests.
  7664. 1415.83 s [vector] update: OK
  7665. 1415.83 s [vector] +++ OK, passed 100 tests.
  7666. 1415.83 s [vector] mempty: OK
  7667. 1415.83 s [vector] +++ OK, passed 100 tests.
  7668. 1415.83 s [vector] mappend: OK
  7669. 1415.83 s [vector] +++ OK, passed 100 tests.
  7670. 1415.83 s [vector] mconcat: OK (0.02s)
  7671. 1415.83 s [vector] +++ OK, passed 100 tests.
  7672. 1415.83 s [vector] glength: OK
  7673. 1415.83 s [vector] +++ OK, passed 100 tests.
  7674. 1415.83 s [vector] and: OK
  7675. 1415.83 s [vector] +++ OK, passed 100 tests.
  7676. 1415.83 s [vector] or: OK
  7677. 1415.83 s [vector] +++ OK, passed 100 tests.
  7678. 1415.83 s [vector] (Int)
  7679. 1415.83 s [vector] fromList.toList == id: OK
  7680. 1415.83 s [vector] +++ OK, passed 100 tests.
  7681. 1415.83 s [vector] toList.fromList == id: OK
  7682. 1415.83 s [vector] +++ OK, passed 100 tests.
  7683. 1415.83 s [vector] unstream.stream == id: OK
  7684. 1415.83 s [vector] +++ OK, passed 100 tests.
  7685. 1415.83 s [vector] stream.unstream == id: OK
  7686. 1415.83 s [vector] +++ OK, passed 100 tests.
  7687. 1415.83 s [vector] eq: OK
  7688. 1415.83 s [vector] +++ OK, passed 100 tests.
  7689. 1415.83 s [vector] length: OK
  7690. 1415.83 s [vector] +++ OK, passed 100 tests.
  7691. 1415.83 s [vector] null: OK
  7692. 1415.83 s [vector] +++ OK, passed 100 tests.
  7693. 1415.83 s [vector] index: OK
  7694. 1415.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7695. 1415.83 s [vector] safeIndex: OK
  7696. 1415.83 s [vector] +++ OK, passed 100 tests.
  7697. 1415.83 s [vector] head: OK
  7698. 1415.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7699. 1415.83 s [vector] last: OK
  7700. 1415.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7701. 1415.83 s [vector] unsafeIndex: OK
  7702. 1415.83 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7703. 1415.83 s [vector] unsafeHead: OK
  7704. 1415.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7705. 1415.83 s [vector] unsafeLast: OK
  7706. 1415.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7707. 1415.83 s [vector] slice: OK
  7708. 1415.83 s [vector] +++ OK, passed 100 tests.
  7709. 1415.83 s [vector] init: OK
  7710. 1415.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7711. 1415.83 s [vector] tail: OK
  7712. 1415.83 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7713. 1415.83 s [vector] take: OK
  7714. 1415.83 s [vector] +++ OK, passed 100 tests.
  7715. 1415.83 s [vector] drop: OK
  7716. 1415.83 s [vector] +++ OK, passed 100 tests.
  7717. 1415.83 s [vector] splitAt: OK
  7718. 1415.83 s [vector] +++ OK, passed 100 tests.
  7719. 1415.83 s [vector] empty: OK
  7720. 1415.83 s [vector] +++ OK, passed 100 tests.
  7721. 1415.83 s [vector] singleton: OK
  7722. 1415.83 s [vector] +++ OK, passed 100 tests.
  7723. 1415.83 s [vector] replicate: OK
  7724. 1415.83 s [vector] +++ OK, passed 100 tests.
  7725. 1415.83 s [vector] generate: OK
  7726. 1415.84 s [vector] +++ OK, passed 100 tests.
  7727. 1415.84 s [vector] iterateN: OK
  7728. 1415.84 s [vector] +++ OK, passed 100 tests.
  7729. 1415.84 s [vector] iterateNM: OK (0.03s)
  7730. 1415.84 s [vector] +++ OK, passed 100 tests.
  7731. 1415.84 s [vector] generateM: OK (0.02s)
  7732. 1415.84 s [vector] +++ OK, passed 100 tests.
  7733. 1415.84 s [vector] replicateM: OK
  7734. 1415.84 s [vector] +++ OK, passed 100 tests.
  7735. 1415.84 s [vector] create: OK
  7736. 1415.84 s [vector] +++ OK, passed 100 tests.
  7737. 1415.84 s [vector] createT: OK
  7738. 1415.84 s [vector] +++ OK, passed 100 tests.
  7739. 1415.84 s [vector] unfoldr: OK
  7740. 1415.84 s [vector] +++ OK, passed 100 tests.
  7741. 1415.84 s [vector] unfoldrN: OK
  7742. 1415.84 s [vector] +++ OK, passed 100 tests.
  7743. 1415.84 s [vector] unfoldrExactN: OK
  7744. 1415.84 s [vector] +++ OK, passed 100 tests.
  7745. 1415.84 s [vector] unfoldrM: OK
  7746. 1415.84 s [vector] +++ OK, passed 100 tests.
  7747. 1415.84 s [vector] unfoldrNM: OK (0.02s)
  7748. 1415.84 s [vector] +++ OK, passed 100 tests.
  7749. 1415.84 s [vector] unfoldrExactNM: OK (0.02s)
  7750. 1415.84 s [vector] +++ OK, passed 100 tests.
  7751. 1415.84 s [vector] constructN: OK
  7752. 1415.84 s [vector] +++ OK, passed 100 tests.
  7753. 1415.84 s [vector] constructrN: OK
  7754. 1415.84 s [vector] +++ OK, passed 100 tests.
  7755. 1415.84 s [vector] cons: OK
  7756. 1415.84 s [vector] +++ OK, passed 100 tests.
  7757. 1415.84 s [vector] snoc: OK
  7758. 1415.84 s [vector] +++ OK, passed 100 tests.
  7759. 1415.84 s [vector] append: OK
  7760. 1415.84 s [vector] +++ OK, passed 100 tests.
  7761. 1415.84 s [vector] concat: OK (0.02s)
  7762. 1415.84 s [vector] +++ OK, passed 100 tests.
  7763. 1415.84 s [vector] force: OK
  7764. 1415.84 s [vector] +++ OK, passed 100 tests.
  7765. 1415.84 s [vector] upd: OK
  7766. 1415.84 s [vector] +++ OK, passed 100 tests.
  7767. 1415.84 s [vector] accum: OK
  7768. 1415.84 s [vector] +++ OK, passed 100 tests.
  7769. 1415.84 s [vector] reverse: OK
  7770. 1415.84 s [vector] +++ OK, passed 100 tests.
  7771. 1415.84 s [vector] backpermute: OK
  7772. 1415.84 s [vector] +++ OK, passed 100 tests.
  7773. 1415.84 s [vector] map: OK
  7774. 1415.84 s [vector] +++ OK, passed 100 tests.
  7775. 1415.84 s [vector] imap: OK
  7776. 1415.84 s [vector] +++ OK, passed 100 tests.
  7777. 1415.84 s [vector] concatMap: OK
  7778. 1415.84 s [vector] +++ OK, passed 100 tests.
  7779. 1415.84 s [vector] mapM: OK
  7780. 1415.84 s [vector] +++ OK, passed 100 tests.
  7781. 1415.84 s [vector] mapM_: OK (0.03s)
  7782. 1415.84 s [vector] +++ OK, passed 100 tests.
  7783. 1415.84 s [vector] forM: OK
  7784. 1415.84 s [vector] +++ OK, passed 100 tests.
  7785. 1415.84 s [vector] forM_: OK (0.02s)
  7786. 1415.84 s [vector] +++ OK, passed 100 tests.
  7787. 1415.84 s [vector] imapM: OK
  7788. 1415.84 s [vector] +++ OK, passed 100 tests.
  7789. 1415.84 s [vector] imapM_: OK (0.02s)
  7790. 1415.84 s [vector] +++ OK, passed 100 tests.
  7791. 1415.84 s [vector] zipWith: OK
  7792. 1415.84 s [vector] +++ OK, passed 100 tests.
  7793. 1415.84 s [vector] zipWith3: OK
  7794. 1415.84 s [vector] +++ OK, passed 100 tests.
  7795. 1415.84 s [vector] izipWith: OK
  7796. 1415.84 s [vector] +++ OK, passed 100 tests.
  7797. 1415.84 s [vector] izipWith3: OK
  7798. 1415.84 s [vector] +++ OK, passed 100 tests.
  7799. 1415.84 s [vector] izipWithM: OK
  7800. 1415.84 s [vector] +++ OK, passed 100 tests.
  7801. 1415.84 s [vector] izipWithM_: OK (0.01s)
  7802. 1415.84 s [vector] +++ OK, passed 100 tests.
  7803. 1415.84 s [vector] zipWithM: OK
  7804. 1415.84 s [vector] +++ OK, passed 100 tests.
  7805. 1415.84 s [vector] zipWithM_: OK (0.01s)
  7806. 1415.84 s [vector] +++ OK, passed 100 tests.
  7807. 1415.84 s [vector] filter: OK
  7808. 1415.84 s [vector] +++ OK, passed 100 tests.
  7809. 1415.84 s [vector] ifilter: OK
  7810. 1415.84 s [vector] +++ OK, passed 100 tests.
  7811. 1415.84 s [vector] filterM: OK (0.03s)
  7812. 1415.84 s [vector] +++ OK, passed 100 tests.
  7813. 1415.84 s [vector] uniq: OK
  7814. 1415.84 s [vector] +++ OK, passed 100 tests.
  7815. 1415.84 s [vector] mapMaybe: OK
  7816. 1415.84 s [vector] +++ OK, passed 100 tests.
  7817. 1415.84 s [vector] imapMaybe: OK
  7818. 1415.84 s [vector] +++ OK, passed 100 tests.
  7819. 1415.84 s [vector] takeWhile: OK
  7820. 1415.84 s [vector] +++ OK, passed 100 tests.
  7821. 1415.84 s [vector] dropWhile: OK
  7822. 1415.84 s [vector] +++ OK, passed 100 tests.
  7823. 1415.84 s [vector] partition: OK
  7824. 1415.84 s [vector] +++ OK, passed 100 tests.
  7825. 1415.84 s [vector] partitionWith: OK
  7826. 1415.84 s [vector] +++ OK, passed 100 tests.
  7827. 1415.84 s [vector] span: OK
  7828. 1415.84 s [vector] +++ OK, passed 100 tests.
  7829. 1415.84 s [vector] break: OK
  7830. 1415.84 s [vector] +++ OK, passed 100 tests.
  7831. 1415.84 s [vector] spanR: OK
  7832. 1415.84 s [vector] +++ OK, passed 100 tests.
  7833. 1415.84 s [vector] breakR: OK
  7834. 1415.84 s [vector] +++ OK, passed 100 tests.
  7835. 1415.84 s [vector] groupBy: OK
  7836. 1415.84 s [vector] +++ OK, passed 100 tests.
  7837. 1415.84 s [vector] elem: OK
  7838. 1415.84 s [vector] +++ OK, passed 100 tests.
  7839. 1415.84 s [vector] notElem: OK
  7840. 1415.84 s [vector] +++ OK, passed 100 tests.
  7841. 1415.84 s [vector] find: OK
  7842. 1415.84 s [vector] +++ OK, passed 100 tests.
  7843. 1415.84 s [vector] findIndex: OK
  7844. 1415.84 s [vector] +++ OK, passed 100 tests.
  7845. 1415.84 s [vector] findIndexR: OK
  7846. 1415.84 s [vector] +++ OK, passed 100 tests.
  7847. 1415.84 s [vector] findIndices: OK
  7848. 1415.84 s [vector] +++ OK, passed 100 tests.
  7849. 1415.84 s [vector] elemIndex: OK
  7850. 1415.84 s [vector] +++ OK, passed 100 tests.
  7851. 1415.84 s [vector] elemIndices: OK
  7852. 1415.84 s [vector] +++ OK, passed 100 tests.
  7853. 1415.84 s [vector] foldl: OK
  7854. 1415.84 s [vector] +++ OK, passed 100 tests.
  7855. 1415.84 s [vector] foldl1: OK
  7856. 1415.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7857. 1415.84 s [vector] foldl': OK
  7858. 1415.84 s [vector] +++ OK, passed 100 tests.
  7859. 1415.84 s [vector] foldl1': OK
  7860. 1415.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7861. 1415.84 s [vector] foldr: OK
  7862. 1415.84 s [vector] +++ OK, passed 100 tests.
  7863. 1415.84 s [vector] foldr1: OK
  7864. 1415.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7865. 1415.84 s [vector] foldr': OK
  7866. 1415.84 s [vector] +++ OK, passed 100 tests.
  7867. 1415.84 s [vector] foldr1': OK
  7868. 1415.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7869. 1415.84 s [vector] ifoldl: OK
  7870. 1415.84 s [vector] +++ OK, passed 100 tests.
  7871. 1415.84 s [vector] ifoldl': OK
  7872. 1415.84 s [vector] +++ OK, passed 100 tests.
  7873. 1415.84 s [vector] ifoldr: OK
  7874. 1415.84 s [vector] +++ OK, passed 100 tests.
  7875. 1415.84 s [vector] ifoldr': OK
  7876. 1415.84 s [vector] +++ OK, passed 100 tests.
  7877. 1415.84 s [vector] ifoldM: OK
  7878. 1415.84 s [vector] +++ OK, passed 100 tests.
  7879. 1415.84 s [vector] ifoldM': OK
  7880. 1415.84 s [vector] +++ OK, passed 100 tests.
  7881. 1415.84 s [vector] ifoldM_: OK (0.02s)
  7882. 1415.84 s [vector] +++ OK, passed 100 tests.
  7883. 1415.84 s [vector] ifoldM'_: OK (0.02s)
  7884. 1415.84 s [vector] +++ OK, passed 100 tests.
  7885. 1415.84 s [vector] all: OK
  7886. 1415.84 s [vector] +++ OK, passed 100 tests.
  7887. 1415.84 s [vector] any: OK
  7888. 1415.84 s [vector] +++ OK, passed 100 tests.
  7889. 1415.84 s [vector] prescanl: OK
  7890. 1415.84 s [vector] +++ OK, passed 100 tests.
  7891. 1415.84 s [vector] prescanl': OK
  7892. 1415.84 s [vector] +++ OK, passed 100 tests.
  7893. 1415.84 s [vector] postscanl: OK
  7894. 1415.84 s [vector] +++ OK, passed 100 tests.
  7895. 1415.84 s [vector] postscanl': OK
  7896. 1415.84 s [vector] +++ OK, passed 100 tests.
  7897. 1415.84 s [vector] scanl: OK
  7898. 1415.84 s [vector] +++ OK, passed 100 tests.
  7899. 1415.84 s [vector] scanl': OK
  7900. 1415.84 s [vector] +++ OK, passed 100 tests.
  7901. 1415.84 s [vector] scanl1: OK
  7902. 1415.84 s [vector] +++ OK, passed 100 tests.
  7903. 1415.84 s [vector] scanl1': OK
  7904. 1415.84 s [vector] +++ OK, passed 100 tests.
  7905. 1415.84 s [vector] iscanl: OK
  7906. 1415.84 s [vector] +++ OK, passed 100 tests.
  7907. 1415.84 s [vector] iscanl': OK
  7908. 1415.84 s [vector] +++ OK, passed 100 tests.
  7909. 1415.84 s [vector] prescanr: OK
  7910. 1415.84 s [vector] +++ OK, passed 100 tests.
  7911. 1415.84 s [vector] prescanr': OK
  7912. 1415.84 s [vector] +++ OK, passed 100 tests.
  7913. 1415.84 s [vector] postscanr: OK
  7914. 1415.84 s [vector] +++ OK, passed 100 tests.
  7915. 1415.84 s [vector] postscanr': OK
  7916. 1415.84 s [vector] +++ OK, passed 100 tests.
  7917. 1415.84 s [vector] scanr: OK
  7918. 1415.84 s [vector] +++ OK, passed 100 tests.
  7919. 1415.84 s [vector] scanr': OK
  7920. 1415.84 s [vector] +++ OK, passed 100 tests.
  7921. 1415.84 s [vector] scanr1: OK
  7922. 1415.84 s [vector] +++ OK, passed 100 tests.
  7923. 1415.84 s [vector] scanr1': OK
  7924. 1415.84 s [vector] +++ OK, passed 100 tests.
  7925. 1415.84 s [vector] iscanr: OK
  7926. 1415.84 s [vector] +++ OK, passed 100 tests.
  7927. 1415.84 s [vector] iscanr': OK
  7928. 1415.84 s [vector] +++ OK, passed 100 tests.
  7929. 1415.84 s [vector] mut_read: OK
  7930. 1415.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7931. 1415.84 s [vector] mut_write: OK
  7932. 1415.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7933. 1415.84 s [vector] mut_modify: OK
  7934. 1415.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7935. 1415.84 s [vector] mut_generate: OK
  7936. 1415.84 s [vector] +++ OK, passed 100 tests.
  7937. 1415.84 s [vector] mut_generateM: OK
  7938. 1415.84 s [vector] +++ OK, passed 100 tests.
  7939. 1415.84 s [vector] mut_mapM_: OK (0.02s)
  7940. 1415.84 s [vector] +++ OK, passed 100 tests.
  7941. 1415.84 s [vector] mut_imapM_: OK (0.02s)
  7942. 1415.84 s [vector] +++ OK, passed 100 tests.
  7943. 1415.84 s [vector] mut_forM_: OK (0.02s)
  7944. 1415.84 s [vector] +++ OK, passed 100 tests.
  7945. 1415.84 s [vector] mut_iforM_: OK (0.02s)
  7946. 1415.84 s [vector] +++ OK, passed 100 tests.
  7947. 1415.84 s [vector] mut_foldr: OK
  7948. 1415.84 s [vector] +++ OK, passed 100 tests.
  7949. 1415.84 s [vector] mut_foldr': OK
  7950. 1415.84 s [vector] +++ OK, passed 100 tests.
  7951. 1415.84 s [vector] mut_foldl: OK
  7952. 1415.84 s [vector] +++ OK, passed 100 tests.
  7953. 1415.84 s [vector] mut_foldl': OK
  7954. 1415.84 s [vector] +++ OK, passed 100 tests.
  7955. 1415.84 s [vector] mut_ifoldr: OK
  7956. 1415.84 s [vector] +++ OK, passed 100 tests.
  7957. 1415.84 s [vector] mut_ifoldr': OK
  7958. 1415.84 s [vector] +++ OK, passed 100 tests.
  7959. 1415.84 s [vector] mut_ifoldl: OK
  7960. 1415.84 s [vector] +++ OK, passed 100 tests.
  7961. 1415.84 s [vector] mut_ifoldl': OK
  7962. 1415.84 s [vector] +++ OK, passed 100 tests.
  7963. 1415.84 s [vector] mut_foldM: OK
  7964. 1415.84 s [vector] +++ OK, passed 100 tests.
  7965. 1415.84 s [vector] mut_foldM': OK
  7966. 1415.84 s [vector] +++ OK, passed 100 tests.
  7967. 1415.84 s [vector] mut_foldrM: OK
  7968. 1415.84 s [vector] +++ OK, passed 100 tests.
  7969. 1415.84 s [vector] mut_foldrM': OK
  7970. 1415.84 s [vector] +++ OK, passed 100 tests.
  7971. 1415.84 s [vector] mut_ifoldM: OK
  7972. 1415.84 s [vector] +++ OK, passed 100 tests.
  7973. 1415.84 s [vector] mut_ifoldM': OK
  7974. 1415.84 s [vector] +++ OK, passed 100 tests.
  7975. 1415.84 s [vector] mut_ifoldrM: OK
  7976. 1415.84 s [vector] +++ OK, passed 100 tests.
  7977. 1415.84 s [vector] mut_ifoldrM': OK
  7978. 1415.84 s [vector] +++ OK, passed 100 tests.
  7979. 1415.84 s [vector] compare: OK
  7980. 1415.84 s [vector] +++ OK, passed 100 tests.
  7981. 1415.84 s [vector] maximum: OK
  7982. 1415.84 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7983. 1415.84 s [vector] minimum: OK
  7984. 1415.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7985. 1415.84 s [vector] minIndex: OK
  7986. 1415.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7987. 1415.84 s [vector] maxIndex: OK
  7988. 1415.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7989. 1415.84 s [vector] maximumBy: OK
  7990. 1415.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7991. 1415.84 s [vector] minimumBy: OK
  7992. 1415.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7993. 1415.84 s [vector] maximumOn: OK
  7994. 1415.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7995. 1415.84 s [vector] minimumOn: OK
  7996. 1415.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7997. 1415.84 s [vector] maxIndexBy: OK
  7998. 1415.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7999. 1415.84 s [vector] minIndexBy: OK
  8000. 1415.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8001. 1415.84 s [vector] ListFirstMaxIndexWins: OK
  8002. 1415.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8003. 1415.84 s [vector] FalseListFirstMaxIndexWins: OK
  8004. 1415.84 s [vector] +++ OK, failed as expected. (after 1 test):
  8005. 1415.84 s [vector] Exception:
  8006. 1415.84 s [vector] Prelude.foldr1: empty list
  8007. 1415.84 s [vector] CallStack (from HasCallStack):
  8008. 1415.84 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8009. 1415.84 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8010. 1415.84 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8011. 1415.84 s [vector] []
  8012. 1415.84 s [vector] zip: OK
  8013. 1415.84 s [vector] +++ OK, passed 100 tests.
  8014. 1415.84 s [vector] zip3: OK
  8015. 1415.84 s [vector] +++ OK, passed 100 tests.
  8016. 1415.84 s [vector] unzip: OK
  8017. 1415.84 s [vector] +++ OK, passed 100 tests.
  8018. 1415.84 s [vector] unzip3: OK
  8019. 1415.84 s [vector] +++ OK, passed 100 tests.
  8020. 1415.84 s [vector] indexed: OK
  8021. 1415.84 s [vector] +++ OK, passed 100 tests.
  8022. 1415.85 s [vector] update: OK
  8023. 1415.85 s [vector] +++ OK, passed 100 tests.
  8024. 1415.85 s [vector] mempty: OK
  8025. 1415.85 s [vector] +++ OK, passed 100 tests.
  8026. 1415.85 s [vector] mappend: OK
  8027. 1415.85 s [vector] +++ OK, passed 100 tests.
  8028. 1415.85 s [vector] mconcat: OK (0.02s)
  8029. 1415.85 s [vector] +++ OK, passed 100 tests.
  8030. 1415.85 s [vector] glength: OK
  8031. 1415.85 s [vector] +++ OK, passed 100 tests.
  8032. 1415.85 s [vector] sum: OK
  8033. 1415.85 s [vector] +++ OK, passed 100 tests.
  8034. 1415.85 s [vector] product: OK
  8035. 1415.85 s [vector] +++ OK, passed 100 tests.
  8036. 1415.85 s [vector] enumFromN: OK
  8037. 1415.85 s [vector] +++ OK, passed 100 tests.
  8038. 1415.85 s [vector] enumFromThenN: OK
  8039. 1415.85 s [vector] +++ OK, passed 100 tests.
  8040. 1415.85 s [vector] enumFromTo: OK
  8041. 1415.85 s [vector] +++ OK, passed 100 tests.
  8042. 1415.85 s [vector] enumFromThenTo: OK
  8043. 1415.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8044. 1415.85 s [vector] (Float)
  8045. 1415.85 s [vector] fromList.toList == id: OK
  8046. 1415.85 s [vector] +++ OK, passed 100 tests.
  8047. 1415.85 s [vector] toList.fromList == id: OK
  8048. 1415.85 s [vector] +++ OK, passed 100 tests.
  8049. 1415.85 s [vector] unstream.stream == id: OK
  8050. 1415.85 s [vector] +++ OK, passed 100 tests.
  8051. 1415.85 s [vector] stream.unstream == id: OK
  8052. 1415.85 s [vector] +++ OK, passed 100 tests.
  8053. 1415.85 s [vector] eq: OK
  8054. 1415.85 s [vector] +++ OK, passed 100 tests.
  8055. 1415.85 s [vector] length: OK
  8056. 1415.85 s [vector] +++ OK, passed 100 tests.
  8057. 1415.85 s [vector] null: OK
  8058. 1415.85 s [vector] +++ OK, passed 100 tests.
  8059. 1415.85 s [vector] index: OK
  8060. 1415.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8061. 1415.85 s [vector] safeIndex: OK
  8062. 1415.85 s [vector] +++ OK, passed 100 tests.
  8063. 1415.85 s [vector] head: OK
  8064. 1415.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8065. 1415.85 s [vector] last: OK
  8066. 1415.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8067. 1415.85 s [vector] unsafeIndex: OK
  8068. 1415.85 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8069. 1415.85 s [vector] unsafeHead: OK
  8070. 1415.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8071. 1415.85 s [vector] unsafeLast: OK
  8072. 1415.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8073. 1415.85 s [vector] slice: OK
  8074. 1415.85 s [vector] +++ OK, passed 100 tests.
  8075. 1415.85 s [vector] init: OK
  8076. 1415.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8077. 1415.85 s [vector] tail: OK
  8078. 1415.85 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8079. 1415.85 s [vector] take: OK
  8080. 1415.85 s [vector] +++ OK, passed 100 tests.
  8081. 1415.85 s [vector] drop: OK
  8082. 1415.85 s [vector] +++ OK, passed 100 tests.
  8083. 1415.85 s [vector] splitAt: OK
  8084. 1415.85 s [vector] +++ OK, passed 100 tests.
  8085. 1415.85 s [vector] empty: OK
  8086. 1415.85 s [vector] +++ OK, passed 100 tests.
  8087. 1415.85 s [vector] singleton: OK
  8088. 1415.85 s [vector] +++ OK, passed 100 tests.
  8089. 1415.85 s [vector] replicate: OK
  8090. 1415.85 s [vector] +++ OK, passed 100 tests.
  8091. 1415.85 s [vector] generate: OK
  8092. 1415.85 s [vector] +++ OK, passed 100 tests.
  8093. 1415.85 s [vector] iterateN: OK
  8094. 1415.85 s [vector] +++ OK, passed 100 tests.
  8095. 1415.85 s [vector] iterateNM: OK (0.02s)
  8096. 1415.85 s [vector] +++ OK, passed 100 tests.
  8097. 1415.85 s [vector] generateM: OK (0.02s)
  8098. 1415.85 s [vector] +++ OK, passed 100 tests.
  8099. 1415.85 s [vector] replicateM: OK (0.01s)
  8100. 1415.85 s [vector] +++ OK, passed 100 tests.
  8101. 1415.85 s [vector] create: OK
  8102. 1415.85 s [vector] +++ OK, passed 100 tests.
  8103. 1415.85 s [vector] createT: OK
  8104. 1415.85 s [vector] +++ OK, passed 100 tests.
  8105. 1415.85 s [vector] unfoldr: OK
  8106. 1415.85 s [vector] +++ OK, passed 100 tests.
  8107. 1415.85 s [vector] unfoldrN: OK
  8108. 1415.85 s [vector] +++ OK, passed 100 tests.
  8109. 1415.85 s [vector] unfoldrExactN: OK
  8110. 1415.85 s [vector] +++ OK, passed 100 tests.
  8111. 1415.85 s [vector] unfoldrM: OK
  8112. 1415.85 s [vector] +++ OK, passed 100 tests.
  8113. 1415.85 s [vector] unfoldrNM: OK
  8114. 1415.85 s [vector] +++ OK, passed 100 tests.
  8115. 1415.85 s [vector] unfoldrExactNM: OK (0.03s)
  8116. 1415.85 s [vector] +++ OK, passed 100 tests.
  8117. 1415.85 s [vector] constructN: OK
  8118. 1415.85 s [vector] +++ OK, passed 100 tests.
  8119. 1415.85 s [vector] constructrN: OK
  8120. 1415.85 s [vector] +++ OK, passed 100 tests.
  8121. 1415.85 s [vector] cons: OK
  8122. 1415.85 s [vector] +++ OK, passed 100 tests.
  8123. 1415.85 s [vector] snoc: OK
  8124. 1415.85 s [vector] +++ OK, passed 100 tests.
  8125. 1415.85 s [vector] append: OK
  8126. 1415.85 s [vector] +++ OK, passed 100 tests.
  8127. 1415.85 s [vector] concat: OK (0.02s)
  8128. 1415.85 s [vector] +++ OK, passed 100 tests.
  8129. 1415.85 s [vector] force: OK
  8130. 1415.85 s [vector] +++ OK, passed 100 tests.
  8131. 1415.85 s [vector] upd: OK
  8132. 1415.85 s [vector] +++ OK, passed 100 tests.
  8133. 1415.85 s [vector] accum: OK (0.01s)
  8134. 1415.85 s [vector] +++ OK, passed 100 tests.
  8135. 1415.85 s [vector] reverse: OK
  8136. 1415.85 s [vector] +++ OK, passed 100 tests.
  8137. 1415.85 s [vector] backpermute: OK
  8138. 1415.85 s [vector] +++ OK, passed 100 tests.
  8139. 1415.85 s [vector] map: OK
  8140. 1415.85 s [vector] +++ OK, passed 100 tests.
  8141. 1415.85 s [vector] imap: OK
  8142. 1415.85 s [vector] +++ OK, passed 100 tests.
  8143. 1415.85 s [vector] concatMap: OK
  8144. 1415.85 s [vector] +++ OK, passed 100 tests.
  8145. 1415.85 s [vector] mapM: OK
  8146. 1415.85 s [vector] +++ OK, passed 100 tests.
  8147. 1415.85 s [vector] mapM_: OK (0.03s)
  8148. 1415.85 s [vector] +++ OK, passed 100 tests.
  8149. 1415.85 s [vector] forM: OK
  8150. 1415.85 s [vector] +++ OK, passed 100 tests.
  8151. 1415.85 s [vector] forM_: OK (0.04s)
  8152. 1415.85 s [vector] +++ OK, passed 100 tests.
  8153. 1415.85 s [vector] imapM: OK
  8154. 1415.85 s [vector] +++ OK, passed 100 tests.
  8155. 1415.85 s [vector] imapM_: OK (0.04s)
  8156. 1415.85 s [vector] +++ OK, passed 100 tests.
  8157. 1415.85 s [vector] zipWith: OK
  8158. 1415.85 s [vector] +++ OK, passed 100 tests.
  8159. 1415.85 s [vector] zipWith3: OK
  8160. 1415.85 s [vector] +++ OK, passed 100 tests.
  8161. 1415.85 s [vector] izipWith: OK
  8162. 1415.85 s [vector] +++ OK, passed 100 tests.
  8163. 1415.85 s [vector] izipWith3: OK
  8164. 1415.85 s [vector] +++ OK, passed 100 tests.
  8165. 1415.85 s [vector] izipWithM: OK
  8166. 1415.85 s [vector] +++ OK, passed 100 tests.
  8167. 1415.85 s [vector] izipWithM_: OK (0.03s)
  8168. 1415.85 s [vector] +++ OK, passed 100 tests.
  8169. 1415.85 s [vector] zipWithM: OK
  8170. 1415.85 s [vector] +++ OK, passed 100 tests.
  8171. 1415.85 s [vector] zipWithM_: OK (0.03s)
  8172. 1415.85 s [vector] +++ OK, passed 100 tests.
  8173. 1415.85 s [vector] filter: OK
  8174. 1415.85 s [vector] +++ OK, passed 100 tests.
  8175. 1415.85 s [vector] ifilter: OK
  8176. 1415.85 s [vector] +++ OK, passed 100 tests.
  8177. 1415.85 s [vector] filterM: OK (0.04s)
  8178. 1415.85 s [vector] +++ OK, passed 100 tests.
  8179. 1415.85 s [vector] uniq: OK
  8180. 1415.85 s [vector] +++ OK, passed 100 tests.
  8181. 1415.85 s [vector] mapMaybe: OK
  8182. 1415.85 s [vector] +++ OK, passed 100 tests.
  8183. 1415.85 s [vector] imapMaybe: OK
  8184. 1415.85 s [vector] +++ OK, passed 100 tests.
  8185. 1415.85 s [vector] takeWhile: OK
  8186. 1415.85 s [vector] +++ OK, passed 100 tests.
  8187. 1415.85 s [vector] dropWhile: OK
  8188. 1415.85 s [vector] +++ OK, passed 100 tests.
  8189. 1415.85 s [vector] partition: OK
  8190. 1415.85 s [vector] +++ OK, passed 100 tests.
  8191. 1415.85 s [vector] partitionWith: OK
  8192. 1415.85 s [vector] +++ OK, passed 100 tests.
  8193. 1415.85 s [vector] span: OK
  8194. 1415.85 s [vector] +++ OK, passed 100 tests.
  8195. 1415.85 s [vector] break: OK
  8196. 1415.85 s [vector] +++ OK, passed 100 tests.
  8197. 1415.85 s [vector] spanR: OK
  8198. 1415.85 s [vector] +++ OK, passed 100 tests.
  8199. 1415.85 s [vector] breakR: OK
  8200. 1415.85 s [vector] +++ OK, passed 100 tests.
  8201. 1415.85 s [vector] groupBy: OK
  8202. 1415.85 s [vector] +++ OK, passed 100 tests.
  8203. 1415.85 s [vector] elem: OK
  8204. 1415.85 s [vector] +++ OK, passed 100 tests.
  8205. 1415.85 s [vector] notElem: OK
  8206. 1415.85 s [vector] +++ OK, passed 100 tests.
  8207. 1415.85 s [vector] find: OK
  8208. 1415.85 s [vector] +++ OK, passed 100 tests.
  8209. 1415.85 s [vector] findIndex: OK
  8210. 1415.85 s [vector] +++ OK, passed 100 tests.
  8211. 1415.85 s [vector] findIndexR: OK
  8212. 1415.85 s [vector] +++ OK, passed 100 tests.
  8213. 1415.85 s [vector] findIndices: OK
  8214. 1415.85 s [vector] +++ OK, passed 100 tests.
  8215. 1415.85 s [vector] elemIndex: OK
  8216. 1415.85 s [vector] +++ OK, passed 100 tests.
  8217. 1415.85 s [vector] elemIndices: OK
  8218. 1415.85 s [vector] +++ OK, passed 100 tests.
  8219. 1415.85 s [vector] foldl: OK
  8220. 1415.85 s [vector] +++ OK, passed 100 tests.
  8221. 1415.85 s [vector] foldl1: OK
  8222. 1415.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8223. 1415.85 s [vector] foldl': OK
  8224. 1415.85 s [vector] +++ OK, passed 100 tests.
  8225. 1415.85 s [vector] foldl1': OK
  8226. 1415.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8227. 1415.85 s [vector] foldr: OK
  8228. 1415.85 s [vector] +++ OK, passed 100 tests.
  8229. 1415.85 s [vector] foldr1: OK
  8230. 1415.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8231. 1415.85 s [vector] foldr': OK
  8232. 1415.85 s [vector] +++ OK, passed 100 tests.
  8233. 1415.85 s [vector] foldr1': OK
  8234. 1415.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8235. 1415.85 s [vector] ifoldl: OK
  8236. 1415.85 s [vector] +++ OK, passed 100 tests.
  8237. 1415.85 s [vector] ifoldl': OK
  8238. 1415.85 s [vector] +++ OK, passed 100 tests.
  8239. 1415.85 s [vector] ifoldr: OK
  8240. 1415.85 s [vector] +++ OK, passed 100 tests.
  8241. 1415.85 s [vector] ifoldr': OK
  8242. 1415.85 s [vector] +++ OK, passed 100 tests.
  8243. 1415.85 s [vector] ifoldM: OK
  8244. 1415.85 s [vector] +++ OK, passed 100 tests.
  8245. 1415.85 s [vector] ifoldM': OK
  8246. 1415.85 s [vector] +++ OK, passed 100 tests.
  8247. 1415.85 s [vector] ifoldM_: OK (0.04s)
  8248. 1415.85 s [vector] +++ OK, passed 100 tests.
  8249. 1415.85 s [vector] ifoldM'_: OK (0.03s)
  8250. 1415.85 s [vector] +++ OK, passed 100 tests.
  8251. 1415.85 s [vector] all: OK
  8252. 1415.85 s [vector] +++ OK, passed 100 tests.
  8253. 1415.85 s [vector] any: OK
  8254. 1415.85 s [vector] +++ OK, passed 100 tests.
  8255. 1415.85 s [vector] prescanl: OK
  8256. 1415.85 s [vector] +++ OK, passed 100 tests.
  8257. 1415.85 s [vector] prescanl': OK
  8258. 1415.85 s [vector] +++ OK, passed 100 tests.
  8259. 1415.85 s [vector] postscanl: OK
  8260. 1415.85 s [vector] +++ OK, passed 100 tests.
  8261. 1415.85 s [vector] postscanl': OK
  8262. 1415.85 s [vector] +++ OK, passed 100 tests.
  8263. 1415.85 s [vector] scanl: OK
  8264. 1415.85 s [vector] +++ OK, passed 100 tests.
  8265. 1415.85 s [vector] scanl': OK
  8266. 1415.85 s [vector] +++ OK, passed 100 tests.
  8267. 1415.85 s [vector] scanl1: OK
  8268. 1415.85 s [vector] +++ OK, passed 100 tests.
  8269. 1415.85 s [vector] scanl1': OK
  8270. 1415.85 s [vector] +++ OK, passed 100 tests.
  8271. 1415.85 s [vector] iscanl: OK
  8272. 1415.85 s [vector] +++ OK, passed 100 tests.
  8273. 1415.85 s [vector] iscanl': OK
  8274. 1415.85 s [vector] +++ OK, passed 100 tests.
  8275. 1415.85 s [vector] prescanr: OK
  8276. 1415.85 s [vector] +++ OK, passed 100 tests.
  8277. 1415.85 s [vector] prescanr': OK (0.01s)
  8278. 1415.85 s [vector] +++ OK, passed 100 tests.
  8279. 1415.85 s [vector] postscanr: OK
  8280. 1415.85 s [vector] +++ OK, passed 100 tests.
  8281. 1415.85 s [vector] postscanr': OK
  8282. 1415.86 s [vector] +++ OK, passed 100 tests.
  8283. 1415.86 s [vector] scanr: OK
  8284. 1415.86 s [vector] +++ OK, passed 100 tests.
  8285. 1415.86 s [vector] scanr': OK
  8286. 1415.86 s [vector] +++ OK, passed 100 tests.
  8287. 1415.86 s [vector] scanr1: OK
  8288. 1415.86 s [vector] +++ OK, passed 100 tests.
  8289. 1415.86 s [vector] scanr1': OK
  8290. 1415.86 s [vector] +++ OK, passed 100 tests.
  8291. 1415.86 s [vector] iscanr: OK
  8292. 1415.86 s [vector] +++ OK, passed 100 tests.
  8293. 1415.86 s [vector] iscanr': OK (0.01s)
  8294. 1415.86 s [vector] +++ OK, passed 100 tests.
  8295. 1415.86 s [vector] mut_read: OK
  8296. 1415.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8297. 1415.86 s [vector] mut_write: OK
  8298. 1415.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8299. 1415.86 s [vector] mut_modify: OK
  8300. 1415.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8301. 1415.86 s [vector] mut_generate: OK
  8302. 1415.86 s [vector] +++ OK, passed 100 tests.
  8303. 1415.86 s [vector] mut_generateM: OK (0.02s)
  8304. 1415.86 s [vector] +++ OK, passed 100 tests.
  8305. 1415.86 s [vector] mut_mapM_: OK (0.03s)
  8306. 1415.86 s [vector] +++ OK, passed 100 tests.
  8307. 1415.86 s [vector] mut_imapM_: OK (0.03s)
  8308. 1415.86 s [vector] +++ OK, passed 100 tests.
  8309. 1415.86 s [vector] mut_forM_: OK (0.03s)
  8310. 1415.86 s [vector] +++ OK, passed 100 tests.
  8311. 1415.86 s [vector] mut_iforM_: OK (0.04s)
  8312. 1415.86 s [vector] +++ OK, passed 100 tests.
  8313. 1415.86 s [vector] mut_foldr: OK
  8314. 1415.86 s [vector] +++ OK, passed 100 tests.
  8315. 1415.86 s [vector] mut_foldr': OK
  8316. 1415.86 s [vector] +++ OK, passed 100 tests.
  8317. 1415.86 s [vector] mut_foldl: OK
  8318. 1415.86 s [vector] +++ OK, passed 100 tests.
  8319. 1415.86 s [vector] mut_foldl': OK
  8320. 1415.86 s [vector] +++ OK, passed 100 tests.
  8321. 1415.86 s [vector] mut_ifoldr: OK (0.01s)
  8322. 1415.86 s [vector] +++ OK, passed 100 tests.
  8323. 1415.86 s [vector] mut_ifoldr': OK
  8324. 1415.86 s [vector] +++ OK, passed 100 tests.
  8325. 1415.86 s [vector] mut_ifoldl: OK
  8326. 1415.86 s [vector] +++ OK, passed 100 tests.
  8327. 1415.86 s [vector] mut_ifoldl': OK
  8328. 1415.86 s [vector] +++ OK, passed 100 tests.
  8329. 1415.86 s [vector] mut_foldM: OK
  8330. 1415.86 s [vector] +++ OK, passed 100 tests.
  8331. 1415.86 s [vector] mut_foldM': OK (0.01s)
  8332. 1415.86 s [vector] +++ OK, passed 100 tests.
  8333. 1415.86 s [vector] mut_foldrM: OK
  8334. 1415.86 s [vector] +++ OK, passed 100 tests.
  8335. 1415.86 s [vector] mut_foldrM': OK
  8336. 1415.86 s [vector] +++ OK, passed 100 tests.
  8337. 1415.86 s [vector] mut_ifoldM: OK
  8338. 1415.86 s [vector] +++ OK, passed 100 tests.
  8339. 1415.86 s [vector] mut_ifoldM': OK
  8340. 1415.86 s [vector] +++ OK, passed 100 tests.
  8341. 1415.86 s [vector] mut_ifoldrM: OK (0.01s)
  8342. 1415.86 s [vector] +++ OK, passed 100 tests.
  8343. 1415.86 s [vector] mut_ifoldrM': OK (0.01s)
  8344. 1415.86 s [vector] +++ OK, passed 100 tests.
  8345. 1415.86 s [vector] compare: OK
  8346. 1415.86 s [vector] +++ OK, passed 100 tests.
  8347. 1415.86 s [vector] maximum: OK
  8348. 1415.86 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8349. 1415.86 s [vector] minimum: OK
  8350. 1415.86 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8351. 1415.86 s [vector] minIndex: OK
  8352. 1415.86 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8353. 1415.86 s [vector] maxIndex: OK
  8354. 1415.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8355. 1415.86 s [vector] maximumBy: OK
  8356. 1415.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8357. 1415.86 s [vector] minimumBy: OK
  8358. 1415.86 s [vector] +++ OK, passed 100 tests; 25 discarded.
  8359. 1415.86 s [vector] maximumOn: OK
  8360. 1415.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8361. 1415.86 s [vector] minimumOn: OK
  8362. 1415.86 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8363. 1415.86 s [vector] maxIndexBy: OK
  8364. 1415.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8365. 1415.86 s [vector] minIndexBy: OK
  8366. 1415.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8367. 1415.86 s [vector] ListFirstMaxIndexWins: OK
  8368. 1415.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8369. 1415.86 s [vector] FalseListFirstMaxIndexWins: OK
  8370. 1415.86 s [vector] +++ OK, failed as expected. (after 1 test):
  8371. 1415.86 s [vector] Exception:
  8372. 1415.86 s [vector] Prelude.foldr1: empty list
  8373. 1415.86 s [vector] CallStack (from HasCallStack):
  8374. 1415.86 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8375. 1415.86 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8376. 1415.86 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8377. 1415.86 s [vector] []
  8378. 1415.86 s [vector] zip: OK
  8379. 1415.86 s [vector] +++ OK, passed 100 tests.
  8380. 1415.86 s [vector] zip3: OK
  8381. 1415.86 s [vector] +++ OK, passed 100 tests.
  8382. 1415.86 s [vector] unzip: OK
  8383. 1415.86 s [vector] +++ OK, passed 100 tests.
  8384. 1415.86 s [vector] unzip3: OK
  8385. 1415.86 s [vector] +++ OK, passed 100 tests.
  8386. 1415.86 s [vector] indexed: OK
  8387. 1415.86 s [vector] +++ OK, passed 100 tests.
  8388. 1415.86 s [vector] update: OK
  8389. 1415.86 s [vector] +++ OK, passed 100 tests.
  8390. 1415.86 s [vector] mempty: OK
  8391. 1415.86 s [vector] +++ OK, passed 100 tests.
  8392. 1415.86 s [vector] mappend: OK
  8393. 1415.86 s [vector] +++ OK, passed 100 tests.
  8394. 1415.86 s [vector] mconcat: OK (0.02s)
  8395. 1415.86 s [vector] +++ OK, passed 100 tests.
  8396. 1415.86 s [vector] glength: OK
  8397. 1415.86 s [vector] +++ OK, passed 100 tests.
  8398. 1415.86 s [vector] sum: OK
  8399. 1415.86 s [vector] +++ OK, passed 100 tests.
  8400. 1415.86 s [vector] product: OK
  8401. 1415.86 s [vector] +++ OK, passed 100 tests.
  8402. 1415.86 s [vector] enumFromN: OK
  8403. 1415.86 s [vector] +++ OK, passed 100 tests.
  8404. 1415.86 s [vector] enumFromThenN: OK
  8405. 1415.86 s [vector] +++ OK, passed 100 tests.
  8406. 1415.86 s [vector] enumFromTo: OK
  8407. 1415.86 s [vector] +++ OK, passed 100 tests.
  8408. 1415.86 s [vector] enumFromThenTo: OK
  8409. 1415.86 s [vector] +++ OK, passed 100 tests; 2 discarded.
  8410. 1415.86 s [vector] (Double)
  8411. 1415.86 s [vector] fromList.toList == id: OK
  8412. 1415.86 s [vector] +++ OK, passed 100 tests.
  8413. 1415.86 s [vector] toList.fromList == id: OK
  8414. 1415.86 s [vector] +++ OK, passed 100 tests.
  8415. 1415.86 s [vector] unstream.stream == id: OK
  8416. 1415.86 s [vector] +++ OK, passed 100 tests.
  8417. 1415.86 s [vector] stream.unstream == id: OK
  8418. 1415.86 s [vector] +++ OK, passed 100 tests.
  8419. 1415.86 s [vector] eq: OK
  8420. 1415.86 s [vector] +++ OK, passed 100 tests.
  8421. 1415.86 s [vector] length: OK
  8422. 1415.86 s [vector] +++ OK, passed 100 tests.
  8423. 1415.86 s [vector] null: OK
  8424. 1415.86 s [vector] +++ OK, passed 100 tests.
  8425. 1415.86 s [vector] index: OK
  8426. 1415.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8427. 1415.86 s [vector] safeIndex: OK
  8428. 1415.86 s [vector] +++ OK, passed 100 tests.
  8429. 1415.86 s [vector] head: OK
  8430. 1415.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8431. 1415.86 s [vector] last: OK
  8432. 1415.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8433. 1415.86 s [vector] unsafeIndex: OK
  8434. 1415.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8435. 1415.86 s [vector] unsafeHead: OK
  8436. 1415.86 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8437. 1415.86 s [vector] unsafeLast: OK
  8438. 1415.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8439. 1415.86 s [vector] slice: OK
  8440. 1415.86 s [vector] +++ OK, passed 100 tests.
  8441. 1415.86 s [vector] init: OK
  8442. 1415.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8443. 1415.86 s [vector] tail: OK
  8444. 1415.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8445. 1415.86 s [vector] take: OK
  8446. 1415.86 s [vector] +++ OK, passed 100 tests.
  8447. 1415.86 s [vector] drop: OK
  8448. 1415.86 s [vector] +++ OK, passed 100 tests.
  8449. 1415.86 s [vector] splitAt: OK
  8450. 1415.86 s [vector] +++ OK, passed 100 tests.
  8451. 1415.86 s [vector] empty: OK
  8452. 1415.86 s [vector] +++ OK, passed 100 tests.
  8453. 1415.86 s [vector] singleton: OK
  8454. 1415.86 s [vector] +++ OK, passed 100 tests.
  8455. 1415.86 s [vector] replicate: OK
  8456. 1415.86 s [vector] +++ OK, passed 100 tests.
  8457. 1415.86 s [vector] generate: OK
  8458. 1415.86 s [vector] +++ OK, passed 100 tests.
  8459. 1415.86 s [vector] iterateN: OK
  8460. 1415.86 s [vector] +++ OK, passed 100 tests.
  8461. 1415.86 s [vector] iterateNM: OK (0.03s)
  8462. 1415.86 s [vector] +++ OK, passed 100 tests.
  8463. 1415.86 s [vector] generateM: OK (0.01s)
  8464. 1415.86 s [vector] +++ OK, passed 100 tests.
  8465. 1415.86 s [vector] replicateM: OK (0.01s)
  8466. 1415.86 s [vector] +++ OK, passed 100 tests.
  8467. 1415.86 s [vector] create: OK
  8468. 1415.86 s [vector] +++ OK, passed 100 tests.
  8469. 1415.86 s [vector] createT: OK
  8470. 1415.86 s [vector] +++ OK, passed 100 tests.
  8471. 1415.86 s [vector] unfoldr: OK
  8472. 1415.86 s [vector] +++ OK, passed 100 tests.
  8473. 1415.86 s [vector] unfoldrN: OK
  8474. 1415.86 s [vector] +++ OK, passed 100 tests.
  8475. 1415.86 s [vector] unfoldrExactN: OK
  8476. 1415.86 s [vector] +++ OK, passed 100 tests.
  8477. 1415.86 s [vector] unfoldrM: OK
  8478. 1415.86 s [vector] +++ OK, passed 100 tests.
  8479. 1415.86 s [vector] unfoldrNM: OK
  8480. 1415.86 s [vector] +++ OK, passed 100 tests.
  8481. 1415.86 s [vector] unfoldrExactNM: OK (0.06s)
  8482. 1415.86 s [vector] +++ OK, passed 100 tests.
  8483. 1415.86 s [vector] constructN: OK
  8484. 1415.86 s [vector] +++ OK, passed 100 tests.
  8485. 1415.86 s [vector] constructrN: OK (0.01s)
  8486. 1415.86 s [vector] +++ OK, passed 100 tests.
  8487. 1415.86 s [vector] cons: OK
  8488. 1415.86 s [vector] +++ OK, passed 100 tests.
  8489. 1415.86 s [vector] snoc: OK
  8490. 1415.86 s [vector] +++ OK, passed 100 tests.
  8491. 1415.86 s [vector] append: OK
  8492. 1415.86 s [vector] +++ OK, passed 100 tests.
  8493. 1415.86 s [vector] concat: OK (0.03s)
  8494. 1415.86 s [vector] +++ OK, passed 100 tests.
  8495. 1415.86 s [vector] force: OK
  8496. 1415.86 s [vector] +++ OK, passed 100 tests.
  8497. 1415.86 s [vector] upd: OK
  8498. 1415.86 s [vector] +++ OK, passed 100 tests.
  8499. 1415.86 s [vector] accum: OK (0.01s)
  8500. 1415.86 s [vector] +++ OK, passed 100 tests.
  8501. 1415.86 s [vector] reverse: OK
  8502. 1415.86 s [vector] +++ OK, passed 100 tests.
  8503. 1415.86 s [vector] backpermute: OK
  8504. 1415.86 s [vector] +++ OK, passed 100 tests.
  8505. 1415.86 s [vector] map: OK
  8506. 1415.86 s [vector] +++ OK, passed 100 tests.
  8507. 1415.86 s [vector] imap: OK
  8508. 1415.86 s [vector] +++ OK, passed 100 tests.
  8509. 1415.86 s [vector] concatMap: OK
  8510. 1415.86 s [vector] +++ OK, passed 100 tests.
  8511. 1415.86 s [vector] mapM: OK
  8512. 1415.86 s [vector] +++ OK, passed 100 tests.
  8513. 1415.86 s [vector] mapM_: OK (0.04s)
  8514. 1415.86 s [vector] +++ OK, passed 100 tests.
  8515. 1415.86 s [vector] forM: OK
  8516. 1415.86 s [vector] +++ OK, passed 100 tests.
  8517. 1415.86 s [vector] forM_: OK (0.04s)
  8518. 1415.86 s [vector] +++ OK, passed 100 tests.
  8519. 1415.86 s [vector] imapM: OK
  8520. 1415.86 s [vector] +++ OK, passed 100 tests.
  8521. 1415.86 s [vector] imapM_: OK (0.03s)
  8522. 1415.86 s [vector] +++ OK, passed 100 tests.
  8523. 1415.86 s [vector] zipWith: OK (0.01s)
  8524. 1415.86 s [vector] +++ OK, passed 100 tests.
  8525. 1415.86 s [vector] zipWith3: OK (0.01s)
  8526. 1415.86 s [vector] +++ OK, passed 100 tests.
  8527. 1415.86 s [vector] izipWith: OK
  8528. 1415.86 s [vector] +++ OK, passed 100 tests.
  8529. 1415.86 s [vector] izipWith3: OK (0.01s)
  8530. 1415.86 s [vector] +++ OK, passed 100 tests.
  8531. 1415.86 s [vector] izipWithM: OK (0.01s)
  8532. 1415.86 s [vector] +++ OK, passed 100 tests.
  8533. 1415.86 s [vector] izipWithM_: OK (0.03s)
  8534. 1415.86 s [vector] +++ OK, passed 100 tests.
  8535. 1415.86 s [vector] zipWithM: OK
  8536. 1415.86 s [vector] +++ OK, passed 100 tests.
  8537. 1415.86 s [vector] zipWithM_: OK (0.03s)
  8538. 1415.86 s [vector] +++ OK, passed 100 tests.
  8539. 1415.86 s [vector] filter: OK
  8540. 1415.86 s [vector] +++ OK, passed 100 tests.
  8541. 1415.86 s [vector] ifilter: OK
  8542. 1415.86 s [vector] +++ OK, passed 100 tests.
  8543. 1415.86 s [vector] filterM: OK (0.04s)
  8544. 1415.86 s [vector] +++ OK, passed 100 tests.
  8545. 1415.86 s [vector] uniq: OK
  8546. 1415.86 s [vector] +++ OK, passed 100 tests.
  8547. 1415.86 s [vector] mapMaybe: OK
  8548. 1415.86 s [vector] +++ OK, passed 100 tests.
  8549. 1415.86 s [vector] imapMaybe: OK
  8550. 1415.86 s [vector] +++ OK, passed 100 tests.
  8551. 1415.86 s [vector] takeWhile: OK
  8552. 1415.86 s [vector] +++ OK, passed 100 tests.
  8553. 1415.86 s [vector] dropWhile: OK
  8554. 1415.86 s [vector] +++ OK, passed 100 tests.
  8555. 1415.86 s [vector] partition: OK
  8556. 1415.86 s [vector] +++ OK, passed 100 tests.
  8557. 1415.86 s [vector] partitionWith: OK
  8558. 1415.86 s [vector] +++ OK, passed 100 tests.
  8559. 1415.86 s [vector] span: OK
  8560. 1415.86 s [vector] +++ OK, passed 100 tests.
  8561. 1415.86 s [vector] break: OK
  8562. 1415.86 s [vector] +++ OK, passed 100 tests.
  8563. 1415.86 s [vector] spanR: OK
  8564. 1415.86 s [vector] +++ OK, passed 100 tests.
  8565. 1415.86 s [vector] breakR: OK
  8566. 1415.86 s [vector] +++ OK, passed 100 tests.
  8567. 1415.86 s [vector] groupBy: OK
  8568. 1415.86 s [vector] +++ OK, passed 100 tests.
  8569. 1415.86 s [vector] elem: OK
  8570. 1415.86 s [vector] +++ OK, passed 100 tests.
  8571. 1415.86 s [vector] notElem: OK
  8572. 1415.86 s [vector] +++ OK, passed 100 tests.
  8573. 1415.86 s [vector] find: OK
  8574. 1415.86 s [vector] +++ OK, passed 100 tests.
  8575. 1415.86 s [vector] findIndex: OK
  8576. 1415.86 s [vector] +++ OK, passed 100 tests.
  8577. 1415.86 s [vector] findIndexR: OK
  8578. 1415.86 s [vector] +++ OK, passed 100 tests.
  8579. 1415.86 s [vector] findIndices: OK
  8580. 1415.86 s [vector] +++ OK, passed 100 tests.
  8581. 1415.86 s [vector] elemIndex: OK
  8582. 1415.86 s [vector] +++ OK, passed 100 tests.
  8583. 1415.86 s [vector] elemIndices: OK
  8584. 1415.86 s [vector] +++ OK, passed 100 tests.
  8585. 1415.86 s [vector] foldl: OK (0.01s)
  8586. 1415.86 s [vector] +++ OK, passed 100 tests.
  8587. 1415.86 s [vector] foldl1: OK (0.01s)
  8588. 1415.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8589. 1415.86 s [vector] foldl': OK (0.01s)
  8590. 1415.86 s [vector] +++ OK, passed 100 tests.
  8591. 1415.86 s [vector] foldl1': OK (0.01s)
  8592. 1415.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8593. 1415.86 s [vector] foldr: OK
  8594. 1415.86 s [vector] +++ OK, passed 100 tests.
  8595. 1415.86 s [vector] foldr1: OK (0.01s)
  8596. 1415.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8597. 1415.86 s [vector] foldr': OK
  8598. 1415.86 s [vector] +++ OK, passed 100 tests.
  8599. 1415.86 s [vector] foldr1': OK (0.01s)
  8600. 1415.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8601. 1415.86 s [vector] ifoldl: OK (0.01s)
  8602. 1415.86 s [vector] +++ OK, passed 100 tests.
  8603. 1415.86 s [vector] ifoldl': OK (0.02s)
  8604. 1415.86 s [vector] +++ OK, passed 100 tests.
  8605. 1415.86 s [vector] ifoldr: OK (0.02s)
  8606. 1415.86 s [vector] +++ OK, passed 100 tests.
  8607. 1415.86 s [vector] ifoldr': OK (0.02s)
  8608. 1415.86 s [vector] +++ OK, passed 100 tests.
  8609. 1415.86 s [vector] ifoldM: OK (0.02s)
  8610. 1415.86 s [vector] +++ OK, passed 100 tests.
  8611. 1415.86 s [vector] ifoldM': OK (0.02s)
  8612. 1415.86 s [vector] +++ OK, passed 100 tests.
  8613. 1415.86 s [vector] ifoldM_: OK (0.04s)
  8614. 1415.86 s [vector] +++ OK, passed 100 tests.
  8615. 1415.87 s [vector] ifoldM'_: OK (0.05s)
  8616. 1415.87 s [vector] +++ OK, passed 100 tests.
  8617. 1415.87 s [vector] all: OK
  8618. 1415.87 s [vector] +++ OK, passed 100 tests.
  8619. 1415.87 s [vector] any: OK
  8620. 1415.87 s [vector] +++ OK, passed 100 tests.
  8621. 1415.87 s [vector] prescanl: OK (0.02s)
  8622. 1415.87 s [vector] +++ OK, passed 100 tests.
  8623. 1415.87 s [vector] prescanl': OK (0.01s)
  8624. 1415.87 s [vector] +++ OK, passed 100 tests.
  8625. 1415.87 s [vector] postscanl: OK (0.02s)
  8626. 1415.87 s [vector] +++ OK, passed 100 tests.
  8627. 1415.87 s [vector] postscanl': OK (0.02s)
  8628. 1415.87 s [vector] +++ OK, passed 100 tests.
  8629. 1415.87 s [vector] scanl: OK (0.01s)
  8630. 1415.87 s [vector] +++ OK, passed 100 tests.
  8631. 1415.87 s [vector] scanl': OK (0.02s)
  8632. 1415.87 s [vector] +++ OK, passed 100 tests.
  8633. 1415.87 s [vector] scanl1: OK (0.01s)
  8634. 1415.87 s [vector] +++ OK, passed 100 tests.
  8635. 1415.87 s [vector] scanl1': OK (0.01s)
  8636. 1415.87 s [vector] +++ OK, passed 100 tests.
  8637. 1415.87 s [vector] iscanl: OK (0.02s)
  8638. 1415.87 s [vector] +++ OK, passed 100 tests.
  8639. 1415.87 s [vector] iscanl': OK (0.01s)
  8640. 1415.87 s [vector] +++ OK, passed 100 tests.
  8641. 1415.87 s [vector] prescanr: OK (0.01s)
  8642. 1415.87 s [vector] +++ OK, passed 100 tests.
  8643. 1415.87 s [vector] prescanr': OK (0.01s)
  8644. 1415.87 s [vector] +++ OK, passed 100 tests.
  8645. 1415.87 s [vector] postscanr: OK (0.01s)
  8646. 1415.87 s [vector] +++ OK, passed 100 tests.
  8647. 1415.87 s [vector] postscanr': OK (0.02s)
  8648. 1415.87 s [vector] +++ OK, passed 100 tests.
  8649. 1415.87 s [vector] scanr: OK (0.01s)
  8650. 1415.87 s [vector] +++ OK, passed 100 tests.
  8651. 1415.87 s [vector] scanr': OK (0.01s)
  8652. 1415.87 s [vector] +++ OK, passed 100 tests.
  8653. 1415.87 s [vector] scanr1: OK (0.01s)
  8654. 1415.87 s [vector] +++ OK, passed 100 tests.
  8655. 1415.87 s [vector] scanr1': OK (0.01s)
  8656. 1415.87 s [vector] +++ OK, passed 100 tests.
  8657. 1415.87 s [vector] iscanr: OK (0.01s)
  8658. 1415.87 s [vector] +++ OK, passed 100 tests.
  8659. 1415.87 s [vector] iscanr': OK (0.02s)
  8660. 1415.87 s [vector] +++ OK, passed 100 tests.
  8661. 1415.87 s [vector] mut_read: OK
  8662. 1415.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8663. 1415.87 s [vector] mut_write: OK
  8664. 1415.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8665. 1415.87 s [vector] mut_modify: OK
  8666. 1415.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8667. 1415.87 s [vector] mut_generate: OK
  8668. 1415.87 s [vector] +++ OK, passed 100 tests.
  8669. 1415.87 s [vector] mut_generateM: OK (0.02s)
  8670. 1415.87 s [vector] +++ OK, passed 100 tests.
  8671. 1415.87 s [vector] mut_mapM_: OK (0.04s)
  8672. 1415.87 s [vector] +++ OK, passed 100 tests.
  8673. 1415.87 s [vector] mut_imapM_: OK (0.04s)
  8674. 1415.87 s [vector] +++ OK, passed 100 tests.
  8675. 1415.87 s [vector] mut_forM_: OK (0.04s)
  8676. 1415.87 s [vector] +++ OK, passed 100 tests.
  8677. 1415.87 s [vector] mut_iforM_: OK (0.06s)
  8678. 1415.87 s [vector] +++ OK, passed 100 tests.
  8679. 1415.87 s [vector] mut_foldr: OK (0.02s)
  8680. 1415.87 s [vector] +++ OK, passed 100 tests.
  8681. 1415.87 s [vector] mut_foldr': OK (0.02s)
  8682. 1415.87 s [vector] +++ OK, passed 100 tests.
  8683. 1415.87 s [vector] mut_foldl: OK (0.01s)
  8684. 1415.87 s [vector] +++ OK, passed 100 tests.
  8685. 1415.87 s [vector] mut_foldl': OK (0.01s)
  8686. 1415.87 s [vector] +++ OK, passed 100 tests.
  8687. 1415.87 s [vector] mut_ifoldr: OK (0.02s)
  8688. 1415.87 s [vector] +++ OK, passed 100 tests.
  8689. 1415.87 s [vector] mut_ifoldr': OK (0.02s)
  8690. 1415.87 s [vector] +++ OK, passed 100 tests.
  8691. 1415.87 s [vector] mut_ifoldl: OK
  8692. 1415.87 s [vector] +++ OK, passed 100 tests.
  8693. 1415.87 s [vector] mut_ifoldl': OK (0.01s)
  8694. 1415.87 s [vector] +++ OK, passed 100 tests.
  8695. 1415.87 s [vector] mut_foldM: OK (0.01s)
  8696. 1415.87 s [vector] +++ OK, passed 100 tests.
  8697. 1415.87 s [vector] mut_foldM': OK (0.01s)
  8698. 1415.87 s [vector] +++ OK, passed 100 tests.
  8699. 1415.87 s [vector] mut_foldrM: OK (0.01s)
  8700. 1415.87 s [vector] +++ OK, passed 100 tests.
  8701. 1415.87 s [vector] mut_foldrM': OK (0.01s)
  8702. 1415.87 s [vector] +++ OK, passed 100 tests.
  8703. 1415.87 s [vector] mut_ifoldM: OK (0.02s)
  8704. 1415.87 s [vector] +++ OK, passed 100 tests.
  8705. 1415.87 s [vector] mut_ifoldM': OK (0.03s)
  8706. 1415.87 s [vector] +++ OK, passed 100 tests.
  8707. 1415.87 s [vector] mut_ifoldrM: OK (0.02s)
  8708. 1415.87 s [vector] +++ OK, passed 100 tests.
  8709. 1415.87 s [vector] mut_ifoldrM': OK (0.02s)
  8710. 1415.87 s [vector] +++ OK, passed 100 tests.
  8711. 1415.87 s [vector] compare: OK
  8712. 1415.87 s [vector] +++ OK, passed 100 tests.
  8713. 1415.87 s [vector] maximum: OK
  8714. 1415.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8715. 1415.87 s [vector] minimum: OK
  8716. 1415.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8717. 1415.87 s [vector] minIndex: OK
  8718. 1415.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8719. 1415.87 s [vector] maxIndex: OK
  8720. 1415.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8721. 1415.87 s [vector] maximumBy: OK
  8722. 1415.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8723. 1415.87 s [vector] minimumBy: OK
  8724. 1415.87 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8725. 1415.87 s [vector] maximumOn: OK
  8726. 1415.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8727. 1415.87 s [vector] minimumOn: OK
  8728. 1415.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8729. 1415.87 s [vector] maxIndexBy: OK
  8730. 1415.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8731. 1415.87 s [vector] minIndexBy: OK
  8732. 1415.87 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8733. 1415.87 s [vector] ListFirstMaxIndexWins: OK
  8734. 1415.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8735. 1415.87 s [vector] FalseListFirstMaxIndexWins: OK
  8736. 1415.87 s [vector] +++ OK, failed as expected. (after 1 test):
  8737. 1415.87 s [vector] Exception:
  8738. 1415.87 s [vector] Prelude.foldr1: empty list
  8739. 1415.87 s [vector] CallStack (from HasCallStack):
  8740. 1415.87 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8741. 1415.87 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8742. 1415.87 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8743. 1415.87 s [vector] []
  8744. 1415.87 s [vector] zip: OK
  8745. 1415.87 s [vector] +++ OK, passed 100 tests.
  8746. 1415.87 s [vector] zip3: OK
  8747. 1415.87 s [vector] +++ OK, passed 100 tests.
  8748. 1415.87 s [vector] unzip: OK
  8749. 1415.87 s [vector] +++ OK, passed 100 tests.
  8750. 1415.87 s [vector] unzip3: OK
  8751. 1415.87 s [vector] +++ OK, passed 100 tests.
  8752. 1415.87 s [vector] indexed: OK
  8753. 1415.87 s [vector] +++ OK, passed 100 tests.
  8754. 1415.87 s [vector] update: OK
  8755. 1415.87 s [vector] +++ OK, passed 100 tests.
  8756. 1415.87 s [vector] mempty: OK
  8757. 1415.87 s [vector] +++ OK, passed 100 tests.
  8758. 1415.87 s [vector] mappend: OK
  8759. 1415.87 s [vector] +++ OK, passed 100 tests.
  8760. 1415.87 s [vector] mconcat: OK (0.02s)
  8761. 1415.87 s [vector] +++ OK, passed 100 tests.
  8762. 1415.87 s [vector] glength: OK
  8763. 1415.87 s [vector] +++ OK, passed 100 tests.
  8764. 1415.87 s [vector] sum: OK
  8765. 1415.87 s [vector] +++ OK, passed 100 tests.
  8766. 1415.87 s [vector] product: OK
  8767. 1415.87 s [vector] +++ OK, passed 100 tests.
  8768. 1415.87 s [vector] enumFromN: OK
  8769. 1415.87 s [vector] +++ OK, passed 100 tests.
  8770. 1415.87 s [vector] enumFromThenN: OK
  8771. 1415.87 s [vector] +++ OK, passed 100 tests.
  8772. 1415.87 s [vector] enumFromTo: OK
  8773. 1415.87 s [vector] +++ OK, passed 100 tests.
  8774. 1415.87 s [vector] enumFromThenTo: OK
  8775. 1415.87 s [vector] +++ OK, passed 100 tests; 3 discarded.
  8776. 1415.87 s [vector] (Int,Bool)
  8777. 1415.87 s [vector] fromList.toList == id: OK
  8778. 1415.87 s [vector] +++ OK, passed 100 tests.
  8779. 1415.87 s [vector] toList.fromList == id: OK
  8780. 1415.87 s [vector] +++ OK, passed 100 tests.
  8781. 1415.87 s [vector] unstream.stream == id: OK
  8782. 1415.87 s [vector] +++ OK, passed 100 tests.
  8783. 1415.87 s [vector] stream.unstream == id: OK
  8784. 1415.87 s [vector] +++ OK, passed 100 tests.
  8785. 1415.87 s [vector] eq: OK
  8786. 1415.87 s [vector] +++ OK, passed 100 tests.
  8787. 1415.87 s [vector] length: OK
  8788. 1415.87 s [vector] +++ OK, passed 100 tests.
  8789. 1415.87 s [vector] null: OK
  8790. 1415.87 s [vector] +++ OK, passed 100 tests.
  8791. 1415.87 s [vector] index: OK
  8792. 1415.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8793. 1415.87 s [vector] safeIndex: OK
  8794. 1415.87 s [vector] +++ OK, passed 100 tests.
  8795. 1415.87 s [vector] head: OK
  8796. 1415.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8797. 1415.87 s [vector] last: OK
  8798. 1415.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8799. 1415.87 s [vector] unsafeIndex: OK
  8800. 1415.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8801. 1415.87 s [vector] unsafeHead: OK
  8802. 1415.87 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8803. 1415.87 s [vector] unsafeLast: OK
  8804. 1415.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8805. 1415.87 s [vector] slice: OK
  8806. 1415.87 s [vector] +++ OK, passed 100 tests.
  8807. 1415.87 s [vector] init: OK
  8808. 1415.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8809. 1415.87 s [vector] tail: OK
  8810. 1415.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8811. 1415.87 s [vector] take: OK
  8812. 1415.87 s [vector] +++ OK, passed 100 tests.
  8813. 1415.87 s [vector] drop: OK
  8814. 1415.87 s [vector] +++ OK, passed 100 tests.
  8815. 1415.87 s [vector] splitAt: OK
  8816. 1415.87 s [vector] +++ OK, passed 100 tests.
  8817. 1415.87 s [vector] empty: OK
  8818. 1415.87 s [vector] +++ OK, passed 100 tests.
  8819. 1415.87 s [vector] singleton: OK
  8820. 1415.87 s [vector] +++ OK, passed 100 tests.
  8821. 1415.87 s [vector] replicate: OK
  8822. 1415.87 s [vector] +++ OK, passed 100 tests.
  8823. 1415.87 s [vector] generate: OK
  8824. 1415.87 s [vector] +++ OK, passed 100 tests.
  8825. 1415.87 s [vector] iterateN: OK
  8826. 1415.87 s [vector] +++ OK, passed 100 tests.
  8827. 1415.87 s [vector] iterateNM: OK (0.02s)
  8828. 1415.87 s [vector] +++ OK, passed 100 tests.
  8829. 1415.87 s [vector] generateM: OK (0.05s)
  8830. 1415.87 s [vector] +++ OK, passed 100 tests.
  8831. 1415.87 s [vector] replicateM: OK (0.01s)
  8832. 1415.87 s [vector] +++ OK, passed 100 tests.
  8833. 1415.87 s [vector] create: OK
  8834. 1415.87 s [vector] +++ OK, passed 100 tests.
  8835. 1415.87 s [vector] createT: OK
  8836. 1415.87 s [vector] +++ OK, passed 100 tests.
  8837. 1415.87 s [vector] unfoldr: OK
  8838. 1415.87 s [vector] +++ OK, passed 100 tests.
  8839. 1415.87 s [vector] unfoldrN: OK
  8840. 1415.87 s [vector] +++ OK, passed 100 tests.
  8841. 1415.87 s [vector] unfoldrExactN: OK
  8842. 1415.87 s [vector] +++ OK, passed 100 tests.
  8843. 1415.87 s [vector] unfoldrM: OK
  8844. 1415.87 s [vector] +++ OK, passed 100 tests.
  8845. 1415.87 s [vector] unfoldrNM: OK
  8846. 1415.87 s [vector] +++ OK, passed 100 tests.
  8847. 1415.87 s [vector] unfoldrExactNM: OK (0.05s)
  8848. 1415.87 s [vector] +++ OK, passed 100 tests.
  8849. 1415.87 s [vector] constructN: OK (0.01s)
  8850. 1415.87 s [vector] +++ OK, passed 100 tests.
  8851. 1415.87 s [vector] constructrN: OK
  8852. 1415.87 s [vector] +++ OK, passed 100 tests.
  8853. 1415.87 s [vector] cons: OK
  8854. 1415.88 s [vector] +++ OK, passed 100 tests.
  8855. 1415.88 s [vector] snoc: OK
  8856. 1415.88 s [vector] +++ OK, passed 100 tests.
  8857. 1415.88 s [vector] append: OK
  8858. 1415.88 s [vector] +++ OK, passed 100 tests.
  8859. 1415.88 s [vector] concat: OK (0.04s)
  8860. 1415.88 s [vector] +++ OK, passed 100 tests.
  8861. 1415.88 s [vector] force: OK
  8862. 1415.88 s [vector] +++ OK, passed 100 tests.
  8863. 1415.88 s [vector] upd: OK
  8864. 1415.88 s [vector] +++ OK, passed 100 tests.
  8865. 1415.88 s [vector] accum: OK
  8866. 1415.88 s [vector] +++ OK, passed 100 tests.
  8867. 1415.88 s [vector] reverse: OK
  8868. 1415.88 s [vector] +++ OK, passed 100 tests.
  8869. 1415.88 s [vector] backpermute: OK
  8870. 1415.88 s [vector] +++ OK, passed 100 tests.
  8871. 1415.88 s [vector] map: OK
  8872. 1415.88 s [vector] +++ OK, passed 100 tests.
  8873. 1415.88 s [vector] imap: OK
  8874. 1415.88 s [vector] +++ OK, passed 100 tests.
  8875. 1415.88 s [vector] concatMap: OK
  8876. 1415.88 s [vector] +++ OK, passed 100 tests.
  8877. 1415.88 s [vector] mapM: OK
  8878. 1415.88 s [vector] +++ OK, passed 100 tests.
  8879. 1415.88 s [vector] mapM_: OK (0.03s)
  8880. 1415.88 s [vector] +++ OK, passed 100 tests.
  8881. 1415.88 s [vector] forM: OK
  8882. 1415.88 s [vector] +++ OK, passed 100 tests.
  8883. 1415.88 s [vector] forM_: OK (0.03s)
  8884. 1415.88 s [vector] +++ OK, passed 100 tests.
  8885. 1415.88 s [vector] imapM: OK
  8886. 1415.88 s [vector] +++ OK, passed 100 tests.
  8887. 1415.88 s [vector] imapM_: OK (0.05s)
  8888. 1415.88 s [vector] +++ OK, passed 100 tests.
  8889. 1415.88 s [vector] zipWith: OK
  8890. 1415.88 s [vector] +++ OK, passed 100 tests.
  8891. 1415.88 s [vector] zipWith3: OK
  8892. 1415.88 s [vector] +++ OK, passed 100 tests.
  8893. 1415.88 s [vector] izipWith: OK
  8894. 1415.88 s [vector] +++ OK, passed 100 tests.
  8895. 1415.88 s [vector] izipWith3: OK
  8896. 1415.88 s [vector] +++ OK, passed 100 tests.
  8897. 1415.88 s [vector] izipWithM: OK
  8898. 1415.88 s [vector] +++ OK, passed 100 tests.
  8899. 1415.88 s [vector] izipWithM_: OK (0.03s)
  8900. 1415.88 s [vector] +++ OK, passed 100 tests.
  8901. 1415.88 s [vector] zipWithM: OK
  8902. 1415.88 s [vector] +++ OK, passed 100 tests.
  8903. 1415.88 s [vector] zipWithM_: OK (0.02s)
  8904. 1415.88 s [vector] +++ OK, passed 100 tests.
  8905. 1415.88 s [vector] filter: OK
  8906. 1415.88 s [vector] +++ OK, passed 100 tests.
  8907. 1415.88 s [vector] ifilter: OK
  8908. 1415.88 s [vector] +++ OK, passed 100 tests.
  8909. 1415.88 s [vector] filterM: OK (0.04s)
  8910. 1415.88 s [vector] +++ OK, passed 100 tests.
  8911. 1415.88 s [vector] uniq: OK
  8912. 1415.88 s [vector] +++ OK, passed 100 tests.
  8913. 1415.88 s [vector] mapMaybe: OK
  8914. 1415.88 s [vector] +++ OK, passed 100 tests.
  8915. 1415.88 s [vector] imapMaybe: OK
  8916. 1415.88 s [vector] +++ OK, passed 100 tests.
  8917. 1415.88 s [vector] takeWhile: OK
  8918. 1415.88 s [vector] +++ OK, passed 100 tests.
  8919. 1415.88 s [vector] dropWhile: OK
  8920. 1415.88 s [vector] +++ OK, passed 100 tests.
  8921. 1415.88 s [vector] partition: OK
  8922. 1415.88 s [vector] +++ OK, passed 100 tests.
  8923. 1415.88 s [vector] partitionWith: OK
  8924. 1415.88 s [vector] +++ OK, passed 100 tests.
  8925. 1415.88 s [vector] span: OK
  8926. 1415.88 s [vector] +++ OK, passed 100 tests.
  8927. 1415.88 s [vector] break: OK
  8928. 1415.88 s [vector] +++ OK, passed 100 tests.
  8929. 1415.88 s [vector] spanR: OK
  8930. 1415.88 s [vector] +++ OK, passed 100 tests.
  8931. 1415.88 s [vector] breakR: OK
  8932. 1415.88 s [vector] +++ OK, passed 100 tests.
  8933. 1415.88 s [vector] groupBy: OK
  8934. 1415.88 s [vector] +++ OK, passed 100 tests.
  8935. 1415.88 s [vector] elem: OK
  8936. 1415.88 s [vector] +++ OK, passed 100 tests.
  8937. 1415.88 s [vector] notElem: OK
  8938. 1415.88 s [vector] +++ OK, passed 100 tests.
  8939. 1415.88 s [vector] find: OK
  8940. 1415.88 s [vector] +++ OK, passed 100 tests.
  8941. 1415.88 s [vector] findIndex: OK
  8942. 1415.88 s [vector] +++ OK, passed 100 tests.
  8943. 1415.88 s [vector] findIndexR: OK
  8944. 1415.88 s [vector] +++ OK, passed 100 tests.
  8945. 1415.88 s [vector] findIndices: OK
  8946. 1415.88 s [vector] +++ OK, passed 100 tests.
  8947. 1415.88 s [vector] elemIndex: OK
  8948. 1415.88 s [vector] +++ OK, passed 100 tests.
  8949. 1415.88 s [vector] elemIndices: OK
  8950. 1415.88 s [vector] +++ OK, passed 100 tests.
  8951. 1415.88 s [vector] foldl: OK
  8952. 1415.88 s [vector] +++ OK, passed 100 tests.
  8953. 1415.88 s [vector] foldl1: OK
  8954. 1415.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8955. 1415.88 s [vector] foldl': OK
  8956. 1415.88 s [vector] +++ OK, passed 100 tests.
  8957. 1415.88 s [vector] foldl1': OK
  8958. 1415.88 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8959. 1415.88 s [vector] foldr: OK
  8960. 1415.88 s [vector] +++ OK, passed 100 tests.
  8961. 1415.88 s [vector] foldr1: OK
  8962. 1415.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8963. 1415.88 s [vector] foldr': OK
  8964. 1415.88 s [vector] +++ OK, passed 100 tests.
  8965. 1415.88 s [vector] foldr1': OK
  8966. 1415.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8967. 1415.88 s [vector] ifoldl: OK
  8968. 1415.88 s [vector] +++ OK, passed 100 tests.
  8969. 1415.88 s [vector] ifoldl': OK
  8970. 1415.88 s [vector] +++ OK, passed 100 tests.
  8971. 1415.88 s [vector] ifoldr: OK
  8972. 1415.88 s [vector] +++ OK, passed 100 tests.
  8973. 1415.88 s [vector] ifoldr': OK
  8974. 1415.88 s [vector] +++ OK, passed 100 tests.
  8975. 1415.88 s [vector] ifoldM: OK
  8976. 1415.88 s [vector] +++ OK, passed 100 tests.
  8977. 1415.88 s [vector] ifoldM': OK
  8978. 1415.88 s [vector] +++ OK, passed 100 tests.
  8979. 1415.88 s [vector] ifoldM_: OK (0.03s)
  8980. 1415.88 s [vector] +++ OK, passed 100 tests.
  8981. 1415.88 s [vector] ifoldM'_: OK (0.03s)
  8982. 1415.88 s [vector] +++ OK, passed 100 tests.
  8983. 1415.88 s [vector] all: OK
  8984. 1415.88 s [vector] +++ OK, passed 100 tests.
  8985. 1415.88 s [vector] any: OK
  8986. 1415.88 s [vector] +++ OK, passed 100 tests.
  8987. 1415.88 s [vector] prescanl: OK
  8988. 1415.88 s [vector] +++ OK, passed 100 tests.
  8989. 1415.88 s [vector] prescanl': OK
  8990. 1415.88 s [vector] +++ OK, passed 100 tests.
  8991. 1415.88 s [vector] postscanl: OK
  8992. 1415.88 s [vector] +++ OK, passed 100 tests.
  8993. 1415.88 s [vector] postscanl': OK
  8994. 1415.88 s [vector] +++ OK, passed 100 tests.
  8995. 1415.88 s [vector] scanl: OK
  8996. 1415.88 s [vector] +++ OK, passed 100 tests.
  8997. 1415.88 s [vector] scanl': OK
  8998. 1415.88 s [vector] +++ OK, passed 100 tests.
  8999. 1415.88 s [vector] scanl1: OK
  9000. 1415.88 s [vector] +++ OK, passed 100 tests.
  9001. 1415.88 s [vector] scanl1': OK
  9002. 1415.88 s [vector] +++ OK, passed 100 tests.
  9003. 1415.88 s [vector] iscanl: OK
  9004. 1415.88 s [vector] +++ OK, passed 100 tests.
  9005. 1415.88 s [vector] iscanl': OK
  9006. 1415.88 s [vector] +++ OK, passed 100 tests.
  9007. 1415.88 s [vector] prescanr: OK
  9008. 1415.88 s [vector] +++ OK, passed 100 tests.
  9009. 1415.88 s [vector] prescanr': OK
  9010. 1415.88 s [vector] +++ OK, passed 100 tests.
  9011. 1415.88 s [vector] postscanr: OK
  9012. 1415.88 s [vector] +++ OK, passed 100 tests.
  9013. 1415.88 s [vector] postscanr': OK
  9014. 1415.88 s [vector] +++ OK, passed 100 tests.
  9015. 1415.88 s [vector] scanr: OK
  9016. 1415.88 s [vector] +++ OK, passed 100 tests.
  9017. 1415.88 s [vector] scanr': OK
  9018. 1415.88 s [vector] +++ OK, passed 100 tests.
  9019. 1415.88 s [vector] scanr1: OK
  9020. 1415.88 s [vector] +++ OK, passed 100 tests.
  9021. 1415.88 s [vector] scanr1': OK
  9022. 1415.88 s [vector] +++ OK, passed 100 tests.
  9023. 1415.88 s [vector] iscanr: OK
  9024. 1415.88 s [vector] +++ OK, passed 100 tests.
  9025. 1415.88 s [vector] iscanr': OK
  9026. 1415.88 s [vector] +++ OK, passed 100 tests.
  9027. 1415.88 s [vector] mut_read: OK
  9028. 1415.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9029. 1415.88 s [vector] mut_write: OK
  9030. 1415.88 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9031. 1415.88 s [vector] mut_modify: OK
  9032. 1415.88 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9033. 1415.88 s [vector] mut_generate: OK
  9034. 1415.88 s [vector] +++ OK, passed 100 tests.
  9035. 1415.88 s [vector] mut_generateM: OK (0.02s)
  9036. 1415.88 s [vector] +++ OK, passed 100 tests.
  9037. 1415.88 s [vector] mut_mapM_: OK (0.03s)
  9038. 1415.88 s [vector] +++ OK, passed 100 tests.
  9039. 1415.88 s [vector] mut_imapM_: OK (0.04s)
  9040. 1415.88 s [vector] +++ OK, passed 100 tests.
  9041. 1415.88 s [vector] mut_forM_: OK (0.03s)
  9042. 1415.88 s [vector] +++ OK, passed 100 tests.
  9043. 1415.88 s [vector] mut_iforM_: OK (0.03s)
  9044. 1415.88 s [vector] +++ OK, passed 100 tests.
  9045. 1415.88 s [vector] mut_foldr: OK
  9046. 1415.88 s [vector] +++ OK, passed 100 tests.
  9047. 1415.88 s [vector] mut_foldr': OK
  9048. 1415.88 s [vector] +++ OK, passed 100 tests.
  9049. 1415.88 s [vector] mut_foldl: OK
  9050. 1415.88 s [vector] +++ OK, passed 100 tests.
  9051. 1415.88 s [vector] mut_foldl': OK
  9052. 1415.88 s [vector] +++ OK, passed 100 tests.
  9053. 1415.88 s [vector] mut_ifoldr: OK
  9054. 1415.88 s [vector] +++ OK, passed 100 tests.
  9055. 1415.88 s [vector] mut_ifoldr': OK
  9056. 1415.88 s [vector] +++ OK, passed 100 tests.
  9057. 1415.88 s [vector] mut_ifoldl: OK
  9058. 1415.88 s [vector] +++ OK, passed 100 tests.
  9059. 1415.88 s [vector] mut_ifoldl': OK
  9060. 1415.88 s [vector] +++ OK, passed 100 tests.
  9061. 1415.88 s [vector] mut_foldM: OK
  9062. 1415.88 s [vector] +++ OK, passed 100 tests.
  9063. 1415.88 s [vector] mut_foldM': OK
  9064. 1415.88 s [vector] +++ OK, passed 100 tests.
  9065. 1415.88 s [vector] mut_foldrM: OK
  9066. 1415.88 s [vector] +++ OK, passed 100 tests.
  9067. 1415.88 s [vector] mut_foldrM': OK
  9068. 1415.88 s [vector] +++ OK, passed 100 tests.
  9069. 1415.88 s [vector] mut_ifoldM: OK
  9070. 1415.88 s [vector] +++ OK, passed 100 tests.
  9071. 1415.88 s [vector] mut_ifoldM': OK
  9072. 1415.88 s [vector] +++ OK, passed 100 tests.
  9073. 1415.88 s [vector] mut_ifoldrM: OK
  9074. 1415.88 s [vector] +++ OK, passed 100 tests.
  9075. 1415.88 s [vector] mut_ifoldrM': OK
  9076. 1415.88 s [vector] +++ OK, passed 100 tests.
  9077. 1415.88 s [vector] compare: OK
  9078. 1415.88 s [vector] +++ OK, passed 100 tests.
  9079. 1415.88 s [vector] maximum: OK
  9080. 1415.88 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9081. 1415.88 s [vector] minimum: OK
  9082. 1415.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9083. 1415.88 s [vector] minIndex: OK
  9084. 1415.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9085. 1415.88 s [vector] maxIndex: OK
  9086. 1415.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9087. 1415.88 s [vector] maximumBy: OK
  9088. 1415.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9089. 1415.88 s [vector] minimumBy: OK
  9090. 1415.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9091. 1415.88 s [vector] maximumOn: OK
  9092. 1415.88 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9093. 1415.88 s [vector] minimumOn: OK
  9094. 1415.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9095. 1415.88 s [vector] maxIndexBy: OK
  9096. 1415.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9097. 1415.88 s [vector] minIndexBy: OK
  9098. 1415.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9099. 1415.88 s [vector] ListFirstMaxIndexWins: OK
  9100. 1415.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9101. 1415.88 s [vector] FalseListFirstMaxIndexWins: OK
  9102. 1415.88 s [vector] +++ OK, failed as expected. (after 1 test):
  9103. 1415.88 s [vector] Exception:
  9104. 1415.88 s [vector] Prelude.foldr1: empty list
  9105. 1415.88 s [vector] CallStack (from HasCallStack):
  9106. 1415.88 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  9107. 1415.88 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  9108. 1415.88 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9109. 1415.88 s [vector] []
  9110. 1415.88 s [vector] zip: OK
  9111. 1415.88 s [vector] +++ OK, passed 100 tests.
  9112. 1415.88 s [vector] zip3: OK
  9113. 1415.88 s [vector] +++ OK, passed 100 tests.
  9114. 1415.88 s [vector] unzip: OK
  9115. 1415.88 s [vector] +++ OK, passed 100 tests.
  9116. 1415.88 s [vector] unzip3: OK
  9117. 1415.88 s [vector] +++ OK, passed 100 tests.
  9118. 1415.88 s [vector] indexed: OK
  9119. 1415.88 s [vector] +++ OK, passed 100 tests.
  9120. 1415.88 s [vector] update: OK
  9121. 1415.88 s [vector] +++ OK, passed 100 tests.
  9122. 1415.88 s [vector] mempty: OK
  9123. 1415.88 s [vector] +++ OK, passed 100 tests.
  9124. 1415.88 s [vector] mappend: OK
  9125. 1415.88 s [vector] +++ OK, passed 100 tests.
  9126. 1415.88 s [vector] mconcat: OK (0.05s)
  9127. 1415.88 s [vector] +++ OK, passed 100 tests.
  9128. 1415.88 s [vector] glength: OK
  9129. 1415.88 s [vector] +++ OK, passed 100 tests.
  9130. 1415.88 s [vector] (Int,Bool,Int)
  9131. 1415.88 s [vector] fromList.toList == id: OK
  9132. 1415.88 s [vector] +++ OK, passed 100 tests.
  9133. 1415.88 s [vector] toList.fromList == id: OK
  9134. 1415.88 s [vector] +++ OK, passed 100 tests.
  9135. 1415.88 s [vector] unstream.stream == id: OK
  9136. 1415.88 s [vector] +++ OK, passed 100 tests.
  9137. 1415.88 s [vector] stream.unstream == id: OK
  9138. 1415.88 s [vector] +++ OK, passed 100 tests.
  9139. 1415.88 s [vector] eq: OK
  9140. 1415.88 s [vector] +++ OK, passed 100 tests.
  9141. 1415.88 s [vector] length: OK
  9142. 1415.88 s [vector] +++ OK, passed 100 tests.
  9143. 1415.88 s [vector] null: OK
  9144. 1415.88 s [vector] +++ OK, passed 100 tests.
  9145. 1415.88 s [vector] index: OK
  9146. 1415.88 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9147. 1415.88 s [vector] safeIndex: OK
  9148. 1415.88 s [vector] +++ OK, passed 100 tests.
  9149. 1415.88 s [vector] head: OK
  9150. 1415.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9151. 1415.88 s [vector] last: OK
  9152. 1415.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9153. 1415.88 s [vector] unsafeIndex: OK
  9154. 1415.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9155. 1415.88 s [vector] unsafeHead: OK
  9156. 1415.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9157. 1415.88 s [vector] unsafeLast: OK
  9158. 1415.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9159. 1415.88 s [vector] slice: OK
  9160. 1415.88 s [vector] +++ OK, passed 100 tests.
  9161. 1415.88 s [vector] init: OK
  9162. 1415.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9163. 1415.88 s [vector] tail: OK
  9164. 1415.88 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9165. 1415.88 s [vector] take: OK
  9166. 1415.88 s [vector] +++ OK, passed 100 tests.
  9167. 1415.88 s [vector] drop: OK
  9168. 1415.88 s [vector] +++ OK, passed 100 tests.
  9169. 1415.88 s [vector] splitAt: OK
  9170. 1415.88 s [vector] +++ OK, passed 100 tests.
  9171. 1415.89 s [vector] empty: OK
  9172. 1415.89 s [vector] +++ OK, passed 100 tests.
  9173. 1415.89 s [vector] singleton: OK
  9174. 1415.89 s [vector] +++ OK, passed 100 tests.
  9175. 1415.89 s [vector] replicate: OK
  9176. 1415.89 s [vector] +++ OK, passed 100 tests.
  9177. 1415.89 s [vector] generate: OK
  9178. 1415.89 s [vector] +++ OK, passed 100 tests.
  9179. 1415.89 s [vector] iterateN: OK
  9180. 1415.89 s [vector] +++ OK, passed 100 tests.
  9181. 1415.89 s [vector] iterateNM: OK (0.02s)
  9182. 1415.89 s [vector] +++ OK, passed 100 tests.
  9183. 1415.89 s [vector] generateM: OK (0.06s)
  9184. 1415.89 s [vector] +++ OK, passed 100 tests.
  9185. 1415.89 s [vector] replicateM: OK (0.02s)
  9186. 1415.89 s [vector] +++ OK, passed 100 tests.
  9187. 1415.89 s [vector] create: OK (0.02s)
  9188. 1415.89 s [vector] +++ OK, passed 100 tests.
  9189. 1415.89 s [vector] createT: OK
  9190. 1415.89 s [vector] +++ OK, passed 100 tests.
  9191. 1415.89 s [vector] unfoldr: OK
  9192. 1415.89 s [vector] +++ OK, passed 100 tests.
  9193. 1415.89 s [vector] unfoldrN: OK
  9194. 1415.89 s [vector] +++ OK, passed 100 tests.
  9195. 1415.89 s [vector] unfoldrExactN: OK
  9196. 1415.89 s [vector] +++ OK, passed 100 tests.
  9197. 1415.89 s [vector] unfoldrM: OK
  9198. 1415.89 s [vector] +++ OK, passed 100 tests.
  9199. 1415.89 s [vector] unfoldrNM: OK
  9200. 1415.89 s [vector] +++ OK, passed 100 tests.
  9201. 1415.89 s [vector] unfoldrExactNM: OK (0.05s)
  9202. 1415.89 s [vector] +++ OK, passed 100 tests.
  9203. 1415.89 s [vector] constructN: OK (0.01s)
  9204. 1415.89 s [vector] +++ OK, passed 100 tests.
  9205. 1415.89 s [vector] constructrN: OK (0.01s)
  9206. 1415.89 s [vector] +++ OK, passed 100 tests.
  9207. 1415.89 s [vector] cons: OK
  9208. 1415.89 s [vector] +++ OK, passed 100 tests.
  9209. 1415.89 s [vector] snoc: OK
  9210. 1415.89 s [vector] +++ OK, passed 100 tests.
  9211. 1415.89 s [vector] append: OK
  9212. 1415.89 s [vector] +++ OK, passed 100 tests.
  9213. 1415.89 s [vector] concat: OK (0.06s)
  9214. 1415.89 s [vector] +++ OK, passed 100 tests.
  9215. 1415.89 s [vector] force: OK
  9216. 1415.89 s [vector] +++ OK, passed 100 tests.
  9217. 1415.89 s [vector] upd: OK
  9218. 1415.89 s [vector] +++ OK, passed 100 tests.
  9219. 1415.89 s [vector] accum: OK (0.01s)
  9220. 1415.89 s [vector] +++ OK, passed 100 tests.
  9221. 1415.89 s [vector] reverse: OK
  9222. 1415.89 s [vector] +++ OK, passed 100 tests.
  9223. 1415.89 s [vector] backpermute: OK
  9224. 1415.89 s [vector] +++ OK, passed 100 tests.
  9225. 1415.89 s [vector] map: OK
  9226. 1415.89 s [vector] +++ OK, passed 100 tests.
  9227. 1415.89 s [vector] imap: OK
  9228. 1415.89 s [vector] +++ OK, passed 100 tests.
  9229. 1415.89 s [vector] concatMap: OK
  9230. 1415.89 s [vector] +++ OK, passed 100 tests.
  9231. 1415.89 s [vector] mapM: OK
  9232. 1415.89 s [vector] +++ OK, passed 100 tests.
  9233. 1415.89 s [vector] mapM_: OK (0.04s)
  9234. 1415.89 s [vector] +++ OK, passed 100 tests.
  9235. 1415.89 s [vector] forM: OK
  9236. 1415.89 s [vector] +++ OK, passed 100 tests.
  9237. 1415.89 s [vector] forM_: OK (0.04s)
  9238. 1415.89 s [vector] +++ OK, passed 100 tests.
  9239. 1415.89 s [vector] imapM: OK
  9240. 1415.89 s [vector] +++ OK, passed 100 tests.
  9241. 1415.89 s [vector] imapM_: OK (0.06s)
  9242. 1415.89 s [vector] +++ OK, passed 100 tests.
  9243. 1415.89 s [vector] zipWith: OK
  9244. 1415.89 s [vector] +++ OK, passed 100 tests.
  9245. 1415.89 s [vector] zipWith3: OK
  9246. 1415.89 s [vector] +++ OK, passed 100 tests.
  9247. 1415.89 s [vector] izipWith: OK
  9248. 1415.89 s [vector] +++ OK, passed 100 tests.
  9249. 1415.89 s [vector] izipWith3: OK
  9250. 1415.89 s [vector] +++ OK, passed 100 tests.
  9251. 1415.89 s [vector] izipWithM: OK
  9252. 1415.89 s [vector] +++ OK, passed 100 tests.
  9253. 1415.89 s [vector] izipWithM_: OK (0.03s)
  9254. 1415.89 s [vector] +++ OK, passed 100 tests.
  9255. 1415.89 s [vector] zipWithM: OK
  9256. 1415.89 s [vector] +++ OK, passed 100 tests.
  9257. 1415.89 s [vector] zipWithM_: OK (0.04s)
  9258. 1415.89 s [vector] +++ OK, passed 100 tests.
  9259. 1415.89 s [vector] filter: OK
  9260. 1415.89 s [vector] +++ OK, passed 100 tests.
  9261. 1415.89 s [vector] ifilter: OK
  9262. 1415.89 s [vector] +++ OK, passed 100 tests.
  9263. 1415.89 s [vector] filterM: OK (0.06s)
  9264. 1415.89 s [vector] +++ OK, passed 100 tests.
  9265. 1415.89 s [vector] uniq: OK
  9266. 1415.89 s [vector] +++ OK, passed 100 tests.
  9267. 1415.89 s [vector] mapMaybe: OK
  9268. 1415.89 s [vector] +++ OK, passed 100 tests.
  9269. 1415.89 s [vector] imapMaybe: OK
  9270. 1415.89 s [vector] +++ OK, passed 100 tests.
  9271. 1415.89 s [vector] takeWhile: OK
  9272. 1415.89 s [vector] +++ OK, passed 100 tests.
  9273. 1415.89 s [vector] dropWhile: OK
  9274. 1415.89 s [vector] +++ OK, passed 100 tests.
  9275. 1415.89 s [vector] partition: OK
  9276. 1415.89 s [vector] +++ OK, passed 100 tests.
  9277. 1415.89 s [vector] partitionWith: OK
  9278. 1415.89 s [vector] +++ OK, passed 100 tests.
  9279. 1415.89 s [vector] span: OK
  9280. 1415.89 s [vector] +++ OK, passed 100 tests.
  9281. 1415.89 s [vector] break: OK
  9282. 1415.89 s [vector] +++ OK, passed 100 tests.
  9283. 1415.89 s [vector] spanR: OK
  9284. 1415.89 s [vector] +++ OK, passed 100 tests.
  9285. 1415.89 s [vector] breakR: OK
  9286. 1415.89 s [vector] +++ OK, passed 100 tests.
  9287. 1415.89 s [vector] groupBy: OK
  9288. 1415.89 s [vector] +++ OK, passed 100 tests.
  9289. 1415.89 s [vector] elem: OK
  9290. 1415.89 s [vector] +++ OK, passed 100 tests.
  9291. 1415.89 s [vector] notElem: OK
  9292. 1415.89 s [vector] +++ OK, passed 100 tests.
  9293. 1415.89 s [vector] find: OK
  9294. 1415.89 s [vector] +++ OK, passed 100 tests.
  9295. 1415.89 s [vector] findIndex: OK
  9296. 1415.89 s [vector] +++ OK, passed 100 tests.
  9297. 1415.89 s [vector] findIndexR: OK
  9298. 1415.89 s [vector] +++ OK, passed 100 tests.
  9299. 1415.89 s [vector] findIndices: OK
  9300. 1415.89 s [vector] +++ OK, passed 100 tests.
  9301. 1415.89 s [vector] elemIndex: OK
  9302. 1415.89 s [vector] +++ OK, passed 100 tests.
  9303. 1415.89 s [vector] elemIndices: OK
  9304. 1415.89 s [vector] +++ OK, passed 100 tests.
  9305. 1415.89 s [vector] foldl: OK
  9306. 1415.89 s [vector] +++ OK, passed 100 tests.
  9307. 1415.89 s [vector] foldl1: OK
  9308. 1415.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9309. 1415.89 s [vector] foldl': OK
  9310. 1415.89 s [vector] +++ OK, passed 100 tests.
  9311. 1415.89 s [vector] foldl1': OK
  9312. 1415.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9313. 1415.89 s [vector] foldr: OK
  9314. 1415.89 s [vector] +++ OK, passed 100 tests.
  9315. 1415.89 s [vector] foldr1: OK
  9316. 1415.89 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9317. 1415.89 s [vector] foldr': OK
  9318. 1415.89 s [vector] +++ OK, passed 100 tests.
  9319. 1415.89 s [vector] foldr1': OK
  9320. 1415.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9321. 1415.89 s [vector] ifoldl: OK
  9322. 1415.89 s [vector] +++ OK, passed 100 tests.
  9323. 1415.89 s [vector] ifoldl': OK
  9324. 1415.89 s [vector] +++ OK, passed 100 tests.
  9325. 1415.89 s [vector] ifoldr: OK (0.01s)
  9326. 1415.89 s [vector] +++ OK, passed 100 tests.
  9327. 1415.89 s [vector] ifoldr': OK (0.01s)
  9328. 1415.89 s [vector] +++ OK, passed 100 tests.
  9329. 1415.89 s [vector] ifoldM: OK (0.01s)
  9330. 1415.89 s [vector] +++ OK, passed 100 tests.
  9331. 1415.89 s [vector] ifoldM': OK
  9332. 1415.89 s [vector] +++ OK, passed 100 tests.
  9333. 1415.89 s [vector] ifoldM_: OK (0.04s)
  9334. 1415.89 s [vector] +++ OK, passed 100 tests.
  9335. 1415.89 s [vector] ifoldM'_: OK (0.04s)
  9336. 1415.89 s [vector] +++ OK, passed 100 tests.
  9337. 1415.89 s [vector] all: OK
  9338. 1415.89 s [vector] +++ OK, passed 100 tests.
  9339. 1415.89 s [vector] any: OK
  9340. 1415.89 s [vector] +++ OK, passed 100 tests.
  9341. 1415.89 s [vector] prescanl: OK
  9342. 1415.89 s [vector] +++ OK, passed 100 tests.
  9343. 1415.89 s [vector] prescanl': OK
  9344. 1415.89 s [vector] +++ OK, passed 100 tests.
  9345. 1415.89 s [vector] postscanl: OK
  9346. 1415.89 s [vector] +++ OK, passed 100 tests.
  9347. 1415.89 s [vector] postscanl': OK
  9348. 1415.89 s [vector] +++ OK, passed 100 tests.
  9349. 1415.89 s [vector] scanl: OK
  9350. 1415.89 s [vector] +++ OK, passed 100 tests.
  9351. 1415.89 s [vector] scanl': OK (0.01s)
  9352. 1415.89 s [vector] +++ OK, passed 100 tests.
  9353. 1415.89 s [vector] scanl1: OK
  9354. 1415.89 s [vector] +++ OK, passed 100 tests.
  9355. 1415.89 s [vector] scanl1': OK
  9356. 1415.89 s [vector] +++ OK, passed 100 tests.
  9357. 1415.89 s [vector] iscanl: OK
  9358. 1415.89 s [vector] +++ OK, passed 100 tests.
  9359. 1415.89 s [vector] iscanl': OK
  9360. 1415.89 s [vector] +++ OK, passed 100 tests.
  9361. 1415.89 s [vector] prescanr: OK
  9362. 1415.89 s [vector] +++ OK, passed 100 tests.
  9363. 1415.89 s [vector] prescanr': OK (0.02s)
  9364. 1415.89 s [vector] +++ OK, passed 100 tests.
  9365. 1415.89 s [vector] postscanr: OK
  9366. 1415.89 s [vector] +++ OK, passed 100 tests.
  9367. 1415.89 s [vector] postscanr': OK
  9368. 1415.89 s [vector] +++ OK, passed 100 tests.
  9369. 1415.89 s [vector] scanr: OK
  9370. 1415.89 s [vector] +++ OK, passed 100 tests.
  9371. 1415.89 s [vector] scanr': OK
  9372. 1415.89 s [vector] +++ OK, passed 100 tests.
  9373. 1415.89 s [vector] scanr1: OK
  9374. 1415.89 s [vector] +++ OK, passed 100 tests.
  9375. 1415.89 s [vector] scanr1': OK
  9376. 1415.89 s [vector] +++ OK, passed 100 tests.
  9377. 1415.89 s [vector] iscanr: OK
  9378. 1415.89 s [vector] +++ OK, passed 100 tests.
  9379. 1415.89 s [vector] iscanr': OK
  9380. 1415.89 s [vector] +++ OK, passed 100 tests.
  9381. 1415.89 s [vector] mut_read: OK
  9382. 1415.89 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9383. 1415.89 s [vector] mut_write: OK
  9384. 1415.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9385. 1415.89 s [vector] mut_modify: OK
  9386. 1415.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9387. 1415.89 s [vector] mut_generate: OK
  9388. 1415.89 s [vector] +++ OK, passed 100 tests.
  9389. 1415.89 s [vector] mut_generateM: OK (0.02s)
  9390. 1415.89 s [vector] +++ OK, passed 100 tests.
  9391. 1415.89 s [vector] mut_mapM_: OK (0.04s)
  9392. 1415.89 s [vector] +++ OK, passed 100 tests.
  9393. 1415.89 s [vector] mut_imapM_: OK (0.05s)
  9394. 1415.89 s [vector] +++ OK, passed 100 tests.
  9395. 1415.89 s [vector] mut_forM_: OK (0.04s)
  9396. 1415.89 s [vector] +++ OK, passed 100 tests.
  9397. 1415.89 s [vector] mut_iforM_: OK (0.05s)
  9398. 1415.89 s [vector] +++ OK, passed 100 tests.
  9399. 1415.89 s [vector] mut_foldr: OK
  9400. 1415.89 s [vector] +++ OK, passed 100 tests.
  9401. 1415.89 s [vector] mut_foldr': OK
  9402. 1415.89 s [vector] +++ OK, passed 100 tests.
  9403. 1415.89 s [vector] mut_foldl: OK
  9404. 1415.89 s [vector] +++ OK, passed 100 tests.
  9405. 1415.89 s [vector] mut_foldl': OK
  9406. 1415.89 s [vector] +++ OK, passed 100 tests.
  9407. 1415.89 s [vector] mut_ifoldr: OK
  9408. 1415.89 s [vector] +++ OK, passed 100 tests.
  9409. 1415.89 s [vector] mut_ifoldr': OK
  9410. 1415.90 s [vector] +++ OK, passed 100 tests.
  9411. 1415.90 s [vector] mut_ifoldl: OK
  9412. 1415.90 s [vector] +++ OK, passed 100 tests.
  9413. 1415.90 s [vector] mut_ifoldl': OK
  9414. 1415.90 s [vector] +++ OK, passed 100 tests.
  9415. 1415.90 s [vector] mut_foldM: OK
  9416. 1415.90 s [vector] +++ OK, passed 100 tests.
  9417. 1415.90 s [vector] mut_foldM': OK
  9418. 1415.90 s [vector] +++ OK, passed 100 tests.
  9419. 1415.90 s [vector] mut_foldrM: OK
  9420. 1415.90 s [vector] +++ OK, passed 100 tests.
  9421. 1415.90 s [vector] mut_foldrM': OK
  9422. 1415.90 s [vector] +++ OK, passed 100 tests.
  9423. 1415.90 s [vector] mut_ifoldM: OK
  9424. 1415.90 s [vector] +++ OK, passed 100 tests.
  9425. 1415.90 s [vector] mut_ifoldM': OK
  9426. 1415.90 s [vector] +++ OK, passed 100 tests.
  9427. 1415.90 s [vector] mut_ifoldrM: OK
  9428. 1415.90 s [vector] +++ OK, passed 100 tests.
  9429. 1415.90 s [vector] mut_ifoldrM': OK
  9430. 1415.90 s [vector] +++ OK, passed 100 tests.
  9431. 1415.90 s [vector] compare: OK
  9432. 1415.90 s [vector] +++ OK, passed 100 tests.
  9433. 1415.90 s [vector] maximum: OK
  9434. 1415.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9435. 1415.90 s [vector] minimum: OK
  9436. 1415.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9437. 1415.90 s [vector] minIndex: OK
  9438. 1415.90 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9439. 1415.90 s [vector] maxIndex: OK
  9440. 1415.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9441. 1415.90 s [vector] maximumBy: OK
  9442. 1415.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9443. 1415.90 s [vector] minimumBy: OK
  9444. 1415.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9445. 1415.90 s [vector] maximumOn: OK
  9446. 1415.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9447. 1415.90 s [vector] minimumOn: OK
  9448. 1415.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9449. 1415.90 s [vector] maxIndexBy: OK
  9450. 1415.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9451. 1415.90 s [vector] minIndexBy: OK
  9452. 1415.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9453. 1415.90 s [vector] ListFirstMaxIndexWins: OK
  9454. 1415.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9455. 1415.90 s [vector] FalseListFirstMaxIndexWins: OK
  9456. 1415.90 s [vector] +++ OK, failed as expected. (after 1 test):
  9457. 1415.90 s [vector] Exception:
  9458. 1415.90 s [vector] Prelude.foldr1: empty list
  9459. 1415.90 s [vector] CallStack (from HasCallStack):
  9460. 1415.90 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  9461. 1415.90 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  9462. 1415.90 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9463. 1415.90 s [vector] []
  9464. 1415.90 s [vector] zip: OK
  9465. 1415.90 s [vector] +++ OK, passed 100 tests.
  9466. 1415.90 s [vector] zip3: OK
  9467. 1415.90 s [vector] +++ OK, passed 100 tests.
  9468. 1415.90 s [vector] unzip: OK
  9469. 1415.90 s [vector] +++ OK, passed 100 tests.
  9470. 1415.90 s [vector] unzip3: OK
  9471. 1415.90 s [vector] +++ OK, passed 100 tests.
  9472. 1415.90 s [vector] indexed: OK
  9473. 1415.90 s [vector] +++ OK, passed 100 tests.
  9474. 1415.90 s [vector] update: OK
  9475. 1415.90 s [vector] +++ OK, passed 100 tests.
  9476. 1415.90 s [vector] mempty: OK
  9477. 1415.90 s [vector] +++ OK, passed 100 tests.
  9478. 1415.90 s [vector] mappend: OK
  9479. 1415.90 s [vector] +++ OK, passed 100 tests.
  9480. 1415.90 s [vector] mconcat: OK (0.06s)
  9481. 1415.90 s [vector] +++ OK, passed 100 tests.
  9482. 1415.90 s [vector] glength: OK
  9483. 1415.90 s [vector] +++ OK, passed 100 tests.
  9484. 1415.90 s [vector] unstream
  9485. 1415.90 s [vector] unstream == vunstream (exact): OK
  9486. 1415.90 s [vector] +++ OK, passed 100 tests.
  9487. 1415.90 s [vector] unstream == vunstream (unknown): OK
  9488. 1415.90 s [vector] +++ OK, passed 100 tests.
  9489. 1415.90 s [vector] unstreamR ~= vunstream (exact): OK
  9490. 1415.90 s [vector] +++ OK, passed 100 tests.
  9491. 1415.90 s [vector] unstreamR ~= vunstream (unknown): OK
  9492. 1415.90 s [vector] +++ OK, passed 100 tests.
  9493. 1415.90 s [vector] Data.Vector.Storable.Vector Alignment
  9494. 1415.90 s [vector] Aligned Double: OK
  9495. 1415.90 s [vector] Aligned Int: OK
  9496. 1415.90 s [vector] Regression tests
  9497. 1415.90 s [vector] enumFromTo crash #188
  9498. 1415.90 s [vector] Word8: OK
  9499. 1415.90 s [vector] Word16: OK
  9500. 1415.90 s [vector] Word32: OK
  9501. 1415.90 s [vector] Word64: OK
  9502. 1415.90 s [vector] Word: OK
  9503. 1415.90 s [vector] Int8: OK
  9504. 1415.90 s [vector] Int16: OK
  9505. 1415.90 s [vector] Int32: OK
  9506. 1415.90 s [vector] Int64: OK
  9507. 1415.90 s [vector] Int: OK
  9508. 1415.90 s [vector] Char: OK
  9509. 1415.90 s [vector] Negative tests
  9510. 1415.90 s [vector] slice out of bounds #257
  9511. 1415.90 s [vector] Boxed
  9512. 1415.90 s [vector] Negative ix: OK
  9513. 1415.90 s [vector] Negative size: OK
  9514. 1415.90 s [vector] Negative ix and size: OK
  9515. 1415.90 s [vector] Too large ix: OK
  9516. 1415.90 s [vector] Too large size: OK
  9517. 1415.90 s [vector] Too large ix and size: OK
  9518. 1415.90 s [vector] Overflow: OK
  9519. 1415.90 s [vector] OutOfMemory: OK
  9520. 1415.90 s [vector] Primitive
  9521. 1415.90 s [vector] Negative ix: OK
  9522. 1415.90 s [vector] Negative size: OK
  9523. 1415.90 s [vector] Negative ix and size: OK
  9524. 1415.90 s [vector] Too large ix: OK
  9525. 1415.90 s [vector] Too large size: OK
  9526. 1415.90 s [vector] Too large ix and size: OK
  9527. 1415.90 s [vector] Overflow: OK
  9528. 1415.90 s [vector] OutOfMemory: OK
  9529. 1415.90 s [vector] Storable
  9530. 1415.90 s [vector] Negative ix: OK
  9531. 1415.90 s [vector] Negative size: OK
  9532. 1415.90 s [vector] Negative ix and size: OK
  9533. 1415.90 s [vector] Too large ix: OK
  9534. 1415.90 s [vector] Too large size: OK
  9535. 1415.90 s [vector] Too large ix and size: OK
  9536. 1415.90 s [vector] Overflow: OK
  9537. 1415.90 s [vector] OutOfMemory: OK
  9538. 1415.90 s [vector] Unboxed
  9539. 1415.90 s [vector] Negative ix: OK
  9540. 1415.90 s [vector] Negative size: OK
  9541. 1415.90 s [vector] Negative ix and size: OK
  9542. 1415.90 s [vector] Too large ix: OK
  9543. 1415.90 s [vector] Too large size: OK
  9544. 1415.90 s [vector] Too large ix and size: OK
  9545. 1415.90 s [vector] Overflow: OK
  9546. 1415.90 s [vector] OutOfMemory: OK
  9547. 1415.90 s [vector] take #282
  9548. 1415.90 s [vector] Boxed: OK
  9549. 1415.90 s [vector] Primitive: OK
  9550. 1415.90 s [vector] Storable: OK
  9551. 1415.90 s [vector] Unboxed: OK
  9552. 1415.90 s [vector] Data.Vector
  9553. 1415.90 s [vector] MonadFix: OK
  9554. 1415.90 s [vector] toFromArray: OK
  9555. 1415.90 s [vector] toFromArraySlice: OK
  9556. 1415.90 s [vector] toFromArraySliceUnsafe: OK
  9557. 1415.90 s [vector] toFromMutableArray: OK
  9558. 1415.90 s [vector] Data.Vector.Mutable (Move): OK
  9559. 1415.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9560. 1415.90 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  9561. 1415.90 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9562. 1415.90 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  9563. 1415.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9564. 1415.90 s [vector] Data.Vector.Storable.Mutable (Move): OK
  9565. 1415.90 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9566. 1415.90 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  9567. 1415.90 s [vector] +++ OK, passed 100 tests.
  9568. 1415.90 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  9569. 1415.90 s [vector] +++ OK, passed 100 tests.
  9570. 1415.90 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  9571. 1415.90 s [vector] +++ OK, passed 100 tests.
  9572. 1415.90 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  9573. 1415.90 s [vector] +++ OK, passed 100 tests.
  9574. 1415.90 s [vector]
  9575. 1415.90 s [vector] All 2808 tests passed (93.67s)
  9576. 1415.90 s [vector] Test suite vector-tests-O0: PASS
  9577. 1415.90 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  9578. 1415.90 s [vector] Test suite vector-tests-O2: RUNNING...
  9579. 1416.05 s [vector] toplevel
  9580. 1416.05 s [vector] Data.Vector.Fusion.Bundle
  9581. 1416.05 s [vector] fromList.toList == id: OK
  9582. 1416.05 s [vector] +++ OK, passed 100 tests.
  9583. 1416.05 s [vector] toList.fromList == id: OK
  9584. 1416.05 s [vector] +++ OK, passed 100 tests.
  9585. 1416.05 s [vector] eq: OK
  9586. 1416.05 s [vector] +++ OK, passed 100 tests.
  9587. 1416.05 s [vector] length: OK
  9588. 1416.05 s [vector] +++ OK, passed 100 tests.
  9589. 1416.05 s [vector] null: OK
  9590. 1416.05 s [vector] +++ OK, passed 100 tests.
  9591. 1416.05 s [vector] empty: OK
  9592. 1416.05 s [vector] +++ OK, passed 100 tests.
  9593. 1416.05 s [vector] singleton: OK
  9594. 1416.05 s [vector] +++ OK, passed 100 tests.
  9595. 1416.08 s [vector] replicate: OK
  9596. 1416.08 s [vector] +++ OK, passed 100 tests.
  9597. 1416.08 s [vector] cons: OK
  9598. 1416.08 s [vector] +++ OK, passed 100 tests.
  9599. 1416.08 s [vector] snoc: OK
  9600. 1416.08 s [vector] +++ OK, passed 100 tests.
  9601. 1416.08 s [vector] append: OK
  9602. 1416.08 s [vector] +++ OK, passed 100 tests.
  9603. 1416.08 s [vector] head: OK
  9604. 1416.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9605. 1416.08 s [vector] last: OK
  9606. 1416.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9607. 1416.08 s [vector] index: OK
  9608. 1416.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9609. 1416.08 s [vector] extract: OK
  9610. 1416.08 s [vector] +++ OK, passed 100 tests.
  9611. 1416.08 s [vector] init: OK
  9612. 1416.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9613. 1416.08 s [vector] tail: OK
  9614. 1416.08 s [vector] +++ OK, passed 100 tests; 34 discarded.
  9615. 1416.08 s [vector] take: OK
  9616. 1416.08 s [vector] +++ OK, passed 100 tests.
  9617. 1416.08 s [vector] drop: OK
  9618. 1416.08 s [vector] +++ OK, passed 100 tests.
  9619. 1416.08 s [vector] map: OK
  9620. 1416.08 s [vector] +++ OK, passed 100 tests.
  9621. 1416.08 s [vector] zipWith: OK
  9622. 1416.08 s [vector] +++ OK, passed 100 tests.
  9623. 1416.08 s [vector] zipWith3: OK
  9624. 1416.08 s [vector] +++ OK, passed 100 tests.
  9625. 1416.08 s [vector] filter: OK
  9626. 1416.08 s [vector] +++ OK, passed 100 tests.
  9627. 1416.08 s [vector] takeWhile: OK
  9628. 1416.08 s [vector] +++ OK, passed 100 tests.
  9629. 1416.08 s [vector] dropWhile: OK
  9630. 1416.08 s [vector] +++ OK, passed 100 tests.
  9631. 1416.08 s [vector] elem: OK
  9632. 1416.08 s [vector] +++ OK, passed 100 tests.
  9633. 1416.08 s [vector] notElem: OK
  9634. 1416.08 s [vector] +++ OK, passed 100 tests.
  9635. 1416.08 s [vector] find: OK
  9636. 1416.08 s [vector] +++ OK, passed 100 tests.
  9637. 1416.08 s [vector] findIndex: OK
  9638. 1416.08 s [vector] +++ OK, passed 100 tests.
  9639. 1416.09 s [vector] foldl: OK
  9640. 1416.09 s [vector] +++ OK, passed 100 tests.
  9641. 1416.09 s [vector] foldl1: OK
  9642. 1416.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9643. 1416.09 s [vector] foldl': OK
  9644. 1416.09 s [vector] +++ OK, passed 100 tests.
  9645. 1416.09 s [vector] foldl1': OK
  9646. 1416.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9647. 1416.09 s [vector] foldr: OK
  9648. 1416.09 s [vector] +++ OK, passed 100 tests.
  9649. 1416.09 s [vector] foldr1: OK
  9650. 1416.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9651. 1416.09 s [vector] prescanl: OK
  9652. 1416.09 s [vector] +++ OK, passed 100 tests.
  9653. 1416.09 s [vector] prescanl': OK
  9654. 1416.09 s [vector] +++ OK, passed 100 tests.
  9655. 1416.09 s [vector] postscanl: OK
  9656. 1416.09 s [vector] +++ OK, passed 100 tests.
  9657. 1416.09 s [vector] postscanl': OK
  9658. 1416.09 s [vector] +++ OK, passed 100 tests.
  9659. 1416.09 s [vector] scanl: OK
  9660. 1416.09 s [vector] +++ OK, passed 100 tests.
  9661. 1416.09 s [vector] scanl': OK
  9662. 1416.09 s [vector] +++ OK, passed 100 tests.
  9663. 1416.09 s [vector] scanl1: OK
  9664. 1416.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9665. 1416.09 s [vector] scanl1': OK
  9666. 1416.09 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9667. 1416.09 s [vector] concatMap: OK
  9668. 1416.09 s [vector] +++ OK, passed 100 tests.
  9669. 1416.09 s [vector] unfoldr: OK
  9670. 1416.09 s [vector] +++ OK, passed 100 tests.
  9671. 1416.09 s [vector] and: OK
  9672. 1416.09 s [vector] +++ OK, passed 100 tests.
  9673. 1416.09 s [vector] or: OK
  9674. 1416.09 s [vector] +++ OK, passed 100 tests.
  9675. 1416.09 s [vector] Tests.Vector.Boxed
  9676. 1416.09 s [vector] Bool
  9677. 1416.09 s [vector] fromList.toList == id: OK
  9678. 1416.09 s [vector] +++ OK, passed 100 tests.
  9679. 1416.09 s [vector] toList.fromList == id: OK
  9680. 1416.09 s [vector] +++ OK, passed 100 tests.
  9681. 1416.09 s [vector] unstream.stream == id: OK
  9682. 1416.09 s [vector] +++ OK, passed 100 tests.
  9683. 1416.10 s [vector] stream.unstream == id: OK
  9684. 1416.10 s [vector] +++ OK, passed 100 tests.
  9685. 1416.10 s [vector] eq: OK
  9686. 1416.10 s [vector] +++ OK, passed 100 tests.
  9687. 1416.10 s [vector] length: OK
  9688. 1416.10 s [vector] +++ OK, passed 100 tests.
  9689. 1416.10 s [vector] null: OK
  9690. 1416.10 s [vector] +++ OK, passed 100 tests.
  9691. 1416.10 s [vector] index: OK
  9692. 1416.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9693. 1416.10 s [vector] safeIndex: OK
  9694. 1416.10 s [vector] +++ OK, passed 100 tests.
  9695. 1416.10 s [vector] head: OK
  9696. 1416.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9697. 1416.10 s [vector] last: OK
  9698. 1416.10 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9699. 1416.10 s [vector] unsafeIndex: OK
  9700. 1416.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9701. 1416.10 s [vector] unsafeHead: OK
  9702. 1416.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9703. 1416.10 s [vector] unsafeLast: OK
  9704. 1416.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9705. 1416.10 s [vector] slice: OK
  9706. 1416.10 s [vector] +++ OK, passed 100 tests.
  9707. 1416.10 s [vector] init: OK
  9708. 1416.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9709. 1416.10 s [vector] tail: OK
  9710. 1416.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9711. 1416.10 s [vector] take: OK
  9712. 1416.10 s [vector] +++ OK, passed 100 tests.
  9713. 1416.10 s [vector] drop: OK
  9714. 1416.10 s [vector] +++ OK, passed 100 tests.
  9715. 1416.10 s [vector] splitAt: OK
  9716. 1416.10 s [vector] +++ OK, passed 100 tests.
  9717. 1416.10 s [vector] empty: OK
  9718. 1416.10 s [vector] +++ OK, passed 100 tests.
  9719. 1416.10 s [vector] singleton: OK
  9720. 1416.10 s [vector] +++ OK, passed 100 tests.
  9721. 1416.10 s [vector] replicate: OK
  9722. 1416.10 s [vector] +++ OK, passed 100 tests.
  9723. 1416.10 s [vector] generate: OK
  9724. 1416.10 s [vector] +++ OK, passed 100 tests.
  9725. 1416.10 s [vector] iterateN: OK
  9726. 1416.10 s [vector] +++ OK, passed 100 tests.
  9727. 1416.10 s [vector] iterateNM: OK (0.02s)
  9728. 1416.10 s [vector] +++ OK, passed 100 tests.
  9729. 1416.10 s [vector] generateM: OK (0.02s)
  9730. 1416.10 s [vector] +++ OK, passed 100 tests.
  9731. 1416.10 s [vector] replicateM: OK (0.08s)
  9732. 1416.10 s [vector] +++ OK, passed 100 tests.
  9733. 1416.10 s [vector] create: OK
  9734. 1416.10 s [vector] +++ OK, passed 100 tests.
  9735. 1416.10 s [vector] createT: OK
  9736. 1416.10 s [vector] +++ OK, passed 100 tests.
  9737. 1416.11 s [vector] unfoldr: OK
  9738. 1416.11 s [vector] +++ OK, passed 100 tests.
  9739. 1416.11 s [vector] unfoldrN: OK
  9740. 1416.11 s [vector] +++ OK, passed 100 tests.
  9741. 1416.11 s [vector] unfoldrExactN: OK
  9742. 1416.11 s [vector] +++ OK, passed 100 tests.
  9743. 1416.11 s [vector] unfoldrM: OK
  9744. 1416.11 s [vector] +++ OK, passed 100 tests.
  9745. 1416.11 s [vector] unfoldrNM: OK
  9746. 1416.12 s [vector] +++ OK, passed 100 tests.
  9747. 1416.13 s [vector] unfoldrExactNM: OK (0.02s)
  9748. 1416.13 s [vector] +++ OK, passed 100 tests.
  9749. 1416.14 s [vector] constructN: OK
  9750. 1416.14 s [vector] +++ OK, passed 100 tests.
  9751. 1416.14 s [vector] constructrN: OK
  9752. 1416.14 s [vector] +++ OK, passed 100 tests.
  9753. 1416.14 s [vector] cons: OK
  9754. 1416.14 s [vector] +++ OK, passed 100 tests.
  9755. 1416.14 s [vector] snoc: OK
  9756. 1416.14 s [vector] +++ OK, passed 100 tests.
  9757. 1416.14 s [vector] append: OK
  9758. 1416.16 s [vector] +++ OK, passed 100 tests.
  9759. 1416.16 s [vector] concat: OK (0.02s)
  9760. 1416.16 s [vector] +++ OK, passed 100 tests.
  9761. 1416.16 s [vector] force: OK
  9762. 1416.16 s [vector] +++ OK, passed 100 tests.
  9763. 1416.17 s [vector] upd: OK
  9764. 1416.17 s [vector] +++ OK, passed 100 tests.
  9765. 1416.17 s [vector] accum: OK
  9766. 1416.17 s [vector] +++ OK, passed 100 tests.
  9767. 1416.17 s [vector] reverse: OK
  9768. 1416.17 s [vector] +++ OK, passed 100 tests.
  9769. 1416.17 s [vector] backpermute: OK
  9770. 1416.17 s [vector] +++ OK, passed 100 tests.
  9771. 1416.17 s [vector] map: OK
  9772. 1416.17 s [vector] +++ OK, passed 100 tests.
  9773. 1416.17 s [vector] imap: OK
  9774. 1416.17 s [vector] +++ OK, passed 100 tests.
  9775. 1416.18 s [vector] concatMap: OK
  9776. 1416.18 s [vector] +++ OK, passed 100 tests.
  9777. 1416.18 s [vector] mapM: OK
  9778. 1416.19 s [vector] +++ OK, passed 100 tests.
  9779. 1416.19 s [vector] mapM_: OK (0.01s)
  9780. 1416.20 s [vector] +++ OK, passed 100 tests.
  9781. 1416.20 s [vector] forM: OK
  9782. 1416.20 s [vector] +++ OK, passed 100 tests.
  9783. 1416.20 s [vector] forM_: OK
  9784. 1416.21 s [vector] +++ OK, passed 100 tests.
  9785. 1416.21 s [vector] imapM: OK
  9786. 1416.21 s [vector] +++ OK, passed 100 tests.
  9787. 1416.21 s [vector] imapM_: OK (0.01s)
  9788. 1416.21 s [vector] +++ OK, passed 100 tests.
  9789. 1416.21 s [vector] zipWith: OK
  9790. 1416.21 s [vector] +++ OK, passed 100 tests.
  9791. 1416.21 s [vector] zipWith3: OK
  9792. 1416.22 s [vector] +++ OK, passed 100 tests.
  9793. 1416.22 s [vector] izipWith: OK
  9794. 1416.22 s [vector] +++ OK, passed 100 tests.
  9795. 1416.22 s [vector] izipWith3: OK
  9796. 1416.22 s [vector] +++ OK, passed 100 tests.
  9797. 1416.22 s [vector] izipWithM: OK
  9798. 1416.23 s [vector] +++ OK, passed 100 tests.
  9799. 1416.23 s [vector] izipWithM_: OK
  9800. 1416.23 s [vector] +++ OK, passed 100 tests.
  9801. 1416.23 s [vector] zipWithM: OK
  9802. 1416.24 s [vector] +++ OK, passed 100 tests.
  9803. 1416.24 s [vector] zipWithM_: OK
  9804. 1416.24 s [vector] +++ OK, passed 100 tests.
  9805. 1416.24 s [vector] filter: OK
  9806. 1416.24 s [vector] +++ OK, passed 100 tests.
  9807. 1416.24 s [vector] ifilter: OK
  9808. 1416.24 s [vector] +++ OK, passed 100 tests.
  9809. 1416.25 s [vector] filterM: OK (0.01s)
  9810. 1416.25 s [vector] +++ OK, passed 100 tests.
  9811. 1416.25 s [vector] uniq: OK
  9812. 1416.25 s [vector] +++ OK, passed 100 tests.
  9813. 1416.25 s [vector] mapMaybe: OK
  9814. 1416.25 s [vector] +++ OK, passed 100 tests.
  9815. 1416.26 s [vector] imapMaybe: OK
  9816. 1416.26 s [vector] +++ OK, passed 100 tests.
  9817. 1416.26 s [vector] takeWhile: OK
  9818. 1416.26 s [vector] +++ OK, passed 100 tests.
  9819. 1416.26 s [vector] dropWhile: OK
  9820. 1416.26 s [vector] +++ OK, passed 100 tests.
  9821. 1416.26 s [vector] partition: OK
  9822. 1416.26 s [vector] +++ OK, passed 100 tests.
  9823. 1416.26 s [vector] partitionWith: OK
  9824. 1416.26 s [vector] +++ OK, passed 100 tests.
  9825. 1416.26 s [vector] span: OK
  9826. 1416.26 s [vector] +++ OK, passed 100 tests.
  9827. 1416.26 s [vector] break: OK
  9828. 1416.26 s [vector] +++ OK, passed 100 tests.
  9829. 1416.26 s [vector] spanR: OK
  9830. 1416.26 s [vector] +++ OK, passed 100 tests.
  9831. 1416.26 s [vector] breakR: OK
  9832. 1416.27 s [vector] +++ OK, passed 100 tests.
  9833. 1416.27 s [vector] groupBy: OK
  9834. 1416.27 s [vector] +++ OK, passed 100 tests.
  9835. 1416.27 s [vector] elem: OK
  9836. 1416.27 s [vector] +++ OK, passed 100 tests.
  9837. 1416.27 s [vector] notElem: OK
  9838. 1416.27 s [vector] +++ OK, passed 100 tests.
  9839. 1416.27 s [vector] find: OK
  9840. 1416.27 s [vector] +++ OK, passed 100 tests.
  9841. 1416.27 s [vector] findIndex: OK
  9842. 1416.27 s [vector] +++ OK, passed 100 tests.
  9843. 1416.27 s [vector] findIndexR: OK
  9844. 1416.27 s [vector] +++ OK, passed 100 tests.
  9845. 1416.27 s [vector] findIndices: OK
  9846. 1416.27 s [vector] +++ OK, passed 100 tests.
  9847. 1416.27 s [vector] elemIndex: OK
  9848. 1416.27 s [vector] +++ OK, passed 100 tests.
  9849. 1416.27 s [vector] elemIndices: OK
  9850. 1416.27 s [vector] +++ OK, passed 100 tests.
  9851. 1416.28 s [vector] foldl: OK
  9852. 1416.28 s [vector] +++ OK, passed 100 tests.
  9853. 1416.28 s [vector] foldl1: OK
  9854. 1416.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9855. 1416.28 s [vector] foldl': OK
  9856. 1416.28 s [vector] +++ OK, passed 100 tests.
  9857. 1416.28 s [vector] foldl1': OK
  9858. 1416.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9859. 1416.29 s [vector] foldr: OK
  9860. 1416.29 s [vector] +++ OK, passed 100 tests.
  9861. 1416.29 s [vector] foldr1: OK
  9862. 1416.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9863. 1416.29 s [vector] foldr': OK
  9864. 1416.29 s [vector] +++ OK, passed 100 tests.
  9865. 1416.29 s [vector] foldr1': OK
  9866. 1416.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9867. 1416.30 s [vector] ifoldl: OK
  9868. 1416.30 s [vector] +++ OK, passed 100 tests.
  9869. 1416.30 s [vector] ifoldl': OK
  9870. 1416.30 s [vector] +++ OK, passed 100 tests.
  9871. 1416.31 s [vector] ifoldr: OK
  9872. 1416.31 s [vector] +++ OK, passed 100 tests.
  9873. 1416.31 s [vector] ifoldr': OK
  9874. 1416.31 s [vector] +++ OK, passed 100 tests.
  9875. 1416.31 s [vector] ifoldM: OK
  9876. 1416.31 s [vector] +++ OK, passed 100 tests.
  9877. 1416.32 s [vector] ifoldM': OK
  9878. 1416.32 s [vector] +++ OK, passed 100 tests.
  9879. 1416.33 s [vector] ifoldM_: OK (0.01s)
  9880. 1416.33 s [vector] +++ OK, passed 100 tests.
  9881. 1416.34 s [vector] ifoldM'_: OK
  9882. 1416.34 s [vector] +++ OK, passed 100 tests.
  9883. 1416.34 s [vector] all: OK
  9884. 1416.34 s [vector] +++ OK, passed 100 tests.
  9885. 1416.34 s [vector] any: OK
  9886. 1416.34 s [vector] +++ OK, passed 100 tests.
  9887. 1416.35 s [vector] prescanl: OK
  9888. 1416.35 s [vector] +++ OK, passed 100 tests.
  9889. 1416.35 s [vector] prescanl': OK
  9890. 1416.35 s [vector] +++ OK, passed 100 tests.
  9891. 1416.35 s [vector] postscanl: OK
  9892. 1416.35 s [vector] +++ OK, passed 100 tests.
  9893. 1416.35 s [vector] postscanl': OK
  9894. 1416.35 s [vector] +++ OK, passed 100 tests.
  9895. 1416.35 s [vector] scanl: OK
  9896. 1416.35 s [vector] +++ OK, passed 100 tests.
  9897. 1416.36 s [vector] scanl': OK
  9898. 1416.36 s [vector] +++ OK, passed 100 tests.
  9899. 1416.36 s [vector] scanl1: OK
  9900. 1416.36 s [vector] +++ OK, passed 100 tests.
  9901. 1416.36 s [vector] scanl1': OK
  9902. 1416.36 s [vector] +++ OK, passed 100 tests.
  9903. 1416.36 s [vector] iscanl: OK
  9904. 1416.37 s [vector] +++ OK, passed 100 tests.
  9905. 1416.37 s [vector] iscanl': OK
  9906. 1416.37 s [vector] +++ OK, passed 100 tests.
  9907. 1416.37 s [pandoc-lua-engine] Phase: setupCompilerEnvironmentPhase
  9908. 1416.37 s [vector] prescanr: OK
  9909. 1416.37 s [vector] +++ OK, passed 100 tests.
  9910. 1416.37 s [vector] prescanr': OK
  9911. 1416.37 s [vector] +++ OK, passed 100 tests.
  9912. 1416.37 s [vector] postscanr: OK
  9913. 1416.37 s [pandoc-lua-engine] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  9914. 1416.37 s [vector] +++ OK, passed 100 tests.
  9915. 1416.38 s [vector] postscanr': OK
  9916. 1416.38 s [vector] +++ OK, passed 100 tests.
  9917. 1416.38 s [vector] scanr: OK
  9918. 1416.38 s [vector] +++ OK, passed 100 tests.
  9919. 1416.38 s [vector] scanr': OK
  9920. 1416.38 s [vector] +++ OK, passed 100 tests.
  9921. 1416.38 s [vector] scanr1: OK
  9922. 1416.38 s [vector] +++ OK, passed 100 tests.
  9923. 1416.38 s [vector] scanr1': OK
  9924. 1416.39 s [vector] +++ OK, passed 100 tests.
  9925. 1416.39 s [vector] iscanr: OK
  9926. 1416.39 s [vector] +++ OK, passed 100 tests.
  9927. 1416.39 s [vector] iscanr': OK
  9928. 1416.39 s [vector] +++ OK, passed 100 tests.
  9929. 1416.39 s [vector] mut_read: OK
  9930. 1416.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9931. 1416.39 s [vector] mut_write: OK
  9932. 1416.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9933. 1416.40 s [vector] mut_modify: OK
  9934. 1416.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9935. 1416.40 s [vector] mut_generate: OK
  9936. 1416.40 s [vector] +++ OK, passed 100 tests.
  9937. 1416.41 s [vector] mut_generateM: OK
  9938. 1416.42 s [vector] +++ OK, passed 100 tests.
  9939. 1416.42 s [vector] mut_mapM_: OK (0.01s)
  9940. 1416.42 s [vector] +++ OK, passed 100 tests.
  9941. 1416.43 s [vector] mut_imapM_: OK
  9942. 1416.44 s [vector] +++ OK, passed 100 tests.
  9943. 1416.44 s [vector] mut_forM_: OK (0.01s)
  9944. 1416.44 s [vector] +++ OK, passed 100 tests.
  9945. 1416.44 s [vector] mut_iforM_: OK
  9946. 1416.44 s [vector] +++ OK, passed 100 tests.
  9947. 1416.44 s [vector] mut_foldr: OK
  9948. 1416.44 s [vector] +++ OK, passed 100 tests.
  9949. 1416.44 s [vector] mut_foldr': OK
  9950. 1416.44 s [vector] +++ OK, passed 100 tests.
  9951. 1416.45 s [vector] mut_foldl: OK
  9952. 1416.45 s [vector] +++ OK, passed 100 tests.
  9953. 1416.45 s [vector] mut_foldl': OK
  9954. 1416.45 s [vector] +++ OK, passed 100 tests.
  9955. 1416.45 s [vector] mut_ifoldr: OK
  9956. 1416.45 s [vector] +++ OK, passed 100 tests.
  9957. 1416.45 s [vector] mut_ifoldr': OK
  9958. 1416.45 s [vector] +++ OK, passed 100 tests.
  9959. 1416.45 s [vector] mut_ifoldl: OK
  9960. 1416.45 s [vector] +++ OK, passed 100 tests.
  9961. 1416.46 s [vector] mut_ifoldl': OK
  9962. 1416.46 s [vector] +++ OK, passed 100 tests.
  9963. 1416.46 s [vector] mut_foldM: OK
  9964. 1416.46 s [vector] +++ OK, passed 100 tests.
  9965. 1416.46 s [vector] mut_foldM': OK
  9966. 1416.46 s [vector] +++ OK, passed 100 tests.
  9967. 1416.46 s [vector] mut_foldrM: OK
  9968. 1416.46 s [vector] +++ OK, passed 100 tests.
  9969. 1416.46 s [vector] mut_foldrM': OK
  9970. 1416.47 s [vector] +++ OK, passed 100 tests.
  9971. 1416.47 s [vector] mut_ifoldM: OK
  9972. 1416.47 s [vector] +++ OK, passed 100 tests.
  9973. 1416.47 s [vector] mut_ifoldM': OK
  9974. 1416.47 s [vector] +++ OK, passed 100 tests.
  9975. 1416.47 s [vector] mut_ifoldrM: OK
  9976. 1416.47 s [vector] +++ OK, passed 100 tests.
  9977. 1416.47 s [vector] mut_ifoldrM': OK
  9978. 1416.47 s [vector] +++ OK, passed 100 tests.
  9979. 1416.47 s [vector] compare: OK
  9980. 1416.47 s [vector] +++ OK, passed 100 tests.
  9981. 1416.47 s [vector] maximum: OK
  9982. 1416.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9983. 1416.47 s [vector] minimum: OK
  9984. 1416.47 s [vector] +++ OK, passed 100 tests; 26 discarded.
  9985. 1416.47 s [vector] minIndex: OK
  9986. 1416.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9987. 1416.47 s [vector] maxIndex: OK
  9988. 1416.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9989. 1416.47 s [vector] maximumBy: OK
  9990. 1416.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9991. 1416.48 s [vector] minimumBy: OK
  9992. 1416.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9993. 1416.48 s [vector] maximumOn: OK
  9994. 1416.48 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9995. 1416.48 s [vector] minimumOn: OK
  9996. 1416.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9997. 1416.48 s [vector] maxIndexBy: OK
  9998. 1416.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9999. 1416.48 s [vector] minIndexBy: OK
  10000. 1416.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10001. 1416.48 s [vector] ListFirstMaxIndexWins: OK
  10002. 1416.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10003. 1416.48 s [vector] FalseListFirstMaxIndexWins: OK
  10004. 1416.48 s [vector] +++ OK, failed as expected. (after 1 test):
  10005. 1416.48 s [vector] Exception:
  10006. 1416.48 s [vector] Prelude.foldr1: empty list
  10007. 1416.48 s [vector] CallStack (from HasCallStack):
  10008. 1416.48 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10009. 1416.48 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10010. 1416.48 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10011. 1416.48 s [vector] []
  10012. 1416.48 s [vector] zip: OK
  10013. 1416.48 s [vector] +++ OK, passed 100 tests.
  10014. 1416.48 s [vector] zip3: OK
  10015. 1416.48 s [vector] +++ OK, passed 100 tests.
  10016. 1416.48 s [vector] unzip: OK
  10017. 1416.48 s [vector] +++ OK, passed 100 tests.
  10018. 1416.48 s [vector] unzip3: OK
  10019. 1416.48 s [vector] +++ OK, passed 100 tests.
  10020. 1416.48 s [vector] indexed: OK
  10021. 1416.49 s [vector] +++ OK, passed 100 tests.
  10022. 1416.49 s [vector] update: OK
  10023. 1416.49 s [vector] +++ OK, passed 100 tests.
  10024. 1416.49 s [vector] concat: OK
  10025. 1416.50 s [vector] +++ OK, passed 100 tests.
  10026. 1416.50 s [vector] mempty: OK
  10027. 1416.50 s [vector] +++ OK, passed 100 tests.
  10028. 1416.50 s [vector] mappend: OK
  10029. 1416.50 s [vector] +++ OK, passed 100 tests.
  10030. 1416.51 s [vector] mconcat: OK
  10031. 1416.51 s [vector] +++ OK, passed 100 tests.
  10032. 1416.51 s [vector] fmap: OK
  10033. 1416.51 s [vector] +++ OK, passed 100 tests.
  10034. 1416.51 s [vector] return: OK
  10035. 1416.52 s [vector] +++ OK, passed 100 tests.
  10036. 1416.52 s [vector] bind: OK (0.01s)
  10037. 1416.52 s [vector] +++ OK, passed 100 tests.
  10038. 1416.52 s [vector] mzip: OK
  10039. 1416.52 s [vector] +++ OK, passed 100 tests.
  10040. 1416.52 s [vector] munzip: OK
  10041. 1416.52 s [vector] +++ OK, passed 100 tests.
  10042. 1416.54 s [vector] applicative_pure: OK
  10043. 1416.54 s [vector] +++ OK, passed 100 tests.
  10044. 1416.54 s [vector] applicative_appl: OK (0.02s)
  10045. 1416.54 s [vector] +++ OK, passed 100 tests.
  10046. 1416.54 s [vector] alternative_empty: OK
  10047. 1416.54 s [vector] +++ OK, passed 100 tests.
  10048. 1416.54 s [vector] alternative_or: OK
  10049. 1416.54 s [vector] +++ OK, passed 100 tests.
  10050. 1416.54 s [pandoc-server] Phase: setupCompilerEnvironmentPhase
  10051. 1416.55 s [pandoc-server] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  10052. 1416.58 s [vector] sequence: OK (0.03s)
  10053. 1416.58 s [vector] +++ OK, passed 100 tests.
  10054. 1416.58 s [vector] sequence_: OK
  10055. 1416.58 s [vector] +++ OK, passed 100 tests.
  10056. 1416.58 s [vector] glength: OK
  10057. 1416.58 s [vector] +++ OK, passed 100 tests.
  10058. 1416.58 s [vector] and: OK
  10059. 1416.58 s [vector] +++ OK, passed 100 tests.
  10060. 1416.58 s [vector] or: OK
  10061. 1416.58 s [vector] +++ OK, passed 100 tests.
  10062. 1416.58 s [vector] Int
  10063. 1416.58 s [vector] fromList.toList == id: OK
  10064. 1416.58 s [vector] +++ OK, passed 100 tests.
  10065. 1416.58 s [vector] toList.fromList == id: OK
  10066. 1416.58 s [vector] +++ OK, passed 100 tests.
  10067. 1416.58 s [vector] unstream.stream == id: OK
  10068. 1416.58 s [vector] +++ OK, passed 100 tests.
  10069. 1416.58 s [vector] stream.unstream == id: OK
  10070. 1416.58 s [vector] +++ OK, passed 100 tests.
  10071. 1416.58 s [vector] eq: OK
  10072. 1416.58 s [vector] +++ OK, passed 100 tests.
  10073. 1416.58 s [vector] length: OK
  10074. 1416.58 s [vector] +++ OK, passed 100 tests.
  10075. 1416.58 s [vector] null: OK
  10076. 1416.59 s [vector] +++ OK, passed 100 tests.
  10077. 1416.59 s [vector] index: OK
  10078. 1416.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10079. 1416.59 s [vector] safeIndex: OK
  10080. 1416.59 s [vector] +++ OK, passed 100 tests.
  10081. 1416.59 s [vector] head: OK
  10082. 1416.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10083. 1416.59 s [vector] last: OK
  10084. 1416.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10085. 1416.59 s [vector] unsafeIndex: OK
  10086. 1416.59 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10087. 1416.59 s [vector] unsafeHead: OK
  10088. 1416.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10089. 1416.59 s [vector] unsafeLast: OK
  10090. 1416.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10091. 1416.59 s [vector] slice: OK
  10092. 1416.59 s [vector] +++ OK, passed 100 tests.
  10093. 1416.59 s [vector] init: OK
  10094. 1416.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10095. 1416.59 s [vector] tail: OK
  10096. 1416.59 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10097. 1416.59 s [vector] take: OK
  10098. 1416.59 s [vector] +++ OK, passed 100 tests.
  10099. 1416.59 s [vector] drop: OK
  10100. 1416.59 s [vector] +++ OK, passed 100 tests.
  10101. 1416.59 s [vector] splitAt: OK
  10102. 1416.59 s [vector] +++ OK, passed 100 tests.
  10103. 1416.59 s [vector] empty: OK
  10104. 1416.60 s [vector] +++ OK, passed 100 tests.
  10105. 1416.60 s [vector] singleton: OK
  10106. 1416.60 s [vector] +++ OK, passed 100 tests.
  10107. 1416.60 s [vector] replicate: OK
  10108. 1416.60 s [vector] +++ OK, passed 100 tests.
  10109. 1416.60 s [vector] generate: OK
  10110. 1416.60 s [vector] +++ OK, passed 100 tests.
  10111. 1416.60 s [vector] iterateN: OK
  10112. 1416.62 s [vector] +++ OK, passed 100 tests.
  10113. 1416.66 s [vector] iterateNM: OK (0.04s)
  10114. 1416.66 s [vector] +++ OK, passed 100 tests.
  10115. 1416.68 s [vector] generateM: OK (0.03s)
  10116. 1416.68 s [vector] +++ OK, passed 100 tests.
  10117. 1416.68 s [vector] replicateM: OK
  10118. 1416.68 s [vector] +++ OK, passed 100 tests.
  10119. 1416.68 s [vector] create: OK
  10120. 1416.68 s [vector] +++ OK, passed 100 tests.
  10121. 1416.68 s [vector] createT: OK
  10122. 1416.68 s [vector] +++ OK, passed 100 tests.
  10123. 1416.68 s [vector] unfoldr: OK
  10124. 1416.68 s [vector] +++ OK, passed 100 tests.
  10125. 1416.68 s [vector] unfoldrN: OK
  10126. 1416.68 s [vector] +++ OK, passed 100 tests.
  10127. 1416.68 s [vector] unfoldrExactN: OK
  10128. 1416.68 s [vector] +++ OK, passed 100 tests.
  10129. 1416.69 s [vector] unfoldrM: OK
  10130. 1416.70 s [vector] +++ OK, passed 100 tests.
  10131. 1416.70 s [vector] unfoldrNM: OK
  10132. 1416.70 s [vector] +++ OK, passed 100 tests.
  10133. 1416.71 s [vector] unfoldrExactNM: OK (0.02s)
  10134. 1416.72 s [vector] +++ OK, passed 100 tests.
  10135. 1416.72 s [vector] constructN: OK
  10136. 1416.72 s [vector] +++ OK, passed 100 tests.
  10137. 1416.72 s [vector] constructrN: OK
  10138. 1416.72 s [vector] +++ OK, passed 100 tests.
  10139. 1416.72 s [vector] cons: OK
  10140. 1416.72 s [vector] +++ OK, passed 100 tests.
  10141. 1416.72 s [vector] snoc: OK
  10142. 1416.72 s [vector] +++ OK, passed 100 tests.
  10143. 1416.74 s [vector] append: OK
  10144. 1416.74 s [vector] +++ OK, passed 100 tests.
  10145. 1416.74 s [vector] concat: OK (0.01s)
  10146. 1416.74 s [vector] +++ OK, passed 100 tests.
  10147. 1416.74 s [vector] force: OK
  10148. 1416.74 s [vector] +++ OK, passed 100 tests.
  10149. 1416.74 s [vector] upd: OK
  10150. 1416.74 s [vector] +++ OK, passed 100 tests.
  10151. 1416.74 s [vector] accum: OK
  10152. 1416.74 s [vector] +++ OK, passed 100 tests.
  10153. 1416.74 s [vector] reverse: OK
  10154. 1416.74 s [vector] +++ OK, passed 100 tests.
  10155. 1416.74 s [vector] backpermute: OK
  10156. 1416.75 s [vector] +++ OK, passed 100 tests.
  10157. 1416.75 s [vector] map: OK
  10158. 1416.76 s [vector] +++ OK, passed 100 tests.
  10159. 1416.76 s [vector] imap: OK
  10160. 1416.76 s [vector] +++ OK, passed 100 tests.
  10161. 1416.76 s [vector] concatMap: OK
  10162. 1416.76 s [vector] +++ OK, passed 100 tests.
  10163. 1416.76 s [vector] mapM: OK
  10164. 1416.76 s [vector] +++ OK, passed 100 tests.
  10165. 1416.77 s [vector] mapM_: OK (0.02s)
  10166. 1416.77 s [vector] +++ OK, passed 100 tests.
  10167. 1416.77 s [vector] forM: OK
  10168. 1416.77 s [vector] +++ OK, passed 100 tests.
  10169. 1416.79 s [vector] forM_: OK (0.02s)
  10170. 1416.79 s [vector] +++ OK, passed 100 tests.
  10171. 1416.79 s [vector] imapM: OK
  10172. 1416.79 s [vector] +++ OK, passed 100 tests.
  10173. 1416.81 s [vector] imapM_: OK (0.02s)
  10174. 1416.81 s [vector] +++ OK, passed 100 tests.
  10175. 1416.81 s [vector] zipWith: OK
  10176. 1416.81 s [vector] +++ OK, passed 100 tests.
  10177. 1416.81 s [vector] zipWith3: OK
  10178. 1416.82 s [vector] +++ OK, passed 100 tests.
  10179. 1416.82 s [vector] izipWith: OK
  10180. 1416.82 s [vector] +++ OK, passed 100 tests.
  10181. 1416.82 s [vector] izipWith3: OK
  10182. 1416.82 s [vector] +++ OK, passed 100 tests.
  10183. 1416.84 s [vector] izipWithM: OK
  10184. 1416.84 s [vector] +++ OK, passed 100 tests.
  10185. 1416.84 s [vector] izipWithM_: OK (0.01s)
  10186. 1416.84 s [vector] +++ OK, passed 100 tests.
  10187. 1416.85 s [vector] zipWithM: OK
  10188. 1416.85 s [vector] +++ OK, passed 100 tests.
  10189. 1416.85 s [vector] zipWithM_: OK (0.01s)
  10190. 1416.85 s [vector] +++ OK, passed 100 tests.
  10191. 1416.85 s [vector] filter: OK
  10192. 1416.86 s [vector] +++ OK, passed 100 tests.
  10193. 1416.88 s [vector] ifilter: OK
  10194. 1416.88 s [vector] +++ OK, passed 100 tests.
  10195. 1416.90 s [vector] filterM: OK (0.04s)
  10196. 1416.90 s [vector] +++ OK, passed 100 tests.
  10197. 1416.90 s [vector] uniq: OK
  10198. 1416.90 s [vector] +++ OK, passed 100 tests.
  10199. 1416.90 s [vector] mapMaybe: OK
  10200. 1416.91 s [vector] +++ OK, passed 100 tests.
  10201. 1416.91 s [vector] imapMaybe: OK
  10202. 1416.91 s [vector] +++ OK, passed 100 tests.
  10203. 1416.91 s [vector] takeWhile: OK
  10204. 1416.91 s [vector] +++ OK, passed 100 tests.
  10205. 1416.91 s [vector] dropWhile: OK
  10206. 1416.91 s [vector] +++ OK, passed 100 tests.
  10207. 1416.91 s [vector] partition: OK
  10208. 1416.91 s [vector] +++ OK, passed 100 tests.
  10209. 1416.91 s [vector] partitionWith: OK
  10210. 1416.91 s [vector] +++ OK, passed 100 tests.
  10211. 1416.91 s [vector] span: OK
  10212. 1416.91 s [vector] +++ OK, passed 100 tests.
  10213. 1416.92 s [vector] break: OK
  10214. 1416.92 s [vector] +++ OK, passed 100 tests.
  10215. 1416.92 s [vector] spanR: OK
  10216. 1416.92 s [vector] +++ OK, passed 100 tests.
  10217. 1416.92 s [vector] breakR: OK
  10218. 1416.92 s [vector] +++ OK, passed 100 tests.
  10219. 1416.92 s [vector] groupBy: OK
  10220. 1416.92 s [vector] +++ OK, passed 100 tests.
  10221. 1416.92 s [vector] elem: OK
  10222. 1416.92 s [vector] +++ OK, passed 100 tests.
  10223. 1416.92 s [vector] notElem: OK
  10224. 1416.92 s [vector] +++ OK, passed 100 tests.
  10225. 1416.92 s [vector] find: OK
  10226. 1416.92 s [vector] +++ OK, passed 100 tests.
  10227. 1416.92 s [vector] findIndex: OK
  10228. 1416.92 s [vector] +++ OK, passed 100 tests.
  10229. 1416.92 s [vector] findIndexR: OK
  10230. 1416.92 s [vector] +++ OK, passed 100 tests.
  10231. 1416.93 s [vector] findIndices: OK
  10232. 1416.93 s [vector] +++ OK, passed 100 tests.
  10233. 1416.93 s [vector] elemIndex: OK
  10234. 1416.93 s [vector] +++ OK, passed 100 tests.
  10235. 1416.93 s [vector] elemIndices: OK
  10236. 1416.93 s [vector] +++ OK, passed 100 tests.
  10237. 1416.94 s [vector] foldl: OK
  10238. 1416.94 s [vector] +++ OK, passed 100 tests.
  10239. 1416.94 s [vector] foldl1: OK
  10240. 1416.94 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10241. 1416.94 s [vector] foldl': OK
  10242. 1416.94 s [vector] +++ OK, passed 100 tests.
  10243. 1416.94 s [vector] foldl1': OK
  10244. 1416.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10245. 1416.94 s [vector] foldr: OK
  10246. 1416.94 s [vector] +++ OK, passed 100 tests.
  10247. 1416.94 s [vector] foldr1: OK
  10248. 1416.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10249. 1416.95 s [vector] foldr': OK
  10250. 1416.95 s [vector] +++ OK, passed 100 tests.
  10251. 1416.95 s [vector] foldr1': OK
  10252. 1416.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10253. 1416.95 s [vector] ifoldl: OK
  10254. 1416.96 s [vector] +++ OK, passed 100 tests.
  10255. 1416.96 s [vector] ifoldl': OK
  10256. 1416.96 s [vector] +++ OK, passed 100 tests.
  10257. 1416.96 s [vector] ifoldr: OK
  10258. 1416.97 s [vector] +++ OK, passed 100 tests.
  10259. 1416.97 s [vector] ifoldr': OK
  10260. 1416.97 s [vector] +++ OK, passed 100 tests.
  10261. 1416.98 s [vector] ifoldM: OK
  10262. 1416.98 s [vector] +++ OK, passed 100 tests.
  10263. 1416.98 s [vector] ifoldM': OK
  10264. 1416.98 s [vector] +++ OK, passed 100 tests.
  10265. 1417.02 s [vector] ifoldM_: OK (0.03s)
  10266. 1417.02 s [vector] +++ OK, passed 100 tests.
  10267. 1417.03 s [vector] ifoldM'_: OK (0.02s)
  10268. 1417.03 s [vector] +++ OK, passed 100 tests.
  10269. 1417.03 s [vector] all: OK
  10270. 1417.03 s [vector] +++ OK, passed 100 tests.
  10271. 1417.03 s [vector] any: OK
  10272. 1417.04 s [vector] +++ OK, passed 100 tests.
  10273. 1417.04 s [vector] prescanl: OK
  10274. 1417.04 s [vector] +++ OK, passed 100 tests.
  10275. 1417.04 s [vector] prescanl': OK
  10276. 1417.04 s [vector] +++ OK, passed 100 tests.
  10277. 1417.04 s [vector] postscanl: OK
  10278. 1417.04 s [vector] +++ OK, passed 100 tests.
  10279. 1417.05 s [vector] postscanl': OK
  10280. 1417.05 s [vector] +++ OK, passed 100 tests.
  10281. 1417.05 s [vector] scanl: OK
  10282. 1417.05 s [vector] +++ OK, passed 100 tests.
  10283. 1417.05 s [vector] scanl': OK
  10284. 1417.06 s [vector] +++ OK, passed 100 tests.
  10285. 1417.06 s [vector] scanl1: OK
  10286. 1417.06 s [vector] +++ OK, passed 100 tests.
  10287. 1417.06 s [vector] scanl1': OK
  10288. 1417.06 s [vector] +++ OK, passed 100 tests.
  10289. 1417.06 s [vector] iscanl: OK
  10290. 1417.06 s [vector] +++ OK, passed 100 tests.
  10291. 1417.07 s [vector] iscanl': OK
  10292. 1417.07 s [vector] +++ OK, passed 100 tests.
  10293. 1417.08 s [vector] prescanr: OK
  10294. 1417.08 s [vector] +++ OK, passed 100 tests.
  10295. 1417.08 s [vector] prescanr': OK
  10296. 1417.08 s [vector] +++ OK, passed 100 tests.
  10297. 1417.08 s [vector] postscanr: OK
  10298. 1417.08 s [vector] +++ OK, passed 100 tests.
  10299. 1417.08 s [vector] postscanr': OK
  10300. 1417.09 s [vector] +++ OK, passed 100 tests.
  10301. 1417.09 s [vector] scanr: OK
  10302. 1417.09 s [vector] +++ OK, passed 100 tests.
  10303. 1417.09 s [vector] scanr': OK
  10304. 1417.09 s [vector] +++ OK, passed 100 tests.
  10305. 1417.10 s [vector] scanr1: OK
  10306. 1417.10 s [vector] +++ OK, passed 100 tests.
  10307. 1417.10 s [vector] scanr1': OK
  10308. 1417.11 s [vector] +++ OK, passed 100 tests.
  10309. 1417.11 s [vector] iscanr: OK
  10310. 1417.11 s [vector] +++ OK, passed 100 tests.
  10311. 1417.11 s [vector] iscanr': OK
  10312. 1417.11 s [vector] +++ OK, passed 100 tests.
  10313. 1417.11 s [vector] mut_read: OK
  10314. 1417.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10315. 1417.12 s [vector] mut_write: OK
  10316. 1417.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10317. 1417.12 s [vector] mut_modify: OK
  10318. 1417.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10319. 1417.14 s [vector] mut_generate: OK
  10320. 1417.14 s [vector] +++ OK, passed 100 tests.
  10321. 1417.16 s [vector] mut_generateM: OK (0.02s)
  10322. 1417.16 s [vector] +++ OK, passed 100 tests.
  10323. 1417.18 s [vector] mut_mapM_: OK (0.04s)
  10324. 1417.18 s [vector] +++ OK, passed 100 tests.
  10325. 1417.20 s [vector] mut_imapM_: OK (0.02s)
  10326. 1417.20 s [vector] +++ OK, passed 100 tests.
  10327. 1417.20 s [pandoc-lua-engine] Phase: unpackPhase
  10328. 1417.21 s [vector] mut_forM_: OK (0.02s)
  10329. 1417.21 s [vector] +++ OK, passed 100 tests.
  10330. 1417.21 s [pandoc-lua-engine] unpacking source archive /nix/store/zx6z7rsf1lwrwkbcq94jg1dgi1fp9jls-pandoc-lua-engine-0.4.3.tar.gz
  10331. 1417.23 s [pandoc-lua-engine] source root is pandoc-lua-engine-0.4.3
  10332. 1417.24 s [vector] mut_iforM_: OK (0.01s)
  10333. 1417.24 s [vector] +++ OK, passed 100 tests.
  10334. 1417.25 s [vector] mut_foldr: OK
  10335. 1417.25 s [vector] +++ OK, passed 100 tests.
  10336. 1417.25 s [vector] mut_foldr': OK
  10337. 1417.25 s [vector] +++ OK, passed 100 tests.
  10338. 1417.25 s [vector] mut_foldl: OK
  10339. 1417.26 s [pandoc-lua-engine] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-lua-engine-0.4.3/test/writer-template.out.txt"
  10340. 1417.26 s [vector] +++ OK, passed 100 tests.
  10341. 1417.26 s [vector] mut_foldl': OK
  10342. 1417.27 s [pandoc-lua-engine] Phase: patchPhase
  10343. 1417.27 s [vector] +++ OK, passed 100 tests.
  10344. 1417.27 s [vector] mut_ifoldr: OK
  10345. 1417.28 s [pandoc-lua-engine] Replace Cabal file with edited version from mirror://hackage/pandoc-lua-engine-0.4.3/revision/2.cabal.
  10346. 1417.28 s [vector] +++ OK, passed 100 tests.
  10347. 1417.29 s [vector] mut_ifoldr': OK (0.01s)
  10348. 1417.29 s [vector] +++ OK, passed 100 tests.
  10349. 1417.29 s [vector] mut_ifoldl: OK
  10350. 1417.29 s [vector] +++ OK, passed 100 tests.
  10351. 1417.29 s [vector] mut_ifoldl': OK
  10352. 1417.29 s [vector] +++ OK, passed 100 tests.
  10353. 1417.29 s [pandoc-lua-engine] Phase: compileBuildDriverPhase
  10354. 1417.30 s [vector] mut_foldM: OK
  10355. 1417.30 s [vector] +++ OK, passed 100 tests.
  10356. 1417.30 s [vector] mut_foldM': OK
  10357. 1417.30 s [pandoc-lua-engine] setupCompileFlags: -package-db=/build/tmp.dXHKZTBIpZ/setup-package.conf.d -threaded
  10358. 1417.30 s [vector] +++ OK, passed 100 tests.
  10359. 1417.30 s [vector] mut_foldrM: OK
  10360. 1417.30 s [vector] +++ OK, passed 100 tests.
  10361. 1417.30 s [vector] mut_foldrM': OK
  10362. 1417.30 s [vector] +++ OK, passed 100 tests.
  10363. 1417.30 s [vector] mut_ifoldM: OK
  10364. 1417.31 s [vector] +++ OK, passed 100 tests.
  10365. 1417.31 s [vector] mut_ifoldM': OK
  10366. 1417.31 s [vector] +++ OK, passed 100 tests.
  10367. 1417.31 s [vector] mut_ifoldrM: OK
  10368. 1417.31 s [vector] +++ OK, passed 100 tests.
  10369. 1417.31 s [vector] mut_ifoldrM': OK
  10370. 1417.31 s [vector] +++ OK, passed 100 tests.
  10371. 1417.31 s [vector] compare: OK
  10372. 1417.31 s [vector] +++ OK, passed 100 tests.
  10373. 1417.31 s [vector] maximum: OK
  10374. 1417.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10375. 1417.31 s [vector] minimum: OK
  10376. 1417.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10377. 1417.32 s [vector] minIndex: OK
  10378. 1417.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10379. 1417.32 s [vector] maxIndex: OK
  10380. 1417.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10381. 1417.32 s [vector] maximumBy: OK
  10382. 1417.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10383. 1417.32 s [vector] minimumBy: OK
  10384. 1417.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10385. 1417.32 s [vector] maximumOn: OK
  10386. 1417.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10387. 1417.32 s [vector] minimumOn: OK
  10388. 1417.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10389. 1417.32 s [vector] maxIndexBy: OK
  10390. 1417.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10391. 1417.32 s [vector] minIndexBy: OK
  10392. 1417.32 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10393. 1417.32 s [vector] ListFirstMaxIndexWins: OK
  10394. 1417.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10395. 1417.32 s [vector] FalseListFirstMaxIndexWins: OK
  10396. 1417.32 s [vector] +++ OK, failed as expected. (after 1 test):
  10397. 1417.32 s [vector] Exception:
  10398. 1417.32 s [vector] Prelude.foldr1: empty list
  10399. 1417.32 s [vector] CallStack (from HasCallStack):
  10400. 1417.32 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10401. 1417.32 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10402. 1417.32 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10403. 1417.32 s [vector] []
  10404. 1417.32 s [vector] zip: OK
  10405. 1417.32 s [vector] +++ OK, passed 100 tests.
  10406. 1417.32 s [vector] zip3: OK
  10407. 1417.32 s [vector] +++ OK, passed 100 tests.
  10408. 1417.32 s [vector] unzip: OK
  10409. 1417.32 s [vector] +++ OK, passed 100 tests.
  10410. 1417.32 s [vector] unzip3: OK
  10411. 1417.32 s [vector] +++ OK, passed 100 tests.
  10412. 1417.32 s [vector] indexed: OK
  10413. 1417.32 s [vector] +++ OK, passed 100 tests.
  10414. 1417.32 s [vector] update: OK
  10415. 1417.33 s [vector] +++ OK, passed 100 tests.
  10416. 1417.33 s [vector] concat: OK
  10417. 1417.33 s [vector] +++ OK, passed 100 tests.
  10418. 1417.33 s [vector] mempty: OK
  10419. 1417.33 s [vector] +++ OK, passed 100 tests.
  10420. 1417.34 s [vector] mappend: OK
  10421. 1417.34 s [vector] +++ OK, passed 100 tests.
  10422. 1417.34 s [vector] mconcat: OK
  10423. 1417.34 s [vector] +++ OK, passed 100 tests.
  10424. 1417.34 s [vector] fmap: OK
  10425. 1417.34 s [vector] +++ OK, passed 100 tests.
  10426. 1417.34 s [vector] return: OK
  10427. 1417.36 s [vector] +++ OK, passed 100 tests.
  10428. 1417.36 s [vector] bind: OK (0.02s)
  10429. 1417.36 s [vector] +++ OK, passed 100 tests.
  10430. 1417.36 s [vector] mzip: OK
  10431. 1417.36 s [vector] +++ OK, passed 100 tests.
  10432. 1417.36 s [vector] munzip: OK
  10433. 1417.36 s [vector] +++ OK, passed 100 tests.
  10434. 1417.36 s [vector] applicative_pure: OK
  10435. 1417.38 s [vector] +++ OK, passed 100 tests.
  10436. 1417.39 s [pandoc-lua-engine] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.dXHKZTBIpZ/Main.o )
  10437. 1417.39 s [vector] applicative_appl: OK (0.03s)
  10438. 1417.39 s [vector] +++ OK, passed 100 tests.
  10439. 1417.39 s [vector] alternative_empty: OK
  10440. 1417.40 s [vector] +++ OK, passed 100 tests.
  10441. 1417.40 s [vector] alternative_or: OK
  10442. 1417.40 s [vector] +++ OK, passed 100 tests.
  10443. 1417.45 s [vector] sequence: OK (0.05s)
  10444. 1417.45 s [vector] +++ OK, passed 100 tests.
  10445. 1417.45 s [vector] sequence_: OK (0.01s)
  10446. 1417.45 s [vector] +++ OK, passed 100 tests.
  10447. 1417.45 s [vector] glength: OK
  10448. 1417.45 s [vector] +++ OK, passed 100 tests.
  10449. 1417.45 s [vector] sum: OK
  10450. 1417.45 s [vector] +++ OK, passed 100 tests.
  10451. 1417.45 s [vector] product: OK
  10452. 1417.45 s [vector] +++ OK, passed 100 tests.
  10453. 1417.45 s [vector] enumFromN: OK
  10454. 1417.45 s [vector] +++ OK, passed 100 tests.
  10455. 1417.45 s [vector] enumFromThenN: OK
  10456. 1417.45 s [vector] +++ OK, passed 100 tests.
  10457. 1417.46 s [vector] enumFromTo: OK
  10458. 1417.46 s [vector] +++ OK, passed 100 tests.
  10459. 1417.46 s [vector] enumFromThenTo: OK
  10460. 1417.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10461. 1417.46 s [vector] unstream
  10462. 1417.46 s [vector] unstream == vunstream (exact): OK
  10463. 1417.46 s [vector] +++ OK, passed 100 tests.
  10464. 1417.46 s [vector] unstream == vunstream (unknown): OK
  10465. 1417.46 s [vector] +++ OK, passed 100 tests.
  10466. 1417.46 s [vector] unstreamR ~= vunstream (exact): OK
  10467. 1417.46 s [vector] +++ OK, passed 100 tests.
  10468. 1417.46 s [vector] unstreamR ~= vunstream (unknown): OK
  10469. 1417.46 s [vector] +++ OK, passed 100 tests.
  10470. 1417.46 s [vector] Tests.Vector.Primitive
  10471. 1417.46 s [vector] Int
  10472. 1417.46 s [vector] fromList.toList == id: OK
  10473. 1417.46 s [vector] +++ OK, passed 100 tests.
  10474. 1417.46 s [vector] toList.fromList == id: OK
  10475. 1417.46 s [vector] +++ OK, passed 100 tests.
  10476. 1417.46 s [vector] unstream.stream == id: OK
  10477. 1417.46 s [vector] +++ OK, passed 100 tests.
  10478. 1417.46 s [vector] stream.unstream == id: OK
  10479. 1417.46 s [vector] +++ OK, passed 100 tests.
  10480. 1417.46 s [vector] eq: OK
  10481. 1417.46 s [vector] +++ OK, passed 100 tests.
  10482. 1417.46 s [vector] length: OK
  10483. 1417.46 s [vector] +++ OK, passed 100 tests.
  10484. 1417.46 s [vector] null: OK
  10485. 1417.46 s [vector] +++ OK, passed 100 tests.
  10486. 1417.46 s [vector] index: OK
  10487. 1417.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10488. 1417.46 s [vector] safeIndex: OK
  10489. 1417.46 s [vector] +++ OK, passed 100 tests.
  10490. 1417.46 s [vector] head: OK
  10491. 1417.47 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10492. 1417.47 s [vector] last: OK
  10493. 1417.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10494. 1417.47 s [vector] unsafeIndex: OK
  10495. 1417.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10496. 1417.47 s [vector] unsafeHead: OK
  10497. 1417.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10498. 1417.47 s [vector] unsafeLast: OK
  10499. 1417.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10500. 1417.47 s [vector] slice: OK
  10501. 1417.47 s [vector] +++ OK, passed 100 tests.
  10502. 1417.47 s [vector] init: OK
  10503. 1417.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10504. 1417.47 s [vector] tail: OK
  10505. 1417.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10506. 1417.47 s [vector] take: OK
  10507. 1417.47 s [vector] +++ OK, passed 100 tests.
  10508. 1417.47 s [vector] drop: OK
  10509. 1417.47 s [vector] +++ OK, passed 100 tests.
  10510. 1417.47 s [vector] splitAt: OK
  10511. 1417.48 s [vector] +++ OK, passed 100 tests.
  10512. 1417.48 s [vector] empty: OK
  10513. 1417.48 s [vector] +++ OK, passed 100 tests.
  10514. 1417.48 s [vector] singleton: OK
  10515. 1417.48 s [vector] +++ OK, passed 100 tests.
  10516. 1417.48 s [vector] replicate: OK
  10517. 1417.48 s [vector] +++ OK, passed 100 tests.
  10518. 1417.48 s [vector] generate: OK
  10519. 1417.48 s [vector] +++ OK, passed 100 tests.
  10520. 1417.50 s [vector] iterateN: OK
  10521. 1417.50 s [vector] +++ OK, passed 100 tests.
  10522. 1417.51 s [pandoc-server] Phase: unpackPhase
  10523. 1417.52 s [pandoc-server] unpacking source archive /nix/store/4kqsjsplqpsanrihsxp1wxshjqr4snkl-pandoc-server-0.1.0.11.tar.gz
  10524. 1417.52 s [vector] iterateNM: OK (0.02s)
  10525. 1417.52 s [vector] +++ OK, passed 100 tests.
  10526. 1417.52 s [pandoc-lua-engine] [2 of 2] Linking Setup
  10527. 1417.52 s [pandoc-server] source root is pandoc-server-0.1.0.11
  10528. 1417.54 s [pandoc-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-server-0.1.0.11/src/Text/Pandoc/Server.hs"
  10529. 1417.54 s [pandoc-server] Phase: patchPhase
  10530. 1417.56 s [vector] generateM: OK (0.04s)
  10531. 1417.56 s [vector] +++ OK, passed 100 tests.
  10532. 1417.56 s [pandoc-server] Phase: compileBuildDriverPhase
  10533. 1417.57 s [vector] replicateM: OK (0.02s)
  10534. 1417.57 s [vector] +++ OK, passed 100 tests.
  10535. 1417.57 s [vector] create: OK
  10536. 1417.57 s [vector] +++ OK, passed 100 tests.
  10537. 1417.57 s [pandoc-server] setupCompileFlags: -package-db=/build/tmp.QfXhG0cDsW/setup-package.conf.d -threaded
  10538. 1417.58 s [vector] createT: OK
  10539. 1417.58 s [vector] +++ OK, passed 100 tests.
  10540. 1417.58 s [vector] unfoldr: OK
  10541. 1417.58 s [vector] +++ OK, passed 100 tests.
  10542. 1417.58 s [vector] unfoldrN: OK
  10543. 1417.58 s [vector] +++ OK, passed 100 tests.
  10544. 1417.59 s [vector] unfoldrExactN: OK
  10545. 1417.59 s [vector] +++ OK, passed 100 tests.
  10546. 1417.60 s [vector] unfoldrM: OK
  10547. 1417.60 s [vector] +++ OK, passed 100 tests.
  10548. 1417.62 s [vector] unfoldrNM: OK
  10549. 1417.62 s [vector] +++ OK, passed 100 tests.
  10550. 1417.62 s [vector] unfoldrExactNM: OK (0.02s)
  10551. 1417.62 s [vector] +++ OK, passed 100 tests.
  10552. 1417.62 s [vector] constructN: OK
  10553. 1417.63 s [vector] +++ OK, passed 100 tests.
  10554. 1417.63 s [vector] constructrN: OK
  10555. 1417.63 s [vector] +++ OK, passed 100 tests.
  10556. 1417.63 s [vector] cons: OK
  10557. 1417.63 s [vector] +++ OK, passed 100 tests.
  10558. 1417.63 s [vector] snoc: OK
  10559. 1417.63 s [vector] +++ OK, passed 100 tests.
  10560. 1417.64 s [vector] append: OK
  10561. 1417.64 s [vector] +++ OK, passed 100 tests.
  10562. 1417.65 s [vector] concat: OK (0.02s)
  10563. 1417.65 s [vector] +++ OK, passed 100 tests.
  10564. 1417.66 s [vector] force: OK
  10565. 1417.66 s [vector] +++ OK, passed 100 tests.
  10566. 1417.66 s [vector] upd: OK
  10567. 1417.66 s [vector] +++ OK, passed 100 tests.
  10568. 1417.66 s [vector] accum: OK
  10569. 1417.66 s [vector] +++ OK, passed 100 tests.
  10570. 1417.67 s [pandoc-server] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.QfXhG0cDsW/Main.o )
  10571. 1417.68 s [vector] reverse: OK
  10572. 1417.68 s [vector] +++ OK, passed 100 tests.
  10573. 1417.68 s [vector] backpermute: OK
  10574. 1417.68 s [vector] +++ OK, passed 100 tests.
  10575. 1417.68 s [vector] map: OK
  10576. 1417.68 s [vector] +++ OK, passed 100 tests.
  10577. 1417.68 s [vector] imap: OK
  10578. 1417.69 s [vector] +++ OK, passed 100 tests.
  10579. 1417.70 s [vector] concatMap: OK
  10580. 1417.70 s [vector] +++ OK, passed 100 tests.
  10581. 1417.70 s [vector] mapM: OK
  10582. 1417.70 s [vector] +++ OK, passed 100 tests.
  10583. 1417.70 s [vector] mapM_: OK (0.02s)
  10584. 1417.70 s [vector] +++ OK, passed 100 tests.
  10585. 1417.70 s [vector] forM: OK
  10586. 1417.70 s [vector] +++ OK, passed 100 tests.
  10587. 1417.73 s [vector] forM_: OK (0.02s)
  10588. 1417.73 s [vector] +++ OK, passed 100 tests.
  10589. 1417.73 s [vector] imapM: OK
  10590. 1417.73 s [vector] +++ OK, passed 100 tests.
  10591. 1417.73 s [vector] imapM_: OK (0.01s)
  10592. 1417.73 s [vector] +++ OK, passed 100 tests.
  10593. 1417.73 s [vector] zipWith: OK
  10594. 1417.74 s [vector] +++ OK, passed 100 tests.
  10595. 1417.74 s [vector] zipWith3: OK
  10596. 1417.74 s [vector] +++ OK, passed 100 tests.
  10597. 1417.74 s [pandoc-server] [2 of 2] Linking Setup
  10598. 1417.75 s [vector] izipWith: OK
  10599. 1417.75 s [vector] +++ OK, passed 100 tests.
  10600. 1417.75 s [vector] izipWith3: OK
  10601. 1417.75 s [vector] +++ OK, passed 100 tests.
  10602. 1417.75 s [vector] izipWithM: OK
  10603. 1417.76 s [vector] +++ OK, passed 100 tests.
  10604. 1417.77 s [vector] izipWithM_: OK (0.01s)
  10605. 1417.77 s [vector] +++ OK, passed 100 tests.
  10606. 1417.78 s [vector] zipWithM: OK
  10607. 1417.78 s [vector] +++ OK, passed 100 tests.
  10608. 1417.79 s [vector] zipWithM_: OK (0.02s)
  10609. 1417.79 s [vector] +++ OK, passed 100 tests.
  10610. 1417.79 s [vector] filter: OK
  10611. 1417.79 s [vector] +++ OK, passed 100 tests.
  10612. 1417.79 s [vector] ifilter: OK
  10613. 1417.79 s [vector] +++ OK, passed 100 tests.
  10614. 1417.81 s [vector] filterM: OK (0.02s)
  10615. 1417.81 s [vector] +++ OK, passed 100 tests.
  10616. 1417.82 s [vector] uniq: OK
  10617. 1417.82 s [vector] +++ OK, passed 100 tests.
  10618. 1417.82 s [vector] mapMaybe: OK
  10619. 1417.82 s [vector] +++ OK, passed 100 tests.
  10620. 1417.82 s [vector] imapMaybe: OK
  10621. 1417.82 s [vector] +++ OK, passed 100 tests.
  10622. 1417.82 s [vector] takeWhile: OK
  10623. 1417.82 s [vector] +++ OK, passed 100 tests.
  10624. 1417.83 s [vector] dropWhile: OK
  10625. 1417.83 s [vector] +++ OK, passed 100 tests.
  10626. 1417.83 s [vector] partition: OK
  10627. 1417.84 s [vector] +++ OK, passed 100 tests.
  10628. 1417.84 s [vector] partitionWith: OK
  10629. 1417.84 s [vector] +++ OK, passed 100 tests.
  10630. 1417.84 s [vector] span: OK
  10631. 1417.84 s [vector] +++ OK, passed 100 tests.
  10632. 1417.84 s [vector] break: OK
  10633. 1417.84 s [vector] +++ OK, passed 100 tests.
  10634. 1417.84 s [vector] spanR: OK
  10635. 1417.85 s [vector] +++ OK, passed 100 tests.
  10636. 1417.85 s [vector] breakR: OK
  10637. 1417.85 s [vector] +++ OK, passed 100 tests.
  10638. 1417.85 s [vector] groupBy: OK
  10639. 1417.85 s [vector] +++ OK, passed 100 tests.
  10640. 1417.85 s [vector] elem: OK
  10641. 1417.85 s [vector] +++ OK, passed 100 tests.
  10642. 1417.86 s [vector] notElem: OK
  10643. 1417.86 s [vector] +++ OK, passed 100 tests.
  10644. 1417.86 s [vector] find: OK
  10645. 1417.86 s [vector] +++ OK, passed 100 tests.
  10646. 1417.86 s [vector] findIndex: OK
  10647. 1417.86 s [vector] +++ OK, passed 100 tests.
  10648. 1417.86 s [vector] findIndexR: OK
  10649. 1417.86 s [vector] +++ OK, passed 100 tests.
  10650. 1417.86 s [vector] findIndices: OK
  10651. 1417.86 s [vector] +++ OK, passed 100 tests.
  10652. 1417.86 s [vector] elemIndex: OK
  10653. 1417.86 s [vector] +++ OK, passed 100 tests.
  10654. 1417.86 s [vector] elemIndices: OK
  10655. 1417.86 s [vector] +++ OK, passed 100 tests.
  10656. 1417.87 s [vector] foldl: OK
  10657. 1417.87 s [vector] +++ OK, passed 100 tests.
  10658. 1417.87 s [vector] foldl1: OK
  10659. 1417.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10660. 1417.87 s [vector] foldl': OK
  10661. 1417.87 s [vector] +++ OK, passed 100 tests.
  10662. 1417.88 s [vector] foldl1': OK
  10663. 1417.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10664. 1417.89 s [vector] foldr: OK
  10665. 1417.89 s [vector] +++ OK, passed 100 tests.
  10666. 1417.89 s [vector] foldr1: OK
  10667. 1417.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10668. 1417.90 s [vector] foldr': OK
  10669. 1417.90 s [vector] +++ OK, passed 100 tests.
  10670. 1417.90 s [vector] foldr1': OK
  10671. 1417.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10672. 1417.91 s [vector] ifoldl: OK
  10673. 1417.91 s [vector] +++ OK, passed 100 tests.
  10674. 1417.92 s [vector] ifoldl': OK
  10675. 1417.92 s [vector] +++ OK, passed 100 tests.
  10676. 1417.92 s [vector] ifoldr: OK
  10677. 1417.92 s [vector] +++ OK, passed 100 tests.
  10678. 1417.93 s [vector] ifoldr': OK
  10679. 1417.93 s [vector] +++ OK, passed 100 tests.
  10680. 1417.93 s [vector] ifoldM: OK
  10681. 1417.93 s [vector] +++ OK, passed 100 tests.
  10682. 1417.94 s [vector] ifoldM': OK
  10683. 1417.94 s [vector] +++ OK, passed 100 tests.
  10684. 1417.96 s [vector] ifoldM_: OK (0.02s)
  10685. 1417.96 s [vector] +++ OK, passed 100 tests.
  10686. 1417.97 s [vector] ifoldM'_: OK (0.01s)
  10687. 1417.97 s [vector] +++ OK, passed 100 tests.
  10688. 1417.97 s [vector] all: OK
  10689. 1417.97 s [vector] +++ OK, passed 100 tests.
  10690. 1417.97 s [vector] any: OK
  10691. 1417.97 s [vector] +++ OK, passed 100 tests.
  10692. 1417.97 s [vector] prescanl: OK
  10693. 1417.97 s [vector] +++ OK, passed 100 tests.
  10694. 1417.98 s [vector] prescanl': OK
  10695. 1417.98 s [vector] +++ OK, passed 100 tests.
  10696. 1417.98 s [vector] postscanl: OK
  10697. 1417.98 s [vector] +++ OK, passed 100 tests.
  10698. 1417.98 s [vector] postscanl': OK
  10699. 1417.98 s [vector] +++ OK, passed 100 tests.
  10700. 1417.99 s [vector] scanl: OK
  10701. 1417.99 s [vector] +++ OK, passed 100 tests.
  10702. 1417.99 s [vector] scanl': OK
  10703. 1417.99 s [vector] +++ OK, passed 100 tests.
  10704. 1417.99 s [vector] scanl1: OK
  10705. 1417.99 s [vector] +++ OK, passed 100 tests.
  10706. 1417.99 s [vector] scanl1': OK
  10707. 1418.00 s [vector] +++ OK, passed 100 tests.
  10708. 1418.00 s [vector] iscanl: OK
  10709. 1418.00 s [vector] +++ OK, passed 100 tests.
  10710. 1418.00 s [vector] iscanl': OK
  10711. 1418.00 s [vector] +++ OK, passed 100 tests.
  10712. 1418.01 s [vector] prescanr: OK
  10713. 1418.01 s [vector] +++ OK, passed 100 tests.
  10714. 1418.01 s [vector] prescanr': OK
  10715. 1418.01 s [vector] +++ OK, passed 100 tests.
  10716. 1418.01 s [vector] postscanr: OK
  10717. 1418.01 s [vector] +++ OK, passed 100 tests.
  10718. 1418.02 s [vector] postscanr': OK
  10719. 1418.02 s [vector] +++ OK, passed 100 tests.
  10720. 1418.02 s [vector] scanr: OK
  10721. 1418.02 s [vector] +++ OK, passed 100 tests.
  10722. 1418.02 s [vector] scanr': OK
  10723. 1418.02 s [vector] +++ OK, passed 100 tests.
  10724. 1418.03 s [vector] scanr1: OK
  10725. 1418.03 s [vector] +++ OK, passed 100 tests.
  10726. 1418.03 s [vector] scanr1': OK
  10727. 1418.03 s [vector] +++ OK, passed 100 tests.
  10728. 1418.03 s [vector] iscanr: OK
  10729. 1418.03 s [vector] +++ OK, passed 100 tests.
  10730. 1418.03 s [vector] iscanr': OK
  10731. 1418.03 s [vector] +++ OK, passed 100 tests.
  10732. 1418.03 s [vector] mut_read: OK
  10733. 1418.03 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10734. 1418.04 s [vector] mut_write: OK
  10735. 1418.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10736. 1418.04 s [vector] mut_modify: OK
  10737. 1418.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10738. 1418.04 s [vector] mut_generate: OK
  10739. 1418.04 s [vector] +++ OK, passed 100 tests.
  10740. 1418.05 s [vector] mut_generateM: OK
  10741. 1418.05 s [vector] +++ OK, passed 100 tests.
  10742. 1418.07 s [vector] mut_mapM_: OK (0.02s)
  10743. 1418.07 s [vector] +++ OK, passed 100 tests.
  10744. 1418.08 s [vector] mut_imapM_: OK
  10745. 1418.08 s [vector] +++ OK, passed 100 tests.
  10746. 1418.11 s [vector] mut_forM_: OK (0.02s)
  10747. 1418.11 s [vector] +++ OK, passed 100 tests.
  10748. 1418.12 s [vector] mut_iforM_: OK (0.02s)
  10749. 1418.12 s [vector] +++ OK, passed 100 tests.
  10750. 1418.12 s [vector] mut_foldr: OK
  10751. 1418.12 s [vector] +++ OK, passed 100 tests.
  10752. 1418.12 s [vector] mut_foldr': OK
  10753. 1418.12 s [vector] +++ OK, passed 100 tests.
  10754. 1418.12 s [vector] mut_foldl: OK
  10755. 1418.13 s [vector] +++ OK, passed 100 tests.
  10756. 1418.13 s [vector] mut_foldl': OK
  10757. 1418.14 s [vector] +++ OK, passed 100 tests.
  10758. 1418.14 s [vector] mut_ifoldr: OK
  10759. 1418.14 s [vector] +++ OK, passed 100 tests.
  10760. 1418.15 s [vector] mut_ifoldr': OK
  10761. 1418.15 s [vector] +++ OK, passed 100 tests.
  10762. 1418.15 s [vector] mut_ifoldl: OK
  10763. 1418.15 s [vector] +++ OK, passed 100 tests.
  10764. 1418.15 s [vector] mut_ifoldl': OK
  10765. 1418.15 s [vector] +++ OK, passed 100 tests.
  10766. 1418.15 s [vector] mut_foldM: OK
  10767. 1418.15 s [vector] +++ OK, passed 100 tests.
  10768. 1418.15 s [vector] mut_foldM': OK
  10769. 1418.16 s [vector] +++ OK, passed 100 tests.
  10770. 1418.16 s [vector] mut_foldrM: OK
  10771. 1418.16 s [vector] +++ OK, passed 100 tests.
  10772. 1418.16 s [vector] mut_foldrM': OK
  10773. 1418.17 s [vector] +++ OK, passed 100 tests.
  10774. 1418.17 s [vector] mut_ifoldM: OK
  10775. 1418.17 s [vector] +++ OK, passed 100 tests.
  10776. 1418.17 s [vector] mut_ifoldM': OK
  10777. 1418.17 s [vector] +++ OK, passed 100 tests.
  10778. 1418.17 s [vector] mut_ifoldrM: OK
  10779. 1418.17 s [vector] +++ OK, passed 100 tests.
  10780. 1418.17 s [vector] mut_ifoldrM': OK
  10781. 1418.17 s [vector] +++ OK, passed 100 tests.
  10782. 1418.17 s [vector] compare: OK
  10783. 1418.17 s [vector] +++ OK, passed 100 tests.
  10784. 1418.17 s [vector] maximum: OK
  10785. 1418.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10786. 1418.17 s [vector] minimum: OK
  10787. 1418.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10788. 1418.17 s [vector] minIndex: OK
  10789. 1418.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10790. 1418.18 s [vector] maxIndex: OK
  10791. 1418.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10792. 1418.18 s [vector] maximumBy: OK
  10793. 1418.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10794. 1418.18 s [vector] minimumBy: OK
  10795. 1418.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10796. 1418.18 s [vector] maximumOn: OK
  10797. 1418.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10798. 1418.18 s [vector] minimumOn: OK
  10799. 1418.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10800. 1418.18 s [vector] maxIndexBy: OK
  10801. 1418.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10802. 1418.18 s [vector] minIndexBy: OK
  10803. 1418.18 s [vector] +++ OK, passed 100 tests; 27 discarded.
  10804. 1418.18 s [vector] ListFirstMaxIndexWins: OK
  10805. 1418.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10806. 1418.18 s [vector] FalseListFirstMaxIndexWins: OK
  10807. 1418.18 s [vector] +++ OK, failed as expected. (after 1 test):
  10808. 1418.18 s [vector] Exception:
  10809. 1418.18 s [vector] Prelude.foldr1: empty list
  10810. 1418.18 s [vector] CallStack (from HasCallStack):
  10811. 1418.18 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10812. 1418.18 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10813. 1418.18 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10814. 1418.18 s [vector] []
  10815. 1418.18 s [vector] mempty: OK
  10816. 1418.18 s [vector] +++ OK, passed 100 tests.
  10817. 1418.18 s [vector] mappend: OK
  10818. 1418.18 s [vector] +++ OK, passed 100 tests.
  10819. 1418.21 s [vector] mconcat: OK (0.03s)
  10820. 1418.21 s [vector] +++ OK, passed 100 tests.
  10821. 1418.21 s [vector] glength: OK
  10822. 1418.21 s [vector] +++ OK, passed 100 tests.
  10823. 1418.21 s [vector] sum: OK
  10824. 1418.21 s [vector] +++ OK, passed 100 tests.
  10825. 1418.21 s [vector] product: OK
  10826. 1418.21 s [vector] +++ OK, passed 100 tests.
  10827. 1418.22 s [vector] enumFromN: OK
  10828. 1418.22 s [vector] +++ OK, passed 100 tests.
  10829. 1418.22 s [vector] enumFromThenN: OK
  10830. 1418.22 s [vector] +++ OK, passed 100 tests.
  10831. 1418.22 s [vector] enumFromTo: OK
  10832. 1418.22 s [vector] +++ OK, passed 100 tests.
  10833. 1418.22 s [vector] enumFromThenTo: OK
  10834. 1418.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10835. 1418.22 s [vector] Double
  10836. 1418.22 s [vector] fromList.toList == id: OK
  10837. 1418.22 s [vector] +++ OK, passed 100 tests.
  10838. 1418.22 s [vector] toList.fromList == id: OK
  10839. 1418.22 s [vector] +++ OK, passed 100 tests.
  10840. 1418.22 s [vector] unstream.stream == id: OK
  10841. 1418.22 s [vector] +++ OK, passed 100 tests.
  10842. 1418.22 s [vector] stream.unstream == id: OK
  10843. 1418.22 s [vector] +++ OK, passed 100 tests.
  10844. 1418.22 s [vector] eq: OK
  10845. 1418.22 s [vector] +++ OK, passed 100 tests.
  10846. 1418.22 s [vector] length: OK
  10847. 1418.22 s [vector] +++ OK, passed 100 tests.
  10848. 1418.23 s [vector] null: OK
  10849. 1418.23 s [vector] +++ OK, passed 100 tests.
  10850. 1418.23 s [vector] index: OK
  10851. 1418.23 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10852. 1418.23 s [vector] safeIndex: OK
  10853. 1418.23 s [vector] +++ OK, passed 100 tests.
  10854. 1418.23 s [vector] head: OK
  10855. 1418.23 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10856. 1418.23 s [vector] last: OK
  10857. 1418.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10858. 1418.23 s [vector] unsafeIndex: OK
  10859. 1418.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10860. 1418.24 s [vector] unsafeHead: OK
  10861. 1418.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10862. 1418.24 s [vector] unsafeLast: OK
  10863. 1418.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10864. 1418.24 s [vector] slice: OK
  10865. 1418.24 s [vector] +++ OK, passed 100 tests.
  10866. 1418.24 s [vector] init: OK
  10867. 1418.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10868. 1418.24 s [vector] tail: OK
  10869. 1418.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10870. 1418.24 s [vector] take: OK
  10871. 1418.24 s [vector] +++ OK, passed 100 tests.
  10872. 1418.24 s [vector] drop: OK
  10873. 1418.24 s [vector] +++ OK, passed 100 tests.
  10874. 1418.25 s [vector] splitAt: OK
  10875. 1418.25 s [vector] +++ OK, passed 100 tests.
  10876. 1418.25 s [vector] empty: OK
  10877. 1418.25 s [vector] +++ OK, passed 100 tests.
  10878. 1418.25 s [vector] singleton: OK
  10879. 1418.25 s [vector] +++ OK, passed 100 tests.
  10880. 1418.26 s [vector] replicate: OK
  10881. 1418.26 s [vector] +++ OK, passed 100 tests.
  10882. 1418.26 s [vector] generate: OK
  10883. 1418.26 s [vector] +++ OK, passed 100 tests.
  10884. 1418.26 s [vector] iterateN: OK
  10885. 1418.26 s [vector] +++ OK, passed 100 tests.
  10886. 1418.32 s [vector] iterateNM: OK (0.04s)
  10887. 1418.32 s [vector] +++ OK, passed 100 tests.
  10888. 1418.36 s [vector] generateM: OK (0.04s)
  10889. 1418.36 s [vector] +++ OK, passed 100 tests.
  10890. 1418.38 s [vector] replicateM: OK (0.03s)
  10891. 1418.38 s [vector] +++ OK, passed 100 tests.
  10892. 1418.38 s [vector] create: OK
  10893. 1418.38 s [vector] +++ OK, passed 100 tests.
  10894. 1418.38 s [vector] createT: OK
  10895. 1418.38 s [vector] +++ OK, passed 100 tests.
  10896. 1418.38 s [vector] unfoldr: OK
  10897. 1418.38 s [vector] +++ OK, passed 100 tests.
  10898. 1418.39 s [vector] unfoldrN: OK
  10899. 1418.39 s [vector] +++ OK, passed 100 tests.
  10900. 1418.39 s [vector] unfoldrExactN: OK
  10901. 1418.39 s [vector] +++ OK, passed 100 tests.
  10902. 1418.39 s [vector] unfoldrM: OK
  10903. 1418.39 s [vector] +++ OK, passed 100 tests.
  10904. 1418.40 s [vector] unfoldrNM: OK
  10905. 1418.40 s [vector] +++ OK, passed 100 tests.
  10906. 1418.42 s [vector] unfoldrExactNM: OK (0.02s)
  10907. 1418.42 s [vector] +++ OK, passed 100 tests.
  10908. 1418.43 s [vector] constructN: OK (0.01s)
  10909. 1418.43 s [vector] +++ OK, passed 100 tests.
  10910. 1418.44 s [vector] constructrN: OK (0.01s)
  10911. 1418.44 s [vector] +++ OK, passed 100 tests.
  10912. 1418.44 s [vector] cons: OK
  10913. 1418.44 s [vector] +++ OK, passed 100 tests.
  10914. 1418.44 s [vector] snoc: OK
  10915. 1418.44 s [vector] +++ OK, passed 100 tests.
  10916. 1418.44 s [vector] append: OK
  10917. 1418.44 s [vector] +++ OK, passed 100 tests.
  10918. 1418.46 s [vector] concat: OK (0.03s)
  10919. 1418.47 s [vector] +++ OK, passed 100 tests.
  10920. 1418.48 s [vector] force: OK
  10921. 1418.48 s [vector] +++ OK, passed 100 tests.
  10922. 1418.50 s [vector] upd: OK
  10923. 1418.50 s [vector] +++ OK, passed 100 tests.
  10924. 1418.50 s [vector] accum: OK (0.02s)
  10925. 1418.50 s [vector] +++ OK, passed 100 tests.
  10926. 1418.50 s [vector] reverse: OK
  10927. 1418.50 s [vector] +++ OK, passed 100 tests.
  10928. 1418.50 s [vector] backpermute: OK
  10929. 1418.50 s [vector] +++ OK, passed 100 tests.
  10930. 1418.51 s [vector] map: OK
  10931. 1418.51 s [vector] +++ OK, passed 100 tests.
  10932. 1418.52 s [vector] imap: OK
  10933. 1418.52 s [vector] +++ OK, passed 100 tests.
  10934. 1418.52 s [vector] concatMap: OK
  10935. 1418.52 s [vector] +++ OK, passed 100 tests.
  10936. 1418.52 s [vector] mapM: OK
  10937. 1418.52 s [vector] +++ OK, passed 100 tests.
  10938. 1418.58 s [vector] mapM_: OK (0.04s)
  10939. 1418.58 s [vector] +++ OK, passed 100 tests.
  10940. 1418.60 s [vector] forM: OK (0.02s)
  10941. 1418.60 s [vector] +++ OK, passed 100 tests.
  10942. 1418.65 s [vector] forM_: OK (0.05s)
  10943. 1418.66 s [vector] +++ OK, passed 100 tests.
  10944. 1418.66 s [vector] imapM: OK (0.01s)
  10945. 1418.66 s [vector] +++ OK, passed 100 tests.
  10946. 1418.70 s [vector] imapM_: OK (0.04s)
  10947. 1418.70 s [vector] +++ OK, passed 100 tests.
  10948. 1418.71 s [vector] zipWith: OK (0.01s)
  10949. 1418.72 s [vector] +++ OK, passed 100 tests.
  10950. 1418.72 s [vector] zipWith3: OK (0.01s)
  10951. 1418.72 s [vector] +++ OK, passed 100 tests.
  10952. 1418.74 s [vector] izipWith: OK (0.03s)
  10953. 1418.74 s [vector] +++ OK, passed 100 tests.
  10954. 1418.76 s [vector] izipWith3: OK (0.02s)
  10955. 1418.76 s [vector] +++ OK, passed 100 tests.
  10956. 1418.78 s [vector] izipWithM: OK (0.01s)
  10957. 1418.78 s [vector] +++ OK, passed 100 tests.
  10958. 1418.82 s [vector] izipWithM_: OK (0.04s)
  10959. 1418.82 s [vector] +++ OK, passed 100 tests.
  10960. 1418.84 s [vector] zipWithM: OK (0.02s)
  10961. 1418.84 s [vector] +++ OK, passed 100 tests.
  10962. 1418.89 s [vector] zipWithM_: OK (0.05s)
  10963. 1418.90 s [vector] +++ OK, passed 100 tests.
  10964. 1418.90 s [vector] filter: OK (0.01s)
  10965. 1418.92 s [vector] +++ OK, passed 100 tests.
  10966. 1418.92 s [vector] ifilter: OK (0.01s)
  10967. 1418.92 s [vector] +++ OK, passed 100 tests.
  10968. 1418.98 s [vector] filterM: OK (0.07s)
  10969. 1418.98 s [vector] +++ OK, passed 100 tests.
  10970. 1418.98 s [vector] uniq: OK
  10971. 1418.98 s [vector] +++ OK, passed 100 tests.
  10972. 1419.00 s [vector] mapMaybe: OK (0.01s)
  10973. 1419.00 s [vector] +++ OK, passed 100 tests.
  10974. 1419.00 s [vector] imapMaybe: OK
  10975. 1419.00 s [vector] +++ OK, passed 100 tests.
  10976. 1419.00 s [vector] takeWhile: OK
  10977. 1419.00 s [vector] +++ OK, passed 100 tests.
  10978. 1419.01 s [vector] dropWhile: OK
  10979. 1419.01 s [vector] +++ OK, passed 100 tests.
  10980. 1419.01 s [vector] partition: OK
  10981. 1419.01 s [vector] +++ OK, passed 100 tests.
  10982. 1419.02 s [vector] partitionWith: OK
  10983. 1419.02 s [vector] +++ OK, passed 100 tests.
  10984. 1419.02 s [vector] span: OK
  10985. 1419.02 s [vector] +++ OK, passed 100 tests.
  10986. 1419.02 s [vector] break: OK
  10987. 1419.02 s [vector] +++ OK, passed 100 tests.
  10988. 1419.02 s [vector] spanR: OK
  10989. 1419.02 s [vector] +++ OK, passed 100 tests.
  10990. 1419.02 s [vector] breakR: OK
  10991. 1419.04 s [vector] +++ OK, passed 100 tests.
  10992. 1419.04 s [vector] groupBy: OK (0.02s)
  10993. 1419.04 s [vector] +++ OK, passed 100 tests.
  10994. 1419.04 s [vector] elem: OK
  10995. 1419.04 s [vector] +++ OK, passed 100 tests.
  10996. 1419.04 s [vector] notElem: OK
  10997. 1419.05 s [vector] +++ OK, passed 100 tests.
  10998. 1419.05 s [vector] find: OK
  10999. 1419.05 s [vector] +++ OK, passed 100 tests.
  11000. 1419.05 s [vector] findIndex: OK
  11001. 1419.05 s [vector] +++ OK, passed 100 tests.
  11002. 1419.05 s [vector] findIndexR: OK
  11003. 1419.06 s [vector] +++ OK, passed 100 tests.
  11004. 1419.06 s [vector] findIndices: OK (0.01s)
  11005. 1419.06 s [vector] +++ OK, passed 100 tests.
  11006. 1419.07 s [vector] elemIndex: OK
  11007. 1419.07 s [vector] +++ OK, passed 100 tests.
  11008. 1419.07 s [vector] elemIndices: OK
  11009. 1419.08 s [vector] +++ OK, passed 100 tests.
  11010. 1419.10 s [vector] foldl: OK (0.02s)
  11011. 1419.10 s [vector] +++ OK, passed 100 tests.
  11012. 1419.10 s [vector] foldl1: OK (0.02s)
  11013. 1419.10 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11014. 1419.12 s [vector] foldl': OK (0.01s)
  11015. 1419.12 s [vector] +++ OK, passed 100 tests.
  11016. 1419.16 s [vector] foldl1': OK (0.02s)
  11017. 1419.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11018. 1419.18 s [vector] foldr: OK (0.02s)
  11019. 1419.18 s [vector] +++ OK, passed 100 tests.
  11020. 1419.20 s [vector] foldr1: OK (0.02s)
  11021. 1419.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11022. 1419.20 s [vector] foldr': OK (0.02s)
  11023. 1419.20 s [vector] +++ OK, passed 100 tests.
  11024. 1419.24 s [vector] foldr1': OK (0.03s)
  11025. 1419.24 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11026. 1419.28 s [vector] ifoldl: OK (0.04s)
  11027. 1419.28 s [vector] +++ OK, passed 100 tests.
  11028. 1419.30 s [vector] ifoldl': OK (0.03s)
  11029. 1419.30 s [vector] +++ OK, passed 100 tests.
  11030. 1419.34 s [vector] ifoldr: OK (0.03s)
  11031. 1419.34 s [vector] +++ OK, passed 100 tests.
  11032. 1419.35 s [vector] ifoldr': OK (0.03s)
  11033. 1419.35 s [vector] +++ OK, passed 100 tests.
  11034. 1419.40 s [vector] ifoldM: OK (0.02s)
  11035. 1419.40 s [vector] +++ OK, passed 100 tests.
  11036. 1419.42 s [vector] ifoldM': OK (0.02s)
  11037. 1419.42 s [vector] +++ OK, passed 100 tests.
  11038. 1419.44 s [vector] ifoldM_: OK (0.03s)
  11039. 1419.44 s [vector] +++ OK, passed 100 tests.
  11040. 1419.47 s [vector] ifoldM'_: OK (0.04s)
  11041. 1419.47 s [vector] +++ OK, passed 100 tests.
  11042. 1419.48 s [vector] all: OK
  11043. 1419.48 s [vector] +++ OK, passed 100 tests.
  11044. 1419.48 s [vector] any: OK
  11045. 1419.48 s [vector] +++ OK, passed 100 tests.
  11046. 1419.50 s [vector] prescanl: OK (0.01s)
  11047. 1419.50 s [vector] +++ OK, passed 100 tests.
  11048. 1419.52 s [vector] prescanl': OK (0.02s)
  11049. 1419.52 s [vector] +++ OK, passed 100 tests.
  11050. 1419.54 s [vector] postscanl: OK (0.02s)
  11051. 1419.54 s [vector] +++ OK, passed 100 tests.
  11052. 1419.56 s [vector] postscanl': OK (0.02s)
  11053. 1419.56 s [vector] +++ OK, passed 100 tests.
  11054. 1419.56 s [vector] scanl: OK (0.02s)
  11055. 1419.56 s [vector] +++ OK, passed 100 tests.
  11056. 1419.58 s [vector] scanl': OK (0.01s)
  11057. 1419.58 s [vector] +++ OK, passed 100 tests.
  11058. 1419.60 s [vector] scanl1: OK (0.02s)
  11059. 1419.60 s [vector] +++ OK, passed 100 tests.
  11060. 1419.60 s [pandoc-lua-engine] Phase: updateAutotoolsGnuConfigScriptsPhase
  11061. 1419.61 s [vector] scanl1': OK (0.01s)
  11062. 1419.61 s [pandoc-lua-engine] Phase: configurePhase
  11063. 1419.62 s [vector] +++ OK, passed 100 tests.
  11064. 1419.62 s [vector] iscanl: OK (0.02s)
  11065. 1419.62 s [vector] +++ OK, passed 100 tests.
  11066. 1419.62 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.dXHKZTBIpZ/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
  11067. 1419.63 s [pandoc-lua-engine] Using Parsec parser
  11068. 1419.63 s [pandoc-lua-engine] Configuring pandoc-lua-engine-0.4.3...
  11069. 1419.64 s [vector] iscanl': OK (0.02s)
  11070. 1419.64 s [vector] +++ OK, passed 100 tests.
  11071. 1419.66 s [vector] prescanr: OK (0.02s)
  11072. 1419.66 s [vector] +++ OK, passed 100 tests.
  11073. 1419.68 s [vector] prescanr': OK (0.02s)
  11074. 1419.68 s [vector] +++ OK, passed 100 tests.
  11075. 1419.70 s [vector] postscanr: OK (0.01s)
  11076. 1419.70 s [vector] +++ OK, passed 100 tests.
  11077. 1419.70 s [vector] postscanr': OK (0.01s)
  11078. 1419.70 s [vector] +++ OK, passed 100 tests.
  11079. 1419.72 s [vector] scanr: OK (0.02s)
  11080. 1419.72 s [vector] +++ OK, passed 100 tests.
  11081. 1419.76 s [vector] scanr': OK (0.03s)
  11082. 1419.76 s [vector] +++ OK, passed 100 tests.
  11083. 1419.77 s [vector] scanr1: OK (0.02s)
  11084. 1419.77 s [vector] +++ OK, passed 100 tests.
  11085. 1419.78 s [vector] scanr1': OK
  11086. 1419.78 s [vector] +++ OK, passed 100 tests.
  11087. 1419.80 s [vector] iscanr: OK
  11088. 1419.80 s [vector] +++ OK, passed 100 tests.
  11089. 1419.82 s [vector] iscanr': OK (0.02s)
  11090. 1419.82 s [vector] +++ OK, passed 100 tests.
  11091. 1419.82 s [vector] mut_read: OK
  11092. 1419.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11093. 1419.84 s [vector] mut_write: OK
  11094. 1419.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11095. 1419.84 s [vector] mut_modify: OK
  11096. 1419.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11097. 1419.84 s [vector] mut_generate: OK
  11098. 1419.84 s [vector] +++ OK, passed 100 tests.
  11099. 1419.86 s [vector] mut_generateM: OK (0.02s)
  11100. 1419.86 s [vector] +++ OK, passed 100 tests.
  11101. 1419.88 s [pandoc-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  11102. 1419.89 s [pandoc-server] Phase: configurePhase
  11103. 1419.90 s [vector] mut_mapM_: OK (0.04s)
  11104. 1419.90 s [vector] +++ OK, passed 100 tests.
  11105. 1419.90 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.QfXhG0cDsW/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
  11106. 1419.91 s [pandoc-server] Using Parsec parser
  11107. 1419.91 s [pandoc-server] Configuring pandoc-server-0.1.0.11...
  11108. 1419.94 s [vector] mut_imapM_: OK (0.04s)
  11109. 1419.94 s [vector] +++ OK, passed 100 tests.
  11110. 1419.96 s [vector] mut_forM_: OK (0.04s)
  11111. 1419.96 s [vector] +++ OK, passed 100 tests.
  11112. 1420.00 s [vector] mut_iforM_: OK (0.04s)
  11113. 1420.00 s [vector] +++ OK, passed 100 tests.
  11114. 1420.02 s [vector] mut_foldr: OK (0.01s)
  11115. 1420.02 s [vector] +++ OK, passed 100 tests.
  11116. 1420.04 s [vector] mut_foldr': OK (0.01s)
  11117. 1420.04 s [vector] +++ OK, passed 100 tests.
  11118. 1420.06 s [vector] mut_foldl: OK (0.01s)
  11119. 1420.06 s [vector] +++ OK, passed 100 tests.
  11120. 1420.06 s [vector] mut_foldl': OK (0.01s)
  11121. 1420.08 s [vector] +++ OK, passed 100 tests.
  11122. 1420.08 s [vector] mut_ifoldr: OK (0.01s)
  11123. 1420.10 s [vector] +++ OK, passed 100 tests.
  11124. 1420.10 s [vector] mut_ifoldr': OK (0.02s)
  11125. 1420.10 s [vector] +++ OK, passed 100 tests.
  11126. 1420.11 s [vector] mut_ifoldl: OK (0.02s)
  11127. 1420.11 s [vector] +++ OK, passed 100 tests.
  11128. 1420.11 s [vector] mut_ifoldl': OK (0.01s)
  11129. 1420.11 s [vector] +++ OK, passed 100 tests.
  11130. 1420.14 s [vector] mut_foldM: OK (0.01s)
  11131. 1420.14 s [vector] +++ OK, passed 100 tests.
  11132. 1420.16 s [vector] mut_foldM': OK (0.02s)
  11133. 1420.16 s [vector] +++ OK, passed 100 tests.
  11134. 1420.18 s [vector] mut_foldrM: OK (0.02s)
  11135. 1420.18 s [vector] +++ OK, passed 100 tests.
  11136. 1420.19 s [vector] mut_foldrM': OK (0.02s)
  11137. 1420.19 s [vector] +++ OK, passed 100 tests.
  11138. 1420.19 s [vector] mut_ifoldM: OK (0.02s)
  11139. 1420.19 s [vector] +++ OK, passed 100 tests.
  11140. 1420.22 s [vector] mut_ifoldM': OK (0.02s)
  11141. 1420.22 s [vector] +++ OK, passed 100 tests.
  11142. 1420.24 s [vector] mut_ifoldrM: OK (0.02s)
  11143. 1420.24 s [vector] +++ OK, passed 100 tests.
  11144. 1420.27 s [vector] mut_ifoldrM': OK (0.03s)
  11145. 1420.27 s [vector] +++ OK, passed 100 tests.
  11146. 1420.27 s [vector] compare: OK
  11147. 1420.27 s [vector] +++ OK, passed 100 tests.
  11148. 1420.27 s [vector] maximum: OK
  11149. 1420.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11150. 1420.27 s [vector] minimum: OK
  11151. 1420.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11152. 1420.27 s [vector] minIndex: OK
  11153. 1420.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11154. 1420.27 s [vector] maxIndex: OK
  11155. 1420.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11156. 1420.27 s [vector] maximumBy: OK
  11157. 1420.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11158. 1420.28 s [vector] minimumBy: OK
  11159. 1420.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11160. 1420.28 s [vector] maximumOn: OK
  11161. 1420.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11162. 1420.28 s [vector] minimumOn: OK
  11163. 1420.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11164. 1420.28 s [vector] maxIndexBy: OK
  11165. 1420.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11166. 1420.28 s [vector] minIndexBy: OK
  11167. 1420.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11168. 1420.29 s [vector] ListFirstMaxIndexWins: OK
  11169. 1420.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11170. 1420.29 s [vector] FalseListFirstMaxIndexWins: OK
  11171. 1420.29 s [vector] +++ OK, failed as expected. (after 1 test):
  11172. 1420.29 s [vector] Exception:
  11173. 1420.29 s [vector] Prelude.foldr1: empty list
  11174. 1420.29 s [vector] CallStack (from HasCallStack):
  11175. 1420.29 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  11176. 1420.29 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  11177. 1420.29 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11178. 1420.29 s [vector] []
  11179. 1420.29 s [vector] mempty: OK
  11180. 1420.29 s [vector] +++ OK, passed 100 tests.
  11181. 1420.29 s [vector] mappend: OK
  11182. 1420.29 s [vector] +++ OK, passed 100 tests.
  11183. 1420.33 s [vector] mconcat: OK (0.04s)
  11184. 1420.94 s [vector] +++ OK, passed 100 tests.
  11185. 1420.94 s [vector] glength: OK
  11186. 1420.94 s [vector] +++ OK, passed 100 tests.
  11187. 1420.94 s [vector] sum: OK
  11188. 1420.94 s [vector] +++ OK, passed 100 tests.
  11189. 1420.94 s [vector] product: OK
  11190. 1420.94 s [vector] +++ OK, passed 100 tests.
  11191. 1420.94 s [vector] enumFromN: OK
  11192. 1420.94 s [vector] +++ OK, passed 100 tests.
  11193. 1420.94 s [vector] enumFromThenN: OK
  11194. 1420.94 s [vector] +++ OK, passed 100 tests.
  11195. 1420.94 s [vector] enumFromTo: OK
  11196. 1420.94 s [vector] +++ OK, passed 100 tests.
  11197. 1420.94 s [vector] enumFromThenTo: OK
  11198. 1420.94 s [vector] +++ OK, passed 100 tests.
  11199. 1420.94 s [vector] unstream
  11200. 1420.94 s [vector] unstream == vunstream (exact): OK
  11201. 1420.94 s [vector] +++ OK, passed 100 tests.
  11202. 1420.95 s [vector] unstream == vunstream (unknown): OK
  11203. 1420.95 s [vector] +++ OK, passed 100 tests.
  11204. 1420.95 s [vector] unstreamR ~= vunstream (exact): OK
  11205. 1420.95 s [vector] +++ OK, passed 100 tests.
  11206. 1420.95 s [vector] unstreamR ~= vunstream (unknown): OK
  11207. 1420.95 s [vector] +++ OK, passed 100 tests.
  11208. 1420.95 s [vector] Tests.Vector.Storable
  11209. 1420.95 s [vector] Data.Vector.Storable.Vector (Int)
  11210. 1420.95 s [vector] fromList.toList == id: OK
  11211. 1420.95 s [vector] +++ OK, passed 100 tests.
  11212. 1420.95 s [vector] toList.fromList == id: OK
  11213. 1420.95 s [vector] +++ OK, passed 100 tests.
  11214. 1420.95 s [vector] unstream.stream == id: OK
  11215. 1420.95 s [vector] +++ OK, passed 100 tests.
  11216. 1420.95 s [vector] stream.unstream == id: OK
  11217. 1420.95 s [vector] +++ OK, passed 100 tests.
  11218. 1420.95 s [vector] eq: OK
  11219. 1420.95 s [vector] +++ OK, passed 100 tests.
  11220. 1420.95 s [vector] length: OK
  11221. 1420.95 s [vector] +++ OK, passed 100 tests.
  11222. 1420.95 s [vector] null: OK
  11223. 1420.95 s [vector] +++ OK, passed 100 tests.
  11224. 1420.95 s [vector] index: OK
  11225. 1420.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11226. 1420.95 s [vector] safeIndex: OK
  11227. 1420.95 s [vector] +++ OK, passed 100 tests.
  11228. 1420.95 s [vector] head: OK
  11229. 1420.95 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11230. 1420.95 s [vector] last: OK
  11231. 1420.95 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11232. 1420.95 s [vector] unsafeIndex: OK
  11233. 1420.95 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11234. 1420.95 s [vector] unsafeHead: OK
  11235. 1420.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11236. 1420.95 s [vector] unsafeLast: OK
  11237. 1420.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11238. 1420.95 s [vector] slice: OK
  11239. 1420.95 s [vector] +++ OK, passed 100 tests.
  11240. 1420.95 s [vector] init: OK
  11241. 1420.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11242. 1420.95 s [vector] tail: OK
  11243. 1420.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11244. 1420.95 s [vector] take: OK
  11245. 1420.95 s [vector] +++ OK, passed 100 tests.
  11246. 1420.95 s [vector] drop: OK
  11247. 1420.95 s [vector] +++ OK, passed 100 tests.
  11248. 1420.95 s [vector] splitAt: OK
  11249. 1420.95 s [vector] +++ OK, passed 100 tests.
  11250. 1420.95 s [vector] empty: OK
  11251. 1420.95 s [vector] +++ OK, passed 100 tests.
  11252. 1420.95 s [vector] singleton: OK
  11253. 1420.95 s [vector] +++ OK, passed 100 tests.
  11254. 1420.95 s [vector] replicate: OK
  11255. 1420.95 s [vector] +++ OK, passed 100 tests.
  11256. 1420.95 s [vector] generate: OK
  11257. 1420.95 s [vector] +++ OK, passed 100 tests.
  11258. 1420.95 s [vector] iterateN: OK
  11259. 1420.95 s [vector] +++ OK, passed 100 tests.
  11260. 1420.95 s [vector] iterateNM: OK (0.03s)
  11261. 1420.95 s [vector] +++ OK, passed 100 tests.
  11262. 1420.95 s [vector] generateM: OK (0.03s)
  11263. 1420.95 s [vector] +++ OK, passed 100 tests.
  11264. 1420.95 s [vector] replicateM: OK
  11265. 1420.95 s [vector] +++ OK, passed 100 tests.
  11266. 1420.95 s [vector] create: OK
  11267. 1420.95 s [vector] +++ OK, passed 100 tests.
  11268. 1420.95 s [vector] createT: OK
  11269. 1420.95 s [vector] +++ OK, passed 100 tests.
  11270. 1420.95 s [vector] unfoldr: OK
  11271. 1420.95 s [vector] +++ OK, passed 100 tests.
  11272. 1420.95 s [vector] unfoldrN: OK
  11273. 1420.95 s [vector] +++ OK, passed 100 tests.
  11274. 1420.95 s [vector] unfoldrExactN: OK
  11275. 1420.95 s [vector] +++ OK, passed 100 tests.
  11276. 1420.95 s [vector] unfoldrM: OK
  11277. 1420.95 s [vector] +++ OK, passed 100 tests.
  11278. 1420.95 s [vector] unfoldrNM: OK
  11279. 1420.95 s [vector] +++ OK, passed 100 tests.
  11280. 1420.95 s [vector] unfoldrExactNM: OK (0.02s)
  11281. 1420.95 s [vector] +++ OK, passed 100 tests.
  11282. 1420.95 s [vector] constructN: OK
  11283. 1420.95 s [vector] +++ OK, passed 100 tests.
  11284. 1420.95 s [vector] constructrN: OK
  11285. 1420.95 s [vector] +++ OK, passed 100 tests.
  11286. 1420.95 s [vector] cons: OK
  11287. 1420.95 s [vector] +++ OK, passed 100 tests.
  11288. 1420.95 s [vector] snoc: OK
  11289. 1420.95 s [vector] +++ OK, passed 100 tests.
  11290. 1420.95 s [vector] append: OK
  11291. 1420.95 s [vector] +++ OK, passed 100 tests.
  11292. 1420.95 s [vector] concat: OK (0.01s)
  11293. 1420.95 s [vector] +++ OK, passed 100 tests.
  11294. 1420.95 s [vector] force: OK
  11295. 1420.95 s [vector] +++ OK, passed 100 tests.
  11296. 1420.95 s [vector] upd: OK
  11297. 1420.95 s [vector] +++ OK, passed 100 tests.
  11298. 1420.95 s [vector] accum: OK
  11299. 1420.95 s [vector] +++ OK, passed 100 tests.
  11300. 1420.95 s [vector] reverse: OK
  11301. 1420.95 s [vector] +++ OK, passed 100 tests.
  11302. 1420.95 s [vector] backpermute: OK
  11303. 1420.95 s [vector] +++ OK, passed 100 tests.
  11304. 1420.95 s [vector] map: OK
  11305. 1420.95 s [vector] +++ OK, passed 100 tests.
  11306. 1420.95 s [vector] imap: OK
  11307. 1420.95 s [vector] +++ OK, passed 100 tests.
  11308. 1420.95 s [vector] concatMap: OK
  11309. 1420.95 s [vector] +++ OK, passed 100 tests.
  11310. 1420.95 s [vector] mapM: OK
  11311. 1420.95 s [vector] +++ OK, passed 100 tests.
  11312. 1420.95 s [vector] mapM_: OK (0.02s)
  11313. 1420.95 s [vector] +++ OK, passed 100 tests.
  11314. 1420.95 s [vector] forM: OK
  11315. 1420.95 s [vector] +++ OK, passed 100 tests.
  11316. 1420.95 s [vector] forM_: OK (0.01s)
  11317. 1420.95 s [vector] +++ OK, passed 100 tests.
  11318. 1420.95 s [vector] imapM: OK
  11319. 1420.95 s [vector] +++ OK, passed 100 tests.
  11320. 1420.95 s [vector] imapM_: OK (0.01s)
  11321. 1420.95 s [vector] +++ OK, passed 100 tests.
  11322. 1420.95 s [vector] zipWith: OK
  11323. 1420.95 s [vector] +++ OK, passed 100 tests.
  11324. 1420.95 s [vector] zipWith3: OK
  11325. 1420.95 s [vector] +++ OK, passed 100 tests.
  11326. 1420.95 s [vector] izipWith: OK
  11327. 1420.95 s [vector] +++ OK, passed 100 tests.
  11328. 1420.95 s [vector] izipWith3: OK
  11329. 1420.95 s [vector] +++ OK, passed 100 tests.
  11330. 1420.95 s [vector] izipWithM: OK
  11331. 1420.95 s [vector] +++ OK, passed 100 tests.
  11332. 1420.95 s [vector] izipWithM_: OK (0.02s)
  11333. 1420.95 s [vector] +++ OK, passed 100 tests.
  11334. 1420.95 s [vector] zipWithM: OK
  11335. 1420.95 s [vector] +++ OK, passed 100 tests.
  11336. 1420.95 s [vector] zipWithM_: OK
  11337. 1420.95 s [vector] +++ OK, passed 100 tests.
  11338. 1420.95 s [vector] filter: OK
  11339. 1420.95 s [vector] +++ OK, passed 100 tests.
  11340. 1420.95 s [vector] ifilter: OK
  11341. 1420.95 s [vector] +++ OK, passed 100 tests.
  11342. 1420.95 s [vector] filterM: OK (0.02s)
  11343. 1420.95 s [vector] +++ OK, passed 100 tests.
  11344. 1420.95 s [vector] uniq: OK
  11345. 1420.95 s [vector] +++ OK, passed 100 tests.
  11346. 1420.95 s [vector] mapMaybe: OK
  11347. 1420.95 s [vector] +++ OK, passed 100 tests.
  11348. 1420.95 s [vector] imapMaybe: OK
  11349. 1420.95 s [vector] +++ OK, passed 100 tests.
  11350. 1420.95 s [vector] takeWhile: OK
  11351. 1420.95 s [vector] +++ OK, passed 100 tests.
  11352. 1420.95 s [vector] dropWhile: OK
  11353. 1420.95 s [vector] +++ OK, passed 100 tests.
  11354. 1420.95 s [vector] partition: OK
  11355. 1420.95 s [vector] +++ OK, passed 100 tests.
  11356. 1420.95 s [vector] partitionWith: OK
  11357. 1420.95 s [vector] +++ OK, passed 100 tests.
  11358. 1420.95 s [vector] span: OK
  11359. 1420.95 s [vector] +++ OK, passed 100 tests.
  11360. 1420.95 s [vector] break: OK
  11361. 1420.95 s [vector] +++ OK, passed 100 tests.
  11362. 1420.95 s [vector] spanR: OK
  11363. 1420.95 s [vector] +++ OK, passed 100 tests.
  11364. 1420.95 s [vector] breakR: OK
  11365. 1420.95 s [vector] +++ OK, passed 100 tests.
  11366. 1420.95 s [vector] groupBy: OK
  11367. 1420.95 s [vector] +++ OK, passed 100 tests.
  11368. 1420.95 s [vector] elem: OK
  11369. 1420.95 s [vector] +++ OK, passed 100 tests.
  11370. 1420.95 s [vector] notElem: OK
  11371. 1420.95 s [vector] +++ OK, passed 100 tests.
  11372. 1420.95 s [vector] find: OK
  11373. 1420.95 s [vector] +++ OK, passed 100 tests.
  11374. 1420.95 s [vector] findIndex: OK
  11375. 1420.95 s [vector] +++ OK, passed 100 tests.
  11376. 1420.95 s [vector] findIndexR: OK
  11377. 1420.95 s [vector] +++ OK, passed 100 tests.
  11378. 1420.95 s [vector] findIndices: OK
  11379. 1420.95 s [vector] +++ OK, passed 100 tests.
  11380. 1420.95 s [vector] elemIndex: OK
  11381. 1420.95 s [vector] +++ OK, passed 100 tests.
  11382. 1420.95 s [vector] elemIndices: OK
  11383. 1420.95 s [vector] +++ OK, passed 100 tests.
  11384. 1420.95 s [vector] foldl: OK
  11385. 1420.95 s [vector] +++ OK, passed 100 tests.
  11386. 1420.95 s [vector] foldl1: OK
  11387. 1420.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11388. 1420.95 s [vector] foldl': OK
  11389. 1420.95 s [vector] +++ OK, passed 100 tests.
  11390. 1420.95 s [vector] foldl1': OK
  11391. 1420.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11392. 1420.95 s [vector] foldr: OK
  11393. 1420.95 s [vector] +++ OK, passed 100 tests.
  11394. 1420.95 s [vector] foldr1: OK
  11395. 1420.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11396. 1420.95 s [vector] foldr': OK
  11397. 1420.95 s [vector] +++ OK, passed 100 tests.
  11398. 1420.95 s [vector] foldr1': OK
  11399. 1420.95 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11400. 1420.95 s [vector] ifoldl: OK
  11401. 1420.95 s [vector] +++ OK, passed 100 tests.
  11402. 1420.95 s [vector] ifoldl': OK
  11403. 1420.95 s [vector] +++ OK, passed 100 tests.
  11404. 1420.95 s [vector] ifoldr: OK
  11405. 1420.95 s [vector] +++ OK, passed 100 tests.
  11406. 1420.95 s [vector] ifoldr': OK
  11407. 1420.95 s [vector] +++ OK, passed 100 tests.
  11408. 1420.95 s [vector] ifoldM: OK
  11409. 1420.95 s [vector] +++ OK, passed 100 tests.
  11410. 1420.95 s [vector] ifoldM': OK
  11411. 1420.95 s [vector] +++ OK, passed 100 tests.
  11412. 1420.95 s [vector] ifoldM_: OK (0.01s)
  11413. 1420.95 s [vector] +++ OK, passed 100 tests.
  11414. 1420.95 s [vector] ifoldM'_: OK (0.02s)
  11415. 1420.95 s [vector] +++ OK, passed 100 tests.
  11416. 1420.95 s [vector] all: OK
  11417. 1420.95 s [vector] +++ OK, passed 100 tests.
  11418. 1420.95 s [vector] any: OK
  11419. 1420.95 s [vector] +++ OK, passed 100 tests.
  11420. 1420.95 s [vector] prescanl: OK
  11421. 1420.95 s [vector] +++ OK, passed 100 tests.
  11422. 1420.95 s [vector] prescanl': OK
  11423. 1420.95 s [vector] +++ OK, passed 100 tests.
  11424. 1420.95 s [vector] postscanl: OK
  11425. 1420.95 s [vector] +++ OK, passed 100 tests.
  11426. 1420.95 s [vector] postscanl': OK
  11427. 1420.95 s [vector] +++ OK, passed 100 tests.
  11428. 1420.95 s [vector] scanl: OK
  11429. 1420.95 s [vector] +++ OK, passed 100 tests.
  11430. 1420.95 s [vector] scanl': OK
  11431. 1420.95 s [vector] +++ OK, passed 100 tests.
  11432. 1420.95 s [vector] scanl1: OK
  11433. 1420.95 s [vector] +++ OK, passed 100 tests.
  11434. 1420.95 s [vector] scanl1': OK
  11435. 1420.95 s [vector] +++ OK, passed 100 tests.
  11436. 1420.95 s [vector] iscanl: OK
  11437. 1420.95 s [vector] +++ OK, passed 100 tests.
  11438. 1420.95 s [vector] iscanl': OK
  11439. 1420.95 s [vector] +++ OK, passed 100 tests.
  11440. 1420.95 s [vector] prescanr: OK
  11441. 1420.95 s [vector] +++ OK, passed 100 tests.
  11442. 1420.95 s [vector] prescanr': OK
  11443. 1420.95 s [vector] +++ OK, passed 100 tests.
  11444. 1420.95 s [vector] postscanr: OK
  11445. 1420.95 s [vector] +++ OK, passed 100 tests.
  11446. 1420.95 s [vector] postscanr': OK
  11447. 1420.95 s [vector] +++ OK, passed 100 tests.
  11448. 1420.95 s [vector] scanr: OK
  11449. 1420.95 s [vector] +++ OK, passed 100 tests.
  11450. 1420.95 s [vector] scanr': OK
  11451. 1420.95 s [vector] +++ OK, passed 100 tests.
  11452. 1420.95 s [vector] scanr1: OK
  11453. 1420.95 s [vector] +++ OK, passed 100 tests.
  11454. 1420.95 s [vector] scanr1': OK
  11455. 1420.95 s [vector] +++ OK, passed 100 tests.
  11456. 1420.95 s [vector] iscanr: OK
  11457. 1420.95 s [vector] +++ OK, passed 100 tests.
  11458. 1420.95 s [vector] iscanr': OK
  11459. 1420.95 s [vector] +++ OK, passed 100 tests.
  11460. 1420.95 s [vector] mut_read: OK
  11461. 1420.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11462. 1420.95 s [vector] mut_write: OK
  11463. 1420.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11464. 1420.95 s [vector] mut_modify: OK
  11465. 1420.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11466. 1420.95 s [vector] mut_generate: OK
  11467. 1420.95 s [vector] +++ OK, passed 100 tests.
  11468. 1420.95 s [vector] mut_generateM: OK (0.01s)
  11469. 1420.95 s [vector] +++ OK, passed 100 tests.
  11470. 1420.95 s [vector] mut_mapM_: OK (0.02s)
  11471. 1420.95 s [vector] +++ OK, passed 100 tests.
  11472. 1420.95 s [vector] mut_imapM_: OK (0.01s)
  11473. 1420.95 s [vector] +++ OK, passed 100 tests.
  11474. 1420.95 s [vector] mut_forM_: OK (0.02s)
  11475. 1420.95 s [vector] +++ OK, passed 100 tests.
  11476. 1420.95 s [pandoc-lua-engine] Dependency aeson: using aeson-2.2.3.0
  11477. 1420.95 s [pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
  11478. 1420.95 s [pandoc-lua-engine] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
  11479. 1420.95 s [pandoc-lua-engine] Dependency citeproc >=0.8 && <0.10: using citeproc-0.9.0.1
  11480. 1420.95 s [pandoc-lua-engine] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
  11481. 1420.95 s [pandoc-lua-engine] Dependency crypton >=0.30 && <1.1: using crypton-1.0.4
  11482. 1420.95 s [pandoc-lua-engine] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
  11483. 1420.96 s [pandoc-lua-engine] Dependency doclayout >=0.5 && <0.6: using doclayout-0.5.0.1
  11484. 1420.96 s [pandoc-lua-engine] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
  11485. 1420.96 s [pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
  11486. 1420.96 s [pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
  11487. 1420.96 s [pandoc-lua-engine] Dependency hslua-module-doclayout >=1.2 && <1.3: using
  11488. 1420.96 s [pandoc-lua-engine] hslua-module-doclayout-1.2.0.1
  11489. 1420.96 s [pandoc-lua-engine] Dependency hslua-module-path >=1.1 && <1.2: using hslua-module-path-1.1.1
  11490. 1420.96 s [pandoc-lua-engine] Dependency hslua-module-system >=1.1 && <1.3: using hslua-module-system-1.1.3
  11491. 1420.96 s [pandoc-lua-engine] Dependency hslua-module-text >=1.1 && <1.2: using hslua-module-text-1.1.1
  11492. 1420.96 s [pandoc-lua-engine] Dependency hslua-module-version >=1.1 && <1.2: using
  11493. 1420.96 s [pandoc-lua-engine] hslua-module-version-1.1.1
  11494. 1420.96 s [pandoc-lua-engine] Dependency hslua-module-zip >=1.1.3 && <1.2: using hslua-module-zip-1.1.4
  11495. 1420.96 s [pandoc-lua-engine] Dependency hslua-repl >=0.1.1 && <0.2: using hslua-repl-0.1.2
  11496. 1420.96 s [pandoc-lua-engine] Dependency lpeg >=1.1 && <1.2: using lpeg-1.1.0
  11497. 1420.96 s [pandoc-lua-engine] Dependency mtl >=2.2 && <2.4: using mtl-2.3.1
  11498. 1420.96 s [pandoc-lua-engine] Dependency pandoc >=3.7 && <3.8: using pandoc-3.7.0.2
  11499. 1420.96 s [pandoc-lua-engine] Dependency pandoc-lua-marshal >=0.3 && <0.4: using pandoc-lua-marshal-0.3.1
  11500. 1420.96 s [pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
  11501. 1420.96 s [pandoc-lua-engine] Dependency parsec >=3.1 && <3.2: using parsec-3.1.18.0
  11502. 1420.96 s [pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
  11503. 1420.96 s [pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
  11504. 1420.96 s [pandoc-lua-engine] Dependency bytestring: using bytestring-0.12.2.0
  11505. 1420.96 s [pandoc-lua-engine] Dependency data-default: using data-default-0.8.0.1
  11506. 1420.96 s [pandoc-lua-engine] Dependency directory: using directory-1.3.8.5
  11507. 1420.96 s [pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
  11508. 1420.96 s [pandoc-lua-engine] Dependency filepath: using filepath-1.5.4.0
  11509. 1420.96 s [pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
  11510. 1420.96 s [pandoc-lua-engine] Dependency pandoc: using pandoc-3.7.0.2
  11511. 1420.96 s [pandoc-lua-engine] Dependency pandoc-lua-engine: using pandoc-lua-engine-0.4.3
  11512. 1420.96 s [pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
  11513. 1420.96 s [pandoc-lua-engine] Dependency tasty: using tasty-1.5.3
  11514. 1420.96 s [pandoc-lua-engine] Dependency tasty-golden: using tasty-golden-2.3.5
  11515. 1420.96 s [pandoc-lua-engine] Dependency tasty-hunit: using tasty-hunit-0.10.2
  11516. 1420.96 s [pandoc-lua-engine] Dependency tasty-lua >=1.1 && <1.2: using tasty-lua-1.1.2
  11517. 1420.96 s [pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
  11518. 1420.96 s [pandoc-lua-engine] Source component graph:
  11519. 1420.96 s [pandoc-lua-engine] component lib
  11520. 1420.96 s [pandoc-lua-engine] component test:test-pandoc-lua-engine dependency lib
  11521. 1420.96 s [pandoc-lua-engine] Configured component graph:
  11522. 1420.96 s [pandoc-lua-engine] component pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11523. 1420.96 s [pandoc-lua-engine] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11524. 1420.96 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11525. 1420.96 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11526. 1420.96 s [pandoc-lua-engine] include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
  11527. 1420.96 s [pandoc-lua-engine] include containers-0.7-504a
  11528. 1420.96 s [pandoc-lua-engine] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  11529. 1420.96 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11530. 1420.96 s [pandoc-lua-engine] include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
  11531. 1420.96 s [pandoc-lua-engine] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11532. 1420.96 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11533. 1420.96 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11534. 1420.96 s [pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
  11535. 1420.96 s [pandoc-lua-engine] include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
  11536. 1420.96 s [pandoc-lua-engine] include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
  11537. 1420.96 s [pandoc-lua-engine] include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
  11538. 1420.96 s [pandoc-lua-engine] include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
  11539. 1420.96 s [pandoc-lua-engine] include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
  11540. 1420.96 s [pandoc-lua-engine] include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
  11541. 1420.96 s [pandoc-lua-engine] include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
  11542. 1420.96 s [pandoc-lua-engine] include mtl-2.3.1-b4af
  11543. 1420.96 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11544. 1420.96 s [pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
  11545. 1420.96 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11546. 1420.96 s [pandoc-lua-engine] include parsec-3.1.18.0-b178
  11547. 1420.96 s [pandoc-lua-engine] include text-2.1.3-c691
  11548. 1420.96 s [pandoc-lua-engine] component pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
  11549. 1420.96 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11550. 1420.96 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11551. 1420.96 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11552. 1420.96 s [pandoc-lua-engine] include directory-1.3.8.5-c84a
  11553. 1420.96 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11554. 1420.96 s [pandoc-lua-engine] include filepath-1.5.4.0-e600
  11555. 1420.96 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11556. 1420.96 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11557. 1420.96 s [pandoc-lua-engine] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11558. 1420.96 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11559. 1420.96 s [pandoc-lua-engine] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  11560. 1420.96 s [pandoc-lua-engine] include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
  11561. 1420.96 s [pandoc-lua-engine] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  11562. 1420.96 s [pandoc-lua-engine] include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
  11563. 1420.96 s [pandoc-lua-engine] include text-2.1.3-c691
  11564. 1420.96 s [pandoc-lua-engine] Linked component graph:
  11565. 1420.96 s [pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11566. 1420.96 s [pandoc-lua-engine] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11567. 1420.96 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11568. 1420.96 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11569. 1420.96 s [pandoc-lua-engine] include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
  11570. 1420.96 s [pandoc-lua-engine] include containers-0.7-504a
  11571. 1420.96 s [pandoc-lua-engine] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  11572. 1420.96 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11573. 1420.96 s [pandoc-lua-engine] include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
  11574. 1420.96 s [pandoc-lua-engine] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11575. 1420.96 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11576. 1420.96 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11577. 1420.96 s [pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
  11578. 1420.96 s [pandoc-lua-engine] include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
  11579. 1420.96 s [pandoc-lua-engine] include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
  11580. 1420.96 s [pandoc-lua-engine] include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
  11581. 1420.96 s [pandoc-lua-engine] include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
  11582. 1420.96 s [pandoc-lua-engine] include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
  11583. 1420.96 s [pandoc-lua-engine] include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
  11584. 1420.96 s [pandoc-lua-engine] include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
  11585. 1420.96 s [pandoc-lua-engine] include mtl-2.3.1-b4af
  11586. 1420.96 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11587. 1420.96 s [pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
  11588. 1420.96 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11589. 1420.96 s [pandoc-lua-engine] include parsec-3.1.18.0-b178
  11590. 1420.96 s [pandoc-lua-engine] include text-2.1.3-c691
  11591. 1420.96 s [pandoc-lua-engine] Text.Pandoc.Lua=pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4:Text.Pandoc.Lua
  11592. 1420.96 s [pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
  11593. 1420.96 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11594. 1420.96 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11595. 1420.96 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11596. 1420.96 s [pandoc-lua-engine] include directory-1.3.8.5-c84a
  11597. 1420.96 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11598. 1420.96 s [pandoc-lua-engine] include filepath-1.5.4.0-e600
  11599. 1420.96 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11600. 1420.96 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11601. 1420.96 s [pandoc-lua-engine] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11602. 1420.96 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11603. 1420.96 s [pandoc-lua-engine] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  11604. 1420.96 s [pandoc-lua-engine] include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
  11605. 1420.96 s [pandoc-lua-engine] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  11606. 1420.96 s [pandoc-lua-engine] include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
  11607. 1420.96 s [pandoc-lua-engine] include text-2.1.3-c691
  11608. 1420.96 s [pandoc-lua-engine] Ready component graph:
  11609. 1420.96 s [pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11610. 1420.96 s [pandoc-lua-engine] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11611. 1420.96 s [pandoc-lua-engine] depends base-4.20.2.0-64da
  11612. 1420.96 s [pandoc-lua-engine] depends bytestring-0.12.2.0-262e
  11613. 1420.96 s [pandoc-lua-engine] depends citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
  11614. 1420.96 s [pandoc-lua-engine] depends containers-0.7-504a
  11615. 1420.96 s [pandoc-lua-engine] depends crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  11616. 1420.96 s [pandoc-lua-engine] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11617. 1420.96 s [pandoc-lua-engine] depends doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
  11618. 1420.96 s [pandoc-lua-engine] depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11619. 1420.96 s [pandoc-lua-engine] depends exceptions-0.10.9-1a12
  11620. 1420.96 s [pandoc-lua-engine] depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11621. 1420.96 s [pandoc-lua-engine] depends hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
  11622. 1420.96 s [pandoc-lua-engine] depends hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
  11623. 1420.96 s [pandoc-lua-engine] depends hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
  11624. 1420.96 s [pandoc-lua-engine] depends hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
  11625. 1420.96 s [pandoc-lua-engine] depends hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
  11626. 1420.96 s [pandoc-lua-engine] depends hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
  11627. 1420.96 s [pandoc-lua-engine] depends hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
  11628. 1420.96 s [pandoc-lua-engine] depends lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
  11629. 1420.96 s [pandoc-lua-engine] depends mtl-2.3.1-b4af
  11630. 1420.96 s [pandoc-lua-engine] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11631. 1420.96 s [vector] mut_iforM_: OK (0.02s)
  11632. 1420.96 s [vector] +++ OK, passed 100 tests.
  11633. 1420.96 s [vector] mut_foldr: OK
  11634. 1420.96 s [vector] +++ OK, passed 100 tests.
  11635. 1420.96 s [vector] mut_foldr': OK
  11636. 1420.96 s [vector] +++ OK, passed 100 tests.
  11637. 1420.96 s [vector] mut_foldl: OK
  11638. 1420.96 s [vector] +++ OK, passed 100 tests.
  11639. 1420.96 s [vector] mut_foldl': OK
  11640. 1420.96 s [vector] +++ OK, passed 100 tests.
  11641. 1420.96 s [vector] mut_ifoldr: OK
  11642. 1420.96 s [vector] +++ OK, passed 100 tests.
  11643. 1420.96 s [vector] mut_ifoldr': OK
  11644. 1420.96 s [vector] +++ OK, passed 100 tests.
  11645. 1420.96 s [vector] mut_ifoldl: OK
  11646. 1420.96 s [vector] +++ OK, passed 100 tests.
  11647. 1420.96 s [vector] mut_ifoldl': OK
  11648. 1420.96 s [vector] +++ OK, passed 100 tests.
  11649. 1420.96 s [vector] mut_foldM: OK
  11650. 1420.96 s [vector] +++ OK, passed 100 tests.
  11651. 1420.96 s [vector] mut_foldM': OK
  11652. 1420.96 s [vector] +++ OK, passed 100 tests.
  11653. 1420.96 s [vector] mut_foldrM: OK
  11654. 1420.96 s [vector] +++ OK, passed 100 tests.
  11655. 1420.96 s [vector] mut_foldrM': OK
  11656. 1420.96 s [vector] +++ OK, passed 100 tests.
  11657. 1420.96 s [vector] mut_ifoldM: OK
  11658. 1420.96 s [vector] +++ OK, passed 100 tests.
  11659. 1420.96 s [vector] mut_ifoldM': OK
  11660. 1420.96 s [vector] +++ OK, passed 100 tests.
  11661. 1420.96 s [vector] mut_ifoldrM: OK
  11662. 1420.96 s [vector] +++ OK, passed 100 tests.
  11663. 1420.96 s [vector] mut_ifoldrM': OK
  11664. 1420.96 s [vector] +++ OK, passed 100 tests.
  11665. 1420.96 s [vector] compare: OK
  11666. 1420.96 s [vector] +++ OK, passed 100 tests.
  11667. 1420.96 s [vector] maximum: OK
  11668. 1420.96 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11669. 1420.96 s [vector] minimum: OK
  11670. 1420.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11671. 1420.96 s [vector] minIndex: OK
  11672. 1420.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11673. 1420.96 s [vector] maxIndex: OK
  11674. 1420.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11675. 1420.96 s [vector] maximumBy: OK
  11676. 1420.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11677. 1420.96 s [vector] minimumBy: OK
  11678. 1420.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11679. 1420.96 s [vector] maximumOn: OK
  11680. 1420.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11681. 1420.96 s [vector] minimumOn: OK
  11682. 1420.96 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11683. 1420.96 s [vector] maxIndexBy: OK
  11684. 1420.96 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11685. 1420.96 s [vector] minIndexBy: OK
  11686. 1420.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11687. 1420.96 s [vector] ListFirstMaxIndexWins: OK
  11688. 1420.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11689. 1420.96 s [vector] FalseListFirstMaxIndexWins: OK
  11690. 1420.96 s [vector] +++ OK, failed as expected. (after 1 test):
  11691. 1420.96 s [vector] Exception:
  11692. 1420.96 s [vector] Prelude.foldr1: empty list
  11693. 1420.96 s [vector] CallStack (from HasCallStack):
  11694. 1420.96 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  11695. 1420.96 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  11696. 1420.96 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11697. 1420.96 s [vector] []
  11698. 1420.96 s [vector] mempty: OK
  11699. 1420.96 s [vector] +++ OK, passed 100 tests.
  11700. 1420.96 s [vector] mappend: OK
  11701. 1420.96 s [vector] +++ OK, passed 100 tests.
  11702. 1420.96 s [vector] mconcat: OK (0.02s)
  11703. 1420.96 s [vector] +++ OK, passed 100 tests.
  11704. 1420.96 s [vector] glength: OK
  11705. 1420.96 s [vector] +++ OK, passed 100 tests.
  11706. 1420.97 s [vector] sum: OK
  11707. 1420.97 s [vector] +++ OK, passed 100 tests.
  11708. 1420.97 s [vector] product: OK
  11709. 1420.97 s [vector] +++ OK, passed 100 tests.
  11710. 1420.97 s [vector] enumFromN: OK
  11711. 1420.97 s [vector] +++ OK, passed 100 tests.
  11712. 1420.97 s [vector] enumFromThenN: OK
  11713. 1420.97 s [vector] +++ OK, passed 100 tests.
  11714. 1420.97 s [vector] enumFromTo: OK
  11715. 1420.97 s [vector] +++ OK, passed 100 tests.
  11716. 1420.97 s [vector] enumFromThenTo: OK
  11717. 1420.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11718. 1420.97 s [vector] Data.Vector.Storable.Vector (Double)
  11719. 1420.97 s [vector] fromList.toList == id: OK
  11720. 1420.97 s [vector] +++ OK, passed 100 tests.
  11721. 1420.97 s [vector] toList.fromList == id: OK
  11722. 1420.97 s [vector] +++ OK, passed 100 tests.
  11723. 1420.97 s [vector] unstream.stream == id: OK
  11724. 1420.97 s [vector] +++ OK, passed 100 tests.
  11725. 1420.97 s [vector] stream.unstream == id: OK
  11726. 1420.97 s [vector] +++ OK, passed 100 tests.
  11727. 1420.97 s [vector] eq: OK
  11728. 1420.97 s [vector] +++ OK, passed 100 tests.
  11729. 1420.97 s [vector] length: OK
  11730. 1420.97 s [vector] +++ OK, passed 100 tests.
  11731. 1420.97 s [vector] null: OK
  11732. 1420.97 s [vector] +++ OK, passed 100 tests.
  11733. 1420.98 s [vector] index: OK
  11734. 1420.98 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11735. 1420.98 s [vector] safeIndex: OK
  11736. 1420.98 s [vector] +++ OK, passed 100 tests.
  11737. 1420.98 s [vector] head: OK
  11738. 1420.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11739. 1420.98 s [vector] last: OK
  11740. 1420.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11741. 1420.98 s [vector] unsafeIndex: OK
  11742. 1420.98 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11743. 1420.98 s [vector] unsafeHead: OK
  11744. 1420.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11745. 1420.98 s [vector] unsafeLast: OK
  11746. 1420.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11747. 1420.98 s [vector] slice: OK
  11748. 1420.98 s [vector] +++ OK, passed 100 tests.
  11749. 1420.98 s [vector] init: OK
  11750. 1420.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11751. 1420.99 s [vector] tail: OK
  11752. 1420.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11753. 1420.99 s [vector] take: OK
  11754. 1420.99 s [vector] +++ OK, passed 100 tests.
  11755. 1420.99 s [vector] drop: OK
  11756. 1420.99 s [vector] +++ OK, passed 100 tests.
  11757. 1421.00 s [vector] splitAt: OK
  11758. 1421.00 s [vector] +++ OK, passed 100 tests.
  11759. 1421.00 s [vector] empty: OK
  11760. 1421.00 s [vector] +++ OK, passed 100 tests.
  11761. 1421.00 s [vector] singleton: OK
  11762. 1421.00 s [vector] +++ OK, passed 100 tests.
  11763. 1421.00 s [vector] replicate: OK
  11764. 1421.00 s [vector] +++ OK, passed 100 tests.
  11765. 1421.00 s [vector] generate: OK
  11766. 1421.00 s [vector] +++ OK, passed 100 tests.
  11767. 1421.00 s [vector] iterateN: OK
  11768. 1421.00 s [vector] +++ OK, passed 100 tests.
  11769. 1421.00 s [pandoc-lua-engine] depends pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
  11770. 1421.00 s [pandoc-lua-engine] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11771. 1421.00 s [pandoc-lua-engine] depends parsec-3.1.18.0-b178
  11772. 1421.00 s [pandoc-lua-engine] depends text-2.1.3-c691
  11773. 1421.00 s [pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
  11774. 1421.00 s [pandoc-lua-engine] depends base-4.20.2.0-64da
  11775. 1421.00 s [pandoc-lua-engine] depends bytestring-0.12.2.0-262e
  11776. 1421.00 s [pandoc-lua-engine] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11777. 1421.00 s [pandoc-lua-engine] depends directory-1.3.8.5-c84a
  11778. 1421.00 s [pandoc-lua-engine] depends exceptions-0.10.9-1a12
  11779. 1421.00 s [pandoc-lua-engine] depends filepath-1.5.4.0-e600
  11780. 1421.00 s [pandoc-lua-engine] depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11781. 1421.00 s [pandoc-lua-engine] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11782. 1421.00 s [pandoc-lua-engine] depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11783. 1421.00 s [pandoc-lua-engine] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11784. 1421.00 s [pandoc-lua-engine] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  11785. 1421.00 s [pandoc-lua-engine] depends tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
  11786. 1421.00 s [pandoc-lua-engine] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  11787. 1421.00 s [pandoc-lua-engine] depends tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
  11788. 1421.00 s [pandoc-lua-engine] depends text-2.1.3-c691
  11789. 1421.00 s [pandoc-lua-engine] Using Cabal-3.12.1.0 compiled by ghc-9.10
  11790. 1421.00 s [pandoc-lua-engine] Using compiler: ghc-9.10.3
  11791. 1421.00 s [pandoc-lua-engine] Using install prefix:
  11792. 1421.00 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
  11793. 1421.00 s [pandoc-lua-engine] Executables installed in:
  11794. 1421.00 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/bin
  11795. 1421.00 s [pandoc-lua-engine] Libraries installed in:
  11796. 1421.00 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
  11797. 1421.01 s [pandoc-lua-engine] Dynamic Libraries installed in:
  11798. 1421.01 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
  11799. 1421.01 s [pandoc-lua-engine] Private executables installed in:
  11800. 1421.01 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
  11801. 1421.01 s [pandoc-lua-engine] Data files installed in:
  11802. 1421.01 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
  11803. 1421.01 s [pandoc-lua-engine] Documentation installed in:
  11804. 1421.01 s [pandoc-lua-engine] /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3
  11805. 1421.01 s [pandoc-lua-engine] Configuration files installed in:
  11806. 1421.01 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/etc
  11807. 1421.01 s [pandoc-lua-engine] No alex found
  11808. 1421.01 s [pandoc-lua-engine] Using ar found on system at:
  11809. 1421.01 s [pandoc-lua-engine] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  11810. 1421.01 s [pandoc-lua-engine] No c2hs found
  11811. 1421.01 s [pandoc-lua-engine] No cpphs found
  11812. 1421.01 s [pandoc-lua-engine] No doctest found
  11813. 1421.01 s [pandoc-lua-engine] Using gcc version 14.3.0 given by user at:
  11814. 1421.01 s [pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  11815. 1421.01 s [pandoc-lua-engine] Using ghc version 9.10.3 found on system at:
  11816. 1421.01 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  11817. 1421.01 s [pandoc-lua-engine] Using ghc-pkg version 9.10.3 found on system at:
  11818. 1421.01 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  11819. 1421.01 s [pandoc-lua-engine] No ghcjs found
  11820. 1421.01 s [pandoc-lua-engine] No ghcjs-pkg found
  11821. 1421.01 s [pandoc-lua-engine] No greencard found
  11822. 1421.01 s [pandoc-lua-engine] Using haddock version 2.31.1 found on system at:
  11823. 1421.01 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  11824. 1421.01 s [pandoc-lua-engine] No happy found
  11825. 1421.01 s [pandoc-lua-engine] Using haskell-suite found on system at: haskell-suite-dummy-location
  11826. 1421.01 s [pandoc-lua-engine] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  11827. 1421.01 s [pandoc-lua-engine] No hmake found
  11828. 1421.01 s [pandoc-lua-engine] Using hpc version 0.69 found on system at:
  11829. 1421.01 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  11830. 1421.01 s [pandoc-lua-engine] Using hsc2hs version 0.68.10 found on system at:
  11831. 1421.01 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  11832. 1421.01 s [pandoc-lua-engine] Using hscolour version 1.25 found on system at:
  11833. 1421.01 s [pandoc-lua-engine] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  11834. 1421.01 s [pandoc-lua-engine] No jhc found
  11835. 1421.01 s [pandoc-lua-engine] Using ld found on system at:
  11836. 1421.01 s [pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  11837. 1421.01 s [pandoc-lua-engine] No pkg-config found
  11838. 1421.01 s [pandoc-lua-engine] Using runghc version 9.10.3 found on system at:
  11839. 1421.01 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  11840. 1421.01 s [pandoc-lua-engine] Using strip version 2.44 found on system at:
  11841. 1421.01 s [pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  11842. 1421.01 s [pandoc-lua-engine] Using tar found on system at:
  11843. 1421.01 s [pandoc-lua-engine] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  11844. 1421.01 s [pandoc-lua-engine] No uhc found
  11845. 1421.02 s [vector] iterateNM: OK (0.02s)
  11846. 1421.02 s [vector] +++ OK, passed 100 tests.
  11847. 1421.06 s [vector] generateM: OK (0.03s)
  11848. 1421.06 s [vector] +++ OK, passed 100 tests.
  11849. 1421.06 s [vector] replicateM: OK
  11850. 1421.06 s [vector] +++ OK, passed 100 tests.
  11851. 1421.06 s [vector] create: OK
  11852. 1421.06 s [vector] +++ OK, passed 100 tests.
  11853. 1421.06 s [vector] createT: OK
  11854. 1421.06 s [vector] +++ OK, passed 100 tests.
  11855. 1421.06 s [vector] unfoldr: OK
  11856. 1421.06 s [vector] +++ OK, passed 100 tests.
  11857. 1421.06 s [vector] unfoldrN: OK
  11858. 1421.06 s [vector] +++ OK, passed 100 tests.
  11859. 1421.08 s [vector] unfoldrExactN: OK
  11860. 1421.08 s [vector] +++ OK, passed 100 tests.
  11861. 1421.08 s [vector] unfoldrM: OK
  11862. 1421.08 s [vector] +++ OK, passed 100 tests.
  11863. 1421.08 s [vector] unfoldrNM: OK
  11864. 1421.08 s [vector] +++ OK, passed 100 tests.
  11865. 1421.11 s [vector] unfoldrExactNM: OK (0.03s)
  11866. 1421.12 s [vector] +++ OK, passed 100 tests.
  11867. 1421.12 s [vector] constructN: OK (0.01s)
  11868. 1421.12 s [vector] +++ OK, passed 100 tests.
  11869. 1421.13 s [vector] constructrN: OK (0.02s)
  11870. 1421.13 s [vector] +++ OK, passed 100 tests.
  11871. 1421.13 s [vector] cons: OK
  11872. 1421.13 s [vector] +++ OK, passed 100 tests.
  11873. 1421.13 s [vector] snoc: OK
  11874. 1421.13 s [vector] +++ OK, passed 100 tests.
  11875. 1421.13 s [vector] append: OK
  11876. 1421.13 s [vector] +++ OK, passed 100 tests.
  11877. 1421.15 s [vector] concat: OK (0.02s)
  11878. 1421.15 s [vector] +++ OK, passed 100 tests.
  11879. 1421.15 s [vector] force: OK
  11880. 1421.15 s [vector] +++ OK, passed 100 tests.
  11881. 1421.16 s [vector] upd: OK
  11882. 1421.16 s [vector] +++ OK, passed 100 tests.
  11883. 1421.17 s [vector] accum: OK (0.02s)
  11884. 1421.17 s [vector] +++ OK, passed 100 tests.
  11885. 1421.18 s [vector] reverse: OK
  11886. 1421.18 s [vector] +++ OK, passed 100 tests.
  11887. 1421.18 s [vector] backpermute: OK
  11888. 1421.18 s [vector] +++ OK, passed 100 tests.
  11889. 1421.20 s [vector] map: OK (0.01s)
  11890. 1421.20 s [vector] +++ OK, passed 100 tests.
  11891. 1421.20 s [vector] imap: OK (0.01s)
  11892. 1421.20 s [vector] +++ OK, passed 100 tests.
  11893. 1421.22 s [vector] concatMap: OK (0.01s)
  11894. 1421.22 s [vector] +++ OK, passed 100 tests.
  11895. 1421.24 s [vector] mapM: OK (0.01s)
  11896. 1421.24 s [vector] +++ OK, passed 100 tests.
  11897. 1421.27 s [vector] mapM_: OK (0.05s)
  11898. 1421.28 s [pandoc-server] Dependency aeson >=2.0 && <2.3: using aeson-2.2.3.0
  11899. 1421.28 s [pandoc-server] Dependency base >=4.12 && <5: using base-4.20.2.0
  11900. 1421.28 s [pandoc-server] Dependency base64-bytestring >=0.1 && <1.3: using base64-bytestring-1.2.1.0
  11901. 1421.28 s [pandoc-server] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
  11902. 1421.28 s [pandoc-server] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
  11903. 1421.28 s [pandoc-server] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
  11904. 1421.28 s [pandoc-server] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
  11905. 1421.28 s [pandoc-server] Dependency pandoc >=3.5 && <3.8: using pandoc-3.7.0.2
  11906. 1421.28 s [pandoc-server] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
  11907. 1421.28 s [pandoc-server] Dependency servant-server >=0.19 && <0.21: using servant-server-0.20.3.0
  11908. 1421.28 s [pandoc-server] Dependency skylighting >=0.13 && <0.15: using skylighting-0.14.7
  11909. 1421.28 s [pandoc-server] Dependency text >=1.1.1.0 && <2.2: using text-2.1.3
  11910. 1421.28 s [pandoc-server] Dependency unicode-collation >=0.1.1 && <0.2: using unicode-collation-0.1.3.6
  11911. 1421.28 s [pandoc-server] Dependency wai >=3.2 && <3.3: using wai-3.2.4
  11912. 1421.28 s [pandoc-server] Dependency wai-cors >=0.2.7 && <0.3: using wai-cors-0.2.7
  11913. 1421.28 s [pandoc-server] Source component graph: component lib
  11914. 1421.28 s [pandoc-server] Configured component graph:
  11915. 1421.28 s [pandoc-server] component pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  11916. 1421.28 s [pandoc-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11917. 1421.28 s [pandoc-server] include base-4.20.2.0-64da
  11918. 1421.28 s [pandoc-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  11919. 1421.28 s [pandoc-server] include bytestring-0.12.2.0-262e
  11920. 1421.28 s [pandoc-server] include containers-0.7-504a
  11921. 1421.28 s [pandoc-server] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11922. 1421.28 s [pandoc-server] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11923. 1421.28 s [pandoc-server] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11924. 1421.28 s [pandoc-server] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11925. 1421.28 s [pandoc-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  11926. 1421.28 s [pandoc-server] include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
  11927. 1421.28 s [pandoc-server] include text-2.1.3-c691
  11928. 1421.28 s [pandoc-server] include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
  11929. 1421.28 s [pandoc-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  11930. 1421.28 s [pandoc-server] include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
  11931. 1421.28 s [pandoc-server] Linked component graph:
  11932. 1421.28 s [pandoc-server] unit pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  11933. 1421.28 s [pandoc-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11934. 1421.28 s [pandoc-server] include base-4.20.2.0-64da
  11935. 1421.28 s [pandoc-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  11936. 1421.28 s [pandoc-server] include bytestring-0.12.2.0-262e
  11937. 1421.28 s [pandoc-server] include containers-0.7-504a
  11938. 1421.28 s [pandoc-server] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11939. 1421.28 s [pandoc-server] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11940. 1421.28 s [pandoc-server] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11941. 1421.28 s [pandoc-server] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11942. 1421.28 s [pandoc-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  11943. 1421.28 s [pandoc-server] include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
  11944. 1421.28 s [pandoc-server] include text-2.1.3-c691
  11945. 1421.28 s [pandoc-server] include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
  11946. 1421.28 s [pandoc-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  11947. 1421.28 s [pandoc-server] include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
  11948. 1421.28 s [pandoc-server] Text.Pandoc.Server=pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM:Text.Pandoc.Server
  11949. 1421.28 s [pandoc-server] Ready component graph:
  11950. 1421.28 s [pandoc-server] definite pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  11951. 1421.28 s [pandoc-server] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11952. 1421.28 s [pandoc-server] depends base-4.20.2.0-64da
  11953. 1421.28 s [pandoc-server] depends base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  11954. 1421.28 s [pandoc-server] depends bytestring-0.12.2.0-262e
  11955. 1421.28 s [pandoc-server] depends containers-0.7-504a
  11956. 1421.28 s [pandoc-server] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11957. 1421.28 s [pandoc-server] depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11958. 1421.28 s [pandoc-server] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11959. 1421.28 s [pandoc-server] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11960. 1421.28 s [pandoc-server] depends servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  11961. 1421.28 s [pandoc-server] depends skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
  11962. 1421.28 s [pandoc-server] depends text-2.1.3-c691
  11963. 1421.28 s [pandoc-server] depends unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
  11964. 1421.28 s [pandoc-server] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  11965. 1421.28 s [pandoc-server] depends wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
  11966. 1421.28 s [pandoc-server] Using Cabal-3.12.1.0 compiled by ghc-9.10
  11967. 1421.28 s [pandoc-server] Using compiler: ghc-9.10.3
  11968. 1421.28 s [pandoc-server] Using install prefix:
  11969. 1421.28 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  11970. 1421.28 s [pandoc-server] Executables installed in:
  11971. 1421.28 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/bin
  11972. 1421.28 s [pandoc-server] Libraries installed in:
  11973. 1421.28 s [vector] +++ OK, passed 100 tests.
  11974. 1421.28 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
  11975. 1421.28 s [pandoc-server] Dynamic Libraries installed in:
  11976. 1421.28 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
  11977. 1421.28 s [pandoc-server] Private executables installed in:
  11978. 1421.28 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
  11979. 1421.28 s [pandoc-server] Data files installed in:
  11980. 1421.28 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
  11981. 1421.28 s [pandoc-server] Documentation installed in:
  11982. 1421.28 s [pandoc-server] /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11
  11983. 1421.28 s [pandoc-server] Configuration files installed in:
  11984. 1421.28 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/etc
  11985. 1421.28 s [pandoc-server] No alex found
  11986. 1421.28 s [pandoc-server] Using ar found on system at:
  11987. 1421.28 s [pandoc-server] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  11988. 1421.28 s [pandoc-server] No c2hs found
  11989. 1421.28 s [pandoc-server] No cpphs found
  11990. 1421.28 s [pandoc-server] No doctest found
  11991. 1421.28 s [pandoc-server] Using gcc version 14.3.0 given by user at:
  11992. 1421.28 s [pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  11993. 1421.28 s [pandoc-server] Using ghc version 9.10.3 found on system at:
  11994. 1421.28 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  11995. 1421.28 s [pandoc-server] Using ghc-pkg version 9.10.3 found on system at:
  11996. 1421.28 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  11997. 1421.28 s [pandoc-server] No ghcjs found
  11998. 1421.28 s [pandoc-server] No ghcjs-pkg found
  11999. 1421.28 s [pandoc-server] No greencard found
  12000. 1421.28 s [pandoc-server] Using haddock version 2.31.1 found on system at:
  12001. 1421.28 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  12002. 1421.28 s [pandoc-server] No happy found
  12003. 1421.28 s [pandoc-server] Using haskell-suite found on system at: haskell-suite-dummy-location
  12004. 1421.28 s [pandoc-server] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  12005. 1421.28 s [pandoc-server] No hmake found
  12006. 1421.28 s [pandoc-server] Using hpc version 0.69 found on system at:
  12007. 1421.28 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  12008. 1421.28 s [pandoc-server] Using hsc2hs version 0.68.10 found on system at:
  12009. 1421.28 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  12010. 1421.28 s [pandoc-server] Using hscolour version 1.25 found on system at:
  12011. 1421.28 s [pandoc-server] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  12012. 1421.28 s [pandoc-server] No jhc found
  12013. 1421.28 s [pandoc-server] Using ld found on system at:
  12014. 1421.28 s [pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  12015. 1421.28 s [pandoc-server] No pkg-config found
  12016. 1421.28 s [pandoc-server] Using runghc version 9.10.3 found on system at:
  12017. 1421.28 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  12018. 1421.28 s [pandoc-server] Using strip version 2.44 found on system at:
  12019. 1421.28 s [pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  12020. 1421.28 s [pandoc-server] Using tar found on system at:
  12021. 1421.28 s [pandoc-server] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  12022. 1421.28 s [pandoc-server] No uhc found
  12023. 1421.28 s [vector] forM: OK
  12024. 1421.28 s [vector] +++ OK, passed 100 tests.
  12025. 1421.32 s [vector] forM_: OK (0.04s)
  12026. 1421.32 s [vector] +++ OK, passed 100 tests.
  12027. 1421.32 s [vector] imapM: OK
  12028. 1421.32 s [vector] +++ OK, passed 100 tests.
  12029. 1421.37 s [vector] imapM_: OK (0.04s)
  12030. 1421.38 s [vector] +++ OK, passed 100 tests.
  12031. 1421.38 s [vector] zipWith: OK (0.01s)
  12032. 1421.38 s [vector] +++ OK, passed 100 tests.
  12033. 1421.41 s [vector] zipWith3: OK (0.01s)
  12034. 1421.42 s [vector] +++ OK, passed 100 tests.
  12035. 1421.42 s [vector] izipWith: OK (0.01s)
  12036. 1421.42 s [vector] +++ OK, passed 100 tests.
  12037. 1421.42 s [vector] izipWith3: OK (0.01s)
  12038. 1421.42 s [vector] +++ OK, passed 100 tests.
  12039. 1421.44 s [vector] izipWithM: OK (0.01s)
  12040. 1421.44 s [vector] +++ OK, passed 100 tests.
  12041. 1421.47 s [vector] izipWithM_: OK (0.04s)
  12042. 1421.48 s [vector] +++ OK, passed 100 tests.
  12043. 1421.48 s [vector] zipWithM: OK (0.01s)
  12044. 1421.48 s [vector] +++ OK, passed 100 tests.
  12045. 1421.51 s [vector] zipWithM_: OK (0.03s)
  12046. 1421.52 s [vector] +++ OK, passed 100 tests.
  12047. 1421.52 s [vector] filter: OK
  12048. 1421.52 s [vector] +++ OK, passed 100 tests.
  12049. 1421.52 s [vector] ifilter: OK
  12050. 1421.52 s [vector] +++ OK, passed 100 tests.
  12051. 1421.57 s [vector] filterM: OK (0.03s)
  12052. 1421.57 s [vector] +++ OK, passed 100 tests.
  12053. 1421.58 s [vector] uniq: OK
  12054. 1421.58 s [vector] +++ OK, passed 100 tests.
  12055. 1421.59 s [vector] mapMaybe: OK
  12056. 1421.59 s [vector] +++ OK, passed 100 tests.
  12057. 1421.59 s [vector] imapMaybe: OK
  12058. 1421.60 s [vector] +++ OK, passed 100 tests.
  12059. 1421.60 s [vector] takeWhile: OK
  12060. 1421.60 s [vector] +++ OK, passed 100 tests.
  12061. 1421.60 s [vector] dropWhile: OK
  12062. 1421.60 s [vector] +++ OK, passed 100 tests.
  12063. 1421.61 s [vector] partition: OK
  12064. 1421.61 s [vector] +++ OK, passed 100 tests.
  12065. 1421.61 s [vector] partitionWith: OK
  12066. 1421.61 s [vector] +++ OK, passed 100 tests.
  12067. 1421.61 s [vector] span: OK
  12068. 1421.61 s [vector] +++ OK, passed 100 tests.
  12069. 1421.61 s [vector] break: OK
  12070. 1421.61 s [vector] +++ OK, passed 100 tests.
  12071. 1421.62 s [vector] spanR: OK
  12072. 1421.62 s [vector] +++ OK, passed 100 tests.
  12073. 1421.62 s [vector] breakR: OK
  12074. 1421.62 s [vector] +++ OK, passed 100 tests.
  12075. 1421.63 s [vector] groupBy: OK (0.01s)
  12076. 1421.63 s [vector] +++ OK, passed 100 tests.
  12077. 1421.63 s [vector] elem: OK
  12078. 1421.63 s [vector] +++ OK, passed 100 tests.
  12079. 1421.63 s [vector] notElem: OK
  12080. 1421.63 s [vector] +++ OK, passed 100 tests.
  12081. 1421.64 s [vector] find: OK
  12082. 1421.64 s [vector] +++ OK, passed 100 tests.
  12083. 1421.64 s [vector] findIndex: OK
  12084. 1421.64 s [vector] +++ OK, passed 100 tests.
  12085. 1421.64 s [vector] findIndexR: OK
  12086. 1421.64 s [vector] +++ OK, passed 100 tests.
  12087. 1421.64 s [vector] findIndices: OK
  12088. 1421.64 s [vector] +++ OK, passed 100 tests.
  12089. 1421.64 s [vector] elemIndex: OK
  12090. 1421.64 s [vector] +++ OK, passed 100 tests.
  12091. 1421.66 s [vector] elemIndices: OK
  12092. 1421.66 s [vector] +++ OK, passed 100 tests.
  12093. 1421.66 s [vector] foldl: OK (0.01s)
  12094. 1421.66 s [vector] +++ OK, passed 100 tests.
  12095. 1421.68 s [vector] foldl1: OK (0.01s)
  12096. 1421.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12097. 1421.69 s [vector] foldl': OK (0.02s)
  12098. 1421.70 s [vector] +++ OK, passed 100 tests.
  12099. 1421.70 s [vector] foldl1': OK (0.01s)
  12100. 1421.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12101. 1421.72 s [vector] foldr: OK (0.01s)
  12102. 1421.72 s [vector] +++ OK, passed 100 tests.
  12103. 1421.73 s [vector] foldr1: OK (0.02s)
  12104. 1421.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12105. 1421.74 s [vector] foldr': OK (0.01s)
  12106. 1421.74 s [vector] +++ OK, passed 100 tests.
  12107. 1421.76 s [vector] foldr1': OK (0.01s)
  12108. 1421.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12109. 1421.78 s [vector] ifoldl: OK (0.01s)
  12110. 1421.78 s [vector] +++ OK, passed 100 tests.
  12111. 1421.79 s [pandoc-lua-engine] Phase: buildPhase
  12112. 1421.79 s [vector] ifoldl': OK (0.01s)
  12113. 1421.80 s [vector] +++ OK, passed 100 tests.
  12114. 1421.80 s [vector] ifoldr: OK (0.02s)
  12115. 1421.80 s [vector] +++ OK, passed 100 tests.
  12116. 1421.82 s [vector] ifoldr': OK (0.01s)
  12117. 1421.82 s [vector] +++ OK, passed 100 tests.
  12118. 1421.83 s [vector] ifoldM: OK (0.01s)
  12119. 1421.84 s [vector] +++ OK, passed 100 tests.
  12120. 1421.84 s [vector] ifoldM': OK (0.01s)
  12121. 1421.84 s [vector] +++ OK, passed 100 tests.
  12122. 1421.88 s [vector] ifoldM_: OK (0.03s)
  12123. 1421.88 s [vector] +++ OK, passed 100 tests.
  12124. 1421.91 s [vector] ifoldM'_: OK (0.03s)
  12125. 1421.91 s [vector] +++ OK, passed 100 tests.
  12126. 1421.91 s [vector] all: OK
  12127. 1421.91 s [vector] +++ OK, passed 100 tests.
  12128. 1421.91 s [vector] any: OK
  12129. 1421.92 s [vector] +++ OK, passed 100 tests.
  12130. 1421.93 s [pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
  12131. 1421.93 s [vector] prescanl: OK (0.01s)
  12132. 1421.94 s [vector] +++ OK, passed 100 tests.
  12133. 1421.94 s [vector] prescanl': OK (0.01s)
  12134. 1421.94 s [vector] +++ OK, passed 100 tests.
  12135. 1421.94 s [pandoc-lua-engine] Building library for pandoc-lua-engine-0.4.3...
  12136. 1421.96 s [vector] postscanl: OK (0.02s)
  12137. 1421.96 s [vector] +++ OK, passed 100 tests.
  12138. 1421.96 s [vector] postscanl': OK (0.01s)
  12139. 1421.96 s [vector] +++ OK, passed 100 tests.
  12140. 1421.98 s [vector] scanl: OK
  12141. 1421.98 s [vector] +++ OK, passed 100 tests.
  12142. 1422.00 s [vector] scanl': OK (0.01s)
  12143. 1422.00 s [vector] +++ OK, passed 100 tests.
  12144. 1422.02 s [vector] scanl1: OK (0.01s)
  12145. 1422.02 s [vector] +++ OK, passed 100 tests.
  12146. 1422.04 s [vector] scanl1': OK (0.02s)
  12147. 1422.04 s [vector] +++ OK, passed 100 tests.
  12148. 1422.05 s [vector] iscanl: OK (0.01s)
  12149. 1422.06 s [vector] +++ OK, passed 100 tests.
  12150. 1422.06 s [vector] iscanl': OK (0.02s)
  12151. 1422.06 s [vector] +++ OK, passed 100 tests.
  12152. 1422.07 s [vector] prescanr: OK (0.02s)
  12153. 1422.07 s [vector] +++ OK, passed 100 tests.
  12154. 1422.08 s [pandoc-server] Phase: buildPhase
  12155. 1422.08 s [vector] prescanr': OK
  12156. 1422.08 s [vector] +++ OK, passed 100 tests.
  12157. 1422.10 s [vector] postscanr: OK (0.01s)
  12158. 1422.10 s [vector] +++ OK, passed 100 tests.
  12159. 1422.12 s [vector] postscanr': OK (0.01s)
  12160. 1422.12 s [vector] +++ OK, passed 100 tests.
  12161. 1422.12 s [vector] scanr: OK (0.01s)
  12162. 1422.12 s [vector] +++ OK, passed 100 tests.
  12163. 1422.13 s [vector] scanr': OK
  12164. 1422.14 s [vector] +++ OK, passed 100 tests.
  12165. 1422.16 s [vector] scanr1: OK (0.01s)
  12166. 1422.16 s [vector] +++ OK, passed 100 tests.
  12167. 1422.18 s [vector] scanr1': OK (0.01s)
  12168. 1422.18 s [vector] +++ OK, passed 100 tests.
  12169. 1422.18 s [vector] iscanr: OK (0.01s)
  12170. 1422.18 s [vector] +++ OK, passed 100 tests.
  12171. 1422.19 s [vector] iscanr': OK (0.01s)
  12172. 1422.19 s [vector] +++ OK, passed 100 tests.
  12173. 1422.19 s [vector] mut_read: OK
  12174. 1422.19 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12175. 1422.19 s [vector] mut_write: OK
  12176. 1422.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12177. 1422.19 s [vector] mut_modify: OK
  12178. 1422.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12179. 1422.20 s [vector] mut_generate: OK
  12180. 1422.20 s [vector] +++ OK, passed 100 tests.
  12181. 1422.20 s [vector] mut_generateM: OK (0.01s)
  12182. 1422.21 s [vector] +++ OK, passed 100 tests.
  12183. 1422.22 s [pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
  12184. 1422.22 s [pandoc-server] Building library for pandoc-server-0.1.0.11...
  12185. 1422.25 s [vector] mut_mapM_: OK (0.03s)
  12186. 1422.25 s [vector] +++ OK, passed 100 tests.
  12187. 1422.25 s [pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
  12188. 1422.30 s [vector] mut_imapM_: OK (0.03s)
  12189. 1422.30 s [vector] +++ OK, passed 100 tests.
  12190. 1422.34 s [pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
  12191. 1422.36 s [vector] mut_forM_: OK (0.06s)
  12192. 1422.36 s [vector] +++ OK, passed 100 tests.
  12193. 1422.42 s [vector] mut_iforM_: OK (0.07s)
  12194. 1422.42 s [vector] +++ OK, passed 100 tests.
  12195. 1422.44 s [vector] mut_foldr: OK (0.02s)
  12196. 1422.44 s [vector] +++ OK, passed 100 tests.
  12197. 1422.46 s [vector] mut_foldr': OK (0.02s)
  12198. 1422.46 s [vector] +++ OK, passed 100 tests.
  12199. 1422.48 s [vector] mut_foldl: OK (0.02s)
  12200. 1422.48 s [vector] +++ OK, passed 100 tests.
  12201. 1422.50 s [vector] mut_foldl': OK (0.02s)
  12202. 1422.50 s [vector] +++ OK, passed 100 tests.
  12203. 1422.52 s [vector] mut_ifoldr: OK (0.02s)
  12204. 1422.52 s [vector] +++ OK, passed 100 tests.
  12205. 1422.54 s [vector] mut_ifoldr': OK (0.02s)
  12206. 1422.54 s [vector] +++ OK, passed 100 tests.
  12207. 1422.56 s [vector] mut_ifoldl: OK (0.02s)
  12208. 1422.56 s [vector] +++ OK, passed 100 tests.
  12209. 1422.59 s [vector] mut_ifoldl': OK (0.03s)
  12210. 1422.60 s [vector] +++ OK, passed 100 tests.
  12211. 1422.60 s [vector] mut_foldM: OK (0.02s)
  12212. 1422.60 s [vector] +++ OK, passed 100 tests.
  12213. 1422.62 s [vector] mut_foldM': OK (0.01s)
  12214. 1422.62 s [vector] +++ OK, passed 100 tests.
  12215. 1422.64 s [vector] mut_foldrM: OK (0.01s)
  12216. 1422.64 s [vector] +++ OK, passed 100 tests.
  12217. 1422.64 s [vector] mut_foldrM': OK (0.01s)
  12218. 1422.64 s [vector] +++ OK, passed 100 tests.
  12219. 1422.66 s [vector] mut_ifoldM: OK (0.02s)
  12220. 1422.66 s [vector] +++ OK, passed 100 tests.
  12221. 1422.70 s [vector] mut_ifoldM': OK (0.03s)
  12222. 1422.70 s [vector] +++ OK, passed 100 tests.
  12223. 1422.72 s [vector] mut_ifoldrM: OK (0.02s)
  12224. 1422.72 s [vector] +++ OK, passed 100 tests.
  12225. 1422.72 s [vector] mut_ifoldrM': OK (0.02s)
  12226. 1422.72 s [vector] +++ OK, passed 100 tests.
  12227. 1422.72 s [vector] compare: OK
  12228. 1422.72 s [vector] +++ OK, passed 100 tests.
  12229. 1422.72 s [vector] maximum: OK
  12230. 1422.72 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12231. 1422.72 s [vector] minimum: OK
  12232. 1422.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12233. 1422.73 s [vector] minIndex: OK
  12234. 1422.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12235. 1422.73 s [vector] maxIndex: OK
  12236. 1422.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12237. 1422.73 s [vector] maximumBy: OK
  12238. 1422.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12239. 1422.73 s [vector] minimumBy: OK
  12240. 1422.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12241. 1422.73 s [vector] maximumOn: OK
  12242. 1422.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12243. 1422.74 s [vector] minimumOn: OK
  12244. 1422.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12245. 1422.74 s [vector] maxIndexBy: OK
  12246. 1422.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12247. 1422.74 s [vector] minIndexBy: OK
  12248. 1422.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12249. 1422.74 s [vector] ListFirstMaxIndexWins: OK
  12250. 1422.74 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12251. 1422.74 s [vector] FalseListFirstMaxIndexWins: OK
  12252. 1422.74 s [vector] +++ OK, failed as expected. (after 1 test):
  12253. 1422.74 s [vector] Exception:
  12254. 1422.74 s [vector] Prelude.foldr1: empty list
  12255. 1422.74 s [vector] CallStack (from HasCallStack):
  12256. 1422.74 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12257. 1422.74 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12258. 1422.74 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12259. 1422.74 s [vector] []
  12260. 1422.74 s [vector] mempty: OK
  12261. 1422.75 s [vector] +++ OK, passed 100 tests.
  12262. 1422.75 s [vector] mappend: OK
  12263. 1422.76 s [vector] +++ OK, passed 100 tests.
  12264. 1422.79 s [vector] mconcat: OK (0.03s)
  12265. 1422.79 s [vector] +++ OK, passed 100 tests.
  12266. 1422.79 s [vector] glength: OK
  12267. 1422.79 s [vector] +++ OK, passed 100 tests.
  12268. 1422.79 s [vector] sum: OK
  12269. 1422.79 s [vector] +++ OK, passed 100 tests.
  12270. 1422.79 s [vector] product: OK
  12271. 1422.79 s [vector] +++ OK, passed 100 tests.
  12272. 1422.79 s [vector] enumFromN: OK
  12273. 1422.79 s [vector] +++ OK, passed 100 tests.
  12274. 1422.79 s [vector] enumFromThenN: OK
  12275. 1422.79 s [vector] +++ OK, passed 100 tests.
  12276. 1422.79 s [vector] enumFromTo: OK
  12277. 1422.79 s [vector] +++ OK, passed 100 tests.
  12278. 1422.79 s [vector] enumFromThenTo: OK
  12279. 1422.79 s [vector] +++ OK, passed 100 tests; 1 discarded.
  12280. 1422.79 s [vector] unstream
  12281. 1422.79 s [vector] unstream == vunstream (exact): OK
  12282. 1422.79 s [vector] +++ OK, passed 100 tests.
  12283. 1422.79 s [vector] unstream == vunstream (unknown): OK
  12284. 1422.79 s [vector] +++ OK, passed 100 tests.
  12285. 1422.79 s [vector] unstreamR ~= vunstream (exact): OK
  12286. 1422.79 s [vector] +++ OK, passed 100 tests.
  12287. 1422.80 s [vector] unstreamR ~= vunstream (unknown): OK
  12288. 1422.80 s [vector] +++ OK, passed 100 tests.
  12289. 1422.80 s [vector] Tests.Vector.Strict
  12290. 1422.80 s [vector] Bool
  12291. 1422.80 s [vector] fromList.toList == id: OK
  12292. 1422.80 s [vector] +++ OK, passed 100 tests.
  12293. 1422.80 s [vector] toList.fromList == id: OK
  12294. 1422.80 s [vector] +++ OK, passed 100 tests.
  12295. 1422.80 s [vector] unstream.stream == id: OK
  12296. 1422.80 s [vector] +++ OK, passed 100 tests.
  12297. 1422.80 s [vector] stream.unstream == id: OK
  12298. 1422.80 s [vector] +++ OK, passed 100 tests.
  12299. 1422.80 s [vector] eq: OK
  12300. 1422.80 s [vector] +++ OK, passed 100 tests.
  12301. 1422.80 s [vector] length: OK
  12302. 1422.80 s [vector] +++ OK, passed 100 tests.
  12303. 1422.80 s [vector] null: OK
  12304. 1422.80 s [vector] +++ OK, passed 100 tests.
  12305. 1422.80 s [vector] index: OK
  12306. 1422.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12307. 1422.80 s [vector] safeIndex: OK
  12308. 1422.80 s [vector] +++ OK, passed 100 tests.
  12309. 1422.80 s [vector] head: OK
  12310. 1422.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12311. 1422.80 s [vector] last: OK
  12312. 1422.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12313. 1422.80 s [vector] unsafeIndex: OK
  12314. 1422.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12315. 1422.80 s [vector] unsafeHead: OK
  12316. 1422.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12317. 1422.80 s [vector] unsafeLast: OK
  12318. 1422.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12319. 1422.80 s [vector] slice: OK
  12320. 1422.80 s [vector] +++ OK, passed 100 tests.
  12321. 1422.81 s [vector] init: OK
  12322. 1422.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12323. 1422.81 s [vector] tail: OK
  12324. 1422.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12325. 1422.81 s [vector] take: OK
  12326. 1422.81 s [vector] +++ OK, passed 100 tests.
  12327. 1422.81 s [vector] drop: OK
  12328. 1422.81 s [vector] +++ OK, passed 100 tests.
  12329. 1422.81 s [vector] splitAt: OK
  12330. 1422.81 s [vector] +++ OK, passed 100 tests.
  12331. 1422.81 s [vector] empty: OK
  12332. 1422.81 s [vector] +++ OK, passed 100 tests.
  12333. 1422.81 s [vector] singleton: OK
  12334. 1422.81 s [vector] +++ OK, passed 100 tests.
  12335. 1422.81 s [vector] replicate: OK
  12336. 1422.81 s [vector] +++ OK, passed 100 tests.
  12337. 1422.81 s [vector] generate: OK
  12338. 1422.81 s [vector] +++ OK, passed 100 tests.
  12339. 1422.81 s [vector] iterateN: OK
  12340. 1422.82 s [vector] +++ OK, passed 100 tests.
  12341. 1422.84 s [vector] iterateNM: OK (0.02s)
  12342. 1422.84 s [vector] +++ OK, passed 100 tests.
  12343. 1422.86 s [vector] generateM: OK (0.02s)
  12344. 1422.86 s [vector] +++ OK, passed 100 tests.
  12345. 1422.86 s [vector] replicateM: OK
  12346. 1422.86 s [vector] +++ OK, passed 100 tests.
  12347. 1422.86 s [vector] create: OK
  12348. 1422.86 s [vector] +++ OK, passed 100 tests.
  12349. 1422.86 s [vector] createT: OK
  12350. 1422.86 s [vector] +++ OK, passed 100 tests.
  12351. 1422.86 s [vector] unfoldr: OK
  12352. 1422.86 s [vector] +++ OK, passed 100 tests.
  12353. 1422.86 s [vector] unfoldrN: OK
  12354. 1422.86 s [vector] +++ OK, passed 100 tests.
  12355. 1422.86 s [vector] unfoldrExactN: OK
  12356. 1422.87 s [vector] +++ OK, passed 100 tests.
  12357. 1422.87 s [vector] unfoldrM: OK
  12358. 1422.87 s [vector] +++ OK, passed 100 tests.
  12359. 1422.87 s [vector] unfoldrNM: OK
  12360. 1422.88 s [vector] +++ OK, passed 100 tests.
  12361. 1422.89 s [vector] unfoldrExactNM: OK (0.02s)
  12362. 1422.89 s [vector] +++ OK, passed 100 tests.
  12363. 1422.89 s [vector] constructN: OK
  12364. 1422.89 s [vector] +++ OK, passed 100 tests.
  12365. 1422.89 s [vector] constructrN: OK
  12366. 1422.90 s [vector] +++ OK, passed 100 tests.
  12367. 1422.90 s [vector] cons: OK
  12368. 1422.90 s [vector] +++ OK, passed 100 tests.
  12369. 1422.90 s [vector] snoc: OK
  12370. 1422.91 s [vector] +++ OK, passed 100 tests.
  12371. 1422.91 s [vector] append: OK
  12372. 1422.91 s [vector] +++ OK, passed 100 tests.
  12373. 1422.91 s [vector] concat: OK
  12374. 1422.91 s [vector] +++ OK, passed 100 tests.
  12375. 1422.91 s [vector] force: OK
  12376. 1422.91 s [vector] +++ OK, passed 100 tests.
  12377. 1422.91 s [vector] upd: OK
  12378. 1422.91 s [vector] +++ OK, passed 100 tests.
  12379. 1422.91 s [vector] accum: OK
  12380. 1422.91 s [vector] +++ OK, passed 100 tests.
  12381. 1422.91 s [vector] reverse: OK
  12382. 1422.91 s [vector] +++ OK, passed 100 tests.
  12383. 1422.91 s [vector] backpermute: OK
  12384. 1422.91 s [vector] +++ OK, passed 100 tests.
  12385. 1422.91 s [vector] map: OK
  12386. 1422.91 s [vector] +++ OK, passed 100 tests.
  12387. 1422.91 s [vector] imap: OK
  12388. 1422.92 s [vector] +++ OK, passed 100 tests.
  12389. 1422.92 s [vector] concatMap: OK
  12390. 1422.93 s [vector] +++ OK, passed 100 tests.
  12391. 1422.93 s [vector] mapM: OK
  12392. 1422.93 s [vector] +++ OK, passed 100 tests.
  12393. 1422.93 s [vector] mapM_: OK
  12394. 1422.93 s [vector] +++ OK, passed 100 tests.
  12395. 1422.94 s [vector] forM: OK
  12396. 1422.94 s [vector] +++ OK, passed 100 tests.
  12397. 1422.94 s [vector] forM_: OK
  12398. 1422.94 s [vector] +++ OK, passed 100 tests.
  12399. 1422.94 s [vector] imapM: OK
  12400. 1422.95 s [vector] +++ OK, passed 100 tests.
  12401. 1422.95 s [vector] imapM_: OK
  12402. 1422.95 s [vector] +++ OK, passed 100 tests.
  12403. 1422.95 s [vector] zipWith: OK
  12404. 1422.95 s [vector] +++ OK, passed 100 tests.
  12405. 1422.95 s [vector] zipWith3: OK
  12406. 1422.96 s [vector] +++ OK, passed 100 tests.
  12407. 1422.96 s [vector] izipWith: OK
  12408. 1422.96 s [vector] +++ OK, passed 100 tests.
  12409. 1422.96 s [vector] izipWith3: OK
  12410. 1422.96 s [vector] +++ OK, passed 100 tests.
  12411. 1422.97 s [vector] izipWithM: OK
  12412. 1422.97 s [vector] +++ OK, passed 100 tests.
  12413. 1422.97 s [vector] izipWithM_: OK
  12414. 1422.97 s [vector] +++ OK, passed 100 tests.
  12415. 1422.98 s [vector] zipWithM: OK
  12416. 1422.98 s [vector] +++ OK, passed 100 tests.
  12417. 1422.98 s [vector] zipWithM_: OK
  12418. 1422.98 s [vector] +++ OK, passed 100 tests.
  12419. 1422.98 s [vector] filter: OK
  12420. 1422.98 s [vector] +++ OK, passed 100 tests.
  12421. 1422.98 s [vector] ifilter: OK
  12422. 1422.98 s [vector] +++ OK, passed 100 tests.
  12423. 1423.02 s [vector] filterM: OK (0.04s)
  12424. 1423.02 s [vector] +++ OK, passed 100 tests.
  12425. 1423.02 s [vector] uniq: OK
  12426. 1423.02 s [vector] +++ OK, passed 100 tests.
  12427. 1423.03 s [vector] mapMaybe: OK
  12428. 1423.03 s [vector] +++ OK, passed 100 tests.
  12429. 1423.03 s [vector] imapMaybe: OK
  12430. 1423.03 s [vector] +++ OK, passed 100 tests.
  12431. 1423.03 s [vector] takeWhile: OK
  12432. 1423.03 s [vector] +++ OK, passed 100 tests.
  12433. 1423.03 s [vector] dropWhile: OK
  12434. 1423.03 s [vector] +++ OK, passed 100 tests.
  12435. 1423.04 s [vector] partition: OK
  12436. 1423.04 s [vector] +++ OK, passed 100 tests.
  12437. 1423.04 s [vector] partitionWith: OK
  12438. 1423.04 s [vector] +++ OK, passed 100 tests.
  12439. 1423.05 s [vector] span: OK
  12440. 1423.05 s [vector] +++ OK, passed 100 tests.
  12441. 1423.05 s [vector] break: OK
  12442. 1423.05 s [vector] +++ OK, passed 100 tests.
  12443. 1423.05 s [vector] spanR: OK
  12444. 1423.05 s [vector] +++ OK, passed 100 tests.
  12445. 1423.05 s [vector] breakR: OK
  12446. 1423.05 s [vector] +++ OK, passed 100 tests.
  12447. 1423.05 s [vector] groupBy: OK
  12448. 1423.06 s [vector] +++ OK, passed 100 tests.
  12449. 1423.06 s [vector] elem: OK
  12450. 1423.06 s [vector] +++ OK, passed 100 tests.
  12451. 1423.06 s [vector] notElem: OK
  12452. 1423.06 s [vector] +++ OK, passed 100 tests.
  12453. 1423.06 s [vector] find: OK
  12454. 1423.07 s [vector] +++ OK, passed 100 tests.
  12455. 1423.07 s [vector] findIndex: OK
  12456. 1423.07 s [vector] +++ OK, passed 100 tests.
  12457. 1423.07 s [vector] findIndexR: OK
  12458. 1423.07 s [vector] +++ OK, passed 100 tests.
  12459. 1423.07 s [vector] findIndices: OK
  12460. 1423.07 s [vector] +++ OK, passed 100 tests.
  12461. 1423.07 s [vector] elemIndex: OK
  12462. 1423.07 s [vector] +++ OK, passed 100 tests.
  12463. 1423.07 s [vector] elemIndices: OK
  12464. 1423.07 s [vector] +++ OK, passed 100 tests.
  12465. 1423.07 s [vector] foldl: OK
  12466. 1423.08 s [vector] +++ OK, passed 100 tests.
  12467. 1423.08 s [vector] foldl1: OK
  12468. 1423.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12469. 1423.08 s [vector] foldl': OK
  12470. 1423.08 s [vector] +++ OK, passed 100 tests.
  12471. 1423.08 s [vector] foldl1': OK
  12472. 1423.08 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12473. 1423.08 s [vector] foldr: OK
  12474. 1423.08 s [vector] +++ OK, passed 100 tests.
  12475. 1423.08 s [vector] foldr1: OK
  12476. 1423.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12477. 1423.09 s [vector] foldr': OK
  12478. 1423.09 s [vector] +++ OK, passed 100 tests.
  12479. 1423.09 s [vector] foldr1': OK
  12480. 1423.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12481. 1423.09 s [vector] ifoldl: OK
  12482. 1423.09 s [vector] +++ OK, passed 100 tests.
  12483. 1423.10 s [vector] ifoldl': OK
  12484. 1423.10 s [vector] +++ OK, passed 100 tests.
  12485. 1423.11 s [vector] ifoldr: OK
  12486. 1423.12 s [vector] +++ OK, passed 100 tests.
  12487. 1423.12 s [vector] ifoldr': OK
  12488. 1423.12 s [vector] +++ OK, passed 100 tests.
  12489. 1423.12 s [vector] ifoldM: OK
  12490. 1423.12 s [vector] +++ OK, passed 100 tests.
  12491. 1423.12 s [vector] ifoldM': OK
  12492. 1423.12 s [vector] +++ OK, passed 100 tests.
  12493. 1423.12 s [vector] ifoldM_: OK
  12494. 1423.12 s [vector] +++ OK, passed 100 tests.
  12495. 1423.12 s [vector] ifoldM'_: OK
  12496. 1423.12 s [vector] +++ OK, passed 100 tests.
  12497. 1423.12 s [vector] all: OK
  12498. 1423.12 s [vector] +++ OK, passed 100 tests.
  12499. 1423.12 s [vector] any: OK
  12500. 1423.12 s [vector] +++ OK, passed 100 tests.
  12501. 1423.12 s [vector] prescanl: OK
  12502. 1423.12 s [vector] +++ OK, passed 100 tests.
  12503. 1423.12 s [vector] prescanl': OK
  12504. 1423.12 s [vector] +++ OK, passed 100 tests.
  12505. 1423.12 s [vector] postscanl: OK
  12506. 1423.12 s [vector] +++ OK, passed 100 tests.
  12507. 1423.13 s [vector] postscanl': OK
  12508. 1423.13 s [vector] +++ OK, passed 100 tests.
  12509. 1423.13 s [vector] scanl: OK
  12510. 1423.13 s [vector] +++ OK, passed 100 tests.
  12511. 1423.13 s [vector] scanl': OK
  12512. 1423.13 s [vector] +++ OK, passed 100 tests.
  12513. 1423.13 s [vector] scanl1: OK
  12514. 1423.13 s [vector] +++ OK, passed 100 tests.
  12515. 1423.13 s [vector] scanl1': OK
  12516. 1423.13 s [vector] +++ OK, passed 100 tests.
  12517. 1423.13 s [vector] iscanl: OK
  12518. 1423.13 s [vector] +++ OK, passed 100 tests.
  12519. 1423.13 s [vector] iscanl': OK
  12520. 1423.13 s [vector] +++ OK, passed 100 tests.
  12521. 1423.13 s [vector] prescanr: OK
  12522. 1423.13 s [vector] +++ OK, passed 100 tests.
  12523. 1423.13 s [vector] prescanr': OK
  12524. 1423.13 s [vector] +++ OK, passed 100 tests.
  12525. 1423.13 s [vector] postscanr: OK
  12526. 1423.13 s [vector] +++ OK, passed 100 tests.
  12527. 1423.14 s [vector] postscanr': OK
  12528. 1423.14 s [vector] +++ OK, passed 100 tests.
  12529. 1423.14 s [vector] scanr: OK
  12530. 1423.14 s [vector] +++ OK, passed 100 tests.
  12531. 1423.14 s [vector] scanr': OK
  12532. 1423.14 s [vector] +++ OK, passed 100 tests.
  12533. 1423.14 s [vector] scanr1: OK
  12534. 1423.14 s [vector] +++ OK, passed 100 tests.
  12535. 1423.14 s [vector] scanr1': OK
  12536. 1423.14 s [vector] +++ OK, passed 100 tests.
  12537. 1423.14 s [vector] iscanr: OK
  12538. 1423.14 s [vector] +++ OK, passed 100 tests.
  12539. 1423.14 s [vector] iscanr': OK
  12540. 1423.14 s [vector] +++ OK, passed 100 tests.
  12541. 1423.14 s [vector] mut_read: OK
  12542. 1423.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12543. 1423.15 s [vector] mut_write: OK
  12544. 1423.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12545. 1423.15 s [vector] mut_modify: OK
  12546. 1423.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12547. 1423.15 s [vector] mut_generate: OK
  12548. 1423.16 s [vector] +++ OK, passed 100 tests.
  12549. 1423.17 s [vector] mut_generateM: OK
  12550. 1423.17 s [vector] +++ OK, passed 100 tests.
  12551. 1423.17 s [vector] mut_mapM_: OK
  12552. 1423.17 s [vector] +++ OK, passed 100 tests.
  12553. 1423.17 s [vector] mut_imapM_: OK
  12554. 1423.18 s [vector] +++ OK, passed 100 tests.
  12555. 1423.20 s [vector] mut_forM_: OK
  12556. 1423.20 s [vector] +++ OK, passed 100 tests.
  12557. 1423.20 s [vector] mut_iforM_: OK (0.02s)
  12558. 1423.20 s [vector] +++ OK, passed 100 tests.
  12559. 1423.20 s [vector] mut_foldr: OK
  12560. 1423.21 s [vector] +++ OK, passed 100 tests.
  12561. 1423.21 s [vector] mut_foldr': OK
  12562. 1423.21 s [vector] +++ OK, passed 100 tests.
  12563. 1423.21 s [vector] mut_foldl: OK
  12564. 1423.21 s [vector] +++ OK, passed 100 tests.
  12565. 1423.21 s [vector] mut_foldl': OK
  12566. 1423.21 s [vector] +++ OK, passed 100 tests.
  12567. 1423.21 s [vector] mut_ifoldr: OK
  12568. 1423.21 s [vector] +++ OK, passed 100 tests.
  12569. 1423.21 s [vector] mut_ifoldr': OK
  12570. 1423.21 s [vector] +++ OK, passed 100 tests.
  12571. 1423.22 s [vector] mut_ifoldl: OK
  12572. 1423.22 s [vector] +++ OK, passed 100 tests.
  12573. 1423.22 s [vector] mut_ifoldl': OK
  12574. 1423.22 s [vector] +++ OK, passed 100 tests.
  12575. 1423.22 s [vector] mut_foldM: OK
  12576. 1423.22 s [vector] +++ OK, passed 100 tests.
  12577. 1423.22 s [vector] mut_foldM': OK
  12578. 1423.22 s [vector] +++ OK, passed 100 tests.
  12579. 1423.22 s [vector] mut_foldrM: OK
  12580. 1423.22 s [vector] +++ OK, passed 100 tests.
  12581. 1423.22 s [vector] mut_foldrM': OK
  12582. 1423.22 s [vector] +++ OK, passed 100 tests.
  12583. 1423.22 s [vector] mut_ifoldM: OK
  12584. 1423.22 s [vector] +++ OK, passed 100 tests.
  12585. 1423.22 s [vector] mut_ifoldM': OK
  12586. 1423.23 s [vector] +++ OK, passed 100 tests.
  12587. 1423.23 s [vector] mut_ifoldrM: OK
  12588. 1423.23 s [vector] +++ OK, passed 100 tests.
  12589. 1423.23 s [vector] mut_ifoldrM': OK
  12590. 1423.23 s [vector] +++ OK, passed 100 tests.
  12591. 1423.23 s [vector] compare: OK
  12592. 1423.23 s [vector] +++ OK, passed 100 tests.
  12593. 1423.23 s [vector] maximum: OK
  12594. 1423.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12595. 1423.23 s [vector] minimum: OK
  12596. 1423.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12597. 1423.23 s [vector] minIndex: OK
  12598. 1423.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12599. 1423.23 s [vector] maxIndex: OK
  12600. 1423.23 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12601. 1423.23 s [vector] maximumBy: OK
  12602. 1423.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12603. 1423.23 s [vector] minimumBy: OK
  12604. 1423.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12605. 1423.23 s [vector] maximumOn: OK
  12606. 1423.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12607. 1423.23 s [vector] minimumOn: OK
  12608. 1423.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12609. 1423.23 s [vector] maxIndexBy: OK
  12610. 1423.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12611. 1423.23 s [vector] minIndexBy: OK
  12612. 1423.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12613. 1423.23 s [vector] ListFirstMaxIndexWins: OK
  12614. 1423.23 s [vector] +++ OK, passed 100 tests; 25 discarded.
  12615. 1423.23 s [vector] FalseListFirstMaxIndexWins: OK
  12616. 1423.23 s [vector] +++ OK, failed as expected. (after 1 test):
  12617. 1423.23 s [vector] Exception:
  12618. 1423.23 s [vector] Prelude.foldr1: empty list
  12619. 1423.23 s [vector] CallStack (from HasCallStack):
  12620. 1423.23 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12621. 1423.23 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12622. 1423.23 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12623. 1423.23 s [vector] []
  12624. 1423.23 s [vector] zip: OK
  12625. 1423.23 s [vector] +++ OK, passed 100 tests.
  12626. 1423.23 s [vector] zip3: OK
  12627. 1423.24 s [vector] +++ OK, passed 100 tests.
  12628. 1423.24 s [vector] unzip: OK
  12629. 1423.24 s [vector] +++ OK, passed 100 tests.
  12630. 1423.24 s [vector] unzip3: OK
  12631. 1423.24 s [vector] +++ OK, passed 100 tests.
  12632. 1423.24 s [vector] indexed: OK
  12633. 1423.24 s [vector] +++ OK, passed 100 tests.
  12634. 1423.24 s [vector] update: OK
  12635. 1423.24 s [vector] +++ OK, passed 100 tests.
  12636. 1423.24 s [vector] concat: OK
  12637. 1423.24 s [vector] +++ OK, passed 100 tests.
  12638. 1423.24 s [vector] mempty: OK
  12639. 1423.24 s [vector] +++ OK, passed 100 tests.
  12640. 1423.24 s [vector] mappend: OK
  12641. 1423.25 s [vector] +++ OK, passed 100 tests.
  12642. 1423.26 s [vector] mconcat: OK
  12643. 1423.26 s [vector] +++ OK, passed 100 tests.
  12644. 1423.26 s [vector] fmap: OK
  12645. 1423.26 s [vector] +++ OK, passed 100 tests.
  12646. 1423.26 s [vector] return: OK
  12647. 1423.27 s [vector] +++ OK, passed 100 tests.
  12648. 1423.27 s [vector] bind: OK (0.01s)
  12649. 1423.27 s [vector] +++ OK, passed 100 tests.
  12650. 1423.27 s [vector] mzip: OK
  12651. 1423.27 s [vector] +++ OK, passed 100 tests.
  12652. 1423.27 s [vector] munzip: OK
  12653. 1423.27 s [pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
  12654. 1423.27 s [pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
  12655. 1423.27 s [pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
  12656. 1423.27 s [pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
  12657. 1423.27 s [pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
  12658. 1423.27 s [pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
  12659. 1423.27 s [pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
  12660. 1423.27 s [pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
  12661. 1423.27 s [pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
  12662. 1423.28 s [vector] +++ OK, passed 100 tests.
  12663. 1423.28 s [vector] applicative_pure: OK
  12664. 1423.28 s [vector] +++ OK, passed 100 tests.
  12665. 1423.28 s [vector] applicative_appl: OK (0.01s)
  12666. 1423.28 s [vector] +++ OK, passed 100 tests.
  12667. 1423.30 s [vector] alternative_empty: OK
  12668. 1423.30 s [vector] +++ OK, passed 100 tests.
  12669. 1423.30 s [vector] alternative_or: OK
  12670. 1423.30 s [vector] +++ OK, passed 100 tests.
  12671. 1423.33 s [vector] sequence: OK (0.04s)
  12672. 1423.33 s [vector] +++ OK, passed 100 tests.
  12673. 1423.33 s [vector] sequence_: OK (0.01s)
  12674. 1423.33 s [vector] +++ OK, passed 100 tests.
  12675. 1423.33 s [vector] glength: OK
  12676. 1423.33 s [vector] +++ OK, passed 100 tests.
  12677. 1423.33 s [vector] and: OK
  12678. 1423.33 s [vector] +++ OK, passed 100 tests.
  12679. 1423.33 s [vector] or: OK
  12680. 1423.33 s [vector] +++ OK, passed 100 tests.
  12681. 1423.33 s [vector] Int
  12682. 1423.33 s [vector] fromList.toList == id: OK
  12683. 1423.33 s [vector] +++ OK, passed 100 tests.
  12684. 1423.33 s [vector] toList.fromList == id: OK
  12685. 1423.33 s [vector] +++ OK, passed 100 tests.
  12686. 1423.33 s [vector] unstream.stream == id: OK
  12687. 1423.34 s [vector] +++ OK, passed 100 tests.
  12688. 1423.34 s [vector] stream.unstream == id: OK
  12689. 1423.34 s [vector] +++ OK, passed 100 tests.
  12690. 1423.34 s [vector] eq: OK
  12691. 1423.34 s [vector] +++ OK, passed 100 tests.
  12692. 1423.34 s [vector] length: OK
  12693. 1423.34 s [vector] +++ OK, passed 100 tests.
  12694. 1423.34 s [vector] null: OK
  12695. 1423.34 s [vector] +++ OK, passed 100 tests.
  12696. 1423.34 s [vector] index: OK
  12697. 1423.34 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12698. 1423.34 s [vector] safeIndex: OK
  12699. 1423.34 s [vector] +++ OK, passed 100 tests.
  12700. 1423.34 s [vector] head: OK
  12701. 1423.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12702. 1423.34 s [vector] last: OK
  12703. 1423.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12704. 1423.34 s [vector] unsafeIndex: OK
  12705. 1423.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12706. 1423.34 s [vector] unsafeHead: OK
  12707. 1423.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12708. 1423.34 s [vector] unsafeLast: OK
  12709. 1423.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12710. 1423.34 s [vector] slice: OK
  12711. 1423.34 s [vector] +++ OK, passed 100 tests.
  12712. 1423.34 s [vector] init: OK
  12713. 1423.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12714. 1423.35 s [vector] tail: OK
  12715. 1423.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12716. 1423.36 s [vector] take: OK
  12717. 1423.36 s [vector] +++ OK, passed 100 tests.
  12718. 1423.36 s [vector] drop: OK
  12719. 1423.36 s [vector] +++ OK, passed 100 tests.
  12720. 1423.36 s [vector] splitAt: OK
  12721. 1423.36 s [vector] +++ OK, passed 100 tests.
  12722. 1423.36 s [vector] empty: OK
  12723. 1423.36 s [vector] +++ OK, passed 100 tests.
  12724. 1423.36 s [vector] singleton: OK
  12725. 1423.36 s [vector] +++ OK, passed 100 tests.
  12726. 1423.36 s [vector] replicate: OK
  12727. 1423.36 s [vector] +++ OK, passed 100 tests.
  12728. 1423.36 s [vector] generate: OK
  12729. 1423.36 s [vector] +++ OK, passed 100 tests.
  12730. 1423.37 s [vector] iterateN: OK
  12731. 1423.38 s [vector] +++ OK, passed 100 tests.
  12732. 1423.38 s [vector] iterateNM: OK (0.01s)
  12733. 1423.38 s [vector] +++ OK, passed 100 tests.
  12734. 1423.40 s [vector] generateM: OK (0.03s)
  12735. 1423.40 s [vector] +++ OK, passed 100 tests.
  12736. 1423.40 s [vector] replicateM: OK
  12737. 1423.40 s [vector] +++ OK, passed 100 tests.
  12738. 1423.40 s [vector] create: OK
  12739. 1423.40 s [vector] +++ OK, passed 100 tests.
  12740. 1423.40 s [vector] createT: OK
  12741. 1423.41 s [vector] +++ OK, passed 100 tests.
  12742. 1423.41 s [vector] unfoldr: OK
  12743. 1423.41 s [vector] +++ OK, passed 100 tests.
  12744. 1423.41 s [vector] unfoldrN: OK
  12745. 1423.41 s [vector] +++ OK, passed 100 tests.
  12746. 1423.41 s [vector] unfoldrExactN: OK
  12747. 1423.41 s [vector] +++ OK, passed 100 tests.
  12748. 1423.41 s [vector] unfoldrM: OK
  12749. 1423.41 s [vector] +++ OK, passed 100 tests.
  12750. 1423.42 s [vector] unfoldrNM: OK
  12751. 1423.42 s [vector] +++ OK, passed 100 tests.
  12752. 1423.43 s [vector] unfoldrExactNM: OK (0.02s)
  12753. 1423.43 s [vector] +++ OK, passed 100 tests.
  12754. 1423.44 s [vector] constructN: OK
  12755. 1423.44 s [vector] +++ OK, passed 100 tests.
  12756. 1423.44 s [vector] constructrN: OK
  12757. 1423.44 s [vector] +++ OK, passed 100 tests.
  12758. 1423.44 s [vector] cons: OK
  12759. 1423.44 s [vector] +++ OK, passed 100 tests.
  12760. 1423.44 s [vector] snoc: OK
  12761. 1423.45 s [pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
  12762. 1423.45 s [vector] +++ OK, passed 100 tests.
  12763. 1423.45 s [vector] append: OK
  12764. 1423.46 s [vector] +++ OK, passed 100 tests.
  12765. 1423.46 s [vector] concat: OK (0.01s)
  12766. 1423.46 s [vector] +++ OK, passed 100 tests.
  12767. 1423.46 s [vector] force: OK
  12768. 1423.46 s [vector] +++ OK, passed 100 tests.
  12769. 1423.46 s [vector] upd: OK
  12770. 1423.46 s [vector] +++ OK, passed 100 tests.
  12771. 1423.46 s [vector] accum: OK
  12772. 1423.46 s [vector] +++ OK, passed 100 tests.
  12773. 1423.46 s [vector] reverse: OK
  12774. 1423.47 s [vector] +++ OK, passed 100 tests.
  12775. 1423.47 s [vector] backpermute: OK
  12776. 1423.47 s [vector] +++ OK, passed 100 tests.
  12777. 1423.48 s [vector] map: OK
  12778. 1423.48 s [vector] +++ OK, passed 100 tests.
  12779. 1423.49 s [vector] imap: OK
  12780. 1423.49 s [vector] +++ OK, passed 100 tests.
  12781. 1423.49 s [vector] concatMap: OK
  12782. 1423.50 s [vector] +++ OK, passed 100 tests.
  12783. 1423.50 s [vector] mapM: OK
  12784. 1423.52 s [vector] +++ OK, passed 100 tests.
  12785. 1423.53 s [vector] mapM_: OK (0.03s)
  12786. 1423.53 s [vector] +++ OK, passed 100 tests.
  12787. 1423.53 s [pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
  12788. 1423.54 s [vector] forM: OK
  12789. 1423.54 s [vector] +++ OK, passed 100 tests.
  12790. 1423.55 s [vector] forM_: OK (0.02s)
  12791. 1423.55 s [vector] +++ OK, passed 100 tests.
  12792. 1423.55 s [vector] imapM: OK
  12793. 1423.56 s [vector] +++ OK, passed 100 tests.
  12794. 1423.57 s [pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
  12795. 1423.58 s [vector] imapM_: OK (0.03s)
  12796. 1423.58 s [vector] +++ OK, passed 100 tests.
  12797. 1423.58 s [vector] zipWith: OK
  12798. 1423.58 s [vector] +++ OK, passed 100 tests.
  12799. 1423.58 s [vector] zipWith3: OK
  12800. 1423.58 s [vector] +++ OK, passed 100 tests.
  12801. 1423.59 s [vector] izipWith: OK
  12802. 1423.59 s [vector] +++ OK, passed 100 tests.
  12803. 1423.59 s [vector] izipWith3: OK
  12804. 1423.59 s [vector] +++ OK, passed 100 tests.
  12805. 1423.60 s [vector] izipWithM: OK
  12806. 1423.60 s [vector] +++ OK, passed 100 tests.
  12807. 1423.61 s [vector] izipWithM_: OK (0.01s)
  12808. 1423.61 s [vector] +++ OK, passed 100 tests.
  12809. 1423.61 s [vector] zipWithM: OK
  12810. 1423.61 s [vector] +++ OK, passed 100 tests.
  12811. 1423.62 s [vector] zipWithM_: OK (0.01s)
  12812. 1423.62 s [vector] +++ OK, passed 100 tests.
  12813. 1423.62 s [vector] filter: OK
  12814. 1423.62 s [vector] +++ OK, passed 100 tests.
  12815. 1423.62 s [vector] ifilter: OK
  12816. 1423.62 s [vector] +++ OK, passed 100 tests.
  12817. 1423.65 s [vector] filterM: OK (0.01s)
  12818. 1423.66 s [vector] +++ OK, passed 100 tests.
  12819. 1423.66 s [vector] uniq: OK
  12820. 1423.66 s [vector] +++ OK, passed 100 tests.
  12821. 1423.66 s [vector] mapMaybe: OK
  12822. 1423.66 s [vector] +++ OK, passed 100 tests.
  12823. 1423.66 s [vector] imapMaybe: OK
  12824. 1423.66 s [vector] +++ OK, passed 100 tests.
  12825. 1423.66 s [vector] takeWhile: OK
  12826. 1423.66 s [vector] +++ OK, passed 100 tests.
  12827. 1423.66 s [vector] dropWhile: OK
  12828. 1423.66 s [vector] +++ OK, passed 100 tests.
  12829. 1423.66 s [vector] partition: OK
  12830. 1423.66 s [vector] +++ OK, passed 100 tests.
  12831. 1423.66 s [vector] partitionWith: OK
  12832. 1423.66 s [vector] +++ OK, passed 100 tests.
  12833. 1423.66 s [vector] span: OK
  12834. 1423.66 s [vector] +++ OK, passed 100 tests.
  12835. 1423.66 s [vector] break: OK
  12836. 1423.66 s [vector] +++ OK, passed 100 tests.
  12837. 1423.66 s [vector] spanR: OK
  12838. 1423.66 s [vector] +++ OK, passed 100 tests.
  12839. 1423.67 s [vector] breakR: OK
  12840. 1423.67 s [vector] +++ OK, passed 100 tests.
  12841. 1423.67 s [vector] groupBy: OK
  12842. 1423.67 s [vector] +++ OK, passed 100 tests.
  12843. 1423.67 s [vector] elem: OK
  12844. 1423.67 s [vector] +++ OK, passed 100 tests.
  12845. 1423.67 s [vector] notElem: OK
  12846. 1423.67 s [vector] +++ OK, passed 100 tests.
  12847. 1423.67 s [vector] find: OK
  12848. 1423.67 s [vector] +++ OK, passed 100 tests.
  12849. 1423.67 s [vector] findIndex: OK
  12850. 1423.67 s [vector] +++ OK, passed 100 tests.
  12851. 1423.67 s [vector] findIndexR: OK
  12852. 1423.67 s [vector] +++ OK, passed 100 tests.
  12853. 1423.67 s [vector] findIndices: OK
  12854. 1423.67 s [vector] +++ OK, passed 100 tests.
  12855. 1423.67 s [vector] elemIndex: OK
  12856. 1423.67 s [vector] +++ OK, passed 100 tests.
  12857. 1423.68 s [vector] elemIndices: OK
  12858. 1423.68 s [vector] +++ OK, passed 100 tests.
  12859. 1423.68 s [vector] foldl: OK
  12860. 1423.68 s [vector] +++ OK, passed 100 tests.
  12861. 1423.68 s [vector] foldl1: OK
  12862. 1423.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12863. 1423.68 s [vector] foldl': OK
  12864. 1423.68 s [vector] +++ OK, passed 100 tests.
  12865. 1423.68 s [vector] foldl1': OK
  12866. 1423.68 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12867. 1423.68 s [vector] foldr: OK
  12868. 1423.68 s [vector] +++ OK, passed 100 tests.
  12869. 1423.69 s [vector] foldr1: OK
  12870. 1423.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12871. 1423.69 s [vector] foldr': OK
  12872. 1423.70 s [vector] +++ OK, passed 100 tests.
  12873. 1423.70 s [vector] foldr1': OK
  12874. 1423.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12875. 1423.70 s [vector] ifoldl: OK
  12876. 1423.70 s [vector] +++ OK, passed 100 tests.
  12877. 1423.70 s [vector] ifoldl': OK
  12878. 1423.71 s [vector] +++ OK, passed 100 tests.
  12879. 1423.71 s [vector] ifoldr: OK
  12880. 1423.71 s [vector] +++ OK, passed 100 tests.
  12881. 1423.71 s [vector] ifoldr': OK
  12882. 1423.71 s [vector] +++ OK, passed 100 tests.
  12883. 1423.72 s [vector] ifoldM: OK
  12884. 1423.72 s [vector] +++ OK, passed 100 tests.
  12885. 1423.72 s [vector] ifoldM': OK
  12886. 1423.72 s [vector] +++ OK, passed 100 tests.
  12887. 1423.74 s [vector] ifoldM_: OK (0.02s)
  12888. 1423.74 s [vector] +++ OK, passed 100 tests.
  12889. 1423.74 s [vector] ifoldM'_: OK (0.01s)
  12890. 1423.74 s [vector] +++ OK, passed 100 tests.
  12891. 1423.75 s [vector] all: OK
  12892. 1423.75 s [vector] +++ OK, passed 100 tests.
  12893. 1423.75 s [vector] any: OK
  12894. 1423.75 s [vector] +++ OK, passed 100 tests.
  12895. 1423.75 s [vector] prescanl: OK
  12896. 1423.75 s [vector] +++ OK, passed 100 tests.
  12897. 1423.75 s [vector] prescanl': OK
  12898. 1423.75 s [vector] +++ OK, passed 100 tests.
  12899. 1423.75 s [vector] postscanl: OK
  12900. 1423.75 s [vector] +++ OK, passed 100 tests.
  12901. 1423.76 s [vector] postscanl': OK
  12902. 1423.76 s [vector] +++ OK, passed 100 tests.
  12903. 1423.76 s [vector] scanl: OK
  12904. 1423.76 s [vector] +++ OK, passed 100 tests.
  12905. 1423.76 s [vector] scanl': OK
  12906. 1423.76 s [vector] +++ OK, passed 100 tests.
  12907. 1423.77 s [vector] scanl1: OK
  12908. 1423.77 s [vector] +++ OK, passed 100 tests.
  12909. 1423.77 s [vector] scanl1': OK
  12910. 1423.77 s [vector] +++ OK, passed 100 tests.
  12911. 1423.77 s [vector] iscanl: OK
  12912. 1423.77 s [vector] +++ OK, passed 100 tests.
  12913. 1423.78 s [vector] iscanl': OK
  12914. 1423.78 s [vector] +++ OK, passed 100 tests.
  12915. 1423.78 s [vector] prescanr: OK
  12916. 1423.78 s [vector] +++ OK, passed 100 tests.
  12917. 1423.78 s [vector] prescanr': OK
  12918. 1423.78 s [vector] +++ OK, passed 100 tests.
  12919. 1423.78 s [vector] postscanr: OK
  12920. 1423.78 s [vector] +++ OK, passed 100 tests.
  12921. 1423.78 s [vector] postscanr': OK
  12922. 1423.78 s [vector] +++ OK, passed 100 tests.
  12923. 1423.79 s [vector] scanr: OK
  12924. 1423.79 s [vector] +++ OK, passed 100 tests.
  12925. 1423.79 s [vector] scanr': OK
  12926. 1423.79 s [vector] +++ OK, passed 100 tests.
  12927. 1423.79 s [vector] scanr1: OK
  12928. 1423.79 s [vector] +++ OK, passed 100 tests.
  12929. 1423.80 s [vector] scanr1': OK
  12930. 1423.80 s [vector] +++ OK, passed 100 tests.
  12931. 1423.80 s [vector] iscanr: OK
  12932. 1423.80 s [vector] +++ OK, passed 100 tests.
  12933. 1423.80 s [vector] iscanr': OK
  12934. 1423.80 s [vector] +++ OK, passed 100 tests.
  12935. 1423.80 s [vector] mut_read: OK
  12936. 1423.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12937. 1423.80 s [vector] mut_write: OK
  12938. 1423.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12939. 1423.80 s [vector] mut_modify: OK
  12940. 1423.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12941. 1423.81 s [vector] mut_generate: OK
  12942. 1423.82 s [vector] +++ OK, passed 100 tests.
  12943. 1423.82 s [vector] mut_generateM: OK
  12944. 1423.82 s [vector] +++ OK, passed 100 tests.
  12945. 1423.84 s [vector] mut_mapM_: OK (0.01s)
  12946. 1423.84 s [vector] +++ OK, passed 100 tests.
  12947. 1423.86 s [vector] mut_imapM_: OK (0.02s)
  12948. 1423.86 s [vector] +++ OK, passed 100 tests.
  12949. 1423.87 s [vector] mut_forM_: OK (0.02s)
  12950. 1423.87 s [vector] +++ OK, passed 100 tests.
  12951. 1423.89 s [vector] mut_iforM_: OK
  12952. 1423.89 s [vector] +++ OK, passed 100 tests.
  12953. 1423.89 s [vector] mut_foldr: OK
  12954. 1423.90 s [vector] +++ OK, passed 100 tests.
  12955. 1423.90 s [vector] mut_foldr': OK
  12956. 1423.90 s [vector] +++ OK, passed 100 tests.
  12957. 1423.90 s [vector] mut_foldl: OK
  12958. 1423.90 s [vector] +++ OK, passed 100 tests.
  12959. 1423.90 s [vector] mut_foldl': OK
  12960. 1423.91 s [vector] +++ OK, passed 100 tests.
  12961. 1423.91 s [vector] mut_ifoldr: OK
  12962. 1423.91 s [vector] +++ OK, passed 100 tests.
  12963. 1423.92 s [vector] mut_ifoldr': OK
  12964. 1423.92 s [vector] +++ OK, passed 100 tests.
  12965. 1423.93 s [vector] mut_ifoldl: OK
  12966. 1423.93 s [vector] +++ OK, passed 100 tests.
  12967. 1423.93 s [vector] mut_ifoldl': OK
  12968. 1423.93 s [vector] +++ OK, passed 100 tests.
  12969. 1423.94 s [vector] mut_foldM: OK
  12970. 1423.94 s [vector] +++ OK, passed 100 tests.
  12971. 1423.94 s [vector] mut_foldM': OK
  12972. 1423.94 s [vector] +++ OK, passed 100 tests.
  12973. 1423.95 s [vector] mut_foldrM: OK
  12974. 1423.96 s [vector] +++ OK, passed 100 tests.
  12975. 1423.96 s [vector] mut_foldrM': OK
  12976. 1423.96 s [vector] +++ OK, passed 100 tests.
  12977. 1423.97 s [vector] mut_ifoldM: OK
  12978. 1423.97 s [vector] +++ OK, passed 100 tests.
  12979. 1423.97 s [vector] mut_ifoldM': OK
  12980. 1423.98 s [vector] +++ OK, passed 100 tests.
  12981. 1423.98 s [vector] mut_ifoldrM: OK
  12982. 1423.99 s [vector] +++ OK, passed 100 tests.
  12983. 1423.99 s [vector] mut_ifoldrM': OK
  12984. 1423.99 s [vector] +++ OK, passed 100 tests.
  12985. 1423.99 s [vector] compare: OK
  12986. 1423.99 s [vector] +++ OK, passed 100 tests.
  12987. 1423.99 s [vector] maximum: OK
  12988. 1423.99 s [vector] +++ OK, passed 100 tests; 25 discarded.
  12989. 1423.99 s [vector] minimum: OK
  12990. 1423.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12991. 1424.00 s [vector] minIndex: OK
  12992. 1424.00 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12993. 1424.00 s [vector] maxIndex: OK
  12994. 1424.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12995. 1424.00 s [vector] maximumBy: OK
  12996. 1424.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12997. 1424.00 s [vector] minimumBy: OK
  12998. 1424.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12999. 1424.00 s [vector] maximumOn: OK
  13000. 1424.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13001. 1424.00 s [vector] minimumOn: OK
  13002. 1424.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13003. 1424.00 s [vector] maxIndexBy: OK
  13004. 1424.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13005. 1424.01 s [vector] minIndexBy: OK
  13006. 1424.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13007. 1424.01 s [vector] ListFirstMaxIndexWins: OK
  13008. 1424.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13009. 1424.01 s [vector] FalseListFirstMaxIndexWins: OK
  13010. 1424.01 s [vector] +++ OK, failed as expected. (after 1 test):
  13011. 1424.01 s [vector] Exception:
  13012. 1424.01 s [vector] Prelude.foldr1: empty list
  13013. 1424.01 s [vector] CallStack (from HasCallStack):
  13014. 1424.01 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  13015. 1424.01 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  13016. 1424.01 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13017. 1424.01 s [vector] []
  13018. 1424.01 s [vector] zip: OK
  13019. 1424.01 s [vector] +++ OK, passed 100 tests.
  13020. 1424.02 s [vector] zip3: OK
  13021. 1424.02 s [vector] +++ OK, passed 100 tests.
  13022. 1424.02 s [vector] unzip: OK
  13023. 1424.02 s [vector] +++ OK, passed 100 tests.
  13024. 1424.02 s [vector] unzip3: OK
  13025. 1424.02 s [vector] +++ OK, passed 100 tests.
  13026. 1424.02 s [vector] indexed: OK
  13027. 1424.02 s [vector] +++ OK, passed 100 tests.
  13028. 1424.04 s [vector] update: OK
  13029. 1424.04 s [vector] +++ OK, passed 100 tests.
  13030. 1424.04 s [vector] concat: OK (0.01s)
  13031. 1424.04 s [vector] +++ OK, passed 100 tests.
  13032. 1424.04 s [vector] mempty: OK
  13033. 1424.04 s [vector] +++ OK, passed 100 tests.
  13034. 1424.05 s [vector] mappend: OK
  13035. 1424.05 s [vector] +++ OK, passed 100 tests.
  13036. 1424.05 s [vector] mconcat: OK (0.02s)
  13037. 1424.05 s [vector] +++ OK, passed 100 tests.
  13038. 1424.05 s [vector] fmap: OK
  13039. 1424.06 s [vector] +++ OK, passed 100 tests.
  13040. 1424.06 s [vector] return: OK
  13041. 1424.06 s [vector] +++ OK, passed 100 tests.
  13042. 1424.10 s [vector] bind: OK (0.04s)
  13043. 1424.10 s [vector] +++ OK, passed 100 tests.
  13044. 1424.10 s [vector] mzip: OK
  13045. 1424.10 s [vector] +++ OK, passed 100 tests.
  13046. 1424.10 s [vector] munzip: OK
  13047. 1424.10 s [vector] +++ OK, passed 100 tests.
  13048. 1424.12 s [vector] applicative_pure: OK
  13049. 1424.12 s [vector] +++ OK, passed 100 tests.
  13050. 1424.15 s [vector] applicative_appl: OK (0.05s)
  13051. 1424.15 s [vector] +++ OK, passed 100 tests.
  13052. 1424.15 s [vector] alternative_empty: OK
  13053. 1424.15 s [vector] +++ OK, passed 100 tests.
  13054. 1424.15 s [vector] alternative_or: OK
  13055. 1424.16 s [vector] +++ OK, passed 100 tests.
  13056. 1424.20 s [vector] sequence: OK (0.04s)
  13057. 1424.20 s [vector] +++ OK, passed 100 tests.
  13058. 1424.20 s [vector] sequence_: OK (0.02s)
  13059. 1424.20 s [vector] +++ OK, passed 100 tests.
  13060. 1424.20 s [vector] glength: OK
  13061. 1424.21 s [vector] +++ OK, passed 100 tests.
  13062. 1424.21 s [vector] sum: OK
  13063. 1424.21 s [vector] +++ OK, passed 100 tests.
  13064. 1424.21 s [vector] product: OK
  13065. 1424.21 s [vector] +++ OK, passed 100 tests.
  13066. 1424.21 s [vector] enumFromN: OK
  13067. 1424.21 s [vector] +++ OK, passed 100 tests.
  13068. 1424.21 s [vector] enumFromThenN: OK
  13069. 1424.21 s [vector] +++ OK, passed 100 tests.
  13070. 1424.21 s [vector] enumFromTo: OK
  13071. 1424.21 s [vector] +++ OK, passed 100 tests.
  13072. 1424.21 s [vector] enumFromThenTo: OK
  13073. 1424.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13074. 1424.21 s [vector] unstream
  13075. 1424.21 s [vector] unstream == vunstream (exact): OK
  13076. 1424.21 s [vector] +++ OK, passed 100 tests.
  13077. 1424.21 s [vector] unstream == vunstream (unknown): OK
  13078. 1424.21 s [vector] +++ OK, passed 100 tests.
  13079. 1424.21 s [vector] unstreamR ~= vunstream (exact): OK
  13080. 1424.21 s [vector] +++ OK, passed 100 tests.
  13081. 1424.21 s [vector] unstreamR ~= vunstream (unknown): OK
  13082. 1424.21 s [vector] +++ OK, passed 100 tests.
  13083. 1424.21 s [vector] Tests.Vector.Unboxed
  13084. 1424.21 s [vector] ()
  13085. 1424.21 s [vector] fromList.toList == id: OK
  13086. 1424.21 s [vector] +++ OK, passed 100 tests.
  13087. 1424.21 s [vector] toList.fromList == id: OK
  13088. 1424.21 s [vector] +++ OK, passed 100 tests.
  13089. 1424.21 s [vector] unstream.stream == id: OK
  13090. 1424.21 s [vector] +++ OK, passed 100 tests.
  13091. 1424.21 s [vector] stream.unstream == id: OK
  13092. 1424.21 s [vector] +++ OK, passed 100 tests.
  13093. 1424.21 s [vector] eq: OK
  13094. 1424.21 s [vector] +++ OK, passed 100 tests.
  13095. 1424.21 s [vector] length: OK
  13096. 1424.21 s [vector] +++ OK, passed 100 tests.
  13097. 1424.21 s [vector] null: OK
  13098. 1424.21 s [vector] +++ OK, passed 100 tests.
  13099. 1424.21 s [vector] index: OK
  13100. 1424.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13101. 1424.21 s [vector] safeIndex: OK
  13102. 1424.21 s [vector] +++ OK, passed 100 tests.
  13103. 1424.21 s [vector] head: OK
  13104. 1424.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13105. 1424.22 s [vector] last: OK
  13106. 1424.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13107. 1424.22 s [vector] unsafeIndex: OK
  13108. 1424.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13109. 1424.22 s [vector] unsafeHead: OK
  13110. 1424.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13111. 1424.22 s [vector] unsafeLast: OK
  13112. 1424.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13113. 1424.22 s [vector] slice: OK
  13114. 1424.22 s [vector] +++ OK, passed 100 tests.
  13115. 1424.22 s [vector] init: OK
  13116. 1424.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13117. 1424.22 s [vector] tail: OK
  13118. 1424.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13119. 1424.22 s [vector] take: OK
  13120. 1424.22 s [vector] +++ OK, passed 100 tests.
  13121. 1424.22 s [vector] drop: OK
  13122. 1424.22 s [vector] +++ OK, passed 100 tests.
  13123. 1424.22 s [vector] splitAt: OK
  13124. 1424.22 s [vector] +++ OK, passed 100 tests.
  13125. 1424.22 s [vector] empty: OK
  13126. 1424.22 s [vector] +++ OK, passed 100 tests.
  13127. 1424.22 s [vector] singleton: OK
  13128. 1424.22 s [vector] +++ OK, passed 100 tests.
  13129. 1424.22 s [vector] replicate: OK
  13130. 1424.22 s [vector] +++ OK, passed 100 tests.
  13131. 1424.22 s [vector] generate: OK
  13132. 1424.22 s [vector] +++ OK, passed 100 tests.
  13133. 1424.22 s [vector] iterateN: OK
  13134. 1424.22 s [vector] +++ OK, passed 100 tests.
  13135. 1424.28 s [vector] iterateNM: OK (0.04s)
  13136. 1424.28 s [vector] +++ OK, passed 100 tests.
  13137. 1424.31 s [vector] generateM: OK (0.02s)
  13138. 1424.31 s [vector] +++ OK, passed 100 tests.
  13139. 1424.31 s [vector] replicateM: OK (0.03s)
  13140. 1424.31 s [vector] +++ OK, passed 100 tests.
  13141. 1424.32 s [vector] create: OK
  13142. 1424.32 s [vector] +++ OK, passed 100 tests.
  13143. 1424.32 s [vector] createT: OK
  13144. 1424.32 s [vector] +++ OK, passed 100 tests.
  13145. 1424.33 s [vector] unfoldr: OK
  13146. 1424.33 s [vector] +++ OK, passed 100 tests.
  13147. 1424.33 s [vector] unfoldrN: OK
  13148. 1424.33 s [vector] +++ OK, passed 100 tests.
  13149. 1424.33 s [vector] unfoldrExactN: OK
  13150. 1424.33 s [vector] +++ OK, passed 100 tests.
  13151. 1424.33 s [vector] unfoldrM: OK
  13152. 1424.33 s [vector] +++ OK, passed 100 tests.
  13153. 1424.34 s [vector] unfoldrNM: OK
  13154. 1424.34 s [vector] +++ OK, passed 100 tests.
  13155. 1424.35 s [vector] unfoldrExactNM: OK (0.02s)
  13156. 1424.35 s [vector] +++ OK, passed 100 tests.
  13157. 1424.35 s [vector] constructN: OK
  13158. 1424.35 s [vector] +++ OK, passed 100 tests.
  13159. 1424.35 s [vector] constructrN: OK
  13160. 1424.35 s [vector] +++ OK, passed 100 tests.
  13161. 1424.35 s [vector] cons: OK
  13162. 1424.35 s [vector] +++ OK, passed 100 tests.
  13163. 1424.35 s [vector] snoc: OK
  13164. 1424.35 s [vector] +++ OK, passed 100 tests.
  13165. 1424.36 s [vector] append: OK
  13166. 1424.36 s [vector] +++ OK, passed 100 tests.
  13167. 1424.36 s [vector] concat: OK (0.01s)
  13168. 1424.36 s [vector] +++ OK, passed 100 tests.
  13169. 1424.36 s [vector] force: OK
  13170. 1424.36 s [vector] +++ OK, passed 100 tests.
  13171. 1424.37 s [vector] upd: OK
  13172. 1424.37 s [vector] +++ OK, passed 100 tests.
  13173. 1424.37 s [vector] accum: OK
  13174. 1424.37 s [vector] +++ OK, passed 100 tests.
  13175. 1424.37 s [vector] reverse: OK
  13176. 1424.37 s [vector] +++ OK, passed 100 tests.
  13177. 1424.37 s [vector] backpermute: OK
  13178. 1424.37 s [vector] +++ OK, passed 100 tests.
  13179. 1424.37 s [vector] map: OK
  13180. 1424.37 s [vector] +++ OK, passed 100 tests.
  13181. 1424.37 s [vector] imap: OK
  13182. 1424.37 s [vector] +++ OK, passed 100 tests.
  13183. 1424.37 s [vector] concatMap: OK
  13184. 1424.37 s [vector] +++ OK, passed 100 tests.
  13185. 1424.37 s [vector] mapM: OK
  13186. 1424.37 s [vector] +++ OK, passed 100 tests.
  13187. 1424.38 s [vector] mapM_: OK
  13188. 1424.38 s [vector] +++ OK, passed 100 tests.
  13189. 1424.38 s [vector] forM: OK
  13190. 1424.40 s [vector] +++ OK, passed 100 tests.
  13191. 1424.40 s [vector] forM_: OK (0.02s)
  13192. 1424.40 s [vector] +++ OK, passed 100 tests.
  13193. 1424.40 s [vector] imapM: OK
  13194. 1424.42 s [vector] +++ OK, passed 100 tests.
  13195. 1424.42 s [vector] imapM_: OK (0.01s)
  13196. 1424.42 s [vector] +++ OK, passed 100 tests.
  13197. 1424.42 s [vector] zipWith: OK
  13198. 1424.42 s [vector] +++ OK, passed 100 tests.
  13199. 1424.42 s [vector] zipWith3: OK
  13200. 1424.43 s [vector] +++ OK, passed 100 tests.
  13201. 1424.43 s [vector] izipWith: OK
  13202. 1424.43 s [vector] +++ OK, passed 100 tests.
  13203. 1424.44 s [vector] izipWith3: OK
  13204. 1424.44 s [vector] +++ OK, passed 100 tests.
  13205. 1424.44 s [vector] izipWithM: OK
  13206. 1424.44 s [vector] +++ OK, passed 100 tests.
  13207. 1424.44 s [vector] izipWithM_: OK
  13208. 1424.44 s [vector] +++ OK, passed 100 tests.
  13209. 1424.45 s [vector] zipWithM: OK
  13210. 1424.45 s [vector] +++ OK, passed 100 tests.
  13211. 1424.45 s [vector] zipWithM_: OK
  13212. 1424.45 s [vector] +++ OK, passed 100 tests.
  13213. 1424.45 s [vector] filter: OK
  13214. 1424.45 s [vector] +++ OK, passed 100 tests.
  13215. 1424.45 s [vector] ifilter: OK
  13216. 1424.45 s [vector] +++ OK, passed 100 tests.
  13217. 1424.47 s [vector] filterM: OK (0.01s)
  13218. 1424.47 s [vector] +++ OK, passed 100 tests.
  13219. 1424.48 s [vector] uniq: OK
  13220. 1424.48 s [vector] +++ OK, passed 100 tests.
  13221. 1424.48 s [vector] mapMaybe: OK
  13222. 1424.48 s [vector] +++ OK, passed 100 tests.
  13223. 1424.48 s [vector] imapMaybe: OK
  13224. 1424.48 s [vector] +++ OK, passed 100 tests.
  13225. 1424.48 s [vector] takeWhile: OK
  13226. 1424.48 s [vector] +++ OK, passed 100 tests.
  13227. 1424.48 s [vector] dropWhile: OK
  13228. 1424.48 s [vector] +++ OK, passed 100 tests.
  13229. 1424.49 s [vector] partition: OK
  13230. 1424.49 s [vector] +++ OK, passed 100 tests.
  13231. 1424.49 s [vector] partitionWith: OK
  13232. 1424.49 s [vector] +++ OK, passed 100 tests.
  13233. 1424.49 s [vector] span: OK
  13234. 1424.49 s [vector] +++ OK, passed 100 tests.
  13235. 1424.49 s [vector] break: OK
  13236. 1424.49 s [vector] +++ OK, passed 100 tests.
  13237. 1424.49 s [vector] spanR: OK
  13238. 1424.49 s [vector] +++ OK, passed 100 tests.
  13239. 1424.49 s [vector] breakR: OK
  13240. 1424.49 s [vector] +++ OK, passed 100 tests.
  13241. 1424.49 s [vector] groupBy: OK
  13242. 1424.49 s [vector] +++ OK, passed 100 tests.
  13243. 1424.49 s [vector] elem: OK
  13244. 1424.49 s [vector] +++ OK, passed 100 tests.
  13245. 1424.49 s [vector] notElem: OK
  13246. 1424.49 s [vector] +++ OK, passed 100 tests.
  13247. 1424.49 s [vector] find: OK
  13248. 1424.49 s [vector] +++ OK, passed 100 tests.
  13249. 1424.49 s [vector] findIndex: OK
  13250. 1424.49 s [vector] +++ OK, passed 100 tests.
  13251. 1424.49 s [vector] findIndexR: OK
  13252. 1424.49 s [vector] +++ OK, passed 100 tests.
  13253. 1424.49 s [vector] findIndices: OK
  13254. 1424.49 s [vector] +++ OK, passed 100 tests.
  13255. 1424.49 s [vector] elemIndex: OK
  13256. 1424.49 s [vector] +++ OK, passed 100 tests.
  13257. 1424.49 s [vector] elemIndices: OK
  13258. 1424.49 s [vector] +++ OK, passed 100 tests.
  13259. 1424.49 s [vector] foldl: OK
  13260. 1424.49 s [vector] +++ OK, passed 100 tests.
  13261. 1424.49 s [vector] foldl1: OK
  13262. 1424.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13263. 1424.49 s [vector] foldl': OK
  13264. 1424.49 s [vector] +++ OK, passed 100 tests.
  13265. 1424.49 s [vector] foldl1': OK
  13266. 1424.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13267. 1424.49 s [vector] foldr: OK
  13268. 1424.49 s [vector] +++ OK, passed 100 tests.
  13269. 1424.49 s [vector] foldr1: OK
  13270. 1424.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13271. 1424.49 s [vector] foldr': OK
  13272. 1424.49 s [vector] +++ OK, passed 100 tests.
  13273. 1424.49 s [vector] foldr1': OK
  13274. 1424.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13275. 1424.49 s [vector] ifoldl: OK
  13276. 1424.50 s [vector] +++ OK, passed 100 tests.
  13277. 1424.50 s [vector] ifoldl': OK
  13278. 1424.50 s [vector] +++ OK, passed 100 tests.
  13279. 1424.50 s [vector] ifoldr: OK
  13280. 1424.50 s [vector] +++ OK, passed 100 tests.
  13281. 1424.50 s [vector] ifoldr': OK
  13282. 1424.50 s [vector] +++ OK, passed 100 tests.
  13283. 1424.50 s [vector] ifoldM: OK
  13284. 1424.50 s [vector] +++ OK, passed 100 tests.
  13285. 1424.50 s [vector] ifoldM': OK
  13286. 1424.50 s [vector] +++ OK, passed 100 tests.
  13287. 1424.50 s [vector] ifoldM_: OK
  13288. 1424.50 s [vector] +++ OK, passed 100 tests.
  13289. 1424.51 s [vector] ifoldM'_: OK
  13290. 1424.51 s [vector] +++ OK, passed 100 tests.
  13291. 1424.51 s [vector] all: OK
  13292. 1424.51 s [vector] +++ OK, passed 100 tests.
  13293. 1424.51 s [vector] any: OK
  13294. 1424.51 s [vector] +++ OK, passed 100 tests.
  13295. 1424.51 s [vector] prescanl: OK
  13296. 1424.51 s [vector] +++ OK, passed 100 tests.
  13297. 1424.52 s [vector] prescanl': OK
  13298. 1424.52 s [vector] +++ OK, passed 100 tests.
  13299. 1424.52 s [vector] postscanl: OK
  13300. 1424.52 s [vector] +++ OK, passed 100 tests.
  13301. 1424.52 s [vector] postscanl': OK
  13302. 1424.52 s [vector] +++ OK, passed 100 tests.
  13303. 1424.52 s [vector] scanl: OK
  13304. 1424.52 s [vector] +++ OK, passed 100 tests.
  13305. 1424.52 s [vector] scanl': OK
  13306. 1424.52 s [vector] +++ OK, passed 100 tests.
  13307. 1424.52 s [vector] scanl1: OK
  13308. 1424.52 s [vector] +++ OK, passed 100 tests.
  13309. 1424.52 s [vector] scanl1': OK
  13310. 1424.52 s [vector] +++ OK, passed 100 tests.
  13311. 1424.52 s [vector] iscanl: OK
  13312. 1424.52 s [vector] +++ OK, passed 100 tests.
  13313. 1424.52 s [vector] iscanl': OK
  13314. 1424.53 s [vector] +++ OK, passed 100 tests.
  13315. 1424.53 s [vector] prescanr: OK
  13316. 1424.53 s [vector] +++ OK, passed 100 tests.
  13317. 1424.53 s [vector] prescanr': OK
  13318. 1424.53 s [vector] +++ OK, passed 100 tests.
  13319. 1424.53 s [vector] postscanr: OK
  13320. 1424.53 s [vector] +++ OK, passed 100 tests.
  13321. 1424.53 s [vector] postscanr': OK
  13322. 1424.53 s [vector] +++ OK, passed 100 tests.
  13323. 1424.53 s [vector] scanr: OK
  13324. 1424.53 s [vector] +++ OK, passed 100 tests.
  13325. 1424.53 s [vector] scanr': OK
  13326. 1424.53 s [vector] +++ OK, passed 100 tests.
  13327. 1424.53 s [vector] scanr1: OK
  13328. 1424.53 s [vector] +++ OK, passed 100 tests.
  13329. 1424.53 s [vector] scanr1': OK
  13330. 1424.53 s [pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
  13331. 1424.54 s [pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
  13332. 1424.54 s [pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
  13333. 1424.54 s [vector] +++ OK, passed 100 tests.
  13334. 1424.54 s [vector] iscanr: OK
  13335. 1424.54 s [vector] +++ OK, passed 100 tests.
  13336. 1424.54 s [vector] iscanr': OK
  13337. 1424.54 s [vector] +++ OK, passed 100 tests.
  13338. 1424.54 s [vector] mut_read: OK
  13339. 1424.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13340. 1424.54 s [vector] mut_write: OK
  13341. 1424.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13342. 1424.54 s [vector] mut_modify: OK
  13343. 1424.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13344. 1424.54 s [vector] mut_generate: OK
  13345. 1424.55 s [vector] +++ OK, passed 100 tests.
  13346. 1424.56 s [vector] mut_generateM: OK
  13347. 1424.56 s [vector] +++ OK, passed 100 tests.
  13348. 1424.56 s [vector] mut_mapM_: OK
  13349. 1424.56 s [vector] +++ OK, passed 100 tests.
  13350. 1424.57 s [vector] mut_imapM_: OK
  13351. 1424.57 s [vector] +++ OK, passed 100 tests.
  13352. 1424.58 s [vector] mut_forM_: OK
  13353. 1424.58 s [vector] +++ OK, passed 100 tests.
  13354. 1424.58 s [vector] mut_iforM_: OK (0.01s)
  13355. 1424.58 s [vector] +++ OK, passed 100 tests.
  13356. 1424.58 s [vector] mut_foldr: OK
  13357. 1424.59 s [vector] +++ OK, passed 100 tests.
  13358. 1424.59 s [vector] mut_foldr': OK
  13359. 1424.59 s [vector] +++ OK, passed 100 tests.
  13360. 1424.59 s [vector] mut_foldl: OK
  13361. 1424.59 s [vector] +++ OK, passed 100 tests.
  13362. 1424.59 s [vector] mut_foldl': OK
  13363. 1424.59 s [vector] +++ OK, passed 100 tests.
  13364. 1424.59 s [vector] mut_ifoldr: OK
  13365. 1424.59 s [vector] +++ OK, passed 100 tests.
  13366. 1424.59 s [vector] mut_ifoldr': OK
  13367. 1424.59 s [vector] +++ OK, passed 100 tests.
  13368. 1424.59 s [vector] mut_ifoldl: OK
  13369. 1424.59 s [vector] +++ OK, passed 100 tests.
  13370. 1424.59 s [vector] mut_ifoldl': OK
  13371. 1424.59 s [vector] +++ OK, passed 100 tests.
  13372. 1424.59 s [vector] mut_foldM: OK
  13373. 1424.60 s [vector] +++ OK, passed 100 tests.
  13374. 1424.60 s [vector] mut_foldM': OK
  13375. 1424.60 s [vector] +++ OK, passed 100 tests.
  13376. 1424.60 s [vector] mut_foldrM: OK
  13377. 1424.60 s [vector] +++ OK, passed 100 tests.
  13378. 1424.60 s [vector] mut_foldrM': OK
  13379. 1424.60 s [vector] +++ OK, passed 100 tests.
  13380. 1424.60 s [vector] mut_ifoldM: OK
  13381. 1424.60 s [vector] +++ OK, passed 100 tests.
  13382. 1424.60 s [vector] mut_ifoldM': OK
  13383. 1424.60 s [vector] +++ OK, passed 100 tests.
  13384. 1424.60 s [vector] mut_ifoldrM: OK
  13385. 1424.60 s [vector] +++ OK, passed 100 tests.
  13386. 1424.60 s [vector] mut_ifoldrM': OK
  13387. 1424.60 s [vector] +++ OK, passed 100 tests.
  13388. 1424.60 s [vector] compare: OK
  13389. 1424.60 s [vector] +++ OK, passed 100 tests.
  13390. 1424.60 s [vector] maximum: OK
  13391. 1424.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13392. 1424.60 s [vector] minimum: OK
  13393. 1424.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13394. 1424.60 s [vector] minIndex: OK
  13395. 1424.60 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13396. 1424.60 s [vector] maxIndex: OK
  13397. 1424.60 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13398. 1424.60 s [vector] maximumBy: OK
  13399. 1424.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13400. 1424.60 s [vector] minimumBy: OK
  13401. 1424.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13402. 1424.60 s [vector] maximumOn: OK
  13403. 1424.60 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13404. 1424.60 s [vector] minimumOn: OK
  13405. 1424.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13406. 1424.60 s [vector] maxIndexBy: OK
  13407. 1424.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13408. 1424.61 s [vector] minIndexBy: OK
  13409. 1424.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13410. 1424.61 s [vector] ListFirstMaxIndexWins: OK
  13411. 1424.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13412. 1424.61 s [vector] FalseListFirstMaxIndexWins: OK
  13413. 1424.61 s [vector] +++ OK, failed as expected. (after 1 test):
  13414. 1424.61 s [vector] Exception:
  13415. 1424.61 s [vector] Prelude.foldr1: empty list
  13416. 1424.61 s [vector] CallStack (from HasCallStack):
  13417. 1424.61 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  13418. 1424.61 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  13419. 1424.61 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13420. 1424.61 s [vector] []
  13421. 1424.61 s [vector] zip: OK
  13422. 1424.61 s [vector] +++ OK, passed 100 tests.
  13423. 1424.61 s [vector] zip3: OK
  13424. 1424.62 s [vector] +++ OK, passed 100 tests.
  13425. 1424.62 s [vector] unzip: OK
  13426. 1424.62 s [vector] +++ OK, passed 100 tests.
  13427. 1424.62 s [vector] unzip3: OK
  13428. 1424.62 s [vector] +++ OK, passed 100 tests.
  13429. 1424.62 s [vector] indexed: OK
  13430. 1424.62 s [vector] +++ OK, passed 100 tests.
  13431. 1424.62 s [vector] update: OK
  13432. 1424.62 s [vector] +++ OK, passed 100 tests.
  13433. 1424.62 s [vector] mempty: OK
  13434. 1424.62 s [vector] +++ OK, passed 100 tests.
  13435. 1424.63 s [vector] mappend: OK
  13436. 1424.64 s [vector] +++ OK, passed 100 tests.
  13437. 1424.64 s [vector] mconcat: OK (0.01s)
  13438. 1424.64 s [vector] +++ OK, passed 100 tests.
  13439. 1424.64 s [vector] glength: OK
  13440. 1424.64 s [vector] +++ OK, passed 100 tests.
  13441. 1424.64 s [vector] (Bool)
  13442. 1424.64 s [vector] fromList.toList == id: OK
  13443. 1424.64 s [vector] +++ OK, passed 100 tests.
  13444. 1424.64 s [vector] toList.fromList == id: OK
  13445. 1424.64 s [vector] +++ OK, passed 100 tests.
  13446. 1424.64 s [vector] unstream.stream == id: OK
  13447. 1424.64 s [vector] +++ OK, passed 100 tests.
  13448. 1424.64 s [vector] stream.unstream == id: OK
  13449. 1424.64 s [vector] +++ OK, passed 100 tests.
  13450. 1424.64 s [vector] eq: OK
  13451. 1424.64 s [vector] +++ OK, passed 100 tests.
  13452. 1424.64 s [vector] length: OK
  13453. 1424.64 s [vector] +++ OK, passed 100 tests.
  13454. 1424.65 s [vector] null: OK
  13455. 1424.65 s [vector] +++ OK, passed 100 tests.
  13456. 1424.65 s [vector] index: OK
  13457. 1424.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13458. 1424.65 s [vector] safeIndex: OK
  13459. 1424.65 s [vector] +++ OK, passed 100 tests.
  13460. 1424.65 s [vector] head: OK
  13461. 1424.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13462. 1424.65 s [vector] last: OK
  13463. 1424.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13464. 1424.65 s [vector] unsafeIndex: OK
  13465. 1424.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13466. 1424.65 s [vector] unsafeHead: OK
  13467. 1424.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13468. 1424.65 s [vector] unsafeLast: OK
  13469. 1424.65 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13470. 1424.65 s [vector] slice: OK
  13471. 1424.65 s [vector] +++ OK, passed 100 tests.
  13472. 1424.65 s [vector] init: OK
  13473. 1424.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13474. 1424.65 s [vector] tail: OK
  13475. 1424.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13476. 1424.65 s [vector] take: OK
  13477. 1424.65 s [vector] +++ OK, passed 100 tests.
  13478. 1424.65 s [vector] drop: OK
  13479. 1424.65 s [vector] +++ OK, passed 100 tests.
  13480. 1424.65 s [vector] splitAt: OK
  13481. 1424.65 s [vector] +++ OK, passed 100 tests.
  13482. 1424.65 s [vector] empty: OK
  13483. 1424.65 s [vector] +++ OK, passed 100 tests.
  13484. 1424.65 s [vector] singleton: OK
  13485. 1424.65 s [vector] +++ OK, passed 100 tests.
  13486. 1424.65 s [vector] replicate: OK
  13487. 1424.65 s [vector] +++ OK, passed 100 tests.
  13488. 1424.65 s [vector] generate: OK
  13489. 1424.65 s [vector] +++ OK, passed 100 tests.
  13490. 1424.65 s [vector] iterateN: OK
  13491. 1424.66 s [vector] +++ OK, passed 100 tests.
  13492. 1424.69 s [vector] iterateNM: OK (0.02s)
  13493. 1424.69 s [vector] +++ OK, passed 100 tests.
  13494. 1424.70 s [vector] generateM: OK (0.01s)
  13495. 1424.70 s [vector] +++ OK, passed 100 tests.
  13496. 1424.70 s [vector] replicateM: OK
  13497. 1424.70 s [vector] +++ OK, passed 100 tests.
  13498. 1424.70 s [vector] create: OK
  13499. 1424.70 s [vector] +++ OK, passed 100 tests.
  13500. 1424.70 s [vector] createT: OK
  13501. 1424.70 s [vector] +++ OK, passed 100 tests.
  13502. 1424.70 s [vector] unfoldr: OK
  13503. 1424.70 s [vector] +++ OK, passed 100 tests.
  13504. 1424.70 s [vector] unfoldrN: OK
  13505. 1424.70 s [vector] +++ OK, passed 100 tests.
  13506. 1424.70 s [vector] unfoldrExactN: OK
  13507. 1424.70 s [vector] +++ OK, passed 100 tests.
  13508. 1424.70 s [vector] unfoldrM: OK
  13509. 1424.70 s [vector] +++ OK, passed 100 tests.
  13510. 1424.70 s [vector] unfoldrNM: OK
  13511. 1424.70 s [pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
  13512. 1424.70 s [pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
  13513. 1424.70 s [pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
  13514. 1424.72 s [vector] +++ OK, passed 100 tests.
  13515. 1424.73 s [vector] unfoldrExactNM: OK (0.02s)
  13516. 1424.73 s [vector] +++ OK, passed 100 tests.
  13517. 1424.73 s [vector] constructN: OK
  13518. 1424.73 s [vector] +++ OK, passed 100 tests.
  13519. 1424.73 s [vector] constructrN: OK
  13520. 1424.73 s [vector] +++ OK, passed 100 tests.
  13521. 1424.73 s [vector] cons: OK
  13522. 1424.73 s [vector] +++ OK, passed 100 tests.
  13523. 1424.73 s [vector] snoc: OK
  13524. 1424.73 s [vector] +++ OK, passed 100 tests.
  13525. 1424.73 s [vector] append: OK
  13526. 1424.74 s [vector] +++ OK, passed 100 tests.
  13527. 1424.75 s [vector] concat: OK (0.01s)
  13528. 1424.75 s [vector] +++ OK, passed 100 tests.
  13529. 1424.75 s [vector] force: OK
  13530. 1424.75 s [vector] +++ OK, passed 100 tests.
  13531. 1424.75 s [vector] upd: OK
  13532. 1424.75 s [vector] +++ OK, passed 100 tests.
  13533. 1424.75 s [vector] accum: OK
  13534. 1424.75 s [vector] +++ OK, passed 100 tests.
  13535. 1424.75 s [vector] reverse: OK
  13536. 1424.75 s [vector] +++ OK, passed 100 tests.
  13537. 1424.75 s [vector] backpermute: OK
  13538. 1424.75 s [vector] +++ OK, passed 100 tests.
  13539. 1424.76 s [vector] map: OK
  13540. 1424.76 s [vector] +++ OK, passed 100 tests.
  13541. 1424.76 s [vector] imap: OK
  13542. 1424.76 s [vector] +++ OK, passed 100 tests.
  13543. 1424.77 s [vector] concatMap: OK
  13544. 1424.77 s [vector] +++ OK, passed 100 tests.
  13545. 1424.78 s [vector] mapM: OK
  13546. 1424.78 s [vector] +++ OK, passed 100 tests.
  13547. 1424.78 s [vector] mapM_: OK
  13548. 1424.78 s [vector] +++ OK, passed 100 tests.
  13549. 1424.78 s [vector] forM: OK
  13550. 1424.78 s [vector] +++ OK, passed 100 tests.
  13551. 1424.78 s [vector] forM_: OK (0.01s)
  13552. 1424.78 s [vector] +++ OK, passed 100 tests.
  13553. 1424.79 s [vector] imapM: OK
  13554. 1424.79 s [vector] +++ OK, passed 100 tests.
  13555. 1424.80 s [vector] imapM_: OK (0.01s)
  13556. 1424.80 s [vector] +++ OK, passed 100 tests.
  13557. 1424.80 s [vector] zipWith: OK
  13558. 1424.80 s [vector] +++ OK, passed 100 tests.
  13559. 1424.80 s [vector] zipWith3: OK
  13560. 1424.80 s [vector] +++ OK, passed 100 tests.
  13561. 1424.80 s [vector] izipWith: OK
  13562. 1424.80 s [vector] +++ OK, passed 100 tests.
  13563. 1424.80 s [vector] izipWith3: OK
  13564. 1424.81 s [vector] +++ OK, passed 100 tests.
  13565. 1424.81 s [vector] izipWithM: OK
  13566. 1424.81 s [vector] +++ OK, passed 100 tests.
  13567. 1424.82 s [vector] izipWithM_: OK
  13568. 1424.82 s [vector] +++ OK, passed 100 tests.
  13569. 1424.82 s [vector] zipWithM: OK
  13570. 1424.82 s [vector] +++ OK, passed 100 tests.
  13571. 1424.82 s [vector] zipWithM_: OK
  13572. 1424.82 s [vector] +++ OK, passed 100 tests.
  13573. 1424.82 s [vector] filter: OK
  13574. 1424.82 s [vector] +++ OK, passed 100 tests.
  13575. 1424.82 s [vector] ifilter: OK
  13576. 1424.82 s [vector] +++ OK, passed 100 tests.
  13577. 1424.84 s [vector] filterM: OK (0.01s)
  13578. 1424.84 s [vector] +++ OK, passed 100 tests.
  13579. 1424.84 s [vector] uniq: OK
  13580. 1424.84 s [vector] +++ OK, passed 100 tests.
  13581. 1424.84 s [vector] mapMaybe: OK
  13582. 1424.84 s [vector] +++ OK, passed 100 tests.
  13583. 1424.84 s [vector] imapMaybe: OK
  13584. 1424.84 s [vector] +++ OK, passed 100 tests.
  13585. 1424.84 s [vector] takeWhile: OK
  13586. 1424.84 s [vector] +++ OK, passed 100 tests.
  13587. 1424.84 s [vector] dropWhile: OK
  13588. 1424.85 s [vector] +++ OK, passed 100 tests.
  13589. 1424.85 s [vector] partition: OK
  13590. 1424.85 s [vector] +++ OK, passed 100 tests.
  13591. 1424.85 s [vector] partitionWith: OK
  13592. 1424.85 s [vector] +++ OK, passed 100 tests.
  13593. 1424.85 s [vector] span: OK
  13594. 1424.85 s [vector] +++ OK, passed 100 tests.
  13595. 1424.85 s [vector] break: OK
  13596. 1424.85 s [vector] +++ OK, passed 100 tests.
  13597. 1424.85 s [vector] spanR: OK
  13598. 1424.85 s [vector] +++ OK, passed 100 tests.
  13599. 1424.85 s [vector] breakR: OK
  13600. 1424.85 s [vector] +++ OK, passed 100 tests.
  13601. 1424.85 s [vector] groupBy: OK
  13602. 1424.85 s [vector] +++ OK, passed 100 tests.
  13603. 1424.85 s [vector] elem: OK
  13604. 1424.85 s [vector] +++ OK, passed 100 tests.
  13605. 1424.86 s [vector] notElem: OK
  13606. 1424.86 s [vector] +++ OK, passed 100 tests.
  13607. 1424.86 s [vector] find: OK
  13608. 1424.86 s [vector] +++ OK, passed 100 tests.
  13609. 1424.86 s [vector] findIndex: OK
  13610. 1424.86 s [vector] +++ OK, passed 100 tests.
  13611. 1424.86 s [vector] findIndexR: OK
  13612. 1424.86 s [vector] +++ OK, passed 100 tests.
  13613. 1424.86 s [vector] findIndices: OK
  13614. 1424.86 s [vector] +++ OK, passed 100 tests.
  13615. 1424.86 s [vector] elemIndex: OK
  13616. 1424.86 s [vector] +++ OK, passed 100 tests.
  13617. 1424.86 s [vector] elemIndices: OK
  13618. 1424.86 s [vector] +++ OK, passed 100 tests.
  13619. 1424.86 s [vector] foldl: OK
  13620. 1424.86 s [vector] +++ OK, passed 100 tests.
  13621. 1424.86 s [vector] foldl1: OK
  13622. 1424.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13623. 1424.86 s [vector] foldl': OK
  13624. 1424.86 s [vector] +++ OK, passed 100 tests.
  13625. 1424.86 s [vector] foldl1': OK
  13626. 1424.87 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13627. 1424.87 s [vector] foldr: OK
  13628. 1424.87 s [vector] +++ OK, passed 100 tests.
  13629. 1424.87 s [vector] foldr1: OK
  13630. 1424.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13631. 1424.88 s [vector] foldr': OK
  13632. 1424.88 s [vector] +++ OK, passed 100 tests.
  13633. 1424.88 s [vector] foldr1': OK
  13634. 1424.88 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13635. 1424.88 s [vector] ifoldl: OK
  13636. 1424.88 s [vector] +++ OK, passed 100 tests.
  13637. 1424.88 s [vector] ifoldl': OK
  13638. 1424.88 s [vector] +++ OK, passed 100 tests.
  13639. 1424.88 s [vector] ifoldr: OK
  13640. 1424.88 s [vector] +++ OK, passed 100 tests.
  13641. 1424.88 s [vector] ifoldr': OK
  13642. 1424.88 s [vector] +++ OK, passed 100 tests.
  13643. 1424.89 s [vector] ifoldM: OK
  13644. 1424.90 s [vector] +++ OK, passed 100 tests.
  13645. 1424.90 s [vector] ifoldM': OK
  13646. 1424.90 s [vector] +++ OK, passed 100 tests.
  13647. 1424.90 s [vector] ifoldM_: OK (0.01s)
  13648. 1424.90 s [vector] +++ OK, passed 100 tests.
  13649. 1424.90 s [vector] ifoldM'_: OK (0.01s)
  13650. 1424.91 s [vector] +++ OK, passed 100 tests.
  13651. 1424.91 s [vector] all: OK
  13652. 1424.91 s [vector] +++ OK, passed 100 tests.
  13653. 1424.91 s [vector] any: OK
  13654. 1424.91 s [vector] +++ OK, passed 100 tests.
  13655. 1424.91 s [vector] prescanl: OK
  13656. 1424.91 s [vector] +++ OK, passed 100 tests.
  13657. 1424.91 s [vector] prescanl': OK
  13658. 1424.91 s [vector] +++ OK, passed 100 tests.
  13659. 1424.91 s [vector] postscanl: OK
  13660. 1424.91 s [vector] +++ OK, passed 100 tests.
  13661. 1424.91 s [vector] postscanl': OK
  13662. 1424.91 s [vector] +++ OK, passed 100 tests.
  13663. 1424.92 s [vector] scanl: OK
  13664. 1424.92 s [vector] +++ OK, passed 100 tests.
  13665. 1424.92 s [vector] scanl': OK
  13666. 1424.92 s [vector] +++ OK, passed 100 tests.
  13667. 1424.92 s [vector] scanl1: OK
  13668. 1424.92 s [vector] +++ OK, passed 100 tests.
  13669. 1424.92 s [vector] scanl1': OK
  13670. 1424.92 s [vector] +++ OK, passed 100 tests.
  13671. 1424.92 s [vector] iscanl: OK
  13672. 1424.93 s [vector] +++ OK, passed 100 tests.
  13673. 1424.93 s [vector] iscanl': OK
  13674. 1424.93 s [vector] +++ OK, passed 100 tests.
  13675. 1424.93 s [vector] prescanr: OK
  13676. 1424.93 s [vector] +++ OK, passed 100 tests.
  13677. 1424.93 s [vector] prescanr': OK
  13678. 1424.93 s [vector] +++ OK, passed 100 tests.
  13679. 1424.94 s [vector] postscanr: OK
  13680. 1424.94 s [vector] +++ OK, passed 100 tests.
  13681. 1424.94 s [vector] postscanr': OK
  13682. 1424.94 s [vector] +++ OK, passed 100 tests.
  13683. 1424.94 s [vector] scanr: OK
  13684. 1424.95 s [vector] +++ OK, passed 100 tests.
  13685. 1424.95 s [vector] scanr': OK
  13686. 1424.95 s [vector] +++ OK, passed 100 tests.
  13687. 1424.95 s [vector] scanr1: OK
  13688. 1424.96 s [vector] +++ OK, passed 100 tests.
  13689. 1424.96 s [vector] scanr1': OK
  13690. 1424.96 s [vector] +++ OK, passed 100 tests.
  13691. 1424.96 s [vector] iscanr: OK
  13692. 1424.96 s [vector] +++ OK, passed 100 tests.
  13693. 1424.97 s [vector] iscanr': OK
  13694. 1424.97 s [vector] +++ OK, passed 100 tests.
  13695. 1424.97 s [vector] mut_read: OK
  13696. 1424.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13697. 1424.97 s [vector] mut_write: OK
  13698. 1424.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13699. 1424.97 s [vector] mut_modify: OK
  13700. 1424.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13701. 1424.97 s [vector] mut_generate: OK
  13702. 1424.98 s [vector] +++ OK, passed 100 tests.
  13703. 1425.00 s [vector] mut_generateM: OK (0.01s)
  13704. 1425.00 s [vector] +++ OK, passed 100 tests.
  13705. 1425.01 s [vector] mut_mapM_: OK (0.01s)
  13706. 1425.01 s [vector] +++ OK, passed 100 tests.
  13707. 1425.02 s [vector] mut_imapM_: OK (0.01s)
  13708. 1425.02 s [vector] +++ OK, passed 100 tests.
  13709. 1425.03 s [vector] mut_forM_: OK (0.01s)
  13710. 1425.03 s [vector] +++ OK, passed 100 tests.
  13711. 1425.04 s [vector] mut_iforM_: OK (0.01s)
  13712. 1425.04 s [vector] +++ OK, passed 100 tests.
  13713. 1425.04 s [vector] mut_foldr: OK
  13714. 1425.04 s [vector] +++ OK, passed 100 tests.
  13715. 1425.04 s [vector] mut_foldr': OK
  13716. 1425.04 s [vector] +++ OK, passed 100 tests.
  13717. 1425.04 s [vector] mut_foldl: OK
  13718. 1425.04 s [vector] +++ OK, passed 100 tests.
  13719. 1425.04 s [vector] mut_foldl': OK
  13720. 1425.04 s [vector] +++ OK, passed 100 tests.
  13721. 1425.05 s [vector] mut_ifoldr: OK
  13722. 1425.05 s [vector] +++ OK, passed 100 tests.
  13723. 1425.05 s [vector] mut_ifoldr': OK
  13724. 1425.05 s [vector] +++ OK, passed 100 tests.
  13725. 1425.05 s [vector] mut_ifoldl: OK
  13726. 1425.05 s [vector] +++ OK, passed 100 tests.
  13727. 1425.05 s [vector] mut_ifoldl': OK
  13728. 1425.05 s [vector] +++ OK, passed 100 tests.
  13729. 1425.05 s [vector] mut_foldM: OK
  13730. 1425.05 s [vector] +++ OK, passed 100 tests.
  13731. 1425.05 s [vector] mut_foldM': OK
  13732. 1425.05 s [vector] +++ OK, passed 100 tests.
  13733. 1425.06 s [vector] mut_foldrM: OK
  13734. 1425.06 s [vector] +++ OK, passed 100 tests.
  13735. 1425.06 s [vector] mut_foldrM': OK
  13736. 1425.06 s [vector] +++ OK, passed 100 tests.
  13737. 1425.06 s [vector] mut_ifoldM: OK
  13738. 1425.06 s [vector] +++ OK, passed 100 tests.
  13739. 1425.06 s [vector] mut_ifoldM': OK
  13740. 1425.06 s [vector] +++ OK, passed 100 tests.
  13741. 1425.06 s [vector] mut_ifoldrM: OK
  13742. 1425.06 s [vector] +++ OK, passed 100 tests.
  13743. 1425.06 s [vector] mut_ifoldrM': OK
  13744. 1425.06 s [vector] +++ OK, passed 100 tests.
  13745. 1425.06 s [vector] compare: OK
  13746. 1425.06 s [vector] +++ OK, passed 100 tests.
  13747. 1425.06 s [vector] maximum: OK
  13748. 1425.06 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13749. 1425.06 s [vector] minimum: OK
  13750. 1425.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13751. 1425.06 s [vector] minIndex: OK
  13752. 1425.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13753. 1425.07 s [vector] maxIndex: OK
  13754. 1425.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13755. 1425.07 s [vector] maximumBy: OK
  13756. 1425.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13757. 1425.07 s [vector] minimumBy: OK
  13758. 1425.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13759. 1425.07 s [vector] maximumOn: OK
  13760. 1425.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13761. 1425.07 s [vector] minimumOn: OK
  13762. 1425.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13763. 1425.07 s [vector] maxIndexBy: OK
  13764. 1425.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13765. 1425.07 s [vector] minIndexBy: OK
  13766. 1425.07 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13767. 1425.07 s [vector] ListFirstMaxIndexWins: OK
  13768. 1425.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13769. 1425.07 s [vector] FalseListFirstMaxIndexWins: OK
  13770. 1425.07 s [vector] +++ OK, failed as expected. (after 1 test):
  13771. 1425.07 s [vector] Exception:
  13772. 1425.07 s [vector] Prelude.foldr1: empty list
  13773. 1425.07 s [vector] CallStack (from HasCallStack):
  13774. 1425.07 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  13775. 1425.07 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  13776. 1425.07 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13777. 1425.07 s [vector] []
  13778. 1425.07 s [vector] zip: OK
  13779. 1425.07 s [vector] +++ OK, passed 100 tests.
  13780. 1425.07 s [vector] zip3: OK
  13781. 1425.07 s [vector] +++ OK, passed 100 tests.
  13782. 1425.07 s [vector] unzip: OK
  13783. 1425.07 s [vector] +++ OK, passed 100 tests.
  13784. 1425.08 s [vector] unzip3: OK
  13785. 1425.08 s [vector] +++ OK, passed 100 tests.
  13786. 1425.08 s [vector] indexed: OK
  13787. 1425.08 s [vector] +++ OK, passed 100 tests.
  13788. 1425.08 s [vector] update: OK
  13789. 1425.08 s [vector] +++ OK, passed 100 tests.
  13790. 1425.08 s [vector] mempty: OK
  13791. 1425.09 s [vector] +++ OK, passed 100 tests.
  13792. 1425.10 s [vector] mappend: OK
  13793. 1425.10 s [vector] +++ OK, passed 100 tests.
  13794. 1425.10 s [vector] mconcat: OK (0.01s)
  13795. 1425.10 s [vector] +++ OK, passed 100 tests.
  13796. 1425.10 s [vector] glength: OK
  13797. 1425.10 s [vector] +++ OK, passed 100 tests.
  13798. 1425.10 s [vector] and: OK
  13799. 1425.10 s [vector] +++ OK, passed 100 tests.
  13800. 1425.10 s [vector] or: OK
  13801. 1425.10 s [vector] +++ OK, passed 100 tests.
  13802. 1425.10 s [vector] (Int)
  13803. 1425.10 s [vector] fromList.toList == id: OK
  13804. 1425.10 s [vector] +++ OK, passed 100 tests.
  13805. 1425.10 s [vector] toList.fromList == id: OK
  13806. 1425.10 s [vector] +++ OK, passed 100 tests.
  13807. 1425.10 s [vector] unstream.stream == id: OK
  13808. 1425.10 s [vector] +++ OK, passed 100 tests.
  13809. 1425.10 s [vector] stream.unstream == id: OK
  13810. 1425.10 s [vector] +++ OK, passed 100 tests.
  13811. 1425.10 s [vector] eq: OK
  13812. 1425.10 s [vector] +++ OK, passed 100 tests.
  13813. 1425.10 s [vector] length: OK
  13814. 1425.10 s [vector] +++ OK, passed 100 tests.
  13815. 1425.10 s [vector] null: OK
  13816. 1425.10 s [vector] +++ OK, passed 100 tests.
  13817. 1425.10 s [vector] index: OK
  13818. 1425.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13819. 1425.10 s [vector] safeIndex: OK
  13820. 1425.10 s [vector] +++ OK, passed 100 tests.
  13821. 1425.10 s [vector] head: OK
  13822. 1425.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13823. 1425.10 s [vector] last: OK
  13824. 1425.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13825. 1425.10 s [vector] unsafeIndex: OK
  13826. 1425.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13827. 1425.11 s [vector] unsafeHead: OK
  13828. 1425.11 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13829. 1425.11 s [vector] unsafeLast: OK
  13830. 1425.11 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13831. 1425.11 s [vector] slice: OK
  13832. 1425.11 s [vector] +++ OK, passed 100 tests.
  13833. 1425.11 s [vector] init: OK
  13834. 1425.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13835. 1425.11 s [vector] tail: OK
  13836. 1425.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13837. 1425.11 s [vector] take: OK
  13838. 1425.11 s [vector] +++ OK, passed 100 tests.
  13839. 1425.11 s [vector] drop: OK
  13840. 1425.11 s [vector] +++ OK, passed 100 tests.
  13841. 1425.11 s [vector] splitAt: OK
  13842. 1425.11 s [vector] +++ OK, passed 100 tests.
  13843. 1425.11 s [vector] empty: OK
  13844. 1425.11 s [vector] +++ OK, passed 100 tests.
  13845. 1425.11 s [vector] singleton: OK
  13846. 1425.12 s [vector] +++ OK, passed 100 tests.
  13847. 1425.12 s [vector] replicate: OK
  13848. 1425.12 s [vector] +++ OK, passed 100 tests.
  13849. 1425.12 s [vector] generate: OK
  13850. 1425.12 s [vector] +++ OK, passed 100 tests.
  13851. 1425.12 s [vector] iterateN: OK
  13852. 1425.12 s [vector] +++ OK, passed 100 tests.
  13853. 1425.16 s [vector] iterateNM: OK (0.03s)
  13854. 1425.16 s [vector] +++ OK, passed 100 tests.
  13855. 1425.17 s [vector] generateM: OK (0.02s)
  13856. 1425.17 s [vector] +++ OK, passed 100 tests.
  13857. 1425.17 s [vector] replicateM: OK
  13858. 1425.17 s [vector] +++ OK, passed 100 tests.
  13859. 1425.17 s [vector] create: OK
  13860. 1425.17 s [vector] +++ OK, passed 100 tests.
  13861. 1425.17 s [vector] createT: OK
  13862. 1425.17 s [vector] +++ OK, passed 100 tests.
  13863. 1425.17 s [vector] unfoldr: OK
  13864. 1425.17 s [vector] +++ OK, passed 100 tests.
  13865. 1425.17 s [vector] unfoldrN: OK
  13866. 1425.18 s [vector] +++ OK, passed 100 tests.
  13867. 1425.18 s [vector] unfoldrExactN: OK
  13868. 1425.18 s [vector] +++ OK, passed 100 tests.
  13869. 1425.18 s [vector] unfoldrM: OK
  13870. 1425.18 s [vector] +++ OK, passed 100 tests.
  13871. 1425.19 s [vector] unfoldrNM: OK
  13872. 1425.19 s [vector] +++ OK, passed 100 tests.
  13873. 1425.20 s [vector] unfoldrExactNM: OK (0.02s)
  13874. 1425.20 s [vector] +++ OK, passed 100 tests.
  13875. 1425.20 s [vector] constructN: OK
  13876. 1425.20 s [vector] +++ OK, passed 100 tests.
  13877. 1425.20 s [vector] constructrN: OK
  13878. 1425.20 s [vector] +++ OK, passed 100 tests.
  13879. 1425.20 s [vector] cons: OK
  13880. 1425.20 s [vector] +++ OK, passed 100 tests.
  13881. 1425.20 s [vector] snoc: OK
  13882. 1425.20 s [vector] +++ OK, passed 100 tests.
  13883. 1425.20 s [vector] append: OK
  13884. 1425.22 s [vector] +++ OK, passed 100 tests.
  13885. 1425.22 s [vector] concat: OK (0.02s)
  13886. 1425.22 s [vector] +++ OK, passed 100 tests.
  13887. 1425.22 s [vector] force: OK
  13888. 1425.22 s [vector] +++ OK, passed 100 tests.
  13889. 1425.22 s [vector] upd: OK
  13890. 1425.23 s [vector] +++ OK, passed 100 tests.
  13891. 1425.23 s [vector] accum: OK
  13892. 1425.23 s [vector] +++ OK, passed 100 tests.
  13893. 1425.23 s [vector] reverse: OK
  13894. 1425.23 s [vector] +++ OK, passed 100 tests.
  13895. 1425.23 s [vector] backpermute: OK
  13896. 1425.23 s [vector] +++ OK, passed 100 tests.
  13897. 1425.23 s [vector] map: OK
  13898. 1425.23 s [vector] +++ OK, passed 100 tests.
  13899. 1425.23 s [vector] imap: OK
  13900. 1425.24 s [vector] +++ OK, passed 100 tests.
  13901. 1425.24 s [vector] concatMap: OK
  13902. 1425.24 s [vector] +++ OK, passed 100 tests.
  13903. 1425.24 s [vector] mapM: OK
  13904. 1425.24 s [vector] +++ OK, passed 100 tests.
  13905. 1425.25 s [vector] mapM_: OK (0.02s)
  13906. 1425.25 s [vector] +++ OK, passed 100 tests.
  13907. 1425.25 s [vector] forM: OK
  13908. 1425.26 s [vector] +++ OK, passed 100 tests.
  13909. 1425.28 s [vector] forM_: OK (0.02s)
  13910. 1425.28 s [vector] +++ OK, passed 100 tests.
  13911. 1425.28 s [vector] imapM: OK
  13912. 1425.30 s [vector] +++ OK, passed 100 tests.
  13913. 1425.31 s [vector] imapM_: OK (0.03s)
  13914. 1425.31 s [vector] +++ OK, passed 100 tests.
  13915. 1425.31 s [vector] zipWith: OK
  13916. 1425.31 s [vector] +++ OK, passed 100 tests.
  13917. 1425.32 s [vector] zipWith3: OK
  13918. 1425.32 s [vector] +++ OK, passed 100 tests.
  13919. 1425.32 s [vector] izipWith: OK
  13920. 1425.32 s [vector] +++ OK, passed 100 tests.
  13921. 1425.33 s [vector] izipWith3: OK
  13922. 1425.34 s [vector] +++ OK, passed 100 tests.
  13923. 1425.59 s [vector] izipWithM: OK
  13924. 1425.59 s [vector] +++ OK, passed 100 tests.
  13925. 1425.59 s [vector] izipWithM_: OK (0.02s)
  13926. 1425.59 s [vector] +++ OK, passed 100 tests.
  13927. 1425.59 s [vector] zipWithM: OK
  13928. 1425.59 s [vector] +++ OK, passed 100 tests.
  13929. 1425.59 s [vector] zipWithM_: OK (0.01s)
  13930. 1425.59 s [vector] +++ OK, passed 100 tests.
  13931. 1425.59 s [vector] filter: OK
  13932. 1425.59 s [vector] +++ OK, passed 100 tests.
  13933. 1425.59 s [vector] ifilter: OK
  13934. 1425.59 s [vector] +++ OK, passed 100 tests.
  13935. 1425.60 s [vector] filterM: OK (0.04s)
  13936. 1425.60 s [vector] +++ OK, passed 100 tests.
  13937. 1425.60 s [vector] uniq: OK
  13938. 1425.60 s [vector] +++ OK, passed 100 tests.
  13939. 1425.60 s [vector] mapMaybe: OK
  13940. 1425.60 s [vector] +++ OK, passed 100 tests.
  13941. 1425.60 s [vector] imapMaybe: OK
  13942. 1425.60 s [vector] +++ OK, passed 100 tests.
  13943. 1425.60 s [vector] takeWhile: OK
  13944. 1425.60 s [vector] +++ OK, passed 100 tests.
  13945. 1425.60 s [vector] dropWhile: OK
  13946. 1425.60 s [vector] +++ OK, passed 100 tests.
  13947. 1425.60 s [vector] partition: OK
  13948. 1425.60 s [vector] +++ OK, passed 100 tests.
  13949. 1425.60 s [vector] partitionWith: OK
  13950. 1425.60 s [vector] +++ OK, passed 100 tests.
  13951. 1425.60 s [vector] span: OK
  13952. 1425.60 s [vector] +++ OK, passed 100 tests.
  13953. 1425.60 s [vector] break: OK
  13954. 1425.60 s [vector] +++ OK, passed 100 tests.
  13955. 1425.60 s [vector] spanR: OK
  13956. 1425.60 s [vector] +++ OK, passed 100 tests.
  13957. 1425.60 s [vector] breakR: OK
  13958. 1425.60 s [vector] +++ OK, passed 100 tests.
  13959. 1425.60 s [vector] groupBy: OK
  13960. 1425.60 s [vector] +++ OK, passed 100 tests.
  13961. 1425.60 s [vector] elem: OK
  13962. 1425.60 s [vector] +++ OK, passed 100 tests.
  13963. 1425.60 s [vector] notElem: OK
  13964. 1425.60 s [vector] +++ OK, passed 100 tests.
  13965. 1425.60 s [vector] find: OK
  13966. 1425.60 s [vector] +++ OK, passed 100 tests.
  13967. 1425.60 s [vector] findIndex: OK
  13968. 1425.60 s [vector] +++ OK, passed 100 tests.
  13969. 1425.60 s [vector] findIndexR: OK
  13970. 1425.60 s [vector] +++ OK, passed 100 tests.
  13971. 1425.60 s [vector] findIndices: OK
  13972. 1425.60 s [vector] +++ OK, passed 100 tests.
  13973. 1425.60 s [vector] elemIndex: OK
  13974. 1425.60 s [vector] +++ OK, passed 100 tests.
  13975. 1425.60 s [vector] elemIndices: OK
  13976. 1425.60 s [vector] +++ OK, passed 100 tests.
  13977. 1425.60 s [vector] foldl: OK
  13978. 1425.60 s [vector] +++ OK, passed 100 tests.
  13979. 1425.60 s [vector] foldl1: OK
  13980. 1425.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13981. 1425.61 s [vector] foldl': OK
  13982. 1425.61 s [vector] +++ OK, passed 100 tests.
  13983. 1425.61 s [vector] foldl1': OK
  13984. 1425.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13985. 1425.61 s [vector] foldr: OK
  13986. 1425.61 s [vector] +++ OK, passed 100 tests.
  13987. 1425.61 s [vector] foldr1: OK
  13988. 1425.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13989. 1425.61 s [vector] foldr': OK
  13990. 1425.61 s [vector] +++ OK, passed 100 tests.
  13991. 1425.61 s [vector] foldr1': OK
  13992. 1425.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13993. 1425.61 s [vector] ifoldl: OK
  13994. 1425.61 s [vector] +++ OK, passed 100 tests.
  13995. 1425.61 s [vector] ifoldl': OK
  13996. 1425.61 s [vector] +++ OK, passed 100 tests.
  13997. 1425.61 s [vector] ifoldr: OK
  13998. 1425.61 s [vector] +++ OK, passed 100 tests.
  13999. 1425.61 s [vector] ifoldr': OK
  14000. 1425.61 s [vector] +++ OK, passed 100 tests.
  14001. 1425.61 s [vector] ifoldM: OK (0.01s)
  14002. 1425.61 s [vector] +++ OK, passed 100 tests.
  14003. 1425.61 s [vector] ifoldM': OK
  14004. 1425.61 s [vector] +++ OK, passed 100 tests.
  14005. 1425.61 s [pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
  14006. 1425.61 s [vector] ifoldM_: OK (0.03s)
  14007. 1425.61 s [vector] +++ OK, passed 100 tests.
  14008. 1425.61 s [vector] ifoldM'_: OK (0.03s)
  14009. 1425.61 s [vector] +++ OK, passed 100 tests.
  14010. 1425.61 s [vector] all: OK
  14011. 1425.61 s [vector] +++ OK, passed 100 tests.
  14012. 1425.61 s [vector] any: OK
  14013. 1425.61 s [vector] +++ OK, passed 100 tests.
  14014. 1425.61 s [vector] prescanl: OK
  14015. 1425.62 s [vector] +++ OK, passed 100 tests.
  14016. 1425.62 s [vector] prescanl': OK
  14017. 1425.62 s [vector] +++ OK, passed 100 tests.
  14018. 1425.62 s [vector] postscanl: OK
  14019. 1425.63 s [vector] +++ OK, passed 100 tests.
  14020. 1425.63 s [vector] postscanl': OK
  14021. 1425.63 s [vector] +++ OK, passed 100 tests.
  14022. 1425.64 s [vector] scanl: OK
  14023. 1425.64 s [vector] +++ OK, passed 100 tests.
  14024. 1425.64 s [vector] scanl': OK
  14025. 1425.64 s [vector] +++ OK, passed 100 tests.
  14026. 1425.64 s [vector] scanl1: OK
  14027. 1425.65 s [vector] +++ OK, passed 100 tests.
  14028. 1425.65 s [vector] scanl1': OK
  14029. 1425.65 s [vector] +++ OK, passed 100 tests.
  14030. 1425.65 s [vector] iscanl: OK
  14031. 1425.65 s [vector] +++ OK, passed 100 tests.
  14032. 1425.65 s [vector] iscanl': OK
  14033. 1425.66 s [vector] +++ OK, passed 100 tests.
  14034. 1425.66 s [vector] prescanr: OK
  14035. 1425.66 s [vector] +++ OK, passed 100 tests.
  14036. 1425.66 s [vector] prescanr': OK
  14037. 1425.66 s [vector] +++ OK, passed 100 tests.
  14038. 1425.66 s [vector] postscanr: OK
  14039. 1425.67 s [vector] +++ OK, passed 100 tests.
  14040. 1425.67 s [vector] postscanr': OK
  14041. 1425.67 s [vector] +++ OK, passed 100 tests.
  14042. 1425.67 s [vector] scanr: OK
  14043. 1425.67 s [vector] +++ OK, passed 100 tests.
  14044. 1425.68 s [vector] scanr': OK
  14045. 1425.68 s [vector] +++ OK, passed 100 tests.
  14046. 1425.68 s [vector] scanr1: OK
  14047. 1425.68 s [vector] +++ OK, passed 100 tests.
  14048. 1425.68 s [vector] scanr1': OK
  14049. 1425.68 s [vector] +++ OK, passed 100 tests.
  14050. 1425.68 s [vector] iscanr: OK
  14051. 1425.69 s [vector] +++ OK, passed 100 tests.
  14052. 1425.69 s [vector] iscanr': OK
  14053. 1425.69 s [vector] +++ OK, passed 100 tests.
  14054. 1425.69 s [vector] mut_read: OK
  14055. 1425.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14056. 1425.69 s [vector] mut_write: OK
  14057. 1425.69 s [vector] +++ OK, passed 100 tests; 25 discarded.
  14058. 1425.69 s [vector] mut_modify: OK
  14059. 1425.69 s [vector] +++ OK, passed 100 tests; 10 discarded.
  14060. 1425.69 s [vector] mut_generate: OK
  14061. 1425.70 s [vector] +++ OK, passed 100 tests.
  14062. 1425.70 s [vector] mut_generateM: OK
  14063. 1425.71 s [vector] +++ OK, passed 100 tests.
  14064. 1425.72 s [vector] mut_mapM_: OK (0.01s)
  14065. 1425.72 s [vector] +++ OK, passed 100 tests.
  14066. 1425.74 s [vector] mut_imapM_: OK (0.02s)
  14067. 1425.74 s [vector] +++ OK, passed 100 tests.
  14068. 1425.76 s [vector] mut_forM_: OK (0.02s)
  14069. 1425.76 s [vector] +++ OK, passed 100 tests.
  14070. 1425.77 s [vector] mut_iforM_: OK (0.02s)
  14071. 1425.77 s [vector] +++ OK, passed 100 tests.
  14072. 1425.77 s [vector] mut_foldr: OK
  14073. 1425.77 s [vector] +++ OK, passed 100 tests.
  14074. 1425.77 s [vector] mut_foldr': OK
  14075. 1425.77 s [vector] +++ OK, passed 100 tests.
  14076. 1425.77 s [vector] mut_foldl: OK
  14077. 1425.77 s [vector] +++ OK, passed 100 tests.
  14078. 1425.77 s [vector] mut_foldl': OK
  14079. 1425.77 s [vector] +++ OK, passed 100 tests.
  14080. 1425.78 s [vector] mut_ifoldr: OK
  14081. 1425.78 s [vector] +++ OK, passed 100 tests.
  14082. 1425.78 s [vector] mut_ifoldr': OK
  14083. 1425.78 s [vector] +++ OK, passed 100 tests.
  14084. 1425.79 s [vector] mut_ifoldl: OK
  14085. 1425.79 s [vector] +++ OK, passed 100 tests.
  14086. 1425.79 s [vector] mut_ifoldl': OK
  14087. 1425.79 s [vector] +++ OK, passed 100 tests.
  14088. 1425.79 s [vector] mut_foldM: OK
  14089. 1425.79 s [vector] +++ OK, passed 100 tests.
  14090. 1425.79 s [vector] mut_foldM': OK
  14091. 1425.79 s [vector] +++ OK, passed 100 tests.
  14092. 1425.79 s [vector] mut_foldrM: OK
  14093. 1425.80 s [vector] +++ OK, passed 100 tests.
  14094. 1425.80 s [vector] mut_foldrM': OK
  14095. 1425.80 s [vector] +++ OK, passed 100 tests.
  14096. 1425.80 s [vector] mut_ifoldM: OK
  14097. 1425.80 s [vector] +++ OK, passed 100 tests.
  14098. 1425.80 s [vector] mut_ifoldM': OK
  14099. 1425.80 s [vector] +++ OK, passed 100 tests.
  14100. 1425.81 s [vector] mut_ifoldrM: OK
  14101. 1425.81 s [vector] +++ OK, passed 100 tests.
  14102. 1425.82 s [vector] mut_ifoldrM': OK
  14103. 1425.82 s [vector] +++ OK, passed 100 tests.
  14104. 1425.82 s [vector] compare: OK
  14105. 1425.82 s [vector] +++ OK, passed 100 tests.
  14106. 1425.82 s [vector] maximum: OK
  14107. 1425.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14108. 1425.82 s [vector] minimum: OK
  14109. 1425.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14110. 1425.82 s [vector] minIndex: OK
  14111. 1425.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14112. 1425.82 s [vector] maxIndex: OK
  14113. 1425.83 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14114. 1425.83 s [vector] maximumBy: OK
  14115. 1425.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14116. 1425.83 s [vector] minimumBy: OK
  14117. 1425.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14118. 1425.83 s [vector] maximumOn: OK
  14119. 1425.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14120. 1425.83 s [vector] minimumOn: OK
  14121. 1425.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14122. 1425.83 s [vector] maxIndexBy: OK
  14123. 1425.84 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14124. 1425.84 s [vector] minIndexBy: OK
  14125. 1425.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14126. 1425.84 s [vector] ListFirstMaxIndexWins: OK
  14127. 1425.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14128. 1425.84 s [vector] FalseListFirstMaxIndexWins: OK
  14129. 1425.84 s [vector] +++ OK, failed as expected. (after 1 test):
  14130. 1425.84 s [vector] Exception:
  14131. 1425.84 s [vector] Prelude.foldr1: empty list
  14132. 1425.84 s [vector] CallStack (from HasCallStack):
  14133. 1425.84 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  14134. 1425.84 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  14135. 1425.84 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14136. 1425.84 s [vector] []
  14137. 1425.84 s [vector] zip: OK
  14138. 1425.84 s [vector] +++ OK, passed 100 tests.
  14139. 1425.84 s [vector] zip3: OK
  14140. 1425.84 s [vector] +++ OK, passed 100 tests.
  14141. 1425.84 s [vector] unzip: OK
  14142. 1425.84 s [vector] +++ OK, passed 100 tests.
  14143. 1425.85 s [vector] unzip3: OK
  14144. 1425.85 s [vector] +++ OK, passed 100 tests.
  14145. 1425.85 s [vector] indexed: OK
  14146. 1425.85 s [vector] +++ OK, passed 100 tests.
  14147. 1425.85 s [vector] update: OK
  14148. 1425.85 s [vector] +++ OK, passed 100 tests.
  14149. 1425.85 s [vector] mempty: OK
  14150. 1425.85 s [vector] +++ OK, passed 100 tests.
  14151. 1425.85 s [vector] mappend: OK
  14152. 1425.85 s [vector] +++ OK, passed 100 tests.
  14153. 1425.87 s [vector] mconcat: OK (0.01s)
  14154. 1425.87 s [vector] +++ OK, passed 100 tests.
  14155. 1425.87 s [vector] glength: OK
  14156. 1425.87 s [vector] +++ OK, passed 100 tests.
  14157. 1425.87 s [vector] sum: OK
  14158. 1425.87 s [vector] +++ OK, passed 100 tests.
  14159. 1425.87 s [vector] product: OK
  14160. 1425.87 s [vector] +++ OK, passed 100 tests.
  14161. 1425.87 s [vector] enumFromN: OK
  14162. 1425.87 s [vector] +++ OK, passed 100 tests.
  14163. 1425.87 s [vector] enumFromThenN: OK
  14164. 1425.87 s [vector] +++ OK, passed 100 tests.
  14165. 1425.87 s [vector] enumFromTo: OK
  14166. 1425.88 s [vector] +++ OK, passed 100 tests.
  14167. 1425.88 s [vector] enumFromThenTo: OK
  14168. 1425.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14169. 1425.88 s [vector] (Float)
  14170. 1425.88 s [vector] fromList.toList == id: OK
  14171. 1425.88 s [vector] +++ OK, passed 100 tests.
  14172. 1425.88 s [vector] toList.fromList == id: OK
  14173. 1425.88 s [vector] +++ OK, passed 100 tests.
  14174. 1425.88 s [vector] unstream.stream == id: OK
  14175. 1425.88 s [vector] +++ OK, passed 100 tests.
  14176. 1425.88 s [vector] stream.unstream == id: OK
  14177. 1425.88 s [vector] +++ OK, passed 100 tests.
  14178. 1425.88 s [vector] eq: OK
  14179. 1425.88 s [vector] +++ OK, passed 100 tests.
  14180. 1425.88 s [vector] length: OK
  14181. 1425.88 s [vector] +++ OK, passed 100 tests.
  14182. 1425.88 s [vector] null: OK
  14183. 1425.88 s [vector] +++ OK, passed 100 tests.
  14184. 1425.88 s [vector] index: OK
  14185. 1425.88 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14186. 1425.88 s [vector] safeIndex: OK
  14187. 1425.88 s [vector] +++ OK, passed 100 tests.
  14188. 1425.88 s [vector] head: OK
  14189. 1425.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14190. 1425.88 s [vector] last: OK
  14191. 1425.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14192. 1425.88 s [vector] unsafeIndex: OK
  14193. 1425.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14194. 1425.89 s [vector] unsafeHead: OK
  14195. 1425.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14196. 1425.89 s [vector] unsafeLast: OK
  14197. 1425.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14198. 1425.89 s [vector] slice: OK
  14199. 1425.89 s [vector] +++ OK, passed 100 tests.
  14200. 1425.89 s [vector] init: OK
  14201. 1425.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14202. 1425.89 s [vector] tail: OK
  14203. 1425.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14204. 1425.89 s [vector] take: OK
  14205. 1425.89 s [vector] +++ OK, passed 100 tests.
  14206. 1425.89 s [vector] drop: OK
  14207. 1425.89 s [vector] +++ OK, passed 100 tests.
  14208. 1425.89 s [vector] splitAt: OK
  14209. 1425.89 s [vector] +++ OK, passed 100 tests.
  14210. 1425.89 s [vector] empty: OK
  14211. 1425.89 s [vector] +++ OK, passed 100 tests.
  14212. 1425.90 s [vector] singleton: OK
  14213. 1425.90 s [vector] +++ OK, passed 100 tests.
  14214. 1425.90 s [vector] replicate: OK
  14215. 1425.90 s [vector] +++ OK, passed 100 tests.
  14216. 1425.90 s [vector] generate: OK
  14217. 1425.90 s [vector] +++ OK, passed 100 tests.
  14218. 1425.92 s [vector] iterateN: OK
  14219. 1425.92 s [vector] +++ OK, passed 100 tests.
  14220. 1425.96 s [vector] iterateNM: OK (0.04s)
  14221. 1425.96 s [vector] +++ OK, passed 100 tests.
  14222. 1425.98 s [vector] generateM: OK (0.04s)
  14223. 1425.98 s [vector] +++ OK, passed 100 tests.
  14224. 1425.99 s [vector] replicateM: OK
  14225. 1425.99 s [vector] +++ OK, passed 100 tests.
  14226. 1425.99 s [vector] create: OK
  14227. 1425.99 s [vector] +++ OK, passed 100 tests.
  14228. 1425.99 s [vector] createT: OK
  14229. 1425.99 s [vector] +++ OK, passed 100 tests.
  14230. 1425.99 s [vector] unfoldr: OK
  14231. 1425.99 s [vector] +++ OK, passed 100 tests.
  14232. 1425.99 s [vector] unfoldrN: OK
  14233. 1426.00 s [vector] +++ OK, passed 100 tests.
  14234. 1426.00 s [vector] unfoldrExactN: OK
  14235. 1426.00 s [vector] +++ OK, passed 100 tests.
  14236. 1426.00 s [vector] unfoldrM: OK
  14237. 1426.00 s [vector] +++ OK, passed 100 tests.
  14238. 1426.00 s [vector] unfoldrNM: OK
  14239. 1426.00 s [vector] +++ OK, passed 100 tests.
  14240. 1426.04 s [vector] unfoldrExactNM: OK
  14241. 1426.04 s [vector] +++ OK, passed 100 tests.
  14242. 1426.04 s [vector] constructN: OK
  14243. 1426.05 s [vector] +++ OK, passed 100 tests.
  14244. 1426.05 s [vector] constructrN: OK
  14245. 1426.05 s [vector] +++ OK, passed 100 tests.
  14246. 1426.05 s [vector] cons: OK
  14247. 1426.05 s [vector] +++ OK, passed 100 tests.
  14248. 1426.05 s [vector] snoc: OK
  14249. 1426.05 s [vector] +++ OK, passed 100 tests.
  14250. 1426.06 s [vector] append: OK
  14251. 1426.06 s [vector] +++ OK, passed 100 tests.
  14252. 1426.08 s [vector] concat: OK (0.02s)
  14253. 1426.08 s [vector] +++ OK, passed 100 tests.
  14254. 1426.08 s [vector] force: OK
  14255. 1426.08 s [vector] +++ OK, passed 100 tests.
  14256. 1426.08 s [vector] upd: OK
  14257. 1426.08 s [vector] +++ OK, passed 100 tests.
  14258. 1426.09 s [vector] accum: OK
  14259. 1426.09 s [vector] +++ OK, passed 100 tests.
  14260. 1426.09 s [vector] reverse: OK
  14261. 1426.09 s [vector] +++ OK, passed 100 tests.
  14262. 1426.09 s [vector] backpermute: OK
  14263. 1426.10 s [vector] +++ OK, passed 100 tests.
  14264. 1426.10 s [vector] map: OK
  14265. 1426.10 s [vector] +++ OK, passed 100 tests.
  14266. 1426.11 s [vector] imap: OK
  14267. 1426.11 s [vector] +++ OK, passed 100 tests.
  14268. 1426.12 s [vector] concatMap: OK
  14269. 1426.12 s [vector] +++ OK, passed 100 tests.
  14270. 1426.12 s [vector] mapM: OK
  14271. 1426.12 s [vector] +++ OK, passed 100 tests.
  14272. 1426.15 s [vector] mapM_: OK (0.03s)
  14273. 1426.15 s [vector] +++ OK, passed 100 tests.
  14274. 1426.15 s [vector] forM: OK
  14275. 1426.16 s [vector] +++ OK, passed 100 tests.
  14276. 1426.19 s [vector] forM_: OK (0.03s)
  14277. 1426.20 s [vector] +++ OK, passed 100 tests.
  14278. 1426.20 s [vector] imapM: OK
  14279. 1426.20 s [vector] +++ OK, passed 100 tests.
  14280. 1426.24 s [vector] imapM_: OK (0.04s)
  14281. 1426.24 s [vector] +++ OK, passed 100 tests.
  14282. 1426.26 s [vector] zipWith: OK (0.01s)
  14283. 1426.26 s [vector] +++ OK, passed 100 tests.
  14284. 1426.28 s [vector] zipWith3: OK (0.01s)
  14285. 1426.28 s [vector] +++ OK, passed 100 tests.
  14286. 1426.28 s [vector] izipWith: OK (0.01s)
  14287. 1426.28 s [vector] +++ OK, passed 100 tests.
  14288. 1426.30 s [vector] izipWith3: OK (0.02s)
  14289. 1426.30 s [vector] +++ OK, passed 100 tests.
  14290. 1426.32 s [vector] izipWithM: OK (0.01s)
  14291. 1426.32 s [vector] +++ OK, passed 100 tests.
  14292. 1426.38 s [vector] izipWithM_: OK (0.05s)
  14293. 1426.38 s [vector] +++ OK, passed 100 tests.
  14294. 1426.38 s [vector] zipWithM: OK (0.01s)
  14295. 1426.38 s [vector] +++ OK, passed 100 tests.
  14296. 1426.40 s [vector] zipWithM_: OK (0.04s)
  14297. 1426.40 s [vector] +++ OK, passed 100 tests.
  14298. 1426.40 s [vector] filter: OK
  14299. 1426.41 s [vector] +++ OK, passed 100 tests.
  14300. 1426.41 s [vector] ifilter: OK
  14301. 1426.42 s [vector] +++ OK, passed 100 tests.
  14302. 1426.46 s [vector] filterM: OK (0.05s)
  14303. 1426.46 s [vector] +++ OK, passed 100 tests.
  14304. 1426.46 s [vector] uniq: OK
  14305. 1426.47 s [vector] +++ OK, passed 100 tests.
  14306. 1426.48 s [vector] mapMaybe: OK
  14307. 1426.48 s [vector] +++ OK, passed 100 tests.
  14308. 1426.48 s [vector] imapMaybe: OK
  14309. 1426.48 s [vector] +++ OK, passed 100 tests.
  14310. 1426.48 s [vector] takeWhile: OK
  14311. 1426.48 s [vector] +++ OK, passed 100 tests.
  14312. 1426.49 s [vector] dropWhile: OK
  14313. 1426.49 s [vector] +++ OK, passed 100 tests.
  14314. 1426.49 s [vector] partition: OK
  14315. 1426.49 s [vector] +++ OK, passed 100 tests.
  14316. 1426.49 s [vector] partitionWith: OK
  14317. 1426.49 s [vector] +++ OK, passed 100 tests.
  14318. 1426.50 s [vector] span: OK
  14319. 1426.50 s [vector] +++ OK, passed 100 tests.
  14320. 1426.50 s [vector] break: OK
  14321. 1426.50 s [vector] +++ OK, passed 100 tests.
  14322. 1426.50 s [vector] spanR: OK
  14323. 1426.50 s [vector] +++ OK, passed 100 tests.
  14324. 1426.51 s [vector] breakR: OK
  14325. 1426.51 s [vector] +++ OK, passed 100 tests.
  14326. 1426.51 s [vector] groupBy: OK
  14327. 1426.51 s [vector] +++ OK, passed 100 tests.
  14328. 1426.51 s [vector] elem: OK
  14329. 1426.51 s [vector] +++ OK, passed 100 tests.
  14330. 1426.51 s [vector] notElem: OK
  14331. 1426.51 s [vector] +++ OK, passed 100 tests.
  14332. 1426.52 s [vector] find: OK
  14333. 1426.52 s [vector] +++ OK, passed 100 tests.
  14334. 1426.52 s [vector] findIndex: OK
  14335. 1426.52 s [vector] +++ OK, passed 100 tests.
  14336. 1426.52 s [vector] findIndexR: OK
  14337. 1426.52 s [vector] +++ OK, passed 100 tests.
  14338. 1426.52 s [vector] findIndices: OK
  14339. 1426.52 s [vector] +++ OK, passed 100 tests.
  14340. 1426.52 s [vector] elemIndex: OK
  14341. 1426.52 s [vector] +++ OK, passed 100 tests.
  14342. 1426.54 s [vector] elemIndices: OK
  14343. 1426.54 s [vector] +++ OK, passed 100 tests.
  14344. 1426.54 s [vector] foldl: OK
  14345. 1426.54 s [vector] +++ OK, passed 100 tests.
  14346. 1426.54 s [vector] foldl1: OK
  14347. 1426.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14348. 1426.56 s [vector] foldl': OK
  14349. 1426.56 s [vector] +++ OK, passed 100 tests.
  14350. 1426.57 s [vector] foldl1': OK
  14351. 1426.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14352. 1426.57 s [vector] foldr: OK
  14353. 1426.57 s [pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
  14354. 1426.57 s [pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
  14355. 1426.57 s [pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
  14356. 1426.57 s [pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
  14357. 1426.57 s [pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
  14358. 1426.57 s [pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
  14359. 1426.57 s [pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
  14360. 1426.57 s [pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
  14361. 1426.57 s [pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
  14362. 1426.57 s [pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
  14363. 1426.57 s [pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
  14364. 1426.57 s [vector] +++ OK, passed 100 tests.
  14365. 1426.58 s [vector] foldr1: OK
  14366. 1426.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14367. 1426.58 s [vector] foldr': OK
  14368. 1426.58 s [vector] +++ OK, passed 100 tests.
  14369. 1426.59 s [vector] foldr1': OK
  14370. 1426.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14371. 1426.60 s [vector] ifoldl: OK
  14372. 1426.60 s [vector] +++ OK, passed 100 tests.
  14373. 1426.62 s [vector] ifoldl': OK (0.01s)
  14374. 1426.62 s [vector] +++ OK, passed 100 tests.
  14375. 1426.63 s [vector] ifoldr: OK (0.01s)
  14376. 1426.64 s [vector] +++ OK, passed 100 tests.
  14377. 1426.64 s [vector] ifoldr': OK
  14378. 1426.65 s [vector] +++ OK, passed 100 tests.
  14379. 1426.66 s [vector] ifoldM: OK
  14380. 1426.66 s [vector] +++ OK, passed 100 tests.
  14381. 1426.66 s [vector] ifoldM': OK
  14382. 1426.66 s [vector] +++ OK, passed 100 tests.
  14383. 1426.69 s [vector] ifoldM_: OK (0.04s)
  14384. 1426.69 s [vector] +++ OK, passed 100 tests.
  14385. 1426.72 s [vector] ifoldM'_: OK (0.03s)
  14386. 1426.72 s [vector] +++ OK, passed 100 tests.
  14387. 1426.72 s [vector] all: OK
  14388. 1426.72 s [vector] +++ OK, passed 100 tests.
  14389. 1426.73 s [vector] any: OK
  14390. 1426.73 s [vector] +++ OK, passed 100 tests.
  14391. 1426.73 s [vector] prescanl: OK
  14392. 1426.74 s [vector] +++ OK, passed 100 tests.
  14393. 1426.74 s [vector] prescanl': OK
  14394. 1426.75 s [vector] +++ OK, passed 100 tests.
  14395. 1426.76 s [vector] postscanl: OK
  14396. 1426.76 s [vector] +++ OK, passed 100 tests.
  14397. 1426.76 s [vector] postscanl': OK
  14398. 1426.76 s [vector] +++ OK, passed 100 tests.
  14399. 1426.77 s [vector] scanl: OK
  14400. 1426.78 s [vector] +++ OK, passed 100 tests.
  14401. 1426.78 s [vector] scanl': OK
  14402. 1426.78 s [vector] +++ OK, passed 100 tests.
  14403. 1426.78 s [vector] scanl1: OK
  14404. 1426.78 s [vector] +++ OK, passed 100 tests.
  14405. 1426.79 s [vector] scanl1': OK
  14406. 1426.79 s [vector] +++ OK, passed 100 tests.
  14407. 1426.81 s [vector] iscanl: OK (0.02s)
  14408. 1426.81 s [vector] +++ OK, passed 100 tests.
  14409. 1426.82 s [vector] iscanl': OK (0.01s)
  14410. 1426.82 s [vector] +++ OK, passed 100 tests.
  14411. 1426.85 s [vector] prescanr: OK (0.01s)
  14412. 1426.85 s [vector] +++ OK, passed 100 tests.
  14413. 1426.85 s [vector] prescanr': OK
  14414. 1426.85 s [vector] +++ OK, passed 100 tests.
  14415. 1426.85 s [vector] postscanr: OK
  14416. 1426.85 s [vector] +++ OK, passed 100 tests.
  14417. 1426.86 s [vector] postscanr': OK
  14418. 1426.86 s [vector] +++ OK, passed 100 tests.
  14419. 1426.87 s [vector] scanr: OK (0.01s)
  14420. 1426.88 s [vector] +++ OK, passed 100 tests.
  14421. 1426.88 s [vector] scanr': OK
  14422. 1426.88 s [vector] +++ OK, passed 100 tests.
  14423. 1426.88 s [vector] scanr1: OK
  14424. 1426.89 s [vector] +++ OK, passed 100 tests.
  14425. 1426.91 s [vector] scanr1': OK
  14426. 1426.92 s [vector] +++ OK, passed 100 tests.
  14427. 1426.93 s [vector] iscanr: OK (0.03s)
  14428. 1426.93 s [vector] +++ OK, passed 100 tests.
  14429. 1426.94 s [vector] iscanr': OK (0.01s)
  14430. 1426.94 s [vector] +++ OK, passed 100 tests.
  14431. 1426.94 s [vector] mut_read: OK
  14432. 1426.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14433. 1426.94 s [vector] mut_write: OK
  14434. 1426.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14435. 1426.94 s [vector] mut_modify: OK
  14436. 1426.94 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14437. 1426.95 s [vector] mut_generate: OK
  14438. 1426.96 s [vector] +++ OK, passed 100 tests.
  14439. 1426.96 s [vector] mut_generateM: OK (0.02s)
  14440. 1426.96 s [vector] +++ OK, passed 100 tests.
  14441. 1427.00 s [vector] mut_mapM_: OK (0.04s)
  14442. 1427.00 s [vector] +++ OK, passed 100 tests.
  14443. 1427.04 s [vector] mut_imapM_: OK (0.04s)
  14444. 1427.04 s [vector] +++ OK, passed 100 tests.
  14445. 1427.08 s [vector] mut_forM_: OK (0.03s)
  14446. 1427.08 s [vector] +++ OK, passed 100 tests.
  14447. 1427.10 s [vector] mut_iforM_: OK (0.03s)
  14448. 1427.10 s [vector] +++ OK, passed 100 tests.
  14449. 1427.11 s [vector] mut_foldr: OK
  14450. 1427.11 s [vector] +++ OK, passed 100 tests.
  14451. 1427.11 s [vector] mut_foldr': OK
  14452. 1427.12 s [vector] +++ OK, passed 100 tests.
  14453. 1427.12 s [vector] mut_foldl: OK
  14454. 1427.12 s [vector] +++ OK, passed 100 tests.
  14455. 1427.12 s [vector] mut_foldl': OK
  14456. 1427.12 s [vector] +++ OK, passed 100 tests.
  14457. 1427.13 s [vector] mut_ifoldr: OK
  14458. 1427.14 s [vector] +++ OK, passed 100 tests.
  14459. 1427.15 s [vector] mut_ifoldr': OK (0.01s)
  14460. 1427.16 s [vector] +++ OK, passed 100 tests.
  14461. 1427.16 s [vector] mut_ifoldl: OK
  14462. 1427.16 s [vector] +++ OK, passed 100 tests.
  14463. 1427.17 s [vector] mut_ifoldl': OK (0.01s)
  14464. 1427.18 s [vector] +++ OK, passed 100 tests.
  14465. 1427.18 s [vector] mut_foldM: OK
  14466. 1427.18 s [vector] +++ OK, passed 100 tests.
  14467. 1427.18 s [vector] mut_foldM': OK
  14468. 1427.18 s [vector] +++ OK, passed 100 tests.
  14469. 1427.19 s [vector] mut_foldrM: OK
  14470. 1427.20 s [vector] +++ OK, passed 100 tests.
  14471. 1427.20 s [vector] mut_foldrM': OK
  14472. 1427.20 s [vector] +++ OK, passed 100 tests.
  14473. 1427.21 s [vector] mut_ifoldM: OK
  14474. 1427.22 s [vector] +++ OK, passed 100 tests.
  14475. 1427.22 s [vector] mut_ifoldM': OK
  14476. 1427.22 s [vector] +++ OK, passed 100 tests.
  14477. 1427.22 s [vector] mut_ifoldrM: OK
  14478. 1427.22 s [vector] +++ OK, passed 100 tests.
  14479. 1427.23 s [vector] mut_ifoldrM': OK
  14480. 1427.23 s [vector] +++ OK, passed 100 tests.
  14481. 1427.23 s [vector] compare: OK
  14482. 1427.23 s [vector] +++ OK, passed 100 tests.
  14483. 1427.23 s [vector] maximum: OK
  14484. 1427.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14485. 1427.23 s [vector] minimum: OK
  14486. 1427.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14487. 1427.23 s [vector] minIndex: OK
  14488. 1427.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14489. 1427.23 s [vector] maxIndex: OK
  14490. 1427.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14491. 1427.23 s [vector] maximumBy: OK
  14492. 1427.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14493. 1427.23 s [vector] minimumBy: OK
  14494. 1427.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14495. 1427.23 s [vector] maximumOn: OK
  14496. 1427.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14497. 1427.23 s [vector] minimumOn: OK
  14498. 1427.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14499. 1427.24 s [vector] maxIndexBy: OK
  14500. 1427.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14501. 1427.24 s [vector] minIndexBy: OK
  14502. 1427.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14503. 1427.24 s [vector] ListFirstMaxIndexWins: OK
  14504. 1427.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14505. 1427.24 s [vector] FalseListFirstMaxIndexWins: OK
  14506. 1427.24 s [vector] +++ OK, failed as expected. (after 1 test):
  14507. 1427.24 s [vector] Exception:
  14508. 1427.24 s [vector] Prelude.foldr1: empty list
  14509. 1427.24 s [vector] CallStack (from HasCallStack):
  14510. 1427.24 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  14511. 1427.24 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  14512. 1427.24 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14513. 1427.24 s [vector] []
  14514. 1427.24 s [vector] zip: OK
  14515. 1427.24 s [vector] +++ OK, passed 100 tests.
  14516. 1427.24 s [vector] zip3: OK
  14517. 1427.24 s [vector] +++ OK, passed 100 tests.
  14518. 1427.25 s [vector] unzip: OK
  14519. 1427.25 s [vector] +++ OK, passed 100 tests.
  14520. 1427.25 s [vector] unzip3: OK
  14521. 1427.25 s [vector] +++ OK, passed 100 tests.
  14522. 1427.25 s [vector] indexed: OK
  14523. 1427.25 s [vector] +++ OK, passed 100 tests.
  14524. 1427.25 s [vector] update: OK
  14525. 1427.25 s [vector] +++ OK, passed 100 tests.
  14526. 1427.25 s [vector] mempty: OK
  14527. 1427.25 s [vector] +++ OK, passed 100 tests.
  14528. 1427.25 s [vector] mappend: OK
  14529. 1427.26 s [vector] +++ OK, passed 100 tests.
  14530. 1427.28 s [vector] mconcat: OK (0.03s)
  14531. 1427.28 s [vector] +++ OK, passed 100 tests.
  14532. 1427.29 s [vector] glength: OK
  14533. 1427.29 s [vector] +++ OK, passed 100 tests.
  14534. 1427.29 s [vector] sum: OK
  14535. 1427.29 s [vector] +++ OK, passed 100 tests.
  14536. 1427.29 s [vector] product: OK
  14537. 1427.29 s [vector] +++ OK, passed 100 tests.
  14538. 1427.29 s [vector] enumFromN: OK
  14539. 1427.29 s [vector] +++ OK, passed 100 tests.
  14540. 1427.29 s [vector] enumFromThenN: OK
  14541. 1427.29 s [vector] +++ OK, passed 100 tests.
  14542. 1427.29 s [vector] enumFromTo: OK
  14543. 1427.29 s [vector] +++ OK, passed 100 tests.
  14544. 1427.29 s [vector] enumFromThenTo: OK
  14545. 1427.29 s [vector] +++ OK, passed 100 tests; 2 discarded.
  14546. 1427.29 s [vector] (Double)
  14547. 1427.29 s [vector] fromList.toList == id: OK
  14548. 1427.29 s [vector] +++ OK, passed 100 tests.
  14549. 1427.29 s [vector] toList.fromList == id: OK
  14550. 1427.29 s [vector] +++ OK, passed 100 tests.
  14551. 1427.29 s [vector] unstream.stream == id: OK
  14552. 1427.29 s [vector] +++ OK, passed 100 tests.
  14553. 1427.29 s [vector] stream.unstream == id: OK
  14554. 1427.29 s [vector] +++ OK, passed 100 tests.
  14555. 1427.30 s [vector] eq: OK
  14556. 1427.30 s [vector] +++ OK, passed 100 tests.
  14557. 1427.30 s [vector] length: OK
  14558. 1427.30 s [vector] +++ OK, passed 100 tests.
  14559. 1427.30 s [vector] null: OK
  14560. 1427.30 s [vector] +++ OK, passed 100 tests.
  14561. 1427.30 s [vector] index: OK
  14562. 1427.30 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14563. 1427.30 s [vector] safeIndex: OK
  14564. 1427.30 s [vector] +++ OK, passed 100 tests.
  14565. 1427.30 s [vector] head: OK
  14566. 1427.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14567. 1427.30 s [vector] last: OK
  14568. 1427.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14569. 1427.30 s [vector] unsafeIndex: OK
  14570. 1427.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14571. 1427.30 s [vector] unsafeHead: OK
  14572. 1427.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14573. 1427.30 s [vector] unsafeLast: OK
  14574. 1427.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14575. 1427.30 s [vector] slice: OK
  14576. 1427.30 s [vector] +++ OK, passed 100 tests.
  14577. 1427.30 s [vector] init: OK
  14578. 1427.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14579. 1427.30 s [vector] tail: OK
  14580. 1427.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14581. 1427.31 s [vector] take: OK
  14582. 1427.31 s [vector] +++ OK, passed 100 tests.
  14583. 1427.31 s [vector] drop: OK
  14584. 1427.31 s [vector] +++ OK, passed 100 tests.
  14585. 1427.31 s [vector] splitAt: OK
  14586. 1427.31 s [vector] +++ OK, passed 100 tests.
  14587. 1427.31 s [vector] empty: OK
  14588. 1427.31 s [vector] +++ OK, passed 100 tests.
  14589. 1427.31 s [vector] singleton: OK
  14590. 1427.31 s [vector] +++ OK, passed 100 tests.
  14591. 1427.31 s [vector] replicate: OK
  14592. 1427.31 s [vector] +++ OK, passed 100 tests.
  14593. 1427.31 s [vector] generate: OK
  14594. 1427.31 s [vector] +++ OK, passed 100 tests.
  14595. 1427.32 s [vector] iterateN: OK
  14596. 1427.32 s [vector] +++ OK, passed 100 tests.
  14597. 1427.36 s [vector] iterateNM: OK (0.02s)
  14598. 1427.36 s [vector] +++ OK, passed 100 tests.
  14599. 1427.38 s [vector] generateM: OK (0.03s)
  14600. 1427.38 s [vector] +++ OK, passed 100 tests.
  14601. 1427.38 s [vector] replicateM: OK
  14602. 1427.38 s [vector] +++ OK, passed 100 tests.
  14603. 1427.38 s [vector] create: OK
  14604. 1427.38 s [vector] +++ OK, passed 100 tests.
  14605. 1427.38 s [vector] createT: OK
  14606. 1427.38 s [vector] +++ OK, passed 100 tests.
  14607. 1427.38 s [vector] unfoldr: OK
  14608. 1427.38 s [vector] +++ OK, passed 100 tests.
  14609. 1427.38 s [vector] unfoldrN: OK
  14610. 1427.38 s [vector] +++ OK, passed 100 tests.
  14611. 1427.38 s [vector] unfoldrExactN: OK
  14612. 1427.38 s [vector] +++ OK, passed 100 tests.
  14613. 1427.40 s [vector] unfoldrM: OK
  14614. 1427.40 s [vector] +++ OK, passed 100 tests.
  14615. 1427.40 s [vector] unfoldrNM: OK
  14616. 1427.41 s [vector] +++ OK, passed 100 tests.
  14617. 1427.42 s [vector] unfoldrExactNM: OK (0.02s)
  14618. 1427.42 s [vector] +++ OK, passed 100 tests.
  14619. 1427.44 s [vector] constructN: OK (0.02s)
  14620. 1427.44 s [vector] +++ OK, passed 100 tests.
  14621. 1427.44 s [vector] constructrN: OK (0.01s)
  14622. 1427.44 s [vector] +++ OK, passed 100 tests.
  14623. 1427.46 s [vector] cons: OK
  14624. 1427.46 s [vector] +++ OK, passed 100 tests.
  14625. 1427.46 s [vector] snoc: OK
  14626. 1427.46 s [vector] +++ OK, passed 100 tests.
  14627. 1427.46 s [vector] append: OK
  14628. 1427.46 s [vector] +++ OK, passed 100 tests.
  14629. 1427.47 s [vector] concat: OK (0.03s)
  14630. 1427.47 s [vector] +++ OK, passed 100 tests.
  14631. 1427.47 s [vector] force: OK
  14632. 1427.47 s [vector] +++ OK, passed 100 tests.
  14633. 1427.47 s [vector] upd: OK
  14634. 1427.47 s [vector] +++ OK, passed 100 tests.
  14635. 1427.48 s [vector] accum: OK (0.01s)
  14636. 1427.48 s [vector] +++ OK, passed 100 tests.
  14637. 1427.48 s [vector] reverse: OK
  14638. 1427.48 s [vector] +++ OK, passed 100 tests.
  14639. 1427.49 s [vector] backpermute: OK
  14640. 1427.49 s [vector] +++ OK, passed 100 tests.
  14641. 1427.50 s [vector] map: OK
  14642. 1427.50 s [vector] +++ OK, passed 100 tests.
  14643. 1427.50 s [vector] imap: OK
  14644. 1427.50 s [vector] +++ OK, passed 100 tests.
  14645. 1427.52 s [vector] concatMap: OK
  14646. 1427.52 s [vector] +++ OK, passed 100 tests.
  14647. 1427.52 s [vector] mapM: OK
  14648. 1427.54 s [vector] +++ OK, passed 100 tests.
  14649. 1427.56 s [vector] mapM_: OK (0.03s)
  14650. 1427.56 s [vector] +++ OK, passed 100 tests.
  14651. 1427.58 s [vector] forM: OK (0.01s)
  14652. 1427.58 s [vector] +++ OK, passed 100 tests.
  14653. 1427.61 s [vector] forM_: OK (0.04s)
  14654. 1427.62 s [vector] +++ OK, passed 100 tests.
  14655. 1427.62 s [vector] imapM: OK
  14656. 1427.62 s [vector] +++ OK, passed 100 tests.
  14657. 1427.66 s [vector] imapM_: OK (0.03s)
  14658. 1427.66 s [vector] +++ OK, passed 100 tests.
  14659. 1427.67 s [vector] zipWith: OK
  14660. 1427.67 s [pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
  14661. 1427.68 s [vector] +++ OK, passed 100 tests.
  14662. 1427.68 s [vector] zipWith3: OK (0.01s)
  14663. 1427.68 s [vector] +++ OK, passed 100 tests.
  14664. 1427.68 s [vector] izipWith: OK
  14665. 1427.69 s [vector] +++ OK, passed 100 tests.
  14666. 1427.70 s [vector] izipWith3: OK (0.01s)
  14667. 1427.70 s [vector] +++ OK, passed 100 tests.
  14668. 1427.72 s [vector] izipWithM: OK (0.01s)
  14669. 1427.72 s [vector] +++ OK, passed 100 tests.
  14670. 1427.74 s [vector] izipWithM_: OK (0.03s)
  14671. 1427.74 s [vector] +++ OK, passed 100 tests.
  14672. 1427.74 s [vector] zipWithM: OK
  14673. 1427.74 s [vector] +++ OK, passed 100 tests.
  14674. 1427.78 s [vector] zipWithM_: OK (0.03s)
  14675. 1427.78 s [vector] +++ OK, passed 100 tests.
  14676. 1427.78 s [vector] filter: OK
  14677. 1427.78 s [vector] +++ OK, passed 100 tests.
  14678. 1427.80 s [vector] ifilter: OK
  14679. 1427.80 s [vector] +++ OK, passed 100 tests.
  14680. 1427.82 s [vector] filterM: OK (0.04s)
  14681. 1427.83 s [vector] +++ OK, passed 100 tests.
  14682. 1427.84 s [vector] uniq: OK
  14683. 1427.84 s [vector] +++ OK, passed 100 tests.
  14684. 1427.84 s [vector] mapMaybe: OK
  14685. 1427.84 s [vector] +++ OK, passed 100 tests.
  14686. 1427.84 s [vector] imapMaybe: OK
  14687. 1427.84 s [vector] +++ OK, passed 100 tests.
  14688. 1427.85 s [vector] takeWhile: OK
  14689. 1427.86 s [vector] +++ OK, passed 100 tests.
  14690. 1427.86 s [vector] dropWhile: OK
  14691. 1427.86 s [vector] +++ OK, passed 100 tests.
  14692. 1427.86 s [vector] partition: OK
  14693. 1427.86 s [vector] +++ OK, passed 100 tests.
  14694. 1427.86 s [vector] partitionWith: OK
  14695. 1427.86 s [vector] +++ OK, passed 100 tests.
  14696. 1427.86 s [vector] span: OK
  14697. 1427.86 s [vector] +++ OK, passed 100 tests.
  14698. 1427.86 s [vector] break: OK
  14699. 1427.86 s [vector] +++ OK, passed 100 tests.
  14700. 1427.86 s [vector] spanR: OK
  14701. 1427.86 s [vector] +++ OK, passed 100 tests.
  14702. 1427.86 s [vector] breakR: OK
  14703. 1427.86 s [vector] +++ OK, passed 100 tests.
  14704. 1427.87 s [vector] groupBy: OK
  14705. 1427.87 s [vector] +++ OK, passed 100 tests.
  14706. 1427.88 s [vector] elem: OK
  14707. 1427.88 s [vector] +++ OK, passed 100 tests.
  14708. 1427.88 s [vector] notElem: OK
  14709. 1427.88 s [vector] +++ OK, passed 100 tests.
  14710. 1427.89 s [vector] find: OK
  14711. 1427.89 s [vector] +++ OK, passed 100 tests.
  14712. 1427.89 s [vector] findIndex: OK
  14713. 1427.89 s [vector] +++ OK, passed 100 tests.
  14714. 1427.89 s [vector] findIndexR: OK
  14715. 1427.89 s [vector] +++ OK, passed 100 tests.
  14716. 1427.89 s [vector] findIndices: OK
  14717. 1427.89 s [vector] +++ OK, passed 100 tests.
  14718. 1427.89 s [vector] elemIndex: OK
  14719. 1427.89 s [vector] +++ OK, passed 100 tests.
  14720. 1427.89 s [vector] elemIndices: OK
  14721. 1427.90 s [vector] +++ OK, passed 100 tests.
  14722. 1427.91 s [vector] foldl: OK (0.01s)
  14723. 1427.92 s [vector] +++ OK, passed 100 tests.
  14724. 1427.92 s [vector] foldl1: OK (0.01s)
  14725. 1427.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14726. 1427.93 s [vector] foldl': OK (0.01s)
  14727. 1427.94 s [vector] +++ OK, passed 100 tests.
  14728. 1427.94 s [vector] foldl1': OK (0.01s)
  14729. 1427.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14730. 1427.96 s [vector] foldr: OK (0.01s)
  14731. 1427.96 s [vector] +++ OK, passed 100 tests.
  14732. 1427.96 s [vector] foldr1: OK (0.01s)
  14733. 1427.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14734. 1427.97 s [vector] foldr': OK
  14735. 1427.97 s [vector] +++ OK, passed 100 tests.
  14736. 1427.99 s [vector] foldr1': OK (0.01s)
  14737. 1428.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14738. 1428.00 s [vector] ifoldl: OK (0.01s)
  14739. 1428.00 s [vector] +++ OK, passed 100 tests.
  14740. 1428.02 s [vector] ifoldl': OK (0.01s)
  14741. 1428.02 s [vector] +++ OK, passed 100 tests.
  14742. 1428.04 s [vector] ifoldr: OK (0.01s)
  14743. 1428.04 s [vector] +++ OK, passed 100 tests.
  14744. 1428.05 s [vector] ifoldr': OK (0.02s)
  14745. 1428.06 s [vector] +++ OK, passed 100 tests.
  14746. 1428.06 s [vector] ifoldM: OK (0.01s)
  14747. 1428.06 s [vector] +++ OK, passed 100 tests.
  14748. 1428.08 s [vector] ifoldM': OK (0.01s)
  14749. 1428.08 s [vector] +++ OK, passed 100 tests.
  14750. 1428.12 s [vector] ifoldM_: OK (0.04s)
  14751. 1428.12 s [vector] +++ OK, passed 100 tests.
  14752. 1428.14 s [vector] ifoldM'_: OK (0.03s)
  14753. 1428.14 s [vector] +++ OK, passed 100 tests.
  14754. 1428.14 s [vector] all: OK
  14755. 1428.14 s [vector] +++ OK, passed 100 tests.
  14756. 1428.14 s [pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
  14757. 1428.14 s [pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
  14758. 1428.14 s [pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
  14759. 1428.15 s [vector] any: OK
  14760. 1428.15 s [vector] +++ OK, passed 100 tests.
  14761. 1428.15 s [vector] prescanl: OK (0.01s)
  14762. 1428.15 s [vector] +++ OK, passed 100 tests.
  14763. 1428.17 s [vector] prescanl': OK
  14764. 1428.17 s [vector] +++ OK, passed 100 tests.
  14765. 1428.17 s [vector] postscanl: OK (0.01s)
  14766. 1428.17 s [vector] +++ OK, passed 100 tests.
  14767. 1428.20 s [vector] postscanl': OK (0.01s)
  14768. 1428.20 s [vector] +++ OK, passed 100 tests.
  14769. 1428.21 s [vector] scanl: OK (0.01s)
  14770. 1428.22 s [vector] +++ OK, passed 100 tests.
  14771. 1428.22 s [vector] scanl': OK (0.01s)
  14772. 1428.22 s [vector] +++ OK, passed 100 tests.
  14773. 1428.24 s [vector] scanl1: OK (0.01s)
  14774. 1428.24 s [vector] +++ OK, passed 100 tests.
  14775. 1428.26 s [vector] scanl1': OK (0.01s)
  14776. 1428.26 s [vector] +++ OK, passed 100 tests.
  14777. 1428.26 s [vector] iscanl: OK (0.01s)
  14778. 1428.26 s [vector] +++ OK, passed 100 tests.
  14779. 1428.28 s [vector] iscanl': OK (0.02s)
  14780. 1428.28 s [vector] +++ OK, passed 100 tests.
  14781. 1428.30 s [vector] prescanr: OK (0.01s)
  14782. 1428.30 s [vector] +++ OK, passed 100 tests.
  14783. 1428.31 s [vector] prescanr': OK (0.01s)
  14784. 1428.31 s [vector] +++ OK, passed 100 tests.
  14785. 1428.31 s [vector] postscanr: OK (0.01s)
  14786. 1428.31 s [vector] +++ OK, passed 100 tests.
  14787. 1428.34 s [vector] postscanr': OK
  14788. 1428.34 s [vector] +++ OK, passed 100 tests.
  14789. 1428.34 s [vector] scanr: OK (0.01s)
  14790. 1428.34 s [vector] +++ OK, passed 100 tests.
  14791. 1428.36 s [vector] scanr': OK (0.01s)
  14792. 1428.36 s [vector] +++ OK, passed 100 tests.
  14793. 1428.38 s [vector] scanr1: OK (0.01s)
  14794. 1428.38 s [vector] +++ OK, passed 100 tests.
  14795. 1428.40 s [vector] scanr1': OK (0.01s)
  14796. 1428.40 s [vector] +++ OK, passed 100 tests.
  14797. 1428.42 s [vector] iscanr: OK (0.03s)
  14798. 1428.42 s [vector] +++ OK, passed 100 tests.
  14799. 1428.44 s [vector] iscanr': OK (0.03s)
  14800. 1428.44 s [vector] +++ OK, passed 100 tests.
  14801. 1428.44 s [vector] mut_read: OK
  14802. 1428.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14803. 1428.44 s [vector] mut_write: OK
  14804. 1428.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14805. 1428.44 s [vector] mut_modify: OK
  14806. 1428.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14807. 1428.45 s [pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
  14808. 1428.46 s [vector] mut_generate: OK
  14809. 1428.46 s [vector] +++ OK, passed 100 tests.
  14810. 1428.50 s [vector] mut_generateM: OK (0.03s)
  14811. 1428.50 s [vector] +++ OK, passed 100 tests.
  14812. 1428.52 s [vector] mut_mapM_: OK (0.04s)
  14813. 1428.52 s [vector] +++ OK, passed 100 tests.
  14814. 1428.53 s [pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
  14815. 1428.56 s [vector] mut_imapM_: OK (0.03s)
  14816. 1428.56 s [vector] +++ OK, passed 100 tests.
  14817. 1428.60 s [vector] mut_forM_: OK (0.03s)
  14818. 1428.60 s [vector] +++ OK, passed 100 tests.
  14819. 1428.63 s [vector] mut_iforM_: OK (0.03s)
  14820. 1428.63 s [vector] +++ OK, passed 100 tests.
  14821. 1428.63 s [vector] mut_foldr: OK (0.01s)
  14822. 1428.63 s [vector] +++ OK, passed 100 tests.
  14823. 1428.63 s [pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
  14824. 1428.64 s [vector] mut_foldr': OK
  14825. 1428.64 s [vector] +++ OK, passed 100 tests.
  14826. 1428.67 s [vector] mut_foldl: OK (0.01s)
  14827. 1428.68 s [vector] +++ OK, passed 100 tests.
  14828. 1428.68 s [vector] mut_foldl': OK (0.02s)
  14829. 1428.68 s [vector] +++ OK, passed 100 tests.
  14830. 1428.70 s [vector] mut_ifoldr: OK (0.02s)
  14831. 1428.70 s [vector] +++ OK, passed 100 tests.
  14832. 1428.72 s [vector] mut_ifoldr': OK (0.02s)
  14833. 1428.72 s [vector] +++ OK, passed 100 tests.
  14834. 1428.74 s [vector] mut_ifoldl: OK (0.01s)
  14835. 1428.74 s [vector] +++ OK, passed 100 tests.
  14836. 1428.76 s [vector] mut_ifoldl': OK (0.01s)
  14837. 1428.76 s [vector] +++ OK, passed 100 tests.
  14838. 1428.76 s [vector] mut_foldM: OK (0.02s)
  14839. 1428.76 s [vector] +++ OK, passed 100 tests.
  14840. 1428.78 s [vector] mut_foldM': OK
  14841. 1428.78 s [vector] +++ OK, passed 100 tests.
  14842. 1428.80 s [vector] mut_foldrM: OK (0.02s)
  14843. 1428.80 s [vector] +++ OK, passed 100 tests.
  14844. 1428.81 s [vector] mut_foldrM': OK (0.01s)
  14845. 1428.82 s [vector] +++ OK, passed 100 tests.
  14846. 1428.82 s [vector] mut_ifoldM: OK (0.01s)
  14847. 1428.82 s [vector] +++ OK, passed 100 tests.
  14848. 1428.84 s [vector] mut_ifoldM': OK (0.01s)
  14849. 1428.84 s [vector] +++ OK, passed 100 tests.
  14850. 1428.85 s [vector] mut_ifoldrM: OK (0.01s)
  14851. 1428.85 s [vector] +++ OK, passed 100 tests.
  14852. 1428.86 s [vector] mut_ifoldrM': OK (0.01s)
  14853. 1428.86 s [vector] +++ OK, passed 100 tests.
  14854. 1428.86 s [vector] compare: OK
  14855. 1428.86 s [vector] +++ OK, passed 100 tests.
  14856. 1428.86 s [vector] maximum: OK
  14857. 1428.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14858. 1428.86 s [vector] minimum: OK
  14859. 1428.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14860. 1428.86 s [vector] minIndex: OK
  14861. 1428.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14862. 1428.86 s [vector] maxIndex: OK
  14863. 1428.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14864. 1428.86 s [vector] maximumBy: OK
  14865. 1428.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14866. 1428.86 s [vector] minimumBy: OK
  14867. 1428.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14868. 1428.86 s [vector] maximumOn: OK
  14869. 1428.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14870. 1428.87 s [vector] minimumOn: OK
  14871. 1428.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14872. 1428.87 s [vector] maxIndexBy: OK
  14873. 1428.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14874. 1428.87 s [vector] minIndexBy: OK
  14875. 1428.87 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14876. 1428.87 s [vector] ListFirstMaxIndexWins: OK
  14877. 1428.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14878. 1428.87 s [vector] FalseListFirstMaxIndexWins: OK
  14879. 1428.87 s [vector] +++ OK, failed as expected. (after 1 test):
  14880. 1428.87 s [vector] Exception:
  14881. 1428.87 s [vector] Prelude.foldr1: empty list
  14882. 1428.87 s [vector] CallStack (from HasCallStack):
  14883. 1428.87 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  14884. 1428.87 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  14885. 1428.87 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14886. 1428.87 s [vector] []
  14887. 1428.87 s [vector] zip: OK
  14888. 1428.88 s [vector] +++ OK, passed 100 tests.
  14889. 1428.88 s [vector] zip3: OK
  14890. 1428.88 s [vector] +++ OK, passed 100 tests.
  14891. 1428.88 s [vector] unzip: OK
  14892. 1428.88 s [vector] +++ OK, passed 100 tests.
  14893. 1428.88 s [vector] unzip3: OK
  14894. 1428.88 s [vector] +++ OK, passed 100 tests.
  14895. 1428.88 s [vector] indexed: OK
  14896. 1428.88 s [vector] +++ OK, passed 100 tests.
  14897. 1428.88 s [vector] update: OK
  14898. 1428.88 s [vector] +++ OK, passed 100 tests.
  14899. 1428.89 s [vector] mempty: OK
  14900. 1428.89 s [vector] +++ OK, passed 100 tests.
  14901. 1428.90 s [vector] mappend: OK
  14902. 1428.90 s [vector] +++ OK, passed 100 tests.
  14903. 1428.91 s [vector] mconcat: OK (0.02s)
  14904. 1428.91 s [vector] +++ OK, passed 100 tests.
  14905. 1428.91 s [vector] glength: OK
  14906. 1428.91 s [vector] +++ OK, passed 100 tests.
  14907. 1428.91 s [vector] sum: OK
  14908. 1428.91 s [vector] +++ OK, passed 100 tests.
  14909. 1428.92 s [vector] product: OK
  14910. 1428.92 s [vector] +++ OK, passed 100 tests.
  14911. 1428.92 s [vector] enumFromN: OK
  14912. 1428.92 s [vector] +++ OK, passed 100 tests.
  14913. 1428.92 s [vector] enumFromThenN: OK
  14914. 1428.92 s [vector] +++ OK, passed 100 tests.
  14915. 1428.92 s [vector] enumFromTo: OK
  14916. 1428.92 s [vector] +++ OK, passed 100 tests.
  14917. 1428.92 s [vector] enumFromThenTo: OK
  14918. 1428.92 s [vector] +++ OK, passed 100 tests.
  14919. 1428.92 s [vector] (Int,Bool)
  14920. 1428.92 s [vector] fromList.toList == id: OK
  14921. 1428.92 s [vector] +++ OK, passed 100 tests.
  14922. 1428.92 s [vector] toList.fromList == id: OK
  14923. 1428.92 s [vector] +++ OK, passed 100 tests.
  14924. 1428.92 s [vector] unstream.stream == id: OK
  14925. 1428.92 s [vector] +++ OK, passed 100 tests.
  14926. 1428.92 s [vector] stream.unstream == id: OK
  14927. 1428.92 s [vector] +++ OK, passed 100 tests.
  14928. 1428.92 s [vector] eq: OK
  14929. 1428.92 s [vector] +++ OK, passed 100 tests.
  14930. 1428.92 s [vector] length: OK
  14931. 1428.92 s [vector] +++ OK, passed 100 tests.
  14932. 1428.92 s [vector] null: OK
  14933. 1428.92 s [vector] +++ OK, passed 100 tests.
  14934. 1428.93 s [vector] index: OK
  14935. 1428.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14936. 1428.93 s [vector] safeIndex: OK
  14937. 1428.93 s [vector] +++ OK, passed 100 tests.
  14938. 1428.93 s [vector] head: OK
  14939. 1428.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14940. 1428.93 s [vector] last: OK
  14941. 1428.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14942. 1428.93 s [vector] unsafeIndex: OK
  14943. 1428.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14944. 1428.93 s [vector] unsafeHead: OK
  14945. 1428.93 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14946. 1428.93 s [vector] unsafeLast: OK
  14947. 1428.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14948. 1428.93 s [vector] slice: OK
  14949. 1428.93 s [vector] +++ OK, passed 100 tests.
  14950. 1428.93 s [vector] init: OK
  14951. 1428.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14952. 1428.93 s [vector] tail: OK
  14953. 1428.93 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14954. 1428.93 s [vector] take: OK
  14955. 1428.94 s [vector] +++ OK, passed 100 tests.
  14956. 1428.94 s [vector] drop: OK
  14957. 1428.94 s [vector] +++ OK, passed 100 tests.
  14958. 1428.94 s [vector] splitAt: OK
  14959. 1428.94 s [vector] +++ OK, passed 100 tests.
  14960. 1428.94 s [vector] empty: OK
  14961. 1428.94 s [vector] +++ OK, passed 100 tests.
  14962. 1428.94 s [vector] singleton: OK
  14963. 1428.94 s [vector] +++ OK, passed 100 tests.
  14964. 1428.94 s [vector] replicate: OK
  14965. 1428.96 s [vector] +++ OK, passed 100 tests.
  14966. 1428.96 s [vector] generate: OK
  14967. 1428.96 s [vector] +++ OK, passed 100 tests.
  14968. 1428.96 s [vector] iterateN: OK
  14969. 1428.96 s [vector] +++ OK, passed 100 tests.
  14970. 1428.98 s [vector] iterateNM: OK (0.02s)
  14971. 1428.98 s [vector] +++ OK, passed 100 tests.
  14972. 1428.98 s [pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
  14973. 1429.02 s [vector] generateM: OK (0.05s)
  14974. 1429.02 s [vector] +++ OK, passed 100 tests.
  14975. 1429.05 s [vector] replicateM: OK (0.04s)
  14976. 1429.05 s [vector] +++ OK, passed 100 tests.
  14977. 1429.05 s [vector] create: OK
  14978. 1429.05 s [vector] +++ OK, passed 100 tests.
  14979. 1429.05 s [vector] createT: OK
  14980. 1429.05 s [vector] +++ OK, passed 100 tests.
  14981. 1429.05 s [vector] unfoldr: OK
  14982. 1429.05 s [vector] +++ OK, passed 100 tests.
  14983. 1429.05 s [vector] unfoldrN: OK
  14984. 1429.05 s [vector] +++ OK, passed 100 tests.
  14985. 1429.06 s [vector] unfoldrExactN: OK
  14986. 1429.07 s [vector] +++ OK, passed 100 tests.
  14987. 1429.07 s [vector] unfoldrM: OK
  14988. 1429.07 s [vector] +++ OK, passed 100 tests.
  14989. 1429.07 s [vector] unfoldrNM: OK
  14990. 1429.07 s [vector] +++ OK, passed 100 tests.
  14991. 1429.09 s [pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
  14992. 1429.09 s [vector] unfoldrExactNM: OK (0.02s)
  14993. 1429.09 s [vector] +++ OK, passed 100 tests.
  14994. 1429.09 s [vector] constructN: OK
  14995. 1429.10 s [vector] +++ OK, passed 100 tests.
  14996. 1429.11 s [vector] constructrN: OK
  14997. 1429.11 s [vector] +++ OK, passed 100 tests.
  14998. 1429.11 s [vector] cons: OK
  14999. 1429.11 s [vector] +++ OK, passed 100 tests.
  15000. 1429.11 s [vector] snoc: OK
  15001. 1429.11 s [vector] +++ OK, passed 100 tests.
  15002. 1429.11 s [vector] append: OK
  15003. 1429.12 s [vector] +++ OK, passed 100 tests.
  15004. 1429.17 s [vector] concat: OK (0.06s)
  15005. 1429.17 s [vector] +++ OK, passed 100 tests.
  15006. 1429.17 s [vector] force: OK
  15007. 1429.19 s [vector] +++ OK, passed 100 tests.
  15008. 1429.21 s [vector] upd: OK (0.03s)
  15009. 1429.21 s [vector] +++ OK, passed 100 tests.
  15010. 1429.21 s [vector] accum: OK
  15011. 1429.21 s [vector] +++ OK, passed 100 tests.
  15012. 1429.21 s [vector] reverse: OK
  15013. 1429.21 s [vector] +++ OK, passed 100 tests.
  15014. 1429.21 s [vector] backpermute: OK
  15015. 1429.21 s [vector] +++ OK, passed 100 tests.
  15016. 1429.22 s [vector] map: OK
  15017. 1429.22 s [vector] +++ OK, passed 100 tests.
  15018. 1429.22 s [vector] imap: OK
  15019. 1429.22 s [vector] +++ OK, passed 100 tests.
  15020. 1429.22 s [vector] concatMap: OK
  15021. 1429.23 s [vector] +++ OK, passed 100 tests.
  15022. 1429.24 s [vector] mapM: OK
  15023. 1429.24 s [vector] +++ OK, passed 100 tests.
  15024. 1429.26 s [vector] mapM_: OK (0.03s)
  15025. 1429.28 s [vector] +++ OK, passed 100 tests.
  15026. 1429.28 s [vector] forM: OK
  15027. 1429.28 s [vector] +++ OK, passed 100 tests.
  15028. 1429.29 s [vector] forM_: OK (0.03s)
  15029. 1429.30 s [vector] +++ OK, passed 100 tests.
  15030. 1429.30 s [vector] imapM: OK
  15031. 1429.30 s [vector] +++ OK, passed 100 tests.
  15032. 1429.32 s [vector] imapM_: OK (0.03s)
  15033. 1429.33 s [vector] +++ OK, passed 100 tests.
  15034. 1429.34 s [vector] zipWith: OK
  15035. 1429.34 s [vector] +++ OK, passed 100 tests.
  15036. 1429.34 s [vector] zipWith3: OK
  15037. 1429.34 s [vector] +++ OK, passed 100 tests.
  15038. 1429.34 s [vector] izipWith: OK
  15039. 1429.34 s [vector] +++ OK, passed 100 tests.
  15040. 1429.34 s [vector] izipWith3: OK
  15041. 1429.34 s [vector] +++ OK, passed 100 tests.
  15042. 1429.34 s [vector] izipWithM: OK
  15043. 1429.34 s [vector] +++ OK, passed 100 tests.
  15044. 1429.36 s [vector] izipWithM_: OK
  15045. 1429.37 s [vector] +++ OK, passed 100 tests.
  15046. 1429.37 s [vector] zipWithM: OK
  15047. 1429.38 s [vector] +++ OK, passed 100 tests.
  15048. 1429.40 s [vector] zipWithM_: OK (0.02s)
  15049. 1429.40 s [vector] +++ OK, passed 100 tests.
  15050. 1429.40 s [vector] filter: OK
  15051. 1429.42 s [vector] +++ OK, passed 100 tests.
  15052. 1429.42 s [vector] ifilter: OK
  15053. 1429.42 s [vector] +++ OK, passed 100 tests.
  15054. 1429.44 s [vector] filterM: OK (0.03s)
  15055. 1429.44 s [vector] +++ OK, passed 100 tests.
  15056. 1429.44 s [vector] uniq: OK
  15057. 1429.44 s [vector] +++ OK, passed 100 tests.
  15058. 1429.44 s [vector] mapMaybe: OK
  15059. 1429.44 s [vector] +++ OK, passed 100 tests.
  15060. 1429.44 s [vector] imapMaybe: OK
  15061. 1429.44 s [vector] +++ OK, passed 100 tests.
  15062. 1429.44 s [vector] takeWhile: OK
  15063. 1429.44 s [vector] +++ OK, passed 100 tests.
  15064. 1429.44 s [vector] dropWhile: OK
  15065. 1429.44 s [vector] +++ OK, passed 100 tests.
  15066. 1429.45 s [vector] partition: OK
  15067. 1429.45 s [vector] +++ OK, passed 100 tests.
  15068. 1429.45 s [vector] partitionWith: OK
  15069. 1429.45 s [vector] +++ OK, passed 100 tests.
  15070. 1429.45 s [vector] span: OK
  15071. 1429.45 s [vector] +++ OK, passed 100 tests.
  15072. 1429.46 s [vector] break: OK
  15073. 1429.46 s [vector] +++ OK, passed 100 tests.
  15074. 1429.46 s [vector] spanR: OK
  15075. 1429.46 s [vector] +++ OK, passed 100 tests.
  15076. 1429.47 s [vector] breakR: OK
  15077. 1429.47 s [vector] +++ OK, passed 100 tests.
  15078. 1429.47 s [vector] groupBy: OK
  15079. 1429.47 s [vector] +++ OK, passed 100 tests.
  15080. 1429.47 s [vector] elem: OK
  15081. 1429.47 s [vector] +++ OK, passed 100 tests.
  15082. 1429.47 s [vector] notElem: OK
  15083. 1429.47 s [vector] +++ OK, passed 100 tests.
  15084. 1429.48 s [vector] find: OK
  15085. 1429.48 s [vector] +++ OK, passed 100 tests.
  15086. 1429.48 s [vector] findIndex: OK
  15087. 1429.49 s [vector] +++ OK, passed 100 tests.
  15088. 1429.49 s [vector] findIndexR: OK
  15089. 1429.49 s [vector] +++ OK, passed 100 tests.
  15090. 1429.49 s [vector] findIndices: OK
  15091. 1429.49 s [vector] +++ OK, passed 100 tests.
  15092. 1429.50 s [vector] elemIndex: OK
  15093. 1429.50 s [vector] +++ OK, passed 100 tests.
  15094. 1429.50 s [vector] elemIndices: OK
  15095. 1429.51 s [vector] +++ OK, passed 100 tests.
  15096. 1429.51 s [vector] foldl: OK
  15097. 1429.52 s [vector] +++ OK, passed 100 tests.
  15098. 1429.52 s [vector] foldl1: OK
  15099. 1429.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15100. 1429.52 s [vector] foldl': OK
  15101. 1429.52 s [vector] +++ OK, passed 100 tests.
  15102. 1429.52 s [vector] foldl1': OK
  15103. 1429.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15104. 1429.54 s [vector] foldr: OK (0.02s)
  15105. 1429.54 s [vector] +++ OK, passed 100 tests.
  15106. 1429.54 s [vector] foldr1: OK
  15107. 1429.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15108. 1429.55 s [vector] foldr': OK
  15109. 1429.56 s [vector] +++ OK, passed 100 tests.
  15110. 1429.56 s [vector] foldr1': OK
  15111. 1429.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15112. 1429.56 s [vector] ifoldl: OK
  15113. 1429.56 s [vector] +++ OK, passed 100 tests.
  15114. 1429.56 s [vector] ifoldl': OK
  15115. 1429.56 s [vector] +++ OK, passed 100 tests.
  15116. 1429.56 s [vector] ifoldr: OK
  15117. 1429.56 s [vector] +++ OK, passed 100 tests.
  15118. 1429.56 s [vector] ifoldr': OK
  15119. 1429.56 s [vector] +++ OK, passed 100 tests.
  15120. 1429.57 s [vector] ifoldM: OK
  15121. 1429.58 s [vector] +++ OK, passed 100 tests.
  15122. 1429.58 s [vector] ifoldM': OK
  15123. 1429.58 s [vector] +++ OK, passed 100 tests.
  15124. 1429.60 s [vector] ifoldM_: OK (0.02s)
  15125. 1429.60 s [vector] +++ OK, passed 100 tests.
  15126. 1429.62 s [vector] ifoldM'_: OK (0.02s)
  15127. 1429.62 s [vector] +++ OK, passed 100 tests.
  15128. 1429.62 s [vector] all: OK
  15129. 1429.62 s [vector] +++ OK, passed 100 tests.
  15130. 1429.62 s [vector] any: OK
  15131. 1429.62 s [vector] +++ OK, passed 100 tests.
  15132. 1429.63 s [vector] prescanl: OK
  15133. 1429.63 s [vector] +++ OK, passed 100 tests.
  15134. 1429.64 s [vector] prescanl': OK
  15135. 1429.64 s [vector] +++ OK, passed 100 tests.
  15136. 1429.64 s [vector] postscanl: OK
  15137. 1429.64 s [vector] +++ OK, passed 100 tests.
  15138. 1429.64 s [vector] postscanl': OK
  15139. 1429.64 s [vector] +++ OK, passed 100 tests.
  15140. 1429.65 s [vector] scanl: OK
  15141. 1429.65 s [vector] +++ OK, passed 100 tests.
  15142. 1429.65 s [vector] scanl': OK
  15143. 1429.66 s [vector] +++ OK, passed 100 tests.
  15144. 1429.66 s [vector] scanl1: OK
  15145. 1429.66 s [vector] +++ OK, passed 100 tests.
  15146. 1429.66 s [vector] scanl1': OK
  15147. 1429.66 s [vector] +++ OK, passed 100 tests.
  15148. 1429.67 s [vector] iscanl: OK
  15149. 1429.67 s [vector] +++ OK, passed 100 tests.
  15150. 1429.67 s [vector] iscanl': OK
  15151. 1429.67 s [vector] +++ OK, passed 100 tests.
  15152. 1429.68 s [vector] prescanr: OK
  15153. 1429.68 s [vector] +++ OK, passed 100 tests.
  15154. 1429.69 s [vector] prescanr': OK
  15155. 1429.69 s [vector] +++ OK, passed 100 tests.
  15156. 1429.69 s [vector] postscanr: OK
  15157. 1429.69 s [vector] +++ OK, passed 100 tests.
  15158. 1429.69 s [vector] postscanr': OK
  15159. 1429.69 s [vector] +++ OK, passed 100 tests.
  15160. 1429.69 s [vector] scanr: OK
  15161. 1429.69 s [vector] +++ OK, passed 100 tests.
  15162. 1429.70 s [vector] scanr': OK
  15163. 1429.70 s [vector] +++ OK, passed 100 tests.
  15164. 1429.70 s [vector] scanr1: OK
  15165. 1429.71 s [vector] +++ OK, passed 100 tests.
  15166. 1429.71 s [vector] scanr1': OK
  15167. 1429.72 s [vector] +++ OK, passed 100 tests.
  15168. 1429.72 s [vector] iscanr: OK
  15169. 1429.72 s [vector] +++ OK, passed 100 tests.
  15170. 1429.72 s [vector] iscanr': OK
  15171. 1429.72 s [vector] +++ OK, passed 100 tests.
  15172. 1429.72 s [vector] mut_read: OK
  15173. 1429.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15174. 1429.72 s [vector] mut_write: OK
  15175. 1429.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15176. 1429.72 s [vector] mut_modify: OK
  15177. 1429.74 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15178. 1429.74 s [vector] mut_generate: OK
  15179. 1429.74 s [vector] +++ OK, passed 100 tests.
  15180. 1429.76 s [vector] mut_generateM: OK (0.02s)
  15181. 1429.76 s [vector] +++ OK, passed 100 tests.
  15182. 1429.78 s [vector] mut_mapM_: OK (0.02s)
  15183. 1429.78 s [vector] +++ OK, passed 100 tests.
  15184. 1429.80 s [vector] mut_imapM_: OK (0.02s)
  15185. 1429.80 s [vector] +++ OK, passed 100 tests.
  15186. 1429.82 s [vector] mut_forM_: OK (0.03s)
  15187. 1429.82 s [vector] +++ OK, passed 100 tests.
  15188. 1429.86 s [vector] mut_iforM_: OK (0.03s)
  15189. 1429.86 s [vector] +++ OK, passed 100 tests.
  15190. 1429.86 s [vector] mut_foldr: OK
  15191. 1429.86 s [vector] +++ OK, passed 100 tests.
  15192. 1429.86 s [vector] mut_foldr': OK
  15193. 1429.86 s [vector] +++ OK, passed 100 tests.
  15194. 1429.87 s [vector] mut_foldl: OK
  15195. 1429.87 s [vector] +++ OK, passed 100 tests.
  15196. 1429.87 s [vector] mut_foldl': OK
  15197. 1429.87 s [vector] +++ OK, passed 100 tests.
  15198. 1429.87 s [vector] mut_ifoldr: OK
  15199. 1429.87 s [vector] +++ OK, passed 100 tests.
  15200. 1429.88 s [vector] mut_ifoldr': OK
  15201. 1429.88 s [vector] +++ OK, passed 100 tests.
  15202. 1429.88 s [vector] mut_ifoldl: OK
  15203. 1429.88 s [vector] +++ OK, passed 100 tests.
  15204. 1429.88 s [vector] mut_ifoldl': OK
  15205. 1429.88 s [vector] +++ OK, passed 100 tests.
  15206. 1429.89 s [vector] mut_foldM: OK
  15207. 1429.89 s [vector] +++ OK, passed 100 tests.
  15208. 1429.90 s [vector] mut_foldM': OK
  15209. 1429.90 s [vector] +++ OK, passed 100 tests.
  15210. 1429.90 s [vector] mut_foldrM: OK
  15211. 1429.90 s [vector] +++ OK, passed 100 tests.
  15212. 1429.90 s [vector] mut_foldrM': OK
  15213. 1429.90 s [vector] +++ OK, passed 100 tests.
  15214. 1429.91 s [vector] mut_ifoldM: OK
  15215. 1429.91 s [vector] +++ OK, passed 100 tests.
  15216. 1429.91 s [vector] mut_ifoldM': OK
  15217. 1429.91 s [vector] +++ OK, passed 100 tests.
  15218. 1429.92 s [vector] mut_ifoldrM: OK
  15219. 1429.92 s [vector] +++ OK, passed 100 tests.
  15220. 1429.92 s [vector] mut_ifoldrM': OK
  15221. 1429.92 s [vector] +++ OK, passed 100 tests.
  15222. 1429.92 s [vector] compare: OK
  15223. 1429.92 s [vector] +++ OK, passed 100 tests.
  15224. 1429.92 s [vector] maximum: OK
  15225. 1429.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15226. 1429.92 s [vector] minimum: OK
  15227. 1429.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15228. 1429.92 s [vector] minIndex: OK
  15229. 1429.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15230. 1429.92 s [vector] maxIndex: OK
  15231. 1429.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15232. 1429.92 s [vector] maximumBy: OK
  15233. 1429.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15234. 1429.92 s [vector] minimumBy: OK
  15235. 1429.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15236. 1429.92 s [vector] maximumOn: OK
  15237. 1429.93 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15238. 1429.93 s [vector] minimumOn: OK
  15239. 1429.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15240. 1429.93 s [vector] maxIndexBy: OK
  15241. 1429.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15242. 1429.93 s [vector] minIndexBy: OK
  15243. 1429.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15244. 1429.93 s [vector] ListFirstMaxIndexWins: OK
  15245. 1429.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15246. 1429.93 s [vector] FalseListFirstMaxIndexWins: OK
  15247. 1429.94 s [vector] +++ OK, failed as expected. (after 1 test):
  15248. 1429.94 s [vector] Exception:
  15249. 1429.94 s [vector] Prelude.foldr1: empty list
  15250. 1429.94 s [vector] CallStack (from HasCallStack):
  15251. 1429.94 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  15252. 1429.94 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  15253. 1429.94 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15254. 1429.94 s [vector] []
  15255. 1429.94 s [vector] zip: OK
  15256. 1429.94 s [vector] +++ OK, passed 100 tests.
  15257. 1429.95 s [vector] zip3: OK
  15258. 1429.95 s [vector] +++ OK, passed 100 tests.
  15259. 1429.95 s [vector] unzip: OK
  15260. 1429.96 s [vector] +++ OK, passed 100 tests.
  15261. 1429.96 s [vector] unzip3: OK
  15262. 1429.96 s [vector] +++ OK, passed 100 tests.
  15263. 1429.96 s [vector] indexed: OK
  15264. 1429.96 s [vector] +++ OK, passed 100 tests.
  15265. 1429.96 s [vector] update: OK
  15266. 1429.96 s [vector] +++ OK, passed 100 tests.
  15267. 1429.96 s [vector] mempty: OK
  15268. 1429.96 s [vector] +++ OK, passed 100 tests.
  15269. 1429.96 s [vector] mappend: OK
  15270. 1429.96 s [vector] +++ OK, passed 100 tests.
  15271. 1429.99 s [vector] mconcat: OK (0.03s)
  15272. 1429.99 s [vector] +++ OK, passed 100 tests.
  15273. 1429.99 s [vector] glength: OK
  15274. 1429.99 s [vector] +++ OK, passed 100 tests.
  15275. 1429.99 s [vector] (Int,Bool,Int)
  15276. 1429.99 s [vector] fromList.toList == id: OK
  15277. 1429.99 s [vector] +++ OK, passed 100 tests.
  15278. 1429.99 s [vector] toList.fromList == id: OK
  15279. 1429.99 s [vector] +++ OK, passed 100 tests.
  15280. 1429.99 s [vector] unstream.stream == id: OK
  15281. 1429.99 s [vector] +++ OK, passed 100 tests.
  15282. 1429.99 s [vector] stream.unstream == id: OK
  15283. 1429.99 s [vector] +++ OK, passed 100 tests.
  15284. 1429.99 s [vector] eq: OK
  15285. 1429.99 s [vector] +++ OK, passed 100 tests.
  15286. 1429.99 s [vector] length: OK
  15287. 1429.99 s [vector] +++ OK, passed 100 tests.
  15288. 1429.99 s [vector] null: OK
  15289. 1429.99 s [vector] +++ OK, passed 100 tests.
  15290. 1430.00 s [vector] index: OK
  15291. 1430.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15292. 1430.00 s [vector] safeIndex: OK
  15293. 1430.00 s [vector] +++ OK, passed 100 tests.
  15294. 1430.00 s [vector] head: OK
  15295. 1430.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15296. 1430.00 s [vector] last: OK
  15297. 1430.00 s [vector] +++ OK, passed 100 tests; 25 discarded.
  15298. 1430.00 s [vector] unsafeIndex: OK
  15299. 1430.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15300. 1430.01 s [vector] unsafeHead: OK
  15301. 1430.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15302. 1430.01 s [vector] unsafeLast: OK
  15303. 1430.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15304. 1430.01 s [vector] slice: OK
  15305. 1430.01 s [vector] +++ OK, passed 100 tests.
  15306. 1430.01 s [vector] init: OK
  15307. 1430.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15308. 1430.01 s [vector] tail: OK
  15309. 1430.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15310. 1430.01 s [vector] take: OK
  15311. 1430.01 s [vector] +++ OK, passed 100 tests.
  15312. 1430.01 s [vector] drop: OK
  15313. 1430.01 s [vector] +++ OK, passed 100 tests.
  15314. 1430.01 s [vector] splitAt: OK
  15315. 1430.01 s [vector] +++ OK, passed 100 tests.
  15316. 1430.01 s [vector] empty: OK
  15317. 1430.01 s [vector] +++ OK, passed 100 tests.
  15318. 1430.01 s [vector] singleton: OK
  15319. 1430.01 s [vector] +++ OK, passed 100 tests.
  15320. 1430.01 s [vector] replicate: OK
  15321. 1430.01 s [vector] +++ OK, passed 100 tests.
  15322. 1430.02 s [vector] generate: OK
  15323. 1430.02 s [vector] +++ OK, passed 100 tests.
  15324. 1430.02 s [vector] iterateN: OK
  15325. 1430.02 s [vector] +++ OK, passed 100 tests.
  15326. 1430.04 s [vector] iterateNM: OK (0.02s)
  15327. 1430.04 s [vector] +++ OK, passed 100 tests.
  15328. 1430.06 s [vector] generateM: OK (0.02s)
  15329. 1430.06 s [vector] +++ OK, passed 100 tests.
  15330. 1430.07 s [vector] replicateM: OK (0.02s)
  15331. 1430.07 s [vector] +++ OK, passed 100 tests.
  15332. 1430.07 s [vector] create: OK
  15333. 1430.08 s [vector] +++ OK, passed 100 tests.
  15334. 1430.08 s [vector] createT: OK
  15335. 1430.08 s [vector] +++ OK, passed 100 tests.
  15336. 1430.08 s [vector] unfoldr: OK
  15337. 1430.08 s [vector] +++ OK, passed 100 tests.
  15338. 1430.08 s [vector] unfoldrN: OK
  15339. 1430.08 s [vector] +++ OK, passed 100 tests.
  15340. 1430.09 s [vector] unfoldrExactN: OK
  15341. 1430.10 s [vector] +++ OK, passed 100 tests.
  15342. 1430.10 s [vector] unfoldrM: OK
  15343. 1430.10 s [vector] +++ OK, passed 100 tests.
  15344. 1430.10 s [vector] unfoldrNM: OK
  15345. 1430.10 s [vector] +++ OK, passed 100 tests.
  15346. 1430.11 s [vector] unfoldrExactNM: OK (0.02s)
  15347. 1430.11 s [vector] +++ OK, passed 100 tests.
  15348. 1430.12 s [vector] constructN: OK
  15349. 1430.12 s [vector] +++ OK, passed 100 tests.
  15350. 1430.12 s [vector] constructrN: OK
  15351. 1430.12 s [vector] +++ OK, passed 100 tests.
  15352. 1430.13 s [vector] cons: OK
  15353. 1430.13 s [vector] +++ OK, passed 100 tests.
  15354. 1430.14 s [vector] snoc: OK
  15355. 1430.14 s [vector] +++ OK, passed 100 tests.
  15356. 1430.14 s [vector] append: OK
  15357. 1430.14 s [vector] +++ OK, passed 100 tests.
  15358. 1430.21 s [vector] concat: OK (0.07s)
  15359. 1430.21 s [vector] +++ OK, passed 100 tests.
  15360. 1430.21 s [vector] force: OK
  15361. 1430.21 s [vector] +++ OK, passed 100 tests.
  15362. 1430.21 s [vector] upd: OK
  15363. 1430.21 s [vector] +++ OK, passed 100 tests.
  15364. 1430.22 s [vector] accum: OK
  15365. 1430.22 s [vector] +++ OK, passed 100 tests.
  15366. 1430.22 s [vector] reverse: OK
  15367. 1430.22 s [vector] +++ OK, passed 100 tests.
  15368. 1430.22 s [vector] backpermute: OK
  15369. 1430.22 s [vector] +++ OK, passed 100 tests.
  15370. 1430.24 s [pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
  15371. 1430.24 s [vector] map: OK
  15372. 1430.24 s [vector] +++ OK, passed 100 tests.
  15373. 1430.24 s [vector] imap: OK
  15374. 1430.25 s [vector] +++ OK, passed 100 tests.
  15375. 1430.25 s [vector] concatMap: OK (0.01s)
  15376. 1430.25 s [vector] +++ OK, passed 100 tests.
  15377. 1430.25 s [vector] mapM: OK
  15378. 1430.25 s [vector] +++ OK, passed 100 tests.
  15379. 1430.29 s [vector] mapM_: OK (0.04s)
  15380. 1430.29 s [vector] +++ OK, passed 100 tests.
  15381. 1430.30 s [vector] forM: OK
  15382. 1430.30 s [vector] +++ OK, passed 100 tests.
  15383. 1430.35 s [vector] forM_: OK (0.04s)
  15384. 1430.51 s [vector] +++ OK, passed 100 tests.
  15385. 1430.51 s [vector] imapM: OK
  15386. 1430.51 s [vector] +++ OK, passed 100 tests.
  15387. 1430.51 s [vector] imapM_: OK (0.04s)
  15388. 1430.51 s [vector] +++ OK, passed 100 tests.
  15389. 1430.51 s [vector] zipWith: OK
  15390. 1430.51 s [vector] +++ OK, passed 100 tests.
  15391. 1430.51 s [vector] zipWith3: OK (0.01s)
  15392. 1430.51 s [vector] +++ OK, passed 100 tests.
  15393. 1430.51 s [vector] izipWith: OK (0.01s)
  15394. 1430.51 s [vector] +++ OK, passed 100 tests.
  15395. 1430.51 s [vector] izipWith3: OK
  15396. 1430.51 s [vector] +++ OK, passed 100 tests.
  15397. 1430.51 s [vector] izipWithM: OK
  15398. 1430.51 s [vector] +++ OK, passed 100 tests.
  15399. 1430.51 s [vector] izipWithM_: OK (0.03s)
  15400. 1430.51 s [vector] +++ OK, passed 100 tests.
  15401. 1430.51 s [vector] zipWithM: OK
  15402. 1430.51 s [vector] +++ OK, passed 100 tests.
  15403. 1430.53 s [vector] zipWithM_: OK (0.05s)
  15404. 1430.54 s [vector] +++ OK, passed 100 tests.
  15405. 1430.56 s [vector] filter: OK
  15406. 1430.56 s [vector] +++ OK, passed 100 tests.
  15407. 1430.56 s [vector] ifilter: OK
  15408. 1430.56 s [vector] +++ OK, passed 100 tests.
  15409. 1430.63 s [vector] filterM: OK (0.09s)
  15410. 1430.64 s [vector] +++ OK, passed 100 tests.
  15411. 1430.64 s [vector] uniq: OK
  15412. 1430.64 s [vector] +++ OK, passed 100 tests.
  15413. 1430.64 s [vector] mapMaybe: OK
  15414. 1430.65 s [vector] +++ OK, passed 100 tests.
  15415. 1430.65 s [vector] imapMaybe: OK
  15416. 1430.65 s [vector] +++ OK, passed 100 tests.
  15417. 1430.65 s [vector] takeWhile: OK
  15418. 1430.66 s [vector] +++ OK, passed 100 tests.
  15419. 1430.66 s [vector] dropWhile: OK
  15420. 1430.67 s [vector] +++ OK, passed 100 tests.
  15421. 1430.67 s [vector] partition: OK
  15422. 1430.67 s [vector] +++ OK, passed 100 tests.
  15423. 1430.67 s [vector] partitionWith: OK
  15424. 1430.67 s [vector] +++ OK, passed 100 tests.
  15425. 1430.68 s [vector] span: OK
  15426. 1430.68 s [vector] +++ OK, passed 100 tests.
  15427. 1430.68 s [vector] break: OK
  15428. 1430.68 s [vector] +++ OK, passed 100 tests.
  15429. 1430.68 s [vector] spanR: OK
  15430. 1430.68 s [vector] +++ OK, passed 100 tests.
  15431. 1430.68 s [vector] breakR: OK
  15432. 1430.69 s [vector] +++ OK, passed 100 tests.
  15433. 1430.69 s [vector] groupBy: OK
  15434. 1430.69 s [vector] +++ OK, passed 100 tests.
  15435. 1430.69 s [vector] elem: OK
  15436. 1430.70 s [vector] +++ OK, passed 100 tests.
  15437. 1430.70 s [vector] notElem: OK
  15438. 1430.70 s [vector] +++ OK, passed 100 tests.
  15439. 1430.70 s [vector] find: OK
  15440. 1430.70 s [vector] +++ OK, passed 100 tests.
  15441. 1430.70 s [vector] findIndex: OK
  15442. 1430.70 s [vector] +++ OK, passed 100 tests.
  15443. 1430.70 s [vector] findIndexR: OK
  15444. 1430.71 s [vector] +++ OK, passed 100 tests.
  15445. 1430.71 s [vector] findIndices: OK
  15446. 1430.71 s [vector] +++ OK, passed 100 tests.
  15447. 1430.71 s [vector] elemIndex: OK
  15448. 1430.71 s [vector] +++ OK, passed 100 tests.
  15449. 1430.72 s [vector] elemIndices: OK
  15450. 1430.72 s [vector] +++ OK, passed 100 tests.
  15451. 1430.72 s [vector] foldl: OK
  15452. 1430.72 s [vector] +++ OK, passed 100 tests.
  15453. 1430.74 s [vector] foldl1: OK
  15454. 1430.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15455. 1430.74 s [vector] foldl': OK
  15456. 1430.75 s [vector] +++ OK, passed 100 tests.
  15457. 1430.76 s [vector] foldl1': OK
  15458. 1430.76 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15459. 1430.76 s [vector] foldr: OK
  15460. 1430.76 s [vector] +++ OK, passed 100 tests.
  15461. 1430.77 s [vector] foldr1: OK
  15462. 1430.78 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15463. 1430.78 s [vector] foldr': OK
  15464. 1430.78 s [vector] +++ OK, passed 100 tests.
  15465. 1430.78 s [vector] foldr1': OK
  15466. 1430.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15467. 1430.81 s [vector] ifoldl: OK
  15468. 1430.81 s [vector] +++ OK, passed 100 tests.
  15469. 1430.82 s [vector] ifoldl': OK (0.03s)
  15470. 1430.82 s [vector] +++ OK, passed 100 tests.
  15471. 1430.84 s [vector] ifoldr: OK (0.01s)
  15472. 1430.84 s [vector] +++ OK, passed 100 tests.
  15473. 1430.84 s [vector] ifoldr': OK (0.01s)
  15474. 1430.84 s [vector] +++ OK, passed 100 tests.
  15475. 1430.86 s [vector] ifoldM: OK (0.01s)
  15476. 1430.86 s [vector] +++ OK, passed 100 tests.
  15477. 1430.88 s [vector] ifoldM': OK (0.02s)
  15478. 1430.88 s [vector] +++ OK, passed 100 tests.
  15479. 1430.96 s [vector] ifoldM_: OK (0.08s)
  15480. 1430.96 s [vector] +++ OK, passed 100 tests.
  15481. 1431.01 s [vector] ifoldM'_: OK (0.06s)
  15482. 1431.01 s [vector] +++ OK, passed 100 tests.
  15483. 1431.01 s [vector] all: OK
  15484. 1431.01 s [vector] +++ OK, passed 100 tests.
  15485. 1431.01 s [vector] any: OK
  15486. 1431.02 s [vector] +++ OK, passed 100 tests.
  15487. 1431.03 s [vector] prescanl: OK (0.01s)
  15488. 1431.03 s [vector] +++ OK, passed 100 tests.
  15489. 1431.04 s [vector] prescanl': OK
  15490. 1431.04 s [vector] +++ OK, passed 100 tests.
  15491. 1431.04 s [vector] postscanl: OK
  15492. 1431.05 s [vector] +++ OK, passed 100 tests.
  15493. 1431.06 s [vector] postscanl': OK
  15494. 1431.06 s [vector] +++ OK, passed 100 tests.
  15495. 1431.06 s [vector] scanl: OK
  15496. 1431.07 s [vector] +++ OK, passed 100 tests.
  15497. 1431.08 s [vector] scanl': OK (0.01s)
  15498. 1431.08 s [vector] +++ OK, passed 100 tests.
  15499. 1431.08 s [vector] scanl1: OK (0.01s)
  15500. 1431.08 s [vector] +++ OK, passed 100 tests.
  15501. 1431.10 s [vector] scanl1': OK
  15502. 1431.10 s [vector] +++ OK, passed 100 tests.
  15503. 1431.12 s [vector] iscanl: OK (0.02s)
  15504. 1431.12 s [vector] +++ OK, passed 100 tests.
  15505. 1431.14 s [vector] iscanl': OK (0.02s)
  15506. 1431.14 s [vector] +++ OK, passed 100 tests.
  15507. 1431.16 s [vector] prescanr: OK (0.01s)
  15508. 1431.16 s [vector] +++ OK, passed 100 tests.
  15509. 1431.17 s [vector] prescanr': OK (0.01s)
  15510. 1431.17 s [vector] +++ OK, passed 100 tests.
  15511. 1431.18 s [vector] postscanr: OK (0.01s)
  15512. 1431.18 s [vector] +++ OK, passed 100 tests.
  15513. 1431.19 s [vector] postscanr': OK (0.01s)
  15514. 1431.19 s [vector] +++ OK, passed 100 tests.
  15515. 1431.20 s [vector] scanr: OK (0.01s)
  15516. 1431.20 s [vector] +++ OK, passed 100 tests.
  15517. 1431.23 s [vector] scanr': OK (0.01s)
  15518. 1431.23 s [vector] +++ OK, passed 100 tests.
  15519. 1431.23 s [vector] scanr1: OK (0.01s)
  15520. 1431.23 s [vector] +++ OK, passed 100 tests.
  15521. 1431.24 s [vector] scanr1': OK (0.01s)
  15522. 1431.24 s [vector] +++ OK, passed 100 tests.
  15523. 1431.26 s [vector] iscanr: OK (0.01s)
  15524. 1431.26 s [vector] +++ OK, passed 100 tests.
  15525. 1431.26 s [vector] iscanr': OK (0.01s)
  15526. 1431.26 s [vector] +++ OK, passed 100 tests.
  15527. 1431.26 s [vector] mut_read: OK
  15528. 1431.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15529. 1431.26 s [vector] mut_write: OK
  15530. 1431.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15531. 1431.27 s [vector] mut_modify: OK
  15532. 1431.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15533. 1431.27 s [vector] mut_generate: OK
  15534. 1431.27 s [vector] +++ OK, passed 100 tests.
  15535. 1431.30 s [vector] mut_generateM: OK (0.02s)
  15536. 1431.30 s [vector] +++ OK, passed 100 tests.
  15537. 1431.34 s [vector] mut_mapM_: OK (0.04s)
  15538. 1431.34 s [vector] +++ OK, passed 100 tests.
  15539. 1431.38 s [vector] mut_imapM_: OK (0.03s)
  15540. 1431.38 s [vector] +++ OK, passed 100 tests.
  15541. 1431.42 s [vector] mut_forM_: OK (0.05s)
  15542. 1431.42 s [vector] +++ OK, passed 100 tests.
  15543. 1431.46 s [vector] mut_iforM_: OK (0.04s)
  15544. 1431.46 s [vector] +++ OK, passed 100 tests.
  15545. 1431.46 s [vector] mut_foldr: OK
  15546. 1431.46 s [vector] +++ OK, passed 100 tests.
  15547. 1431.47 s [vector] mut_foldr': OK
  15548. 1431.47 s [vector] +++ OK, passed 100 tests.
  15549. 1431.48 s [vector] mut_foldl: OK
  15550. 1431.48 s [vector] +++ OK, passed 100 tests.
  15551. 1431.49 s [vector] mut_foldl': OK
  15552. 1431.49 s [vector] +++ OK, passed 100 tests.
  15553. 1431.49 s [vector] mut_ifoldr: OK
  15554. 1431.49 s [vector] +++ OK, passed 100 tests.
  15555. 1431.50 s [vector] mut_ifoldr': OK
  15556. 1431.50 s [vector] +++ OK, passed 100 tests.
  15557. 1431.51 s [vector] mut_ifoldl: OK
  15558. 1431.51 s [vector] +++ OK, passed 100 tests.
  15559. 1431.51 s [pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
  15560. 1431.52 s [pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
  15561. 1431.52 s [pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
  15562. 1431.52 s [pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
  15563. 1431.52 s [pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
  15564. 1431.52 s [pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
  15565. 1431.52 s [pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
  15566. 1431.52 s [pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
  15567. 1431.52 s [pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
  15568. 1431.52 s [vector] mut_ifoldl': OK
  15569. 1431.52 s [vector] +++ OK, passed 100 tests.
  15570. 1431.52 s [vector] mut_foldM: OK
  15571. 1431.53 s [vector] +++ OK, passed 100 tests.
  15572. 1431.54 s [vector] mut_foldM': OK
  15573. 1431.54 s [vector] +++ OK, passed 100 tests.
  15574. 1431.54 s [vector] mut_foldrM: OK
  15575. 1431.54 s [vector] +++ OK, passed 100 tests.
  15576. 1431.54 s [vector] mut_foldrM': OK
  15577. 1431.54 s [vector] +++ OK, passed 100 tests.
  15578. 1431.54 s [vector] mut_ifoldM: OK
  15579. 1431.54 s [vector] +++ OK, passed 100 tests.
  15580. 1431.54 s [vector] mut_ifoldM': OK
  15581. 1431.54 s [vector] +++ OK, passed 100 tests.
  15582. 1431.55 s [vector] mut_ifoldrM: OK
  15583. 1431.55 s [vector] +++ OK, passed 100 tests.
  15584. 1431.55 s [vector] mut_ifoldrM': OK
  15585. 1431.55 s [vector] +++ OK, passed 100 tests.
  15586. 1431.56 s [vector] compare: OK
  15587. 1431.56 s [vector] +++ OK, passed 100 tests.
  15588. 1431.56 s [vector] maximum: OK
  15589. 1431.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15590. 1431.56 s [vector] minimum: OK
  15591. 1431.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15592. 1431.56 s [vector] minIndex: OK
  15593. 1431.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15594. 1431.56 s [vector] maxIndex: OK
  15595. 1431.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15596. 1431.57 s [vector] maximumBy: OK
  15597. 1431.57 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15598. 1431.57 s [vector] minimumBy: OK
  15599. 1431.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15600. 1431.57 s [vector] maximumOn: OK
  15601. 1431.57 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15602. 1431.57 s [vector] minimumOn: OK
  15603. 1431.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15604. 1431.58 s [vector] maxIndexBy: OK
  15605. 1431.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15606. 1431.58 s [vector] minIndexBy: OK
  15607. 1431.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15608. 1431.58 s [vector] ListFirstMaxIndexWins: OK
  15609. 1431.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15610. 1431.58 s [vector] FalseListFirstMaxIndexWins: OK
  15611. 1431.58 s [vector] +++ OK, failed as expected. (after 1 test):
  15612. 1431.58 s [vector] Exception:
  15613. 1431.58 s [vector] Prelude.foldr1: empty list
  15614. 1431.58 s [vector] CallStack (from HasCallStack):
  15615. 1431.58 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  15616. 1431.58 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  15617. 1431.58 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15618. 1431.58 s [vector] []
  15619. 1431.58 s [vector] zip: OK
  15620. 1431.58 s [vector] +++ OK, passed 100 tests.
  15621. 1431.58 s [vector] zip3: OK
  15622. 1431.58 s [vector] +++ OK, passed 100 tests.
  15623. 1431.58 s [vector] unzip: OK
  15624. 1431.58 s [vector] +++ OK, passed 100 tests.
  15625. 1431.59 s [vector] unzip3: OK
  15626. 1431.59 s [vector] +++ OK, passed 100 tests.
  15627. 1431.59 s [vector] indexed: OK
  15628. 1431.59 s [vector] +++ OK, passed 100 tests.
  15629. 1431.59 s [vector] update: OK
  15630. 1431.59 s [vector] +++ OK, passed 100 tests.
  15631. 1431.60 s [vector] mempty: OK
  15632. 1431.60 s [vector] +++ OK, passed 100 tests.
  15633. 1431.62 s [vector] mappend: OK
  15634. 1431.62 s [vector] +++ OK, passed 100 tests.
  15635. 1431.66 s [vector] mconcat: OK (0.06s)
  15636. 1431.66 s [vector] +++ OK, passed 100 tests.
  15637. 1431.66 s [vector] glength: OK
  15638. 1431.66 s [vector] +++ OK, passed 100 tests.
  15639. 1431.66 s [vector] unstream
  15640. 1431.66 s [vector] unstream == vunstream (exact): OK
  15641. 1431.66 s [vector] +++ OK, passed 100 tests.
  15642. 1431.66 s [vector] unstream == vunstream (unknown): OK
  15643. 1431.66 s [vector] +++ OK, passed 100 tests.
  15644. 1431.66 s [vector] unstreamR ~= vunstream (exact): OK
  15645. 1431.66 s [vector] +++ OK, passed 100 tests.
  15646. 1431.66 s [vector] unstreamR ~= vunstream (unknown): OK
  15647. 1431.66 s [vector] +++ OK, passed 100 tests.
  15648. 1431.66 s [vector] Data.Vector.Storable.Vector Alignment
  15649. 1431.66 s [vector] Aligned Double: OK
  15650. 1431.66 s [vector] Aligned Int: OK
  15651. 1431.66 s [vector] Regression tests
  15652. 1431.66 s [vector] enumFromTo crash #188
  15653. 1431.66 s [vector] Word8: OK
  15654. 1431.66 s [vector] Word16: OK
  15655. 1431.66 s [vector] Word32: OK
  15656. 1431.66 s [vector] Word64: OK
  15657. 1431.66 s [vector] Word: OK
  15658. 1431.66 s [vector] Int8: OK
  15659. 1431.66 s [vector] Int16: OK
  15660. 1431.66 s [vector] Int32: OK
  15661. 1431.66 s [vector] Int64: OK
  15662. 1431.66 s [vector] Int: OK
  15663. 1431.66 s [vector] Char: OK
  15664. 1431.66 s [vector] Negative tests
  15665. 1431.66 s [vector] slice out of bounds #257
  15666. 1431.66 s [vector] Boxed
  15667. 1431.66 s [vector] Negative ix: OK
  15668. 1431.66 s [vector] Negative size: OK
  15669. 1431.66 s [vector] Negative ix and size: OK
  15670. 1431.66 s [vector] Too large ix: OK
  15671. 1431.66 s [vector] Too large size: OK
  15672. 1431.66 s [vector] Too large ix and size: OK
  15673. 1431.66 s [vector] Overflow: OK
  15674. 1431.66 s [vector] OutOfMemory: OK
  15675. 1431.66 s [vector] Primitive
  15676. 1431.66 s [vector] Negative ix: OK
  15677. 1431.66 s [vector] Negative size: OK
  15678. 1431.66 s [vector] Negative ix and size: OK
  15679. 1431.66 s [vector] Too large ix: OK
  15680. 1431.66 s [vector] Too large size: OK
  15681. 1431.66 s [vector] Too large ix and size: OK
  15682. 1431.66 s [vector] Overflow: OK
  15683. 1431.66 s [vector] OutOfMemory: OK
  15684. 1431.66 s [vector] Storable
  15685. 1431.66 s [vector] Negative ix: OK
  15686. 1431.67 s [vector] Negative size: OK
  15687. 1431.67 s [vector] Negative ix and size: OK
  15688. 1431.67 s [vector] Too large ix: OK
  15689. 1431.67 s [vector] Too large size: OK
  15690. 1431.67 s [vector] Too large ix and size: OK
  15691. 1431.67 s [vector] Overflow: OK
  15692. 1431.67 s [vector] OutOfMemory: OK
  15693. 1431.69 s [vector] Unboxed
  15694. 1431.70 s [vector] Negative ix: OK
  15695. 1431.71 s [vector] Negative size: OK
  15696. 1431.71 s [vector] Negative ix and size: OK
  15697. 1431.71 s [vector] Too large ix: OK
  15698. 1431.71 s [vector] Too large size: OK
  15699. 1431.71 s [vector] Too large ix and size: OK
  15700. 1431.71 s [vector] Overflow: OK
  15701. 1431.71 s [vector] OutOfMemory: OK
  15702. 1431.71 s [vector] take #282
  15703. 1431.71 s [vector] Boxed: OK
  15704. 1431.71 s [vector] Primitive: OK
  15705. 1431.71 s [vector] Storable: OK
  15706. 1431.71 s [vector] Unboxed: OK
  15707. 1431.71 s [vector] Data.Vector
  15708. 1431.71 s [vector] MonadFix: OK
  15709. 1431.71 s [vector] toFromArray: OK
  15710. 1431.71 s [vector] toFromArraySlice: OK
  15711. 1431.71 s [vector] toFromArraySliceUnsafe: OK
  15712. 1431.71 s [vector] toFromMutableArray: OK
  15713. 1431.71 s [vector] Data.Vector.Mutable (Move): OK
  15714. 1431.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15715. 1431.71 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  15716. 1431.71 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15717. 1431.71 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  15718. 1431.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15719. 1431.71 s [vector] Data.Vector.Storable.Mutable (Move): OK
  15720. 1431.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15721. 1431.71 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  15722. 1431.71 s [vector] +++ OK, passed 100 tests.
  15723. 1431.71 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.03s)
  15724. 1431.71 s [vector] +++ OK, passed 100 tests.
  15725. 1431.71 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  15726. 1431.71 s [vector] +++ OK, passed 100 tests.
  15727. 1431.71 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  15728. 1431.71 s [vector] +++ OK, passed 100 tests.
  15729. 1431.71 s [vector]
  15730. 1431.71 s [vector] All 2808 tests passed (15.81s)
  15731. 1431.72 s [vector] Test suite vector-tests-O2: PASS
  15732. 1431.72 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  15733. 1431.72 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  15734. 1431.73 s [vector] checkPhase completed in 1 minutes 49 seconds
  15735. 1431.73 s [vector] Phase: haddockPhase
  15736. 1431.74 s [vector] Phase: installPhase
  15737. 1431.85 s [vector] Installing library in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
  15738. 1431.94 s [pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
  15739. 1432.30 s [pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
  15740. 1432.48 s [pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
  15741. 1433.47 s [pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
  15742. 1433.47 s [pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
  15743. 1433.47 s [pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
  15744. 1433.57 s [vector] Installing internal library benchmarks-O2 in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-8ewGTjYPAbxD2TcU88MBz1-benchmarks-O2
  15745. 1433.96 s [pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
  15746. 1433.96 s [pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
  15747. 1433.96 s [pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
  15748. 1434.14 s [vector] Phase: fixupPhase
  15749. 1434.19 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
  15750. 1434.19 s [vector] shrinking /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-F7uk3pysgNW73MNfNvohpp-ghc9.8.4.so
  15751. 1434.45 s [vector] shrinking /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-8ewGTjYPAbxD2TcU88MBz1-benchmarks-O2-ghc9.8.4.so
  15752. 1434.60 s [vector] checking for references to /build/ in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0...
  15753. 1434.65 s [vector] patching script interpreter paths in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
  15754. 1434.66 s [vector] stripping (with command strip and flags -S -p) in /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0/lib
  15755. 1435.45 s [pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
  15756. 1436.04 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
  15757. 1436.58 s [vector:post-build] Nothing to push - all store paths are already on Cachix.
  15758. 1436.61 s [vector:post-build] Uploading to the NixCI cache: /nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0
  15759. 1436.69 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15760. 1436.71 s [vector:post-build] copying 1 paths...
  15761. 1436.71 s [vector:post-build] copying path '/nix/store/2mjdkhfhyl9c7hs22jbsda3lxvmv9van-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  15762. 1460.36 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15763. 1460.46 s [vector:post-build] copying 0 paths...
  15764. 1460.49 s Progress: 23 of 38 built (2 building), 559 of 559 downloaded from cache
  15765. 1460.63 s Building /nix/store/kpynsivk6619d2xvq96g6bqk5vmphbas-nothunks-0.3.1.drv
  15766. 1460.63 s [pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
  15767. 1460.63 s [pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
  15768. 1460.63 s [pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
  15769. 1460.63 s [pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
  15770. 1460.63 s [pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
  15771. 1460.63 s [pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
  15772. 1460.63 s [pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
  15773. 1460.63 s [pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
  15774. 1460.63 s [pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
  15775. 1460.63 s [pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
  15776. 1460.63 s [pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
  15777. 1460.63 s [pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
  15778. 1460.63 s [pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
  15779. 1460.63 s [pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
  15780. 1460.63 s [pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
  15781. 1460.63 s [pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
  15782. 1460.63 s [pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
  15783. 1460.63 s [pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
  15784. 1460.63 s [pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
  15785. 1460.63 s [pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
  15786. 1460.63 s [pandoc-lua-engine] Building test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
  15787. 1460.63 s [pandoc-lua-engine] [1 of 5] Compiling Tests.Lua
  15788. 1460.63 s [pandoc-lua-engine] [2 of 5] Compiling Tests.Lua.Module
  15789. 1460.63 s [pandoc-lua-engine] [3 of 5] Compiling Tests.Lua.Reader
  15790. 1460.63 s [pandoc-lua-engine] [4 of 5] Compiling Tests.Lua.Writer
  15791. 1460.63 s [pandoc-lua-engine] [5 of 5] Compiling Main
  15792. 1460.63 s [pandoc-lua-engine] [6 of 6] Linking dist/build/test-pandoc-lua-engine/test-pandoc-lua-engine
  15793. 1460.63 s [pandoc-server] Phase: checkPhase
  15794. 1460.63 s [pandoc-server] Package has no test suites.
  15795. 1460.63 s [pandoc-server] Phase: haddockPhase
  15796. 1460.63 s [pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
  15797. 1460.63 s [pandoc-server] Running Haddock on library for pandoc-server-0.1.0.11...
  15798. 1460.63 s [pandoc-server] Warning: The documentation for the following packages are not installed. No
  15799. 1460.63 s [pandoc-server] links will be generated to these packages: attoparsec-0.14.4,
  15800. 1460.63 s [pandoc-server] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
  15801. 1460.63 s [pandoc-server] vector-0.13.2.0
  15802. 1460.63 s [pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
  15803. 1460.63 s [pandoc-server] Haddock coverage:
  15804. 1460.63 s [pandoc-server] 0% ( 0 / 7) in 'Text.Pandoc.Server'
  15805. 1460.63 s [pandoc-server] Missing documentation for:
  15806. 1460.63 s [pandoc-server] Module header
  15807. 1460.63 s [pandoc-server] app (src/Text/Pandoc/Server.hs:200)
  15808. 1460.63 s [pandoc-server] API (src/Text/Pandoc/Server.hs:186)
  15809. 1460.63 s [pandoc-server] ServerOpts (src/Text/Pandoc/Server.hs:55)
  15810. 1460.63 s [pandoc-server] Params (src/Text/Pandoc/Server.hs:125)
  15811. 1460.63 s [pandoc-server] Blob (src/Text/Pandoc/Server.hs:112)
  15812. 1460.63 s [pandoc-server] parseServerOptsFromArgs (src/Text/Pandoc/Server.hs:99)
  15813. 1460.63 s [pandoc-server] Warning: Text.Pandoc.Server: could not find link destinations for:
  15814. 1460.63 s [pandoc-server] - Text.Pandoc.App.Opt.Opt
  15815. 1460.63 s [pandoc-server] - Text.Pandoc.Server.Output
  15816. 1460.85 s [nothunks] Phase: setupCompilerEnvironmentPhase
  15817. 1460.86 s [nothunks] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
  15818. 1461.17 s [nothunks] Phase: unpackPhase
  15819. 1461.17 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  15820. 1461.18 s [nothunks] source root is nothunks-0.3.1
  15821. 1461.19 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  15822. 1461.20 s [nothunks] Phase: patchPhase
  15823. 1461.20 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  15824. 1461.21 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  15825. 1461.23 s [nothunks] Phase: compileBuildDriverPhase
  15826. 1461.24 s [nothunks] setupCompileFlags: -package-db=/build/tmp.35XporISMq/setup-package.conf.d -threaded
  15827. 1461.31 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.35XporISMq/Main.o )
  15828. 1461.43 s [nothunks] [2 of 2] Linking Setup
  15829. 1463.19 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  15830. 1463.21 s [nothunks] Phase: configurePhase
  15831. 1463.22 s [nothunks] configureFlags: --verbose --prefix=/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.35XporISMq/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
  15832. 1463.23 s [nothunks] Using Parsec parser
  15833. 1463.23 s [nothunks] Configuring nothunks-0.3.1...
  15834. 1463.78 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  15835. 1463.78 s [nothunks] Dependency base: using base-4.19.2.0
  15836. 1463.78 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.1.0
  15837. 1463.78 s [nothunks] Dependency containers: using containers-0.6.8
  15838. 1463.78 s [nothunks] Dependency ghc-heap: using ghc-heap-9.8.4
  15839. 1463.78 s [nothunks] Dependency stm: using stm-2.5.3.1
  15840. 1463.78 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.1
  15841. 1463.78 s [nothunks] Dependency time: using time-1.12.2
  15842. 1463.78 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  15843. 1463.78 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  15844. 1463.78 s [nothunks] Dependency base: using base-4.19.2.0
  15845. 1463.78 s [nothunks] Dependency containers: using containers-0.6.8
  15846. 1463.78 s [nothunks] Dependency ghc-prim: using ghc-prim-0.11.0
  15847. 1463.78 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  15848. 1463.78 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  15849. 1463.78 s [nothunks] Dependency random: using random-1.2.1.3
  15850. 1463.78 s [nothunks] Dependency stm: using stm-2.5.3.1
  15851. 1463.78 s [nothunks] Dependency tasty: using tasty-1.5.3
  15852. 1463.78 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  15853. 1464.62 s [nothunks] Source component graph:
  15854. 1464.62 s [nothunks] component lib
  15855. 1464.62 s [nothunks] component test:nothunks-test dependency lib
  15856. 1464.62 s [nothunks] Configured component graph:
  15857. 1464.62 s [nothunks] component nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  15858. 1464.62 s [nothunks] include base-4.19.2.0-8274
  15859. 1464.62 s [nothunks] include bytestring-0.12.1.0-b028
  15860. 1464.62 s [nothunks] include containers-0.6.8-15d9
  15861. 1464.62 s [nothunks] include ghc-heap-9.8.4-88b3
  15862. 1464.62 s [nothunks] include stm-2.5.3.1-4dae
  15863. 1464.63 s [nothunks] include text-2.1.1-5314
  15864. 1464.63 s [nothunks] include time-1.12.2-b11c
  15865. 1464.63 s [nothunks] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
  15866. 1464.63 s [nothunks] include wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
  15867. 1464.63 s [nothunks] component nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
  15868. 1464.63 s [nothunks] include base-4.19.2.0-8274
  15869. 1464.63 s [nothunks] include containers-0.6.8-15d9
  15870. 1464.63 s [nothunks] include ghc-prim-0.11.0-01ae
  15871. 1464.63 s [nothunks] include hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
  15872. 1464.63 s [nothunks] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  15873. 1464.63 s [nothunks] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
  15874. 1464.63 s [nothunks] include stm-2.5.3.1-4dae
  15875. 1464.63 s [nothunks] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
  15876. 1464.63 s [nothunks] include tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
  15877. 1464.63 s [nothunks] Linked component graph:
  15878. 1464.63 s [nothunks] unit nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  15879. 1464.63 s [nothunks] include base-4.19.2.0-8274
  15880. 1464.63 s [nothunks] include bytestring-0.12.1.0-b028
  15881. 1464.63 s [nothunks] include containers-0.6.8-15d9
  15882. 1464.63 s [nothunks] include ghc-heap-9.8.4-88b3
  15883. 1464.63 s [nothunks] include stm-2.5.3.1-4dae
  15884. 1464.63 s [nothunks] include text-2.1.1-5314
  15885. 1464.63 s [nothunks] include time-1.12.2-b11c
  15886. 1464.63 s [nothunks] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
  15887. 1464.63 s [nothunks] include wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
  15888. 1464.63 s [nothunks] NoThunks.Class=nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So:NoThunks.Class
  15889. 1464.63 s [nothunks] unit nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
  15890. 1464.63 s [nothunks] include base-4.19.2.0-8274
  15891. 1464.63 s [nothunks] include containers-0.6.8-15d9
  15892. 1464.63 s [nothunks] include ghc-prim-0.11.0-01ae
  15893. 1464.63 s [nothunks] include hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
  15894. 1464.63 s [nothunks] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  15895. 1464.63 s [nothunks] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
  15896. 1464.63 s [nothunks] include stm-2.5.3.1-4dae
  15897. 1464.63 s [nothunks] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
  15898. 1464.63 s [nothunks] include tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
  15899. 1464.63 s [nothunks] Ready component graph:
  15900. 1464.63 s [nothunks] definite nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  15901. 1464.63 s [nothunks] depends base-4.19.2.0-8274
  15902. 1464.63 s [nothunks] depends bytestring-0.12.1.0-b028
  15903. 1464.63 s [nothunks] depends containers-0.6.8-15d9
  15904. 1464.63 s [nothunks] depends ghc-heap-9.8.4-88b3
  15905. 1464.63 s [nothunks] depends stm-2.5.3.1-4dae
  15906. 1464.63 s [nothunks] depends text-2.1.1-5314
  15907. 1464.63 s [nothunks] depends time-1.12.2-b11c
  15908. 1464.63 s [nothunks] depends vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
  15909. 1464.63 s [nothunks] depends wherefrom-compat-0.1.1.1-B8a6B2BvUCzGz8OFtoo8AO
  15910. 1464.63 s [nothunks] definite nothunks-0.3.1-8INgIczvs3nGsVHBs6bUjZ-nothunks-test
  15911. 1464.63 s [nothunks] depends base-4.19.2.0-8274
  15912. 1464.63 s [nothunks] depends containers-0.6.8-15d9
  15913. 1464.63 s [nothunks] depends ghc-prim-0.11.0-01ae
  15914. 1464.63 s [nothunks] depends hedgehog-1.5-EdloAR8nvuADWiK72c4fzc
  15915. 1464.63 s [nothunks] depends nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  15916. 1464.63 s [nothunks] depends random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
  15917. 1464.63 s [nothunks] depends stm-2.5.3.1-4dae
  15918. 1464.63 s [nothunks] depends tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
  15919. 1464.63 s [nothunks] depends tasty-hedgehog-1.4.0.2-4SLwErL9Pq6G86T5KSGqTH
  15920. 1464.63 s [nothunks] Using Cabal-3.10.3.0 compiled by ghc-9.8
  15921. 1464.63 s [nothunks] Using compiler: ghc-9.8.4
  15922. 1464.63 s [nothunks] Using install prefix:
  15923. 1464.63 s [nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
  15924. 1464.63 s [nothunks] Executables installed in:
  15925. 1464.63 s [nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/bin
  15926. 1464.63 s [nothunks] Libraries installed in:
  15927. 1464.63 s [nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  15928. 1464.63 s [nothunks] Dynamic Libraries installed in:
  15929. 1464.63 s [nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  15930. 1464.63 s [nothunks] Private executables installed in:
  15931. 1464.63 s [nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
  15932. 1464.63 s [nothunks] Data files installed in:
  15933. 1464.63 s [nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/share/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
  15934. 1464.63 s [nothunks] Documentation installed in:
  15935. 1464.63 s [nothunks] /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  15936. 1464.63 s [nothunks] Configuration files installed in:
  15937. 1464.63 s [nothunks] /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/etc
  15938. 1464.63 s [nothunks] No alex found
  15939. 1464.63 s [nothunks] Using ar found on system at:
  15940. 1464.63 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15941. 1464.63 s [nothunks] No c2hs found
  15942. 1464.63 s [nothunks] No cpphs found
  15943. 1464.63 s [nothunks] No doctest found
  15944. 1464.63 s [nothunks] Using gcc version 14.3.0 given by user at:
  15945. 1464.63 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15946. 1464.63 s [nothunks] Using ghc version 9.8.4 found on system at:
  15947. 1464.63 s [nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
  15948. 1464.63 s [nothunks] Using ghc-pkg version 9.8.4 found on system at:
  15949. 1464.63 s [nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
  15950. 1464.63 s [nothunks] No ghcjs found
  15951. 1464.63 s [nothunks] No ghcjs-pkg found
  15952. 1464.63 s [nothunks] No greencard found
  15953. 1464.63 s [nothunks] Using haddock version 2.30.0 found on system at:
  15954. 1464.63 s [nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
  15955. 1464.63 s [nothunks] No happy found
  15956. 1464.63 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  15957. 1464.63 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15958. 1464.63 s [nothunks] No hmake found
  15959. 1464.63 s [nothunks] Using hpc version 0.69 found on system at:
  15960. 1464.63 s [nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
  15961. 1464.63 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  15962. 1464.63 s [nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  15963. 1464.63 s [nothunks] Using hscolour version 1.25 found on system at:
  15964. 1464.63 s [nothunks] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
  15965. 1464.63 s [nothunks] No jhc found
  15966. 1464.63 s [nothunks] Using ld found on system at:
  15967. 1464.63 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  15968. 1464.63 s [nothunks] No pkg-config found
  15969. 1464.63 s [nothunks] Using runghc version 9.8.4 found on system at:
  15970. 1464.63 s [nothunks] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
  15971. 1464.63 s [nothunks] Using strip version 2.44 found on system at:
  15972. 1464.63 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15973. 1464.63 s [nothunks] Using tar found on system at:
  15974. 1464.63 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15975. 1464.63 s [nothunks] No uhc found
  15976. 1465.30 s [nothunks] Phase: buildPhase
  15977. 1465.38 s [nothunks] Preprocessing library for nothunks-0.3.1..
  15978. 1465.38 s [nothunks] Building library for nothunks-0.3.1..
  15979. 1465.49 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  15980. 1466.51 s [pandoc-server] Documentation created: dist/doc/html/pandoc-server/,
  15981. 1466.55 s [pandoc-server] dist/doc/html/pandoc-server/pandoc-server.txt
  15982. 1466.60 s [pandoc-server] Phase: installPhase
  15983. 1466.83 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
  15984. 1467.34 s [pandoc-server] Phase: fixupPhase
  15985. 1467.36 s [pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  15986. 1467.37 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
  15987. 1467.56 s [pandoc-server] checking for references to /build/ in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11...
  15988. 1467.59 s [pandoc-server] patching script interpreter paths in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  15989. 1467.59 s [pandoc-server] stripping (with command strip and flags -S -p) in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib
  15990. 1467.90 s [pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
  15991. 1467.90 s [pandoc-server] checking for references to /build/ in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc...
  15992. 1467.92 s [pandoc-server] patching script interpreter paths in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
  15993. 1468.16 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
  15994. 1468.61 s [pandoc-server:post-build] Nothing to push - all store paths are already on Cachix.
  15995. 1468.64 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
  15996. 1468.70 s [pandoc-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15997. 1468.77 s [pandoc-server:post-build] copying 1 paths...
  15998. 1468.78 s [pandoc-server:post-build] copying path '/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11' to 'https://cache.nix-ci.com'...
  15999. 1469.73 s [pandoc-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16000. 1469.85 s [pandoc-server:post-build] copying 0 paths...
  16001. 1469.87 s Progress: 24 of 38 built (2 building), 559 of 559 downloaded from cache
  16002. 1469.88 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  16003. 1469.88 s [pandoc-lua-engine] buildPhase completed in 47 seconds
  16004. 1469.88 s [pandoc-lua-engine] Phase: checkPhase
  16005. 1469.88 s [pandoc-lua-engine] Running 1 test suites...
  16006. 1469.88 s [pandoc-lua-engine] Test suite test-pandoc-lua-engine: RUNNING...
  16007. 1469.88 s [pandoc-lua-engine] pandoc Lua engine
  16008. 1469.88 s [pandoc-lua-engine] Lua filters
  16009. 1469.88 s [pandoc-lua-engine] macro expansion via filter: OK (0.01s)
  16010. 1469.88 s [pandoc-lua-engine] convert all plains to paras: OK
  16011. 1469.88 s [pandoc-lua-engine] convert display math to inline math: OK (0.03s)
  16012. 1469.88 s [pandoc-lua-engine] make hello world document: OK
  16013. 1469.88 s [pandoc-lua-engine] implicit doc filter: OK
  16014. 1469.88 s [pandoc-lua-engine] parse raw markdown blocks: OK
  16015. 1469.88 s [pandoc-lua-engine] allow shorthand functions for quote types: OK
  16016. 1469.88 s [pandoc-lua-engine] Count inlines via metatable catch-all: OK
  16017. 1469.88 s [pandoc-lua-engine] Count blocks via Block-specific catch-all: OK
  16018. 1469.88 s [pandoc-lua-engine] Smart constructors: OK
  16019. 1469.88 s [pandoc-lua-engine] Convert header upper case: OK
  16020. 1469.88 s [pandoc-lua-engine] Attribute lists are convenient to use: OK
  16021. 1469.88 s [pandoc-lua-engine] Filter list of inlines: OK
  16022. 1469.88 s [pandoc-lua-engine] Filter list of blocks: OK
  16023. 1469.88 s [pandoc-lua-engine] Filter Meta: OK
  16024. 1469.88 s [pandoc-lua-engine] Script filename is set: OK
  16025. 1469.88 s [pandoc-lua-engine] Pandoc version is set: OK
  16026. 1469.88 s [pandoc-lua-engine] Pandoc types version is set: OK
  16027. 1469.88 s [pandoc-lua-engine] require file: OK
  16028. 1469.88 s [pandoc-lua-engine] Allow singleton inline in constructors: OK
  16029. 1469.88 s [pandoc-lua-engine] Elements with Attr have `attr` accessor: OK
  16030. 1469.88 s [pandoc-lua-engine] module `pandoc.system` is present: OK
  16031. 1469.88 s [pandoc-lua-engine] global modules
  16032. 1469.88 s [pandoc-lua-engine] module 'lpeg' is loaded into a global: OK
  16033. 1469.88 s [pandoc-lua-engine] module 're' is loaded into a global: OK
  16034. 1469.88 s [pandoc-lua-engine] module 'lpeg' is available via `require`: OK
  16035. 1469.88 s [pandoc-lua-engine] module 're' is available via `require`: OK
  16036. 1469.88 s [pandoc-lua-engine] informative error messages: OK
  16037. 1469.88 s [pandoc-lua-engine] Lua modules
  16038. 1469.88 s [pandoc-lua-engine] pandoc: OK (0.02s)
  16039. 1469.88 s [pandoc-lua-engine] +++ Success: 79 Lua tests passed
  16040. 1469.88 s [pandoc-lua-engine] pandoc.List: OK
  16041. 1469.88 s [pandoc-lua-engine] +++ Success: 22 Lua tests passed
  16042. 1469.88 s [pandoc-lua-engine] pandoc.format: OK
  16043. 1469.88 s [pandoc-lua-engine] +++ Success: 3 Lua tests passed
  16044. 1469.88 s [pandoc-lua-engine] pandoc.image: OK
  16045. 1469.88 s [pandoc-lua-engine] +++ Success: 6 Lua tests passed
  16046. 1469.88 s [pandoc-lua-engine] pandoc.json: OK
  16047. 1469.88 s [pandoc-lua-engine] +++ Success: 21 Lua tests passed
  16048. 1469.88 s [pandoc-lua-engine] pandoc.log: OK
  16049. 1469.88 s [pandoc-lua-engine] +++ Success: 8 Lua tests passed
  16050. 1469.88 s [pandoc-lua-engine] pandoc.mediabag: OK
  16051. 1469.88 s [pandoc-lua-engine] +++ Success: 9 Lua tests passed
  16052. 1469.88 s [pandoc-lua-engine] pandoc.path: OK
  16053. 1469.88 s [pandoc-lua-engine] +++ Success: 5 Lua tests passed
  16054. 1469.88 s [pandoc-lua-engine] pandoc.structure: OK
  16055. 1469.88 s [pandoc-lua-engine] +++ Success: 11 Lua tests passed
  16056. 1469.88 s [pandoc-lua-engine] pandoc.template: OK (0.03s)
  16057. 1469.88 s [pandoc-lua-engine] +++ Success: 16 Lua tests passed
  16058. 1469.88 s [pandoc-lua-engine] pandoc.text: OK
  16059. 1469.88 s [pandoc-lua-engine] +++ Success: 9 Lua tests passed
  16060. 1469.88 s [pandoc-lua-engine] pandoc.types: OK
  16061. 1469.88 s [pandoc-lua-engine] +++ Success: 13 Lua tests passed
  16062. 1469.88 s [pandoc-lua-engine] pandoc.utils: OK
  16063. 1469.88 s [pandoc-lua-engine] +++ Success: 45 Lua tests passed
  16064. 1469.88 s [pandoc-lua-engine] globals: OK (0.02s)
  16065. 1469.88 s [pandoc-lua-engine] +++ Success: 42 Lua tests passed
  16066. 1469.88 s [pandoc-lua-engine] Custom writers
  16067. 1469.88 s [pandoc-lua-engine] default testsuite: OK (0.08s)
  16068. 1469.88 s [pandoc-lua-engine] tables testsuite: OK (0.04s)
  16069. 1469.88 s [pandoc-lua-engine] bytestring writer: OK
  16070. 1469.88 s [pandoc-lua-engine] template: OK
  16071. 1469.88 s [pandoc-lua-engine] preset extensions: OK
  16072. 1469.88 s [pandoc-lua-engine] modified extensions: OK
  16073. 1469.88 s [pandoc-lua-engine] Custom readers
  16074. 1469.88 s [pandoc-lua-engine] read binary to code block: OK
  16075. 1469.88 s [pandoc-lua-engine]
  16076. 1469.88 s [pandoc-lua-engine] All 48 tests passed (0.37s)
  16077. 1469.88 s [pandoc-lua-engine] Test suite test-pandoc-lua-engine: PASS
  16078. 1469.88 s [pandoc-lua-engine] Test suite logged to:
  16079. 1469.88 s [pandoc-lua-engine] dist/test/pandoc-lua-engine-0.4.3-test-pandoc-lua-engine.log
  16080. 1469.88 s [pandoc-lua-engine] 1 of 1 test suites (1 of 1 test cases) passed.
  16081. 1469.88 s [pandoc-lua-engine] Phase: haddockPhase
  16082. 1469.88 s [pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
  16083. 1469.88 s [pandoc-lua-engine] Running Haddock on library for pandoc-lua-engine-0.4.3...
  16084. 1469.88 s [pandoc-lua-engine] Warning: The documentation for the following packages are not installed. No
  16085. 1469.88 s [pandoc-lua-engine] links will be generated to these packages: attoparsec-0.14.4,
  16086. 1469.88 s [pandoc-lua-engine] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
  16087. 1469.88 s [pandoc-lua-engine] vector-0.13.2.0
  16088. 1470.03 s [pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
  16089. 1470.55 s [pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
  16090. 1470.61 s [pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
  16091. 1471.09 s [pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
  16092. 1471.14 s [pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
  16093. 1471.16 s [pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
  16094. 1471.18 s [pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
  16095. 1471.48 s [pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
  16096. 1471.78 s [pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
  16097. 1471.83 s [pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
  16098. 1471.99 s [pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
  16099. 1472.00 s [pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
  16100. 1472.01 s [pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
  16101. 1472.09 s [pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
  16102. 1472.20 s [pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
  16103. 1472.22 s [pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
  16104. 1472.27 s [pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
  16105. 1472.33 s [pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
  16106. 1472.34 s [pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
  16107. 1472.44 s [pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
  16108. 1472.51 s [pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
  16109. 1472.55 s [pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
  16110. 1472.59 s [pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
  16111. 1472.62 s [pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
  16112. 1472.71 s [pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
  16113. 1472.72 s [pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
  16114. 1472.74 s [pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
  16115. 1472.88 s [pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
  16116. 1472.89 s [pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
  16117. 1472.91 s [pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
  16118. 1473.33 s [pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
  16119. 1473.49 s [pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
  16120. 1473.66 s [pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
  16121. 1473.67 s [pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
  16122. 1473.72 s [pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
  16123. 1473.74 s [pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
  16124. 1473.87 s [pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
  16125. 1473.93 s [pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
  16126. 1473.95 s [pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
  16127. 1473.96 s [pandoc-lua-engine] Haddock coverage:
  16128. 1473.96 s [pandoc-lua-engine] Warning: 'Chunk' is ambiguous. It is defined
  16129. 1473.96 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  16130. 1473.96 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  16131. 1473.96 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16132. 1473.96 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16133. 1473.96 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
  16134. 1473.96 s [pandoc-lua-engine] Warning: 'ChunkedDoc' is ambiguous. It is defined
  16135. 1473.96 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  16136. 1473.96 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  16137. 1473.96 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16138. 1473.96 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16139. 1473.96 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
  16140. 1473.96 s [pandoc-lua-engine] Warning: 'Reference' is ambiguous. It is defined
  16141. 1473.96 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16142. 1473.96 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16143. 1473.96 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16144. 1473.97 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16145. 1473.97 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  16146. 1473.97 s [pandoc-lua-engine] Warning: 'ItemId' is ambiguous. It is defined
  16147. 1473.97 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16148. 1473.97 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16149. 1473.97 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16150. 1473.97 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16151. 1473.97 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  16152. 1473.97 s [pandoc-lua-engine] Warning: 'Name' is ambiguous. It is defined
  16153. 1473.97 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16154. 1473.97 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16155. 1473.97 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16156. 1473.97 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16157. 1473.97 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  16158. 1473.97 s [pandoc-lua-engine] Warning: 'Date' is ambiguous. It is defined
  16159. 1473.97 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16160. 1473.97 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  16161. 1473.97 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16162. 1473.97 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16163. 1473.97 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  16164. 1473.97 s [pandoc-lua-engine] Warning: 'Sources' is ambiguous. It is defined
  16165. 1473.97 s [pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
  16166. 1473.97 s [pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
  16167. 1473.97 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16168. 1473.97 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16169. 1473.97 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Sources’
  16170. 1473.97 s [pandoc-lua-engine] Warning: 'Lua' is ambiguous. It is defined
  16171. 1473.97 s [pandoc-lua-engine] * in ‘HsLua.Core.Error’
  16172. 1473.97 s [pandoc-lua-engine] * in ‘HsLua.Core.Types’
  16173. 1473.97 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16174. 1473.98 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16175. 1473.98 s [pandoc-lua-engine] Defaulting to the one defined in ‘HsLua.Core.Error’
  16176. 1473.98 s [pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
  16177. 1473.98 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
  16178. 1473.98 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  16179. 1473.98 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16180. 1473.98 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16181. 1473.98 s [pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  16182. 1473.98 s [pandoc-lua-engine] Warning: 'ExtensionConfig' is out of scope.
  16183. 1473.98 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  16184. 1473.98 s [pandoc-lua-engine] Warning: 'ExtensionsConfig' is ambiguous. It is defined
  16185. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Format’
  16186. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Format’
  16187. 1473.98 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16188. 1473.98 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16189. 1473.98 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Format’
  16190. 1473.98 s [pandoc-lua-engine] Warning: 'enable' is out of scope.
  16191. 1473.98 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  16192. 1473.98 s [pandoc-lua-engine] Warning: 'disable' is out of scope.
  16193. 1473.98 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  16194. 1473.98 s [pandoc-lua-engine] Warning: 'WriterOptions' is ambiguous. It is defined
  16195. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  16196. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  16197. 1473.98 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16198. 1473.98 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16199. 1473.98 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
  16200. 1473.98 s [pandoc-lua-engine] Warning: 'Pandoc' is ambiguous. It is defined
  16201. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
  16202. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
  16203. 1473.98 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16204. 1473.98 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16205. 1473.98 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Definition’
  16206. 1473.98 s [pandoc-lua-engine] Warning: 'Chunk' is out of scope.
  16207. 1473.98 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  16208. 1473.98 s [pandoc-lua-engine] Warning: 'ReaderOptions' is ambiguous. It is defined
  16209. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  16210. 1473.98 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  16211. 1473.98 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16212. 1473.98 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16213. 1473.98 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
  16214. 1473.98 s [pandoc-lua-engine] Warning: 'read' is out of scope.
  16215. 1473.98 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  16216. 1473.99 s [pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
  16217. 1473.99 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
  16218. 1473.99 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  16219. 1473.99 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  16220. 1473.99 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  16221. 1473.99 s [pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  16222. 1473.99 s [pandoc-lua-engine] 100% ( 11 / 11) in 'Text.Pandoc.Lua'
  16223. 1474.01 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  16224. 1474.01 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
  16225. 1474.16 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 )
  16226. 1475.99 s [pandoc-lua-engine] Warning: Text.Pandoc.Lua: could not find link destinations for:
  16227. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Options.WriterOptions
  16228. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Error.PandocError
  16229. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Options.ReaderOptions
  16230. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Class.CommonState.CommonState
  16231. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Class.PandocMonad.PandocMonad
  16232. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Scripting.ScriptingEngine
  16233. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Filter.Environment.Environment
  16234. 1475.99 s [pandoc-lua-engine] - Text.Pandoc.Scripting.CustomComponents
  16235. 1477.53 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  16236. 1477.95 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  16237. 1479.32 s [nothunks] Phase: checkPhase
  16238. 1479.41 s [nothunks] Running 1 test suites...
  16239. 1479.41 s [nothunks] Test suite nothunks-test: RUNNING...
  16240. 1479.41 s [nothunks] Tests
  16241. 1479.41 s [nothunks] NoThunks.Class
  16242. 1479.41 s [nothunks] Sanity
  16243. 1479.41 s [nothunks] IntNotNF: OK
  16244. 1479.41 s [nothunks] ✓ <interactive> passed 1 test.
  16245. 1479.41 s [nothunks] IntIsNF: OK
  16246. 1479.41 s [nothunks] ✓ <interactive> passed 1 test.
  16247. 1479.41 s [nothunks] Pair: OK
  16248. 1479.41 s [nothunks] ✓ <interactive> passed 1 test.
  16249. 1479.41 s [nothunks] Sum: OK
  16250. 1479.41 s [nothunks] ✓ <interactive> passed 1 test.
  16251. 1479.41 s [nothunks] Fn: OK
  16252. 1479.41 s [nothunks] ✓ <interactive> passed 1 test.
  16253. 1479.42 s [nothunks] IO: OK
  16254. 1479.42 s [nothunks] ✓ <interactive> passed 1 test.
  16255. 1479.42 s [nothunks] InspectHeap
  16256. 1479.44 s [nothunks] Int: OK (0.02s)
  16257. 1479.44 s [nothunks] ✓ <interactive> passed 1000 tests.
  16258. 1479.44 s [nothunks] Just ["Int"] 50% ██████████··········
  16259. 1479.44 s [nothunks] Nothing 50% █████████▉··········
  16260. 1479.46 s [nothunks] IntInt: OK (0.02s)
  16261. 1479.46 s [nothunks] ✓ <interactive> passed 1000 tests.
  16262. 1479.46 s [nothunks] Just ["Int","Tuple2"] 35% ███████·············
  16263. 1479.46 s [nothunks] Just ["Tuple2"] 53% ██████████▌·········
  16264. 1479.46 s [nothunks] Nothing 12% ██▍·················
  16265. 1479.48 s [nothunks] SumInt: OK (0.02s)
  16266. 1479.48 s [nothunks] ✓ <interactive> passed 1000 tests.
  16267. 1479.48 s [nothunks] Just ["Either"] 34% ██████▊·············
  16268. 1479.48 s [nothunks] Just ["Int","Either"] 35% ██████▉·············
  16269. 1479.48 s [nothunks] Nothing 31% ██████▎·············
  16270. 1479.50 s [nothunks] ListInt: OK (0.02s)
  16271. 1479.50 s [nothunks] ✓ <interactive> passed 1000 tests.
  16272. 1479.50 s [nothunks] Just ["Int","List"] 22% ████▍···············
  16273. 1479.50 s [nothunks] Just ["List"] 44% ████████▉···········
  16274. 1479.50 s [nothunks] Nothing 33% ██████▌·············
  16275. 1479.53 s [nothunks] IntListInt: OK (0.03s)
  16276. 1479.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  16277. 1479.53 s [nothunks] Just ["Int","List","Tuple2"] 4% ▊···················
  16278. 1479.53 s [nothunks] Just ["Int","Tuple2"] 26% █████▏··············
  16279. 1479.53 s [nothunks] Just ["List","Tuple2"] 12% ██▎·················
  16280. 1479.53 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  16281. 1479.53 s [nothunks] Nothing 8% █▋··················
  16282. 1479.56 s [nothunks] SeqInt: EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  16283. 1479.56 s [nothunks] after 13 tests and 1 shrink.
  16284. 1479.56 s [nothunks] shrink path: 13:c
  16285. 1479.56 s [nothunks] Just ["Int","Seq"] 23% ████▌···············
  16286. 1479.56 s [nothunks] Nothing 69% █████████████▊······
  16287. 1479.56 s [nothunks]
  16288. 1479.56 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  16289. 1479.56 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  16290. 1479.56 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  16291. 1479.56 s [nothunks] 168 ┃ -> Proxy a
  16292. 1479.56 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  16293. 1479.56 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  16294. 1479.56 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  16295. 1479.56 s [nothunks] 172 ┃ -> Property
  16296. 1479.56 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  16297. 1479.56 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  16298. 1479.56 s [nothunks] Wrap
  16299. 1479.56 s [nothunks] { unwrap =
  16300. 1479.56 s [nothunks] SeqEnqueue
  16301. 1479.56 s [nothunks] (IntValue 0)
  16302. 1479.56 s [nothunks] (SeqEnqueue
  16303. 1479.56 s [nothunks] (IntValue 0)
  16304. 1479.56 s [nothunks] (SeqEnqueue
  16305. 1479.56 s [nothunks] (IntValue 0)
  16306. 1479.56 s [nothunks] (SeqEnqueue
  16307. 1479.56 s [nothunks] (IntValue 0)
  16308. 1479.56 s [nothunks] (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  16309. 1479.56 s [nothunks] }
  16310. 1479.56 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  16311. 1479.56 s [nothunks] 176 ┃ fromModel m $ \a -> do
  16312. 1479.56 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  16313. 1479.56 s [nothunks] IsNF
  16314. 1479.56 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  16315. 1479.56 s [nothunks] 179 Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  16316. 1479.56 s [nothunks] ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16317. 1479.56 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  16318. 1479.56 s [nothunks] ┃ │ - Just
  16319. 1479.56 s [nothunks] ┃ │ - ThunkInfo
  16320. 1479.56 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  16321. 1479.56 s [nothunks] ┃ │ + Nothing
  16322. 1479.56 s [nothunks]
  16323. 1479.56 s [nothunks] This failure can be reproduced by running:
  16324. 1479.56 s [nothunks] > recheckAt (Seed 7658446290982696329 9142656414718942013) "13:c" EXPECTED FAILURE
  16325. 1479.56 s [nothunks]
  16326. 1479.56 s [nothunks] OK (0.02s)
  16327. 1479.56 s [nothunks] ✓ <interactive> passed 1 test.
  16328. 1479.56 s [nothunks] Model
  16329. 1479.58 s [nothunks] Int: OK (0.02s)
  16330. 1479.58 s [nothunks] ✓ <interactive> passed 1000 tests.
  16331. 1479.58 s [nothunks] Just ["Int"] 52% ██████████▎·········
  16332. 1479.58 s [nothunks] Nothing 48% █████████▋··········
  16333. 1479.60 s [nothunks] IntInt: OK (0.02s)
  16334. 1479.60 s [nothunks] ✓ <interactive> passed 1000 tests.
  16335. 1479.60 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  16336. 1479.60 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  16337. 1479.60 s [nothunks] Nothing 12% ██▍·················
  16338. 1479.62 s [nothunks] SumInt: OK (0.02s)
  16339. 1479.62 s [nothunks] ✓ <interactive> passed 1000 tests.
  16340. 1479.62 s [nothunks] Just ["Either"] 36% ███████▏············
  16341. 1479.62 s [nothunks] Just ["Int","Either"] 29% █████▊··············
  16342. 1479.62 s [nothunks] Nothing 35% ██████▉·············
  16343. 1479.62 s [nothunks] ListInt: OK (0.02s)
  16344. 1479.62 s [nothunks] ✓ <interactive> passed 1000 tests.
  16345. 1479.62 s [nothunks] Just ["Int","List"] 20% ████················
  16346. 1479.62 s [nothunks] Just ["List"] 46% █████████▎··········
  16347. 1479.62 s [nothunks] Nothing 33% ██████▌·············
  16348. 1479.66 s [nothunks] IntListInt: OK (0.01s)
  16349. 1479.66 s [nothunks] ✓ <interactive> passed 1000 tests.
  16350. 1479.66 s [nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
  16351. 1479.66 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  16352. 1479.66 s [nothunks] Just ["List","Tuple2"] 11% ██▏·················
  16353. 1479.66 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  16354. 1479.66 s [nothunks] Nothing 8% █▋··················
  16355. 1479.74 s [nothunks] SeqInt: OK (0.09s)
  16356. 1479.74 s [nothunks] ✓ <interactive> passed 1000 tests.
  16357. 1479.74 s [nothunks] Just ["Int","Seq"] 45% █████████···········
  16358. 1479.74 s [nothunks] Nothing 55% ██████████▉·········
  16359. 1479.78 s [nothunks] AllowThunksIn: OK (0.03s)
  16360. 1479.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  16361. 1479.78 s [nothunks] Just ["Int","field2","Record"] 26% █████···············
  16362. 1479.78 s [nothunks] Just ["Record"] 51% ██████████▏·········
  16363. 1479.78 s [nothunks] Nothing 24% ████▋···············
  16364. 1479.78 s [nothunks] Fn: OK (0.01s)
  16365. 1479.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  16366. 1479.78 s [nothunks] Just ["->"] 23% ████▌···············
  16367. 1479.78 s [nothunks] Nothing 77% ███████████████▍····
  16368. 1479.80 s [nothunks] IO: OK (0.01s)
  16369. 1479.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  16370. 1479.80 s [nothunks] Just ["IO"] 25% ████▉···············
  16371. 1479.80 s [nothunks] Nothing 75% ███████████████·····
  16372. 1479.82 s [nothunks] ThunkFreeFn: OK (0.01s)
  16373. 1479.82 s [nothunks] ✓ <interactive> passed 1000 tests.
  16374. 1479.82 s [nothunks] Just ["->"] 25% █████···············
  16375. 1479.82 s [nothunks] Just ["...","->"] 38% ███████▌············
  16376. 1479.82 s [nothunks] Nothing 37% ███████▍············
  16377. 1479.82 s [nothunks] ThunkFreeIO: OK (0.01s)
  16378. 1479.82 s [nothunks] ✓ <interactive> passed 1000 tests.
  16379. 1479.82 s [nothunks] Just ["...","IO"] 39% ███████▋············
  16380. 1479.82 s [nothunks] Just ["IO"] 25% ████▉···············
  16381. 1479.82 s [nothunks] Nothing 37% ███████▎············
  16382. 1479.82 s [nothunks] MutableVars
  16383. 1479.82 s [nothunks] IORef
  16384. 1479.82 s [nothunks] NotNF: OK
  16385. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16386. 1479.82 s [nothunks] NF: OK
  16387. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16388. 1479.82 s [nothunks] NotNFPure: OK
  16389. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16390. 1479.82 s [nothunks] NFPure: OK
  16391. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16392. 1479.82 s [nothunks] NotNFAtomically: OK
  16393. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16394. 1479.82 s [nothunks] NFAtomically: OK
  16395. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16396. 1479.82 s [nothunks] MVar
  16397. 1479.82 s [nothunks] NotNF: OK
  16398. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16399. 1479.82 s [nothunks] NF: OK
  16400. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16401. 1479.82 s [nothunks] NotNFPure: OK
  16402. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16403. 1479.82 s [nothunks] NFPure: OK
  16404. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16405. 1479.82 s [nothunks] NotNFAtomically: OK
  16406. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16407. 1479.82 s [nothunks] NFAtomically: OK
  16408. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16409. 1479.82 s [nothunks] TVar
  16410. 1479.82 s [nothunks] NotNF: OK
  16411. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16412. 1479.82 s [nothunks] NF: OK
  16413. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16414. 1479.82 s [nothunks] NotNFPure: OK
  16415. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16416. 1479.82 s [nothunks] NFPure: OK
  16417. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16418. 1479.82 s [nothunks] NotNFAtomically: OK
  16419. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16420. 1479.82 s [nothunks] NFAtomically: OK
  16421. 1479.82 s [nothunks] ✓ <interactive> passed 1 test.
  16422. 1479.82 s [nothunks]
  16423. 1479.82 s [nothunks] All 41 tests passed (0.41s)
  16424. 1479.82 s [nothunks] Test suite nothunks-test: PASS
  16425. 1479.82 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  16426. 1479.82 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  16427. 1479.83 s [nothunks] Phase: haddockPhase
  16428. 1479.98 s [nothunks] Preprocessing library for nothunks-0.3.1..
  16429. 1479.98 s [nothunks] Running Haddock on library for nothunks-0.3.1..
  16430. 1479.98 s [nothunks] Warning: The documentation for the following packages are not installed. No
  16431. 1479.98 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  16432. 1480.03 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  16433. 1480.22 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  16434. 1480.79 s [nothunks] Haddock coverage:
  16435. 1480.79 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  16436. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:334:48
  16437. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:334:1
  16438. 1480.79 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16439. 1480.79 s [nothunks] by specifying the type/value namespace explicitly.
  16440. 1480.79 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  16441. 1480.79 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  16442. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:353:25
  16443. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:353:1
  16444. 1480.79 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16445. 1480.79 s [nothunks] by specifying the type/value namespace explicitly.
  16446. 1480.79 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  16447. 1480.79 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  16448. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:358:47
  16449. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:358:1
  16450. 1480.79 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16451. 1480.79 s [nothunks] by specifying the type/value namespace explicitly.
  16452. 1480.79 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  16453. 1480.79 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  16454. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:308:27
  16455. 1480.79 s [nothunks] * at src/NoThunks/Class.hs:308:1
  16456. 1480.79 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16457. 1480.80 s [nothunks] by specifying the type/value namespace explicitly.
  16458. 1480.80 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  16459. 1480.80 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  16460. 1480.80 s [nothunks] * at src/NoThunks/Class.hs:230:18
  16461. 1480.80 s [nothunks] * at src/NoThunks/Class.hs:230:1
  16462. 1480.80 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16463. 1480.80 s [nothunks] by specifying the type/value namespace explicitly.
  16464. 1480.80 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  16465. 1480.80 s [nothunks] Warning: 'GHC' is out of scope.
  16466. 1480.80 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16467. 1480.80 s [nothunks] Warning: 'a' is out of scope.
  16468. 1480.80 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16469. 1480.80 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  16470. 1480.80 s [nothunks] Missing documentation for:
  16471. 1480.80 s [nothunks] Module header
  16472. 1481.39 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  16473. 1481.39 s [nothunks] - Data.Vector.Vector
  16474. 1481.39 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  16475. 1481.39 s [nothunks] - NoThunks.Class.HasFields
  16476. 1481.39 s [nothunks] - NoThunks.Class.Elem
  16477. 1481.39 s [nothunks] - NoThunks.Class.GShowTypeOf
  16478. 1481.39 s [nothunks] - NoThunks.Class.GWRecordField
  16479. 1481.39 s [nothunks] - NoThunks.Class.checkContainsThunks
  16480. 1485.49 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  16481. 1485.53 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  16482. 1485.60 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  16483. 1485.61 s [nothunks] Phase: installPhase
  16484. 1485.78 s [nothunks] Installing library in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  16485. 1486.05 s [nothunks] Phase: fixupPhase
  16486. 1486.07 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
  16487. 1486.08 s [nothunks] shrinking /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSnothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So-ghc9.8.4.so
  16488. 1486.09 s [nothunks] checking for references to /build/ in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1...
  16489. 1486.11 s [nothunks] patching script interpreter paths in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1
  16490. 1486.11 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1/lib
  16491. 1486.19 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
  16492. 1486.20 s [nothunks] checking for references to /build/ in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc...
  16493. 1486.22 s [nothunks] patching script interpreter paths in /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
  16494. 1486.35 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
  16495. 1486.82 s [nothunks:post-build] Nothing to push - all store paths are already on Cachix.
  16496. 1486.84 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1 /nix/store/k094f4k25n7fwhxjxxzzns71a83ribna-nothunks-0.3.1-doc
  16497. 1486.90 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16498. 1486.97 s [nothunks:post-build] copying 1 paths...
  16499. 1486.97 s [nothunks:post-build] copying path '/nix/store/fg9gz1agbnzvf069qp9m5qjc2pxzjx7l-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  16500. 1487.82 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16501. 1487.92 s [nothunks:post-build] copying 0 paths...
  16502. 1487.95 s Progress: 25 of 38 built (1 building), 559 of 559 downloaded from cache
  16503. 1488.02 s Building /nix/store/mr7yxhpx752pnr1i2yrqdpqk587ricjc-unordered-containers-0.2.20.1.drv
  16504. 1488.02 s [pandoc-lua-engine] Documentation created: dist/doc/html/pandoc-lua-engine/,
  16505. 1488.02 s [pandoc-lua-engine] dist/doc/html/pandoc-lua-engine/pandoc-lua-engine.txt
  16506. 1488.02 s [pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
  16507. 1488.02 s [pandoc-lua-engine] Phase: installPhase
  16508. 1488.16 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  16509. 1488.16 s [unordered-containers] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
  16510. 1488.19 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
  16511. 1488.36 s [unordered-containers] Phase: unpackPhase
  16512. 1488.36 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  16513. 1488.37 s [unordered-containers] source root is unordered-containers-0.2.20.1
  16514. 1488.38 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  16515. 1488.38 s [unordered-containers] Phase: patchPhase
  16516. 1488.39 s [unordered-containers] Phase: compileBuildDriverPhase
  16517. 1488.40 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.F4TDaT7Clm/setup-package.conf.d -threaded
  16518. 1488.45 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.F4TDaT7Clm/Main.o )
  16519. 1488.54 s [unordered-containers] [2 of 2] Linking Setup
  16520. 1489.28 s [pandoc-lua-engine] Phase: fixupPhase
  16521. 1489.30 s [pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
  16522. 1489.31 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
  16523. 1489.45 s [pandoc-lua-engine] checking for references to /build/ in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3...
  16524. 1489.49 s [pandoc-lua-engine] patching script interpreter paths in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
  16525. 1489.50 s [pandoc-lua-engine] stripping (with command strip and flags -S -p) in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib
  16526. 1489.81 s [pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
  16527. 1489.83 s [pandoc-lua-engine] checking for references to /build/ in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc...
  16528. 1489.85 s [pandoc-lua-engine] patching script interpreter paths in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
  16529. 1490.17 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
  16530. 1490.65 s [pandoc-lua-engine:post-build] Nothing to push - all store paths are already on Cachix.
  16531. 1490.68 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
  16532. 1490.74 s [pandoc-lua-engine:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16533. 1490.81 s [pandoc-lua-engine:post-build] copying 1 paths...
  16534. 1490.81 s [pandoc-lua-engine:post-build] copying path '/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3' to 'https://cache.nix-ci.com'...
  16535. 1498.12 s [pandoc-lua-engine:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16536. 1498.26 s [pandoc-lua-engine:post-build] copying 0 paths...
  16537. 1498.29 s Progress: 26 of 38 built (1 building), 559 of 559 downloaded from cache
  16538. 1498.39 s Building /nix/store/qmy7ps3m9d54gh5mmi24jf976jzhgy36-pandoc-cli-3.7.0.2.drv
  16539. 1498.39 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  16540. 1498.39 s [unordered-containers] Phase: configurePhase
  16541. 1498.40 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.F4TDaT7Clm/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
  16542. 1498.40 s [unordered-containers] Using Parsec parser
  16543. 1498.40 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  16544. 1498.40 s [unordered-containers] Flags chosen: debug=False
  16545. 1498.40 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.19.2.0
  16546. 1498.40 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
  16547. 1498.40 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  16548. 1498.40 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.21.0.0
  16549. 1498.40 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  16550. 1498.40 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  16551. 1498.40 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  16552. 1498.40 s [unordered-containers] Dependency base: using base-4.19.2.0
  16553. 1498.40 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.8
  16554. 1498.40 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  16555. 1498.40 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  16556. 1498.40 s [unordered-containers] Dependency random: using random-1.2.1.3
  16557. 1498.40 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  16558. 1498.40 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  16559. 1498.40 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  16560. 1498.40 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  16561. 1498.40 s [unordered-containers] Source component graph:
  16562. 1498.40 s [unordered-containers] component lib
  16563. 1498.40 s [unordered-containers] component test:unordered-containers-tests dependency lib
  16564. 1498.40 s [unordered-containers] Configured component graph:
  16565. 1498.40 s [unordered-containers] component unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  16566. 1498.40 s [unordered-containers] include base-4.19.2.0-8274
  16567. 1498.40 s [unordered-containers] include deepseq-1.5.1.0-c64e
  16568. 1498.40 s [unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  16569. 1498.40 s [unordered-containers] include template-haskell-2.21.0.0-cbc4
  16570. 1498.40 s [unordered-containers] component unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
  16571. 1498.40 s [unordered-containers] include ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
  16572. 1498.40 s [unordered-containers] include HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
  16573. 1498.40 s [unordered-containers] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  16574. 1498.40 s [unordered-containers] include base-4.19.2.0-8274
  16575. 1498.40 s [unordered-containers] include containers-0.6.8-15d9
  16576. 1498.40 s [unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  16577. 1498.40 s [unordered-containers] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  16578. 1498.40 s [unordered-containers] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
  16579. 1498.40 s [unordered-containers] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
  16580. 1498.40 s [unordered-containers] include tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
  16581. 1498.40 s [unordered-containers] include tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
  16582. 1498.40 s [unordered-containers] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  16583. 1498.40 s [unordered-containers] Linked component graph:
  16584. 1498.40 s [unordered-containers] unit unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  16585. 1498.40 s [unordered-containers] include base-4.19.2.0-8274
  16586. 1498.40 s [unordered-containers] include deepseq-1.5.1.0-c64e
  16587. 1498.40 s [unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  16588. 1498.40 s [unordered-containers] include template-haskell-2.21.0.0-cbc4
  16589. 1498.40 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78:Data.HashSet.Internal
  16590. 1498.40 s [unordered-containers] unit unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
  16591. 1498.40 s [unordered-containers] include ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
  16592. 1498.40 s [unordered-containers] include HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
  16593. 1498.40 s [unordered-containers] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  16594. 1498.40 s [unordered-containers] include base-4.19.2.0-8274
  16595. 1498.40 s [unordered-containers] include containers-0.6.8-15d9
  16596. 1498.40 s [unordered-containers] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  16597. 1498.40 s [unordered-containers] include nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  16598. 1498.40 s [unordered-containers] include random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
  16599. 1498.40 s [unordered-containers] include tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
  16600. 1498.40 s [unordered-containers] include tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
  16601. 1498.40 s [unordered-containers] include tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
  16602. 1498.40 s [unordered-containers] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  16603. 1498.40 s [unordered-containers] Ready component graph:
  16604. 1498.40 s [unordered-containers] definite unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  16605. 1498.40 s [unordered-containers] depends base-4.19.2.0-8274
  16606. 1498.40 s [unordered-containers] depends deepseq-1.5.1.0-c64e
  16607. 1498.40 s [unordered-containers] depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  16608. 1498.40 s [unordered-containers] depends template-haskell-2.21.0.0-cbc4
  16609. 1498.40 s [unordered-containers] definite unordered-containers-0.2.20.1-8p5Y26GgM36CrnRklz7hG5-unordered-containers-tests
  16610. 1498.40 s [unordered-containers] depends ChasingBottoms-1.3.1.17-EmoCAwMoPH0CCHL2NpXdat
  16611. 1498.40 s [unordered-containers] depends HUnit-1.6.2.0-Db1bFs6D9VKLsZfaOMc6ct
  16612. 1498.40 s [unordered-containers] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  16613. 1498.40 s [unordered-containers] depends base-4.19.2.0-8274
  16614. 1498.40 s [unordered-containers] depends containers-0.6.8-15d9
  16615. 1498.40 s [unordered-containers] depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  16616. 1498.40 s [unordered-containers] depends nothunks-0.3.1-K15D4UJtRGlKsSMyO1x7So
  16617. 1498.40 s [unordered-containers] depends random-1.2.1.3-4nAFFkyLaf06hdgohAE32a
  16618. 1498.40 s [unordered-containers] depends tasty-1.5.3-66xEeewhbDHEVHj3Ib33AJ
  16619. 1498.40 s [unordered-containers] depends tasty-hunit-0.10.2-KzZfdY6N22V4CcWQecXPjL
  16620. 1498.40 s [unordered-containers] depends tasty-quickcheck-0.11.1-2kmHUdfkSdKIEfY8qRwL5K
  16621. 1498.40 s [unordered-containers] depends unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  16622. 1498.40 s [unordered-containers] Using Cabal-3.10.3.0 compiled by ghc-9.8
  16623. 1498.40 s [unordered-containers] Using compiler: ghc-9.8.4
  16624. 1498.40 s [unordered-containers] Using install prefix:
  16625. 1498.40 s [unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
  16626. 1498.40 s [unordered-containers] Executables installed in:
  16627. 1498.40 s [unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/bin
  16628. 1498.40 s [unordered-containers] Libraries installed in:
  16629. 1498.40 s [unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  16630. 1498.40 s [unordered-containers] Dynamic Libraries installed in:
  16631. 1498.40 s [unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  16632. 1498.40 s [unordered-containers] Private executables installed in:
  16633. 1498.40 s [unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
  16634. 1498.40 s [unordered-containers] Data files installed in:
  16635. 1498.40 s [unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
  16636. 1498.40 s [unordered-containers] Documentation installed in:
  16637. 1498.40 s [unordered-containers] /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  16638. 1498.40 s [unordered-containers] Configuration files installed in:
  16639. 1498.40 s [unordered-containers] /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/etc
  16640. 1498.40 s [unordered-containers] No alex found
  16641. 1498.40 s [unordered-containers] Using ar found on system at:
  16642. 1498.40 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16643. 1498.40 s [unordered-containers] No c2hs found
  16644. 1498.40 s [unordered-containers] No cpphs found
  16645. 1498.40 s [unordered-containers] No doctest found
  16646. 1498.40 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  16647. 1498.40 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16648. 1498.40 s [unordered-containers] Using ghc version 9.8.4 found on system at:
  16649. 1498.40 s [unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
  16650. 1498.40 s [unordered-containers] Using ghc-pkg version 9.8.4 found on system at:
  16651. 1498.40 s [unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
  16652. 1498.40 s [unordered-containers] No ghcjs found
  16653. 1498.40 s [unordered-containers] No ghcjs-pkg found
  16654. 1498.40 s [unordered-containers] No greencard found
  16655. 1498.40 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  16656. 1498.40 s [unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
  16657. 1498.40 s [unordered-containers] No happy found
  16658. 1498.40 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  16659. 1498.40 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16660. 1498.40 s [unordered-containers] No hmake found
  16661. 1498.40 s [unordered-containers] Using hpc version 0.69 found on system at:
  16662. 1498.40 s [unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
  16663. 1498.40 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  16664. 1498.40 s [unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  16665. 1498.40 s [unordered-containers] Using hscolour version 1.25 found on system at:
  16666. 1498.40 s [unordered-containers] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
  16667. 1498.40 s [unordered-containers] No jhc found
  16668. 1498.40 s [unordered-containers] Using ld found on system at:
  16669. 1498.40 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  16670. 1498.41 s [unordered-containers] No pkg-config found
  16671. 1498.41 s [unordered-containers] Using runghc version 9.8.4 found on system at:
  16672. 1498.41 s [unordered-containers] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
  16673. 1498.41 s [unordered-containers] Using strip version 2.44 found on system at:
  16674. 1498.41 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16675. 1498.41 s [unordered-containers] Using tar found on system at:
  16676. 1498.41 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16677. 1498.41 s [unordered-containers] No uhc found
  16678. 1498.41 s [unordered-containers] Phase: buildPhase
  16679. 1498.41 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  16680. 1498.41 s [unordered-containers] Building library for unordered-containers-0.2.20.1..
  16681. 1498.41 s [unordered-containers]
  16682. 1498.41 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16683. 1498.41 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16684. 1498.41 s [unordered-containers] |
  16685. 1498.41 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16686. 1498.41 s [unordered-containers] | ^^^^^^^^^^
  16687. 1498.41 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
  16688. 1498.41 s [unordered-containers]
  16689. 1498.41 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16690. 1498.41 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16691. 1498.41 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16692. 1498.41 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16693. 1498.41 s [unordered-containers] |
  16694. 1498.41 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16695. 1498.41 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16696. 1498.41 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 )
  16697. 1498.41 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 )
  16698. 1499.25 s [pandoc-cli] Phase: setupCompilerEnvironmentPhase
  16699. 1499.26 s [pandoc-cli] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  16700. 1500.00 s [pandoc-cli] Phase: unpackPhase
  16701. 1500.01 s [pandoc-cli] unpacking source archive /nix/store/l1s1s9sdrxfqabvc0hl1i6jbdyzaj2ci-pandoc-cli-3.7.0.2.tar.gz
  16702. 1500.02 s [pandoc-cli] source root is pandoc-cli-3.7.0.2
  16703. 1500.03 s [pandoc-cli] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-cli-3.7.0.2/src/pandoc.hs"
  16704. 1500.03 s [pandoc-cli] Phase: patchPhase
  16705. 1500.05 s [pandoc-cli] Phase: compileBuildDriverPhase
  16706. 1500.05 s [pandoc-cli] setupCompileFlags: -package-db=/build/tmp.wfHYidRJRl/setup-package.conf.d -threaded
  16707. 1500.13 s [pandoc-cli] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.wfHYidRJRl/Main.o )
  16708. 1500.19 s [pandoc-cli] [2 of 2] Linking Setup
  16709. 1500.34 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 )
  16710. 1500.76 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.o, dist/build/Data/HashMap/Internal/Strict.dyn_o )
  16711. 1502.05 s [pandoc-cli] Phase: updateAutotoolsGnuConfigScriptsPhase
  16712. 1502.06 s [pandoc-cli] Phase: configurePhase
  16713. 1502.07 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.wfHYidRJRl/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
  16714. 1502.08 s [pandoc-cli] Using Parsec parser
  16715. 1502.08 s [pandoc-cli] Configuring pandoc-cli-3.7.0.2...
  16716. 1502.76 s [pandoc-cli] Flags chosen: lua=True, nightly=False, server=True
  16717. 1503.15 s [pandoc-cli] Dependency base >=4.12 && <5: using base-4.20.2.0
  16718. 1503.15 s [pandoc-cli] Dependency hslua-cli >=1.4.1 && <1.5: using hslua-cli-1.4.3
  16719. 1503.15 s [pandoc-cli] Dependency pandoc ==3.7.0.2: using pandoc-3.7.0.2
  16720. 1503.15 s [pandoc-cli] Dependency pandoc-lua-engine >=0.4.3 && <0.5: using pandoc-lua-engine-0.4.3
  16721. 1503.15 s [pandoc-cli] Dependency pandoc-server >=0.1.0.9 && <0.2: using pandoc-server-0.1.0.11
  16722. 1503.15 s [pandoc-cli] Dependency safe: using safe-0.3.21
  16723. 1503.15 s [pandoc-cli] Dependency temporary >=1.1 && <1.4: using temporary-1.3
  16724. 1503.15 s [pandoc-cli] Dependency text: using text-2.1.3
  16725. 1503.15 s [pandoc-cli] Dependency wai-extra >=3.0.24: using wai-extra-3.1.18
  16726. 1503.15 s [pandoc-cli] Dependency warp: using warp-3.4.9
  16727. 1503.15 s [pandoc-cli] Source component graph: component exe:pandoc
  16728. 1503.15 s [pandoc-cli] Configured component graph:
  16729. 1503.15 s [pandoc-cli] component pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
  16730. 1503.15 s [pandoc-cli] include base-4.20.2.0-64da
  16731. 1503.15 s [pandoc-cli] include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
  16732. 1503.15 s [pandoc-cli] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  16733. 1503.15 s [pandoc-cli] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  16734. 1503.15 s [pandoc-cli] include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  16735. 1503.15 s [pandoc-cli] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  16736. 1503.15 s [pandoc-cli] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  16737. 1503.15 s [pandoc-cli] include text-2.1.3-c691
  16738. 1503.15 s [pandoc-cli] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  16739. 1503.15 s [pandoc-cli] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  16740. 1503.15 s [pandoc-cli] Linked component graph:
  16741. 1503.15 s [pandoc-cli] unit pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
  16742. 1503.15 s [pandoc-cli] include base-4.20.2.0-64da
  16743. 1503.15 s [pandoc-cli] include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
  16744. 1503.15 s [pandoc-cli] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  16745. 1503.15 s [pandoc-cli] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  16746. 1503.15 s [pandoc-cli] include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  16747. 1503.15 s [pandoc-cli] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  16748. 1503.15 s [pandoc-cli] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  16749. 1503.15 s [pandoc-cli] include text-2.1.3-c691
  16750. 1503.15 s [pandoc-cli] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  16751. 1503.15 s [pandoc-cli] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  16752. 1503.15 s [pandoc-cli] Ready component graph:
  16753. 1503.15 s [pandoc-cli] definite pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
  16754. 1503.15 s [pandoc-cli] depends base-4.20.2.0-64da
  16755. 1503.15 s [pandoc-cli] depends hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
  16756. 1503.15 s [pandoc-cli] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  16757. 1503.16 s [pandoc-cli] depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  16758. 1503.16 s [pandoc-cli] depends pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  16759. 1503.16 s [pandoc-cli] depends safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  16760. 1503.16 s [pandoc-cli] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  16761. 1503.16 s [pandoc-cli] depends text-2.1.3-c691
  16762. 1503.16 s [pandoc-cli] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  16763. 1503.16 s [pandoc-cli] depends warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  16764. 1503.16 s [pandoc-cli] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16765. 1503.16 s [pandoc-cli] Using compiler: ghc-9.10.3
  16766. 1503.16 s [pandoc-cli] Using install prefix:
  16767. 1503.16 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16768. 1503.16 s [pandoc-cli] Executables installed in:
  16769. 1503.16 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
  16770. 1503.16 s [pandoc-cli] Libraries installed in:
  16771. 1503.16 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
  16772. 1503.16 s [pandoc-cli] Dynamic Libraries installed in:
  16773. 1503.16 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
  16774. 1503.16 s [pandoc-cli] Private executables installed in:
  16775. 1503.16 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
  16776. 1503.16 s [pandoc-cli] Data files installed in:
  16777. 1503.16 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
  16778. 1503.16 s [pandoc-cli] Documentation installed in:
  16779. 1503.16 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
  16780. 1503.16 s [pandoc-cli] Configuration files installed in:
  16781. 1503.16 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/etc
  16782. 1503.16 s [pandoc-cli] No alex found
  16783. 1503.16 s [pandoc-cli] Using ar found on system at:
  16784. 1503.16 s [pandoc-cli] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16785. 1503.16 s [pandoc-cli] No c2hs found
  16786. 1503.16 s [pandoc-cli] No cpphs found
  16787. 1503.16 s [pandoc-cli] No doctest found
  16788. 1503.16 s [pandoc-cli] Using gcc version 14.3.0 given by user at:
  16789. 1503.16 s [pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16790. 1503.16 s [pandoc-cli] Using ghc version 9.10.3 found on system at:
  16791. 1503.16 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  16792. 1503.16 s [pandoc-cli] Using ghc-pkg version 9.10.3 found on system at:
  16793. 1503.16 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  16794. 1503.16 s [pandoc-cli] No ghcjs found
  16795. 1503.16 s [pandoc-cli] No ghcjs-pkg found
  16796. 1503.16 s [pandoc-cli] No greencard found
  16797. 1503.16 s [pandoc-cli] Using haddock version 2.31.1 found on system at:
  16798. 1503.16 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 )
  16799. 1503.16 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  16800. 1503.16 s [pandoc-cli] No happy found
  16801. 1503.16 s [pandoc-cli] Using haskell-suite found on system at: haskell-suite-dummy-location
  16802. 1503.16 s [pandoc-cli] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16803. 1503.16 s [pandoc-cli] No hmake found
  16804. 1503.16 s [pandoc-cli] Using hpc version 0.69 found on system at:
  16805. 1503.16 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  16806. 1503.16 s [pandoc-cli] Using hsc2hs version 0.68.10 found on system at:
  16807. 1503.16 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  16808. 1503.16 s [pandoc-cli] No hscolour found
  16809. 1503.16 s [pandoc-cli] No jhc found
  16810. 1503.16 s [pandoc-cli] Using ld found on system at:
  16811. 1503.16 s [pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  16812. 1503.16 s [pandoc-cli] No pkg-config found
  16813. 1503.16 s [pandoc-cli] Using runghc version 9.10.3 found on system at:
  16814. 1503.16 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  16815. 1503.16 s [pandoc-cli] Using strip version 2.44 found on system at:
  16816. 1503.16 s [pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16817. 1503.16 s [pandoc-cli] Using tar found on system at:
  16818. 1503.16 s [pandoc-cli] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16819. 1503.16 s [pandoc-cli] No uhc found
  16820. 1503.16 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  16821. 1503.16 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 )
  16822. 1503.18 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 )
  16823. 1503.47 s [unordered-containers]
  16824. 1503.47 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16825. 1503.50 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16826. 1503.50 s [unordered-containers] |
  16827. 1503.50 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16828. 1503.50 s [unordered-containers] | ^^^^^^^^^^
  16829. 1503.70 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  16830. 1503.87 s [unordered-containers]
  16831. 1503.87 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16832. 1503.87 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16833. 1503.87 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16834. 1503.87 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16835. 1503.87 s [unordered-containers] |
  16836. 1503.87 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16837. 1503.87 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16838. 1504.05 s [pandoc-cli] Phase: buildPhase
  16839. 1504.21 s [pandoc-cli] Preprocessing executable 'pandoc' for pandoc-cli-3.7.0.2...
  16840. 1504.22 s [pandoc-cli] Building executable 'pandoc' for pandoc-cli-3.7.0.2...
  16841. 1504.36 s [pandoc-cli] [1 of 3] Compiling PandocCLI.Lua
  16842. 1504.71 s [pandoc-cli] [2 of 3] Compiling PandocCLI.Server
  16843. 1504.71 s [pandoc-cli] [3 of 3] Compiling Main
  16844. 1504.77 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  16845. 1504.77 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  16846. 1505.22 s [pandoc-cli] [4 of 4] Linking dist/build/pandoc/pandoc
  16847. 1514.30 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  16848. 1515.00 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  16849. 1515.97 s [pandoc-cli] Phase: checkPhase
  16850. 1516.06 s [pandoc-cli] Package has no test suites.
  16851. 1516.07 s [pandoc-cli] Phase: haddockPhase
  16852. 1516.07 s [pandoc-cli] Phase: installPhase
  16853. 1516.26 s [pandoc-cli] Installing executable pandoc in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
  16854. 1516.26 s [pandoc-cli] Warning: The directory
  16855. 1516.26 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin is not in
  16856. 1516.26 s [pandoc-cli] the system search path.
  16857. 1517.82 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  16858. 1517.82 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  16859. 1517.82 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  16860. 1517.94 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  16861. 1519.37 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  16862. 1519.39 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  16863. 1519.54 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 )
  16864. 1519.82 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  16865. 1519.82 s [unordered-containers]
  16866. 1519.82 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  16867. 1519.82 s [unordered-containers] In the use of ‘head’
  16868. 1519.82 s [unordered-containers] (imported from Prelude, but defined in GHC.List):
  16869. 1519.82 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  16870. 1519.82 s [unordered-containers] |
  16871. 1519.82 s [unordered-containers] 93 | k = head keys
  16872. 1519.82 s [unordered-containers] | ^^^^
  16873. 1520.55 s [pandoc-cli] Phase: fixupPhase
  16874. 1520.57 s [pandoc-cli] shrinking RPATHs of ELF executables and libraries in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16875. 1520.57 s [pandoc-cli] shrinking /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin/pandoc
  16876. 1521.04 s [pandoc-cli] checking for references to /build/ in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2...
  16877. 1521.44 s [pandoc-cli] gzipping man pages under /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/man/
  16878. 1521.48 s [pandoc-cli] patching script interpreter paths in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16879. 1521.49 s [pandoc-cli] stripping (with command strip and flags -S -p) in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
  16880. 1522.74 s [pandoc-cli:post-build] Uploading to cachix cache "sellout": /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16881. 1523.19 s [pandoc-cli:post-build] Nothing to push - all store paths are already on Cachix.
  16882. 1523.22 s [pandoc-cli:post-build] Uploading to the NixCI cache: /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16883. 1523.27 s [pandoc-cli:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16884. 1523.29 s [pandoc-cli:post-build] copying 1 paths...
  16885. 1523.29 s [pandoc-cli:post-build] copying path '/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2' to 'https://cache.nix-ci.com'...
  16886. 1602.74 s [pandoc-cli:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16887. 1602.86 s [pandoc-cli:post-build] copying 0 paths...
  16888. 1602.89 s Progress: 27 of 38 built (1 building), 559 of 559 downloaded from cache
  16889. 1602.96 s Building /nix/store/10xzxxdy2m2dv7z9mzid70kwihb0p0z3-shellcheck-0.11.0.drv
  16890. 1602.96 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 )
  16891. 1602.96 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  16892. 1602.96 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 )
  16893. 1602.96 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 )
  16894. 1602.96 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 )
  16895. 1602.96 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  16896. 1602.96 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  16897. 1602.96 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  16898. 1602.96 s [unordered-containers] buildPhase completed in 40 seconds
  16899. 1602.96 s [unordered-containers] Phase: checkPhase
  16900. 1602.96 s [unordered-containers] Running 1 test suites...
  16901. 1602.96 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  16902. 1602.96 s [unordered-containers] All
  16903. 1602.96 s [unordered-containers] Properties
  16904. 1602.96 s [unordered-containers] Data.HashMap.Lazy
  16905. 1602.96 s [unordered-containers] instances
  16906. 1602.96 s [unordered-containers] Eq
  16907. 1602.96 s [unordered-containers] ==: OK (0.04s)
  16908. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16909. 1602.96 s [unordered-containers] /=: OK (0.03s)
  16910. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16911. 1602.96 s [unordered-containers] Ord
  16912. 1602.96 s [unordered-containers] compare reflexive: OK
  16913. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16914. 1602.96 s [unordered-containers] compare transitive: OK (0.02s)
  16915. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16916. 1602.96 s [unordered-containers] compare antisymmetric: OK
  16917. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16918. 1602.96 s [unordered-containers] Ord => Eq: OK
  16919. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16920. 1602.96 s [unordered-containers] Read/Show: OK (0.13s)
  16921. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16922. 1602.96 s [unordered-containers] Functor: OK (0.03s)
  16923. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16924. 1602.96 s [unordered-containers] Foldable: OK
  16925. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16926. 1602.96 s [unordered-containers] Bifoldable
  16927. 1602.96 s [unordered-containers] bifoldMap: OK (0.01s)
  16928. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16929. 1602.96 s [unordered-containers] bifoldr: OK (0.01s)
  16930. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16931. 1602.96 s [unordered-containers] bifoldl: OK
  16932. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16933. 1602.96 s [unordered-containers] Hashable: OK (0.02s)
  16934. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16935. 1602.96 s [unordered-containers] empty
  16936. 1602.96 s [unordered-containers] valid: OK
  16937. 1602.96 s [unordered-containers] +++ OK, passed 1 test.
  16938. 1602.96 s [unordered-containers] singleton
  16939. 1602.96 s [unordered-containers] valid: OK
  16940. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16941. 1602.96 s [unordered-containers] size: OK
  16942. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16943. 1602.96 s [unordered-containers] member: OK (0.01s)
  16944. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16945. 1602.96 s [unordered-containers] lookup: OK
  16946. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16947. 1602.96 s [unordered-containers] !?: OK
  16948. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16949. 1602.96 s [unordered-containers] insert
  16950. 1602.96 s [unordered-containers] model: OK
  16951. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16952. 1602.96 s [unordered-containers] valid: OK
  16953. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16954. 1602.96 s [unordered-containers] insertWith
  16955. 1602.96 s [unordered-containers] insertWith: OK (0.01s)
  16956. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16957. 1602.96 s [unordered-containers] valid: OK
  16958. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16959. 1602.96 s [unordered-containers] delete
  16960. 1602.96 s [unordered-containers] model: OK (0.01s)
  16961. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16962. 1602.96 s [unordered-containers] valid: OK
  16963. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16964. 1602.96 s [unordered-containers] adjust
  16965. 1602.96 s [unordered-containers] model: OK
  16966. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16967. 1602.96 s [unordered-containers] valid: OK
  16968. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16969. 1602.96 s [unordered-containers] update
  16970. 1602.96 s [unordered-containers] model: OK
  16971. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16972. 1602.96 s [unordered-containers] valid: OK (0.02s)
  16973. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16974. 1602.96 s [unordered-containers] alter
  16975. 1602.96 s [unordered-containers] model: OK
  16976. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16977. 1602.96 s [unordered-containers] valid: OK
  16978. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16979. 1602.96 s [unordered-containers] alterF
  16980. 1602.96 s [unordered-containers] model
  16981. 1602.96 s [unordered-containers] []: OK (0.07s)
  16982. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16983. 1602.96 s [unordered-containers] adjust: OK (0.01s)
  16984. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16985. 1602.96 s [unordered-containers] insert: OK
  16986. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16987. 1602.96 s [unordered-containers] insertWith: OK
  16988. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16989. 1602.96 s [unordered-containers] delete: OK
  16990. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16991. 1602.96 s [unordered-containers] lookup: OK
  16992. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16993. 1602.96 s [unordered-containers] valid: OK
  16994. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16995. 1602.96 s [unordered-containers] isSubmapOf
  16996. 1602.96 s [unordered-containers] model: OK (0.03s)
  16997. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  16998. 1602.96 s [unordered-containers] m ⊆ m: OK
  16999. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  17000. 1602.96 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  17001. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  17002. 1602.96 s [unordered-containers] m1\m2 ⊆ m1: OK
  17003. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  17004. 1602.96 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.01s)
  17005. 1602.96 s [unordered-containers] +++ OK, passed 100 tests; 217 discarded.
  17006. 1602.96 s [unordered-containers] delete k m ⊆ m: OK
  17007. 1602.96 s [unordered-containers] +++ OK, passed 100 tests; 19 discarded.
  17008. 1602.96 s [unordered-containers] m ⊈ delete k m : OK
  17009. 1602.96 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17010. 1602.96 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  17011. 1602.96 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17012. 1602.96 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  17013. 1602.96 s [unordered-containers] +++ OK, passed 100 tests; 9 discarded.
  17014. 1602.96 s [unordered-containers] union
  17015. 1602.96 s [unordered-containers] model: OK (0.01s)
  17016. 1602.96 s [unordered-containers] +++ OK, passed 100 tests.
  17017. 1602.96 s [unordered-containers] valid: OK
  17018. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17019. 1602.97 s [unordered-containers] unionWith
  17020. 1602.97 s [unordered-containers] model: OK (0.01s)
  17021. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17022. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17023. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17024. 1602.97 s [unordered-containers] unionWithKey
  17025. 1602.97 s [unordered-containers] model: OK (0.02s)
  17026. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17027. 1602.97 s [unordered-containers] valid: OK
  17028. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17029. 1602.97 s [unordered-containers] unions
  17030. 1602.97 s [unordered-containers] model: OK (0.79s)
  17031. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17032. 1602.97 s [unordered-containers] valid: OK (0.37s)
  17033. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17034. 1602.97 s [unordered-containers] difference
  17035. 1602.97 s [unordered-containers] model: OK (0.01s)
  17036. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17037. 1602.97 s [unordered-containers] valid: OK
  17038. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17039. 1602.97 s [unordered-containers] differenceWith
  17040. 1602.97 s [unordered-containers] model: OK (0.03s)
  17041. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17042. 1602.97 s [unordered-containers] valid: OK (0.04s)
  17043. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17044. 1602.97 s [unordered-containers] intersection
  17045. 1602.97 s [unordered-containers] model: OK (0.02s)
  17046. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17047. 1602.97 s [unordered-containers] valid: OK
  17048. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17049. 1602.97 s [unordered-containers] intersectionWith
  17050. 1602.97 s [unordered-containers] model: OK (0.02s)
  17051. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17052. 1602.97 s [unordered-containers] valid: OK
  17053. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17054. 1602.97 s [unordered-containers] intersectionWithKey
  17055. 1602.97 s [unordered-containers] model: OK (0.03s)
  17056. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17057. 1602.97 s [unordered-containers] valid: OK
  17058. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17059. 1602.97 s [unordered-containers] compose
  17060. 1602.97 s [unordered-containers] valid: OK
  17061. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17062. 1602.97 s [unordered-containers] map
  17063. 1602.97 s [unordered-containers] model: OK (0.06s)
  17064. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17065. 1602.97 s [unordered-containers] valid: OK
  17066. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17067. 1602.97 s [unordered-containers] traverseWithKey
  17068. 1602.97 s [unordered-containers] model: OK (0.16s)
  17069. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17070. 1602.97 s [unordered-containers] valid: OK (0.04s)
  17071. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17072. 1602.97 s [unordered-containers] mapKeys
  17073. 1602.97 s [unordered-containers] model: OK (0.01s)
  17074. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17075. 1602.97 s [unordered-containers] valid: OK (0.22s)
  17076. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17077. 1602.97 s [unordered-containers] foldr: OK
  17078. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17079. 1602.97 s [unordered-containers] foldl: OK (0.01s)
  17080. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17081. 1602.97 s [unordered-containers] foldrWithKey: OK (0.01s)
  17082. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17083. 1602.97 s [unordered-containers] foldlWithKey: OK (0.02s)
  17084. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17085. 1602.97 s [unordered-containers] foldrWithKey': OK (0.01s)
  17086. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17087. 1602.97 s [unordered-containers] foldlWithKey': OK
  17088. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17089. 1602.97 s [unordered-containers] foldl': OK
  17090. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17091. 1602.97 s [unordered-containers] foldr': OK
  17092. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17093. 1602.97 s [unordered-containers] foldMapWithKey: OK
  17094. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17095. 1602.97 s [unordered-containers] filter
  17096. 1602.97 s [unordered-containers] model: OK (0.05s)
  17097. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17098. 1602.97 s [unordered-containers] valid: OK (0.03s)
  17099. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17100. 1602.97 s [unordered-containers] filterWithKey
  17101. 1602.97 s [unordered-containers] model: OK (1.09s)
  17102. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17103. 1602.97 s [unordered-containers] valid: OK (0.40s)
  17104. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17105. 1602.97 s [unordered-containers] mapMaybe
  17106. 1602.97 s [unordered-containers] model: OK (0.05s)
  17107. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17108. 1602.97 s [unordered-containers] valid: OK (0.05s)
  17109. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17110. 1602.97 s [unordered-containers] mapMaybeWithKey
  17111. 1602.97 s [unordered-containers] model: OK (1.03s)
  17112. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17113. 1602.97 s [unordered-containers] valid: OK (0.48s)
  17114. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17115. 1602.97 s [unordered-containers] elems: OK (0.03s)
  17116. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17117. 1602.97 s [unordered-containers] keys: OK (0.02s)
  17118. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17119. 1602.97 s [unordered-containers] fromList
  17120. 1602.97 s [unordered-containers] model: OK (0.02s)
  17121. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17122. 1602.97 s [unordered-containers] valid: OK
  17123. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17124. 1602.97 s [unordered-containers] fromListWith
  17125. 1602.97 s [unordered-containers] model: OK (0.02s)
  17126. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17127. 1602.97 s [unordered-containers] valid: OK (0.01s)
  17128. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17129. 1602.97 s [unordered-containers] fromListWithKey
  17130. 1602.97 s [unordered-containers] model: OK (0.04s)
  17131. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17132. 1602.97 s [unordered-containers] valid: OK
  17133. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17134. 1602.97 s [unordered-containers] toList: OK (0.02s)
  17135. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17136. 1602.97 s [unordered-containers] Data.HashMap.Strict
  17137. 1602.97 s [unordered-containers] instances
  17138. 1602.97 s [unordered-containers] Eq
  17139. 1602.97 s [unordered-containers] ==: OK (0.03s)
  17140. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17141. 1602.97 s [unordered-containers] /=: OK (0.05s)
  17142. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17143. 1602.97 s [unordered-containers] Ord
  17144. 1602.97 s [unordered-containers] compare reflexive: OK (0.02s)
  17145. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17146. 1602.97 s [unordered-containers] compare transitive: OK (0.07s)
  17147. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17148. 1602.97 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17149. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17150. 1602.97 s [unordered-containers] Ord => Eq: OK (0.02s)
  17151. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17152. 1602.97 s [unordered-containers] Read/Show: OK (0.31s)
  17153. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17154. 1602.97 s [unordered-containers] Functor: OK (0.07s)
  17155. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17156. 1602.97 s [unordered-containers] Foldable: OK (0.02s)
  17157. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17158. 1602.97 s [unordered-containers] Bifoldable
  17159. 1602.97 s [unordered-containers] bifoldMap: OK (0.02s)
  17160. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17161. 1602.97 s [unordered-containers] bifoldr: OK (0.03s)
  17162. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17163. 1602.97 s [unordered-containers] bifoldl: OK (0.01s)
  17164. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17165. 1602.97 s [unordered-containers] Hashable: OK (0.02s)
  17166. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17167. 1602.97 s [unordered-containers] empty
  17168. 1602.97 s [unordered-containers] valid: OK
  17169. 1602.97 s [unordered-containers] +++ OK, passed 1 test.
  17170. 1602.97 s [unordered-containers] singleton
  17171. 1602.97 s [unordered-containers] valid: OK
  17172. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17173. 1602.97 s [unordered-containers] size: OK
  17174. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17175. 1602.97 s [unordered-containers] member: OK (0.02s)
  17176. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17177. 1602.97 s [unordered-containers] lookup: OK (0.02s)
  17178. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17179. 1602.97 s [unordered-containers] !?: OK (0.01s)
  17180. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17181. 1602.97 s [unordered-containers] insert
  17182. 1602.97 s [unordered-containers] model: OK (0.02s)
  17183. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17184. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17185. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17186. 1602.97 s [unordered-containers] insertWith
  17187. 1602.97 s [unordered-containers] insertWith: OK (0.04s)
  17188. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17189. 1602.97 s [unordered-containers] valid: OK
  17190. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17191. 1602.97 s [unordered-containers] delete
  17192. 1602.97 s [unordered-containers] model: OK (0.02s)
  17193. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17194. 1602.97 s [unordered-containers] valid: OK
  17195. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17196. 1602.97 s [unordered-containers] adjust
  17197. 1602.97 s [unordered-containers] model: OK (0.02s)
  17198. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17199. 1602.97 s [unordered-containers] valid: OK
  17200. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17201. 1602.97 s [unordered-containers] update
  17202. 1602.97 s [unordered-containers] model: OK (0.01s)
  17203. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17204. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17205. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17206. 1602.97 s [unordered-containers] alter
  17207. 1602.97 s [unordered-containers] model: OK (0.01s)
  17208. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17209. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17210. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17211. 1602.97 s [unordered-containers] alterF
  17212. 1602.97 s [unordered-containers] model
  17213. 1602.97 s [unordered-containers] []: OK (0.13s)
  17214. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17215. 1602.97 s [unordered-containers] adjust: OK (0.02s)
  17216. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17217. 1602.97 s [unordered-containers] insert: OK (0.03s)
  17218. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17219. 1602.97 s [unordered-containers] insertWith: OK (0.02s)
  17220. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17221. 1602.97 s [unordered-containers] delete: OK (0.02s)
  17222. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17223. 1602.97 s [unordered-containers] lookup: OK (0.01s)
  17224. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17225. 1602.97 s [unordered-containers] valid: OK (0.05s)
  17226. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17227. 1602.97 s [unordered-containers] isSubmapOf
  17228. 1602.97 s [unordered-containers] model: OK (0.02s)
  17229. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17230. 1602.97 s [unordered-containers] m ⊆ m: OK (0.01s)
  17231. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17232. 1602.97 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  17233. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17234. 1602.97 s [unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
  17235. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17236. 1602.97 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.04s)
  17237. 1602.97 s [unordered-containers] +++ OK, passed 100 tests; 166 discarded.
  17238. 1602.97 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  17239. 1602.97 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  17240. 1602.97 s [unordered-containers] m ⊈ delete k m : OK
  17241. 1602.97 s [unordered-containers] +++ OK, passed 100 tests; 19 discarded.
  17242. 1602.97 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  17243. 1602.97 s [unordered-containers] +++ OK, passed 100 tests; 4 discarded.
  17244. 1602.97 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  17245. 1602.97 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  17246. 1602.97 s [unordered-containers] union
  17247. 1602.97 s [unordered-containers] model: OK (0.04s)
  17248. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17249. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17250. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17251. 1602.97 s [unordered-containers] unionWith
  17252. 1602.97 s [unordered-containers] model: OK (0.06s)
  17253. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17254. 1602.97 s [unordered-containers] valid: OK (0.05s)
  17255. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17256. 1602.97 s [unordered-containers] unionWithKey
  17257. 1602.97 s [unordered-containers] model: OK (0.10s)
  17258. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17259. 1602.97 s [unordered-containers] valid: OK (0.10s)
  17260. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17261. 1602.97 s [unordered-containers] unions
  17262. 1602.97 s [unordered-containers] model: OK (0.89s)
  17263. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17264. 1602.97 s [unordered-containers] valid: OK (0.64s)
  17265. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17266. 1602.97 s [unordered-containers] difference
  17267. 1602.97 s [unordered-containers] model: OK (0.03s)
  17268. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17269. 1602.97 s [unordered-containers] valid: OK (0.03s)
  17270. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17271. 1602.97 s [unordered-containers] differenceWith
  17272. 1602.97 s [unordered-containers] model: OK (0.09s)
  17273. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17274. 1602.97 s [unordered-containers] valid: OK (0.08s)
  17275. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17276. 1602.97 s [unordered-containers] intersection
  17277. 1602.97 s [unordered-containers] model: OK (0.02s)
  17278. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17279. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17280. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17281. 1602.97 s [unordered-containers] intersectionWith
  17282. 1602.97 s [unordered-containers] model: OK (0.07s)
  17283. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17284. 1602.97 s [unordered-containers] valid: OK (0.05s)
  17285. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17286. 1602.97 s [unordered-containers] intersectionWithKey
  17287. 1602.97 s [unordered-containers] model: OK (0.13s)
  17288. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17289. 1602.97 s [unordered-containers] valid: OK (0.07s)
  17290. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17291. 1602.97 s [unordered-containers] compose
  17292. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17293. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17294. 1602.97 s [unordered-containers] map
  17295. 1602.97 s [unordered-containers] model: OK (0.15s)
  17296. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17297. 1602.97 s [unordered-containers] valid: OK (0.05s)
  17298. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17299. 1602.97 s [unordered-containers] traverseWithKey
  17300. 1602.97 s [unordered-containers] model: OK (0.67s)
  17301. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17302. 1602.97 s [unordered-containers] valid: OK (0.02s)
  17303. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17304. 1602.97 s [unordered-containers] mapKeys
  17305. 1602.97 s [unordered-containers] model: OK (0.02s)
  17306. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17307. 1602.97 s [unordered-containers] valid: OK (0.47s)
  17308. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17309. 1602.97 s [unordered-containers] foldr: OK (0.04s)
  17310. 1602.97 s [unordered-containers] +++ OK, passed 100 tests.
  17311. 1602.98 s [unordered-containers] foldl: OK (0.03s)
  17312. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17313. 1602.98 s [unordered-containers] foldrWithKey: OK (0.02s)
  17314. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17315. 1602.98 s [unordered-containers] foldlWithKey: OK (0.02s)
  17316. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17317. 1602.98 s [unordered-containers] foldrWithKey': OK (0.01s)
  17318. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17319. 1602.98 s [unordered-containers] foldlWithKey': OK (0.02s)
  17320. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17321. 1602.98 s [unordered-containers] foldl': OK (0.02s)
  17322. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17323. 1602.98 s [unordered-containers] foldr': OK (0.04s)
  17324. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17325. 1602.98 s [unordered-containers] foldMapWithKey: OK (0.03s)
  17326. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17327. 1602.98 s [unordered-containers] filter
  17328. 1602.98 s [unordered-containers] model: OK (0.10s)
  17329. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17330. 1602.98 s [unordered-containers] valid: OK (0.06s)
  17331. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17332. 1602.98 s [unordered-containers] filterWithKey
  17333. 1602.98 s [unordered-containers] model: OK (0.78s)
  17334. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17335. 1602.98 s [unordered-containers] valid: OK (0.64s)
  17336. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17337. 1602.98 s [unordered-containers] mapMaybe
  17338. 1602.98 s [unordered-containers] model: OK (0.08s)
  17339. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17340. 1602.98 s [unordered-containers] valid: OK (0.07s)
  17341. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17342. 1602.98 s [unordered-containers] mapMaybeWithKey
  17343. 1602.98 s [unordered-containers] model: OK (0.77s)
  17344. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17345. 1602.98 s [unordered-containers] valid: OK (0.47s)
  17346. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17347. 1602.98 s [unordered-containers] elems: OK (0.03s)
  17348. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17349. 1602.98 s [unordered-containers] keys: OK (0.03s)
  17350. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17351. 1602.98 s [unordered-containers] fromList
  17352. 1602.98 s [unordered-containers] model: OK
  17353. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17354. 1602.98 s [unordered-containers] valid: OK (0.02s)
  17355. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17356. 1602.98 s [unordered-containers] fromListWith
  17357. 1602.98 s [unordered-containers] model: OK (0.03s)
  17358. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17359. 1602.98 s [unordered-containers] valid: OK (0.05s)
  17360. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17361. 1602.98 s [unordered-containers] fromListWithKey
  17362. 1602.98 s [unordered-containers] model: OK (0.04s)
  17363. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17364. 1602.98 s [unordered-containers] valid: OK (0.07s)
  17365. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17366. 1602.98 s [unordered-containers] toList: OK (0.04s)
  17367. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17368. 1602.98 s [unordered-containers] Data.HashSet
  17369. 1602.98 s [unordered-containers] instances
  17370. 1602.98 s [unordered-containers] Eq
  17371. 1602.98 s [unordered-containers] ==: OK (0.04s)
  17372. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17373. 1602.98 s [unordered-containers] == permutations: OK (0.02s)
  17374. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17375. 1602.98 s [unordered-containers] /=: OK (0.03s)
  17376. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17377. 1602.98 s [unordered-containers] Ord
  17378. 1602.98 s [unordered-containers] compare reflexive: OK
  17379. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17380. 1602.98 s [unordered-containers] compare transitive: OK (0.03s)
  17381. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17382. 1602.98 s [unordered-containers] compare antisymmetric: OK (0.05s)
  17383. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17384. 1602.98 s [unordered-containers] Ord => Eq: OK (0.04s)
  17385. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17386. 1602.98 s [unordered-containers] Read/Show: OK (0.31s)
  17387. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17388. 1602.98 s [unordered-containers] Foldable: OK (0.02s)
  17389. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17390. 1602.98 s [unordered-containers] Hashable: OK (0.02s)
  17391. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17392. 1602.98 s [unordered-containers] size: OK (0.02s)
  17393. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17394. 1602.98 s [unordered-containers] member: OK (0.01s)
  17395. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17396. 1602.98 s [unordered-containers] insert: OK
  17397. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17398. 1602.98 s [unordered-containers] delete: OK (0.04s)
  17399. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17400. 1602.98 s [unordered-containers] union: OK (0.04s)
  17401. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17402. 1602.98 s [unordered-containers] map: OK (0.52s)
  17403. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17404. 1602.98 s [unordered-containers] foldr: OK (0.03s)
  17405. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17406. 1602.98 s [unordered-containers] foldl': OK (0.04s)
  17407. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17408. 1602.98 s [unordered-containers] filter: OK (0.45s)
  17409. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17410. 1602.98 s [unordered-containers] toList: OK (0.03s)
  17411. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17412. 1602.98 s [unordered-containers] Data.HashMap.Internal.List
  17413. 1602.98 s [unordered-containers] isPermutationBy: OK (0.02s)
  17414. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17415. 1602.98 s [unordered-containers] isPermutationBy of different length: OK
  17416. 1602.98 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  17417. 1602.98 s [unordered-containers] pUnorderedCompare: OK (0.07s)
  17418. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17419. 1602.98 s [unordered-containers] modelUnorderedCompare
  17420. 1602.98 s [unordered-containers] reflexive: OK
  17421. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17422. 1602.98 s [unordered-containers] anti-symmetric: OK
  17423. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17424. 1602.98 s [unordered-containers] transitive: OK (0.03s)
  17425. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17426. 1602.98 s [unordered-containers] Regression tests
  17427. 1602.98 s [unordered-containers] issue32: OK
  17428. 1602.98 s [unordered-containers] issue39a: OK
  17429. 1602.98 s [unordered-containers] issue39b: OK (0.03s)
  17430. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17431. 1602.98 s [unordered-containers] issue254 lazy: OK
  17432. 1602.98 s [unordered-containers] issue254 strict: OK
  17433. 1602.98 s [unordered-containers] issue379
  17434. 1602.98 s [unordered-containers] Lazy.unionWith: OK
  17435. 1602.98 s [unordered-containers] union: OK
  17436. 1602.98 s [unordered-containers] Strict.unionWith: OK
  17437. 1602.98 s [unordered-containers] Strict.unionWithKey: OK
  17438. 1602.98 s [unordered-containers] issue381
  17439. 1602.98 s [unordered-containers] mapMaybe: OK
  17440. 1602.98 s [unordered-containers] mapMaybeWithKey: OK
  17441. 1602.98 s [unordered-containers] issue382: OK (0.01s)
  17442. 1602.98 s [unordered-containers] issue383: OK
  17443. 1602.98 s [unordered-containers] issue420: OK
  17444. 1602.98 s [unordered-containers] issue491
  17445. 1602.98 s [unordered-containers] 1: OK
  17446. 1602.98 s [unordered-containers] 2: OK
  17447. 1602.98 s [unordered-containers] 3: OK
  17448. 1602.98 s [unordered-containers] Strictness
  17449. 1602.98 s [unordered-containers] HashMap.Strict
  17450. 1602.98 s [unordered-containers] singleton is key-strict: OK
  17451. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17452. 1602.98 s [unordered-containers] singleton is value-strict: OK
  17453. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17454. 1602.98 s [unordered-containers] member is key-strict: OK
  17455. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17456. 1602.98 s [unordered-containers] lookup is key-strict: OK (0.02s)
  17457. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17458. 1602.98 s [unordered-containers] lookupDefault is key-strict: OK
  17459. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17460. 1602.98 s [unordered-containers] findWithDefault is key-strict: OK
  17461. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17462. 1602.98 s [unordered-containers] ! is key-strict: OK
  17463. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17464. 1602.98 s [unordered-containers] delete is key-strict: OK
  17465. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17466. 1602.98 s [unordered-containers] adjust is key-strict: OK
  17467. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17468. 1602.98 s [unordered-containers] adjust is value-strict: OK (0.02s)
  17469. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17470. 1602.98 s [unordered-containers] insert is key-strict: OK
  17471. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17472. 1602.98 s [unordered-containers] insert is value-strict: OK
  17473. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17474. 1602.98 s [unordered-containers] insertWith is key-strict: OK
  17475. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17476. 1602.98 s [unordered-containers] insertWith is value-strict: OK (0.02s)
  17477. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17478. 1602.98 s [unordered-containers] fromList is key-strict: OK
  17479. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17480. 1602.98 s [unordered-containers] fromList is value-strict: OK
  17481. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17482. 1602.98 s [unordered-containers] fromListWith is key-strict: OK
  17483. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17484. 1602.98 s [unordered-containers] fromListWith is value-strict: OK
  17485. 1602.98 s [unordered-containers] +++ OK, passed 100 tests.
  17486. 1602.98 s [unordered-containers]
  17487. 1602.98 s [unordered-containers] All 257 tests passed (1.27s)
  17488. 1602.98 s [unordered-containers] Test suite unordered-containers-tests: PASS
  17489. 1602.98 s [unordered-containers] Test suite logged to:
  17490. 1602.98 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  17491. 1602.98 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  17492. 1602.99 s [unordered-containers] checkPhase completed in 1 minutes 12 seconds
  17493. 1602.99 s [unordered-containers] Phase: haddockPhase
  17494. 1603.02 s [shellcheck] Phase: unpackPhase
  17495. 1603.03 s [shellcheck] unpacking source archive /nix/store/0y569php6xr1v629bbggizl1ba1mrf5b-ShellCheck-0.11.0.tar.gz
  17496. 1603.04 s [shellcheck] source root is ShellCheck-0.11.0
  17497. 1603.05 s [shellcheck] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "ShellCheck-0.11.0/test/shellcheck.hs"
  17498. 1603.05 s [shellcheck] Phase: patchPhase
  17499. 1603.12 s [shellcheck] Phase: updateAutotoolsGnuConfigScriptsPhase
  17500. 1603.13 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  17501. 1603.13 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
  17502. 1603.14 s [shellcheck] Phase: configurePhase
  17503. 1603.18 s [shellcheck] no configure script, doing nothing
  17504. 1603.18 s [shellcheck] Phase: buildPhase
  17505. 1603.19 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17506. 1603.25 s [shellcheck] Phase: installPhase
  17507. 1603.27 s [shellcheck] Phase: fixupPhase
  17508. 1603.29 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
  17509. 1603.30 s [shellcheck] shrinking /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin/shellcheck
  17510. 1603.31 s [shellcheck] checking for references to /build/ in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin...
  17511. 1603.33 s [shellcheck] patching script interpreter paths in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
  17512. 1603.33 s [shellcheck] stripping (with command strip and flags -S -p) in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin
  17513. 1603.36 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
  17514. 1603.36 s [shellcheck] checking for references to /build/ in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man...
  17515. 1603.36 s [unordered-containers]
  17516. 1603.36 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  17517. 1603.36 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17518. 1603.37 s [unordered-containers] |
  17519. 1603.37 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17520. 1603.37 s [unordered-containers] | ^^^^^^^^^^
  17521. 1603.37 s [shellcheck] gzipping man pages under /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man/share/man/
  17522. 1603.38 s [shellcheck] patching script interpreter paths in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
  17523. 1603.38 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
  17524. 1603.38 s [shellcheck] checking for references to /build/ in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc...
  17525. 1603.39 s [shellcheck] patching script interpreter paths in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
  17526. 1603.39 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
  17527. 1603.40 s [shellcheck] checking for references to /build/ in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0...
  17528. 1603.40 s [shellcheck] patching script interpreter paths in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
  17529. 1603.47 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
  17530. 1603.91 s [shellcheck:post-build] Nothing to push - all store paths are already on Cachix.
  17531. 1603.92 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
  17532. 1603.97 s [shellcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17533. 1604.00 s [shellcheck:post-build] copying 1 paths...
  17534. 1604.00 s [shellcheck:post-build] copying path '/nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin' to 'https://cache.nix-ci.com'...
  17535. 1606.42 s [shellcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17536. 1606.57 s [shellcheck:post-build] copying 0 paths...
  17537. 1606.62 s Progress: 28 of 38 built (1 building), 559 of 559 downloaded from cache
  17538. 1606.67 s Building /nix/store/na71b1qblfcv0x84nz68yybh61b6qjlv-bash-language-server-5.6.0.drv
  17539. 1606.67 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  17540. 1606.67 s [unordered-containers]
  17541. 1606.67 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  17542. 1606.68 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17543. 1606.68 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17544. 1606.68 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17545. 1606.68 s [unordered-containers] |
  17546. 1606.68 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17547. 1606.68 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17548. 1606.68 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  17549. 1606.68 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  17550. 1606.68 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  17551. 1606.68 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  17552. 1606.68 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  17553. 1606.68 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  17554. 1606.68 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  17555. 1606.68 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  17556. 1606.68 s [unordered-containers] Haddock coverage:
  17557. 1606.68 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  17558. 1606.68 s [unordered-containers] Missing documentation for:
  17559. 1606.68 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  17560. 1606.68 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  17561. 1606.68 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  17562. 1606.68 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  17563. 1606.68 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  17564. 1606.68 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  17565. 1606.68 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  17566. 1606.68 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  17567. 1606.68 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  17568. 1606.68 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  17569. 1606.68 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  17570. 1606.68 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  17571. 1606.68 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  17572. 1606.68 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  17573. 1606.68 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  17574. 1606.68 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  17575. 1606.68 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  17576. 1606.68 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  17577. 1606.68 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  17578. 1606.68 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  17579. 1606.68 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  17580. 1606.68 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  17581. 1606.68 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  17582. 1606.68 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  17583. 1606.68 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  17584. 1606.68 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  17585. 1606.68 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  17586. 1606.68 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  17587. 1606.68 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  17588. 1606.68 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  17589. 1606.68 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  17590. 1606.68 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  17591. 1606.68 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  17592. 1606.68 s [unordered-containers] Missing documentation for:
  17593. 1606.68 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  17594. 1606.68 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  17595. 1606.68 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  17596. 1606.68 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  17597. 1606.68 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  17598. 1606.68 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  17599. 1606.68 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17600. 1606.68 s [unordered-containers] by specifying the type/value namespace explicitly.
  17601. 1606.68 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  17602. 1606.68 s [unordered-containers] Warning: 'at' is out of scope.
  17603. 1606.68 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17604. 1606.68 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  17605. 1606.68 s [unordered-containers] Missing documentation for:
  17606. 1606.68 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  17607. 1606.68 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  17608. 1606.68 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  17609. 1606.68 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  17610. 1606.68 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  17611. 1606.68 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  17612. 1606.68 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  17613. 1606.68 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  17614. 1606.68 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  17615. 1606.68 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  17616. 1606.68 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  17617. 1606.68 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  17618. 1606.68 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  17619. 1606.68 s [unordered-containers] Missing documentation for:
  17620. 1606.68 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  17621. 1606.68 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  17622. 1606.68 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  17623. 1606.68 s [unordered-containers] Warning: 'lookup' is out of scope.
  17624. 1606.68 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17625. 1606.68 s [unordered-containers] Warning: 'at' is out of scope.
  17626. 1606.68 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17627. 1606.68 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  17628. 1606.68 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17629. 1606.68 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17630. 1606.68 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17631. 1606.68 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17632. 1606.68 s [unordered-containers] by specifying the type/value namespace explicitly.
  17633. 1606.68 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17634. 1606.68 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  17635. 1606.68 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17636. 1606.68 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17637. 1606.68 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17638. 1606.68 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17639. 1606.68 s [unordered-containers] by specifying the type/value namespace explicitly.
  17640. 1606.68 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17641. 1606.68 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  17642. 1606.68 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  17643. 1606.68 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  17644. 1606.68 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  17645. 1606.68 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17646. 1606.68 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  17647. 1606.68 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17648. 1606.68 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  17649. 1606.68 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17650. 1606.68 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  17651. 1606.68 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17652. 1606.68 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  17653. 1606.68 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17654. 1606.68 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  17655. 1606.68 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17656. 1606.71 s [bash-language-server] Using versionCheckHook
  17657. 1606.75 s [bash-language-server] Phase: unpackPhase
  17658. 1606.76 s [bash-language-server] unpacking source archive /nix/store/lxydhrakpk9ccbjzavdgm3f3imkypnw2-source
  17659. 1606.79 s [bash-language-server] source root is source
  17660. 1606.80 s [bash-language-server] Phase: patchPhase
  17661. 1606.81 s [bash-language-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  17662. 1606.82 s [bash-language-server] Phase: configurePhase
  17663. 1606.83 s [bash-language-server] no configure script, doing nothing
  17664. 1606.83 s [bash-language-server] Executing pnpmConfigHook
  17665. 1607.39 s [bash-language-server] Found 'pnpm' with version '10.28.0'
  17666. 1607.39 s [bash-language-server] Using fetcherVersion: 3
  17667. 1607.39 s [bash-language-server] Configuring pnpm store
  17668. 1607.81 s [bash-language-server] /build /build/source
  17669. 1608.17 s [bash-language-server] /build/source
  17670. 1608.73 s [bash-language-server] Installing dependencies
  17671. 1608.88 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  17672. 1608.88 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  17673. 1608.95 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17674. 1608.96 s [unordered-containers] Phase: installPhase
  17675. 1609.02 s [unordered-containers] Installing library in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  17676. 1609.09 s [bash-language-server] Lockfile is up to date, resolution step is skipped
  17677. 1609.12 s [bash-language-server] Progress: resolved 1, reused 0, downloaded 0, added 0
  17678. 1609.17 s [bash-language-server] . | +416
  17679. 1609.17 s [bash-language-server] Progress: resolved 1, reused 0, downloaded 0, added 0
  17680. 1609.32 s [bash-language-server] Progress: resolved 416, reused 244, downloaded 0, added 0
  17681. 1609.43 s [unordered-containers] Phase: fixupPhase
  17682. 1609.45 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
  17683. 1609.45 s [unordered-containers] shrinking /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSunordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78-ghc9.8.4.so
  17684. 1609.48 s [unordered-containers] checking for references to /build/ in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1...
  17685. 1609.50 s [unordered-containers] patching script interpreter paths in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
  17686. 1609.50 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1/lib
  17687. 1609.52 s [bash-language-server] Progress: resolved 416, reused 416, downloaded 0, added 224
  17688. 1609.64 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc
  17689. 1609.65 s [unordered-containers] checking for references to /build/ in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc...
  17690. 1609.68 s [unordered-containers] patching script interpreter paths in /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc
  17691. 1609.81 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
  17692. 1610.18 s [unordered-containers:post-build] Nothing to push - all store paths are already on Cachix.
  17693. 1610.20 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/s25wpdhrla713qwx34f43yhsmiizm34q-unordered-containers-0.2.20.1-doc /nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1
  17694. 1610.25 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17695. 1610.29 s [unordered-containers:post-build] copying 1 paths...
  17696. 1610.29 s [unordered-containers:post-build] copying path '/nix/store/v8iqk59nmmb81dk31pp4sz43amkr8gsg-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  17697. 1612.75 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17698. 1612.82 s [unordered-containers:post-build] copying 0 paths...
  17699. 1612.84 s Progress: 29 of 38 built (1 building), 559 of 559 downloaded from cache
  17700. 1612.90 s Building /nix/store/c1cwys0z767qcz2bh7ipnhm9pcrxdypk-quickcheck-instances-0.3.33.drv
  17701. 1612.90 s [bash-language-server] Progress: resolved 416, reused 416, downloaded 0, added 413
  17702. 1612.90 s [bash-language-server] Progress: resolved 416, reused 416, downloaded 0, added 416, done
  17703. 1612.90 s [bash-language-server] Done in 1.2s using pnpm v10.28.0
  17704. 1612.90 s [bash-language-server] Patching scripts
  17705. 1612.90 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
  17706. 1612.90 s [bash-language-server] node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17707. 1612.90 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"
  17708. 1612.90 s [bash-language-server] node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17709. 1612.90 s [bash-language-server] node_modules/.bin/ts-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17710. 1612.90 s [bash-language-server] node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17711. 1612.90 s [bash-language-server] node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17712. 1612.90 s [bash-language-server] node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17713. 1612.90 s [bash-language-server] node_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17714. 1612.90 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"
  17715. 1612.90 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"
  17716. 1612.90 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"
  17717. 1612.90 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"
  17718. 1612.90 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"
  17719. 1612.90 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"
  17720. 1612.90 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"
  17721. 1612.90 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"
  17722. 1612.90 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"
  17723. 1612.90 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"
  17724. 1612.90 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"
  17725. 1612.90 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"
  17726. 1612.90 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"
  17727. 1612.90 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"
  17728. 1612.90 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"
  17729. 1612.90 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"
  17730. 1612.90 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"
  17731. 1612.90 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"
  17732. 1612.90 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"
  17733. 1612.90 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"
  17734. 1612.90 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"
  17735. 1612.90 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"
  17736. 1612.90 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"
  17737. 1612.90 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"
  17738. 1612.90 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"
  17739. 1612.90 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"
  17740. 1612.90 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"
  17741. 1612.90 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"
  17742. 1612.90 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"
  17743. 1612.90 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"
  17744. 1612.90 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"
  17745. 1612.90 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"
  17746. 1612.90 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"
  17747. 1612.90 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"
  17748. 1612.90 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"
  17749. 1612.90 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"
  17750. 1612.91 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"
  17751. 1612.91 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"
  17752. 1612.91 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"
  17753. 1612.91 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"
  17754. 1612.91 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"
  17755. 1612.91 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"
  17756. 1612.91 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"
  17757. 1612.91 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"
  17758. 1612.91 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"
  17759. 1612.91 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"
  17760. 1612.91 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"
  17761. 1612.91 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"
  17762. 1612.91 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"
  17763. 1612.91 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"
  17764. 1612.91 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"
  17765. 1612.91 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"
  17766. 1612.91 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"
  17767. 1612.91 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"
  17768. 1612.91 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"
  17769. 1612.91 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"
  17770. 1612.91 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"
  17771. 1612.91 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"
  17772. 1612.91 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"
  17773. 1612.91 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"
  17774. 1612.91 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"
  17775. 1612.91 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"
  17776. 1612.91 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"
  17777. 1612.91 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"
  17778. 1612.91 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"
  17779. 1612.91 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"
  17780. 1612.91 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"
  17781. 1612.91 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"
  17782. 1612.91 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"
  17783. 1612.91 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"
  17784. 1612.91 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"
  17785. 1612.91 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"
  17786. 1612.91 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"
  17787. 1612.92 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"
  17788. 1612.93 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"
  17789. 1612.94 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"
  17790. 1612.96 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"
  17791. 1612.97 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"
  17792. 1612.99 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"
  17793. 1613.00 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"
  17794. 1613.01 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"
  17795. 1613.02 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"
  17796. 1613.03 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"
  17797. 1613.04 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"
  17798. 1613.05 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"
  17799. 1613.06 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  17800. 1613.06 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"
  17801. 1613.07 s [quickcheck-instances] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
  17802. 1613.07 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"
  17803. 1613.09 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"
  17804. 1613.10 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"
  17805. 1613.11 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"
  17806. 1613.13 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"
  17807. 1613.14 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"
  17808. 1613.15 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"
  17809. 1613.16 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"
  17810. 1613.17 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"
  17811. 1613.18 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"
  17812. 1613.19 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"
  17813. 1613.20 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"
  17814. 1613.21 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"
  17815. 1613.22 s [bash-language-server] Finished pnpmConfigHook
  17816. 1613.22 s [bash-language-server] Phase: buildPhase
  17817. 1613.27 s [quickcheck-instances] Phase: unpackPhase
  17818. 1613.28 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  17819. 1613.29 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  17820. 1613.29 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  17821. 1613.30 s [quickcheck-instances] Phase: patchPhase
  17822. 1613.30 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  17823. 1613.31 s [quickcheck-instances] Phase: compileBuildDriverPhase
  17824. 1613.31 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.UzC5wXVn3L/setup-package.conf.d -threaded
  17825. 1613.35 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.UzC5wXVn3L/Main.o )
  17826. 1613.42 s [quickcheck-instances] [2 of 2] Linking Setup
  17827. 1613.53 s [bash-language-server]
  17828. 1613.53 s [bash-language-server] > @ compile /build/source
  17829. 1613.53 s [bash-language-server] > tsc -b server
  17830. 1613.53 s [bash-language-server]
  17831. 1614.95 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  17832. 1614.96 s [quickcheck-instances] Phase: configurePhase
  17833. 1614.99 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.UzC5wXVn3L/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
  17834. 1614.99 s [quickcheck-instances] Using Parsec parser
  17835. 1614.99 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  17836. 1615.34 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  17837. 1615.34 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  17838. 1615.34 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  17839. 1615.34 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.19.2.0
  17840. 1615.34 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.1.0
  17841. 1615.34 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  17842. 1615.34 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
  17843. 1615.34 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  17844. 1615.34 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  17845. 1615.34 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  17846. 1615.34 s [quickcheck-instances] integer-logarithms-1.0.4
  17847. 1615.34 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  17848. 1615.34 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  17849. 1615.34 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  17850. 1615.34 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  17851. 1615.34 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  17852. 1615.34 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  17853. 1615.34 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.1
  17854. 1615.34 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  17855. 1615.34 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  17856. 1615.34 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  17857. 1615.34 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  17858. 1615.34 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  17859. 1615.35 s [quickcheck-instances] unordered-containers-0.2.20.1
  17860. 1615.35 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  17861. 1615.35 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  17862. 1615.35 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  17863. 1615.35 s [quickcheck-instances] Dependency base: using base-4.19.2.0
  17864. 1615.35 s [quickcheck-instances] Dependency containers: using containers-0.6.8
  17865. 1615.35 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  17866. 1615.35 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  17867. 1615.35 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  17868. 1615.35 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  17869. 1615.48 s [bash-language-server] Phase: installPhase
  17870. 1615.65 s [quickcheck-instances] Source component graph:
  17871. 1615.65 s [quickcheck-instances] component lib
  17872. 1615.65 s [quickcheck-instances] component test:self-test dependency lib
  17873. 1615.65 s [quickcheck-instances] Configured component graph:
  17874. 1615.65 s [quickcheck-instances] component quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  17875. 1615.65 s [quickcheck-instances] include OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
  17876. 1615.65 s [quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  17877. 1615.65 s [quickcheck-instances] include array-0.5.8.0-cf4f
  17878. 1615.65 s [quickcheck-instances] include base-4.19.2.0-8274
  17879. 1615.65 s [quickcheck-instances] include bytestring-0.12.1.0-b028
  17880. 1615.65 s [quickcheck-instances] include case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
  17881. 1615.65 s [quickcheck-instances] include containers-0.6.8-15d9
  17882. 1615.65 s [quickcheck-instances] include data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
  17883. 1615.65 s [quickcheck-instances] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  17884. 1615.65 s [quickcheck-instances] include integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
  17885. 1615.65 s [quickcheck-instances] include old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
  17886. 1615.65 s [quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
  17887. 1615.65 s [quickcheck-instances] include scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
  17888. 1615.65 s [quickcheck-instances] include splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
  17889. 1615.65 s [quickcheck-instances] include strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
  17890. 1615.65 s [quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
  17891. 1615.65 s [quickcheck-instances] include text-2.1.1-5314
  17892. 1615.65 s [quickcheck-instances] include text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
  17893. 1615.65 s [quickcheck-instances] include these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
  17894. 1615.65 s [quickcheck-instances] include time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
  17895. 1615.65 s [quickcheck-instances] include transformers-0.6.1.0-388b
  17896. 1615.65 s [quickcheck-instances] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  17897. 1615.65 s [quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
  17898. 1615.65 s [quickcheck-instances] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
  17899. 1615.65 s [quickcheck-instances] component quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
  17900. 1615.65 s [quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  17901. 1615.65 s [quickcheck-instances] include base-4.19.2.0-8274
  17902. 1615.65 s [quickcheck-instances] include containers-0.6.8-15d9
  17903. 1615.65 s [quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
  17904. 1615.65 s [quickcheck-instances] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  17905. 1615.65 s [quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
  17906. 1615.65 s [quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
  17907. 1615.65 s [quickcheck-instances] Linked component graph:
  17908. 1615.65 s [quickcheck-instances] unit quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  17909. 1615.65 s [quickcheck-instances] include OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
  17910. 1615.65 s [quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  17911. 1615.65 s [quickcheck-instances] include array-0.5.8.0-cf4f
  17912. 1615.65 s [quickcheck-instances] include base-4.19.2.0-8274
  17913. 1615.65 s [quickcheck-instances] include bytestring-0.12.1.0-b028
  17914. 1615.65 s [quickcheck-instances] include case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
  17915. 1615.65 s [quickcheck-instances] include containers-0.6.8-15d9
  17916. 1615.65 s [quickcheck-instances] include data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
  17917. 1615.65 s [quickcheck-instances] include hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  17918. 1615.65 s [quickcheck-instances] include integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
  17919. 1615.65 s [quickcheck-instances] include old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
  17920. 1615.65 s [quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
  17921. 1615.65 s [quickcheck-instances] include scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
  17922. 1615.65 s [quickcheck-instances] include splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
  17923. 1615.65 s [quickcheck-instances] include strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
  17924. 1615.65 s [quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
  17925. 1615.65 s [quickcheck-instances] include text-2.1.1-5314
  17926. 1615.65 s [quickcheck-instances] include text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
  17927. 1615.65 s [quickcheck-instances] include these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
  17928. 1615.65 s [quickcheck-instances] include time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
  17929. 1615.65 s [quickcheck-instances] include transformers-0.6.1.0-388b
  17930. 1615.65 s [quickcheck-instances] include unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  17931. 1615.65 s [quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
  17932. 1615.65 s [quickcheck-instances] include vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
  17933. 1615.65 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW:Test.QuickCheck.Instances.Void
  17934. 1615.66 s [quickcheck-instances] unit quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
  17935. 1615.66 s [quickcheck-instances] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  17936. 1615.66 s [quickcheck-instances] include base-4.19.2.0-8274
  17937. 1615.66 s [quickcheck-instances] include containers-0.6.8-15d9
  17938. 1615.66 s [quickcheck-instances] include primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
  17939. 1615.66 s [quickcheck-instances] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  17940. 1615.66 s [quickcheck-instances] include tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
  17941. 1615.66 s [quickcheck-instances] include uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
  17942. 1615.66 s [quickcheck-instances] Ready component graph:
  17943. 1615.66 s [quickcheck-instances] definite quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  17944. 1615.66 s [quickcheck-instances] depends OneTuple-0.4.2-3dnbGs3iswl7RfPlzcJwqJ
  17945. 1615.66 s [quickcheck-instances] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  17946. 1615.66 s [quickcheck-instances] depends array-0.5.8.0-cf4f
  17947. 1615.66 s [quickcheck-instances] depends base-4.19.2.0-8274
  17948. 1615.66 s [quickcheck-instances] depends bytestring-0.12.1.0-b028
  17949. 1615.66 s [quickcheck-instances] depends case-insensitive-1.2.1.0-A80fjc7bt7F8zyu1Co3PYR
  17950. 1615.66 s [quickcheck-instances] depends containers-0.6.8-15d9
  17951. 1615.66 s [quickcheck-instances] depends data-fix-0.3.4-360QE3oeLg37mRDz4E1QQM
  17952. 1615.66 s [quickcheck-instances] depends hashable-1.5.0.0-4y1qdXYWeKG4WieGKFVlDE
  17953. 1615.66 s [quickcheck-instances] depends integer-logarithms-1.0.4-agSqjWr09W26NT8ma47bp
  17954. 1615.66 s [quickcheck-instances] depends old-time-1.1.0.4-D73MxqqL3KfK08Nc3LLQEf
  17955. 1615.66 s [quickcheck-instances] depends primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
  17956. 1615.66 s [quickcheck-instances] depends scientific-0.3.8.0-GUBWFK4PPRa6pHV2jzXM87
  17957. 1615.66 s [quickcheck-instances] depends splitmix-0.1.3.1-Ap5ujF9ygfC1hmiXTupD1c
  17958. 1615.66 s [quickcheck-instances] depends strict-0.5.1-CPTwyWVhsgEFcK4y38LphJ
  17959. 1615.66 s [quickcheck-instances] depends tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
  17960. 1615.66 s [quickcheck-instances] depends text-2.1.1-5314
  17961. 1615.66 s [quickcheck-instances] depends text-short-0.1.6-DjkPcCVpjvo6ni5Bq060rV
  17962. 1615.66 s [quickcheck-instances] depends these-1.2.1-ARnkrz7xAAq8aGkU9KnuYZ
  17963. 1615.66 s [quickcheck-instances] depends time-compat-1.9.8-9ETWUZXGnzD3oVa6CRabZ
  17964. 1615.66 s [quickcheck-instances] depends transformers-0.6.1.0-388b
  17965. 1615.66 s [quickcheck-instances] depends unordered-containers-0.2.20.1-grUjel0ElLEWR1q3kjk78
  17966. 1615.66 s [quickcheck-instances] depends uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
  17967. 1615.66 s [quickcheck-instances] depends vector-0.13.2.0-F7uk3pysgNW73MNfNvohpp
  17968. 1615.66 s [quickcheck-instances] definite quickcheck-instances-0.3.33-DxDfyIwBSY3GtIh6NSz4ux-self-test
  17969. 1615.66 s [quickcheck-instances] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  17970. 1615.66 s [quickcheck-instances] depends base-4.19.2.0-8274
  17971. 1615.66 s [quickcheck-instances] depends containers-0.6.8-15d9
  17972. 1615.68 s [quickcheck-instances] depends primitive-0.9.1.0-KMBvVMR0bwgE22aD7nI8IP
  17973. 1615.68 s [quickcheck-instances] depends quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  17974. 1615.68 s [quickcheck-instances] depends tagged-0.8.9-APGK80s37ni7rnqVYo7lV4
  17975. 1615.68 s [quickcheck-instances] depends uuid-types-1.0.6-19ivyMU3WbZFr1BtViAvmH
  17976. 1615.68 s [quickcheck-instances] Using Cabal-3.10.3.0 compiled by ghc-9.8
  17977. 1615.68 s [quickcheck-instances] Using compiler: ghc-9.8.4
  17978. 1615.68 s [quickcheck-instances] Using install prefix:
  17979. 1615.68 s [quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
  17980. 1615.68 s [quickcheck-instances] Executables installed in:
  17981. 1615.68 s [quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/bin
  17982. 1615.68 s [quickcheck-instances] Libraries installed in:
  17983. 1615.68 s [quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  17984. 1615.68 s [quickcheck-instances] Dynamic Libraries installed in:
  17985. 1615.68 s [quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  17986. 1615.68 s [quickcheck-instances] Private executables installed in:
  17987. 1615.68 s [quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
  17988. 1615.68 s [quickcheck-instances] Data files installed in:
  17989. 1615.68 s [quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
  17990. 1615.68 s [quickcheck-instances] Documentation installed in:
  17991. 1615.68 s [quickcheck-instances] /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  17992. 1615.68 s [quickcheck-instances] Configuration files installed in:
  17993. 1615.68 s [quickcheck-instances] /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/etc
  17994. 1615.68 s [quickcheck-instances] No alex found
  17995. 1615.68 s [quickcheck-instances] Using ar found on system at:
  17996. 1615.68 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17997. 1615.68 s [quickcheck-instances] No c2hs found
  17998. 1615.68 s [quickcheck-instances] No cpphs found
  17999. 1615.68 s [quickcheck-instances] No doctest found
  18000. 1615.68 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  18001. 1615.68 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18002. 1615.68 s [quickcheck-instances] Using ghc version 9.8.4 found on system at:
  18003. 1615.68 s [quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
  18004. 1615.68 s [quickcheck-instances] Using ghc-pkg version 9.8.4 found on system at:
  18005. 1615.68 s [quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
  18006. 1615.68 s [quickcheck-instances] No ghcjs found
  18007. 1615.68 s [quickcheck-instances] No ghcjs-pkg found
  18008. 1615.68 s [quickcheck-instances] No greencard found
  18009. 1615.68 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  18010. 1615.68 s [quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
  18011. 1615.68 s [quickcheck-instances] No happy found
  18012. 1615.68 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  18013. 1615.68 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18014. 1615.68 s [quickcheck-instances] No hmake found
  18015. 1615.68 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  18016. 1615.68 s [quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
  18017. 1615.68 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  18018. 1615.68 s [quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  18019. 1615.68 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  18020. 1615.68 s [quickcheck-instances] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
  18021. 1615.68 s [quickcheck-instances] No jhc found
  18022. 1615.68 s [quickcheck-instances] Using ld found on system at:
  18023. 1615.68 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18024. 1615.69 s [quickcheck-instances] No pkg-config found
  18025. 1615.69 s [quickcheck-instances] Using runghc version 9.8.4 found on system at:
  18026. 1615.69 s [quickcheck-instances] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
  18027. 1615.69 s [quickcheck-instances] Using strip version 2.44 found on system at:
  18028. 1615.69 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18029. 1615.69 s [quickcheck-instances] Using tar found on system at:
  18030. 1615.69 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18031. 1615.69 s [quickcheck-instances] No uhc found
  18032. 1615.87 s [bash-language-server] Lockfile is up to date, resolution step is skipped
  18033. 1615.90 s [bash-language-server] Already up to date
  18034. 1615.93 s [quickcheck-instances] Phase: buildPhase
  18035. 1616.01 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18036. 1616.03 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33..
  18037. 1616.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 )
  18038. 1616.80 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 )
  18039. 1616.82 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 )
  18040. 1616.84 s [bash-language-server]
  18041. 1616.84 s [bash-language-server] devDependencies:
  18042. 1616.84 s [bash-language-server] - @types/jest 29.5.14
  18043. 1616.84 s [bash-language-server] - @types/node 18.19.86
  18044. 1616.84 s [bash-language-server] - @typescript-eslint/eslint-plugin 7.18.0
  18045. 1616.84 s [bash-language-server] - @typescript-eslint/parser 7.18.0
  18046. 1616.84 s [bash-language-server] - cross-spawn 7.0.6
  18047. 1616.84 s [bash-language-server] - eslint 8.57.1
  18048. 1616.84 s [bash-language-server] - eslint-config-prettier 9.1.0
  18049. 1616.84 s [bash-language-server] - eslint-plugin-jest 28.11.0
  18050. 1616.84 s [bash-language-server] - eslint-plugin-prettier 4.2.1
  18051. 1616.84 s [bash-language-server] - eslint-plugin-simple-import-sort 12.1.1
  18052. 1616.84 s [bash-language-server] - eslint-plugin-sort-class-members 1.21.0
  18053. 1616.84 s [bash-language-server] - jest 29.7.0
  18054. 1616.84 s [bash-language-server] - prettier 2.8.8
  18055. 1616.84 s [bash-language-server] - ts-jest 29.3.2
  18056. 1616.85 s [bash-language-server] - typescript 5.6.3
  18057. 1616.85 s [bash-language-server] - vscode-languageserver 8.0.2
  18058. 1616.85 s [bash-language-server] - vscode-languageserver-textdocument 1.0.12
  18059. 1616.85 s [bash-language-server]
  18060. 1617.10 s [bash-language-server] Phase: fixupPhase
  18061. 1617.10 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 )
  18062. 1617.12 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 )
  18063. 1617.12 s [bash-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  18064. 1617.26 s [bash-language-server] shrinking /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server
  18065. 1617.26 s [bash-language-server] checking for references to /build/ in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0...
  18066. 1617.40 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 )
  18067. 1617.40 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 )
  18068. 1617.40 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 )
  18069. 1617.40 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 )
  18070. 1617.40 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 )
  18071. 1617.40 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 )
  18072. 1617.40 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 )
  18073. 1617.40 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 )
  18074. 1617.40 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 )
  18075. 1617.40 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 )
  18076. 1617.42 s [bash-language-server] patching script interpreter paths in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  18077. 1617.43 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"
  18078. 1617.44 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"
  18079. 1617.45 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"
  18080. 1617.47 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 )
  18081. 1617.47 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 )
  18082. 1617.47 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.o, dist/build/Test/QuickCheck/Instances/Text/Short.dyn_o )
  18083. 1617.47 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.o, dist/build/Test/QuickCheck/Instances/These.dyn_o )
  18084. 1617.47 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.o, dist/build/Test/QuickCheck/Instances/Time.dyn_o )
  18085. 1617.78 s [bash-language-server] Phase: installCheckPhase
  18086. 1617.79 s [bash-language-server] Executing versionCheckPhase
  18087. 1617.94 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 )
  18088. 1617.94 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 )
  18089. 1617.94 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 )
  18090. 1617.94 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 )
  18091. 1617.94 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 )
  18092. 1617.94 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 )
  18093. 1617.99 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
  18094. 1617.99 s [bash-language-server] Usage:
  18095. 1617.99 s [bash-language-server] bash-language-server start Start listening on stdin/stdout
  18096. 1617.99 s [bash-language-server] bash-language-server -h, --help Display this help and exit
  18097. 1617.99 s [bash-language-server] bash-language-server -v, --version Print the version and exit
  18098. 1617.99 s [bash-language-server]
  18099. 1617.99 s [bash-language-server] Environment variables:
  18100. 1617.99 s [bash-language-server] BASH_IDE_LOG_LEVEL Set the log level (default: info)
  18101. 1617.99 s [bash-language-server]
  18102. 1617.99 s [bash-language-server] Further documentation: https://github.com/bash-lsp/bash-language-server
  18103. 1617.99 s [bash-language-server] (node:1257) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
  18104. 1617.99 s [bash-language-server] (Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
  18105. 1618.17 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
  18106. 1618.17 s [bash-language-server] 5.6.0
  18107. 1618.17 s [bash-language-server] (node:1268) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
  18108. 1618.17 s [bash-language-server] (Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
  18109. 1618.17 s [bash-language-server] Finished versionCheckPhase
  18110. 1618.17 s [bash-language-server] no Makefile or custom installCheckPhase, doing nothing
  18111. 1618.53 s [bash-language-server:post-build] Uploading to cachix cache "sellout": /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  18112. 1618.97 s [bash-language-server:post-build] Nothing to push - all store paths are already on Cachix.
  18113. 1618.99 s [bash-language-server:post-build] Uploading to the NixCI cache: /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  18114. 1619.04 s [bash-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18115. 1619.14 s [bash-language-server:post-build] copying 1 paths...
  18116. 1619.14 s [bash-language-server:post-build] copying path '/nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0' to 'https://cache.nix-ci.com'...
  18117. 1621.02 s [bash-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18118. 1621.14 s [bash-language-server:post-build] copying 0 paths...
  18119. 1621.18 s Progress: 30 of 38 built (1 building), 559 of 559 downloaded from cache
  18120. 1621.24 s Building /nix/store/zyxicd0liv81yslrfa6dab201msi5mja-project-manager-path-for-duoids.drv
  18121. 1621.24 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 )
  18122. 1621.24 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 )
  18123. 1621.24 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 )
  18124. 1621.24 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 )
  18125. 1621.24 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 )
  18126. 1621.24 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 )
  18127. 1621.24 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 )
  18128. 1621.24 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 )
  18129. 1621.24 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 )
  18130. 1621.24 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 )
  18131. 1621.24 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 )
  18132. 1621.24 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 )
  18133. 1621.24 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 )
  18134. 1621.24 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 )
  18135. 1621.24 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 )
  18136. 1621.24 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 )
  18137. 1621.24 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 )
  18138. 1621.24 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 )
  18139. 1621.24 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 )
  18140. 1621.24 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 )
  18141. 1621.24 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 )
  18142. 1621.24 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 )
  18143. 1621.24 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 )
  18144. 1621.24 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 )
  18145. 1621.24 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 )
  18146. 1621.24 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  18147. 1621.34 s [project-manager-path-for-duoids] created 346 symlinks in user environment
  18148. 1621.41 s [project-manager-path-for-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids
  18149. 1621.87 s [project-manager-path-for-duoids:post-build] Nothing to push - all store paths are already on Cachix.
  18150. 1621.89 s [project-manager-path-for-duoids:post-build] Uploading to the NixCI cache: /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids
  18151. 1621.94 s [project-manager-path-for-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18152. 1621.98 s [project-manager-path-for-duoids:post-build] copying 0 paths...
  18153. 1622.03 s [project-manager-path-for-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18154. 1622.51 s [project-manager-path-for-duoids:post-build] copying 0 paths...
  18155. 1622.53 s Progress: 31 of 38 built (1 building), 559 of 559 downloaded from cache
  18156. 1622.53 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18157. 1622.53 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
  18158. 1622.53 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  18159. 1622.53 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  18160. 1622.82 s [quickcheck-instances] Phase: checkPhase
  18161. 1622.85 s [quickcheck-instances] Running 1 test suites...
  18162. 1622.85 s [quickcheck-instances] Test suite self-test: RUNNING...
  18163. 1622.86 s [quickcheck-instances] +++ OK, passed 100 tests.
  18164. 1622.86 s [quickcheck-instances] +++ OK, passed 100 tests.
  18165. 1622.86 s [quickcheck-instances] +++ OK, passed 100 tests.
  18166. 1622.86 s [quickcheck-instances] +++ OK, passed 100 tests.
  18167. 1622.86 s [quickcheck-instances] +++ OK, passed 100 tests.
  18168. 1622.86 s [quickcheck-instances] Test suite self-test: PASS
  18169. 1622.86 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  18170. 1622.86 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  18171. 1622.87 s [quickcheck-instances] Phase: haddockPhase
  18172. 1622.98 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18173. 1623.00 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
  18174. 1623.00 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  18175. 1623.00 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  18176. 1623.06 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18177. 1623.25 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  18178. 1623.26 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  18179. 1623.27 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  18180. 1623.37 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  18181. 1623.40 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  18182. 1623.42 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  18183. 1623.43 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  18184. 1623.44 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  18185. 1623.44 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  18186. 1623.47 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  18187. 1623.50 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  18188. 1623.51 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  18189. 1623.51 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  18190. 1623.61 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  18191. 1623.62 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  18192. 1623.66 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  18193. 1623.70 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  18194. 1623.71 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  18195. 1623.71 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  18196. 1623.73 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  18197. 1623.79 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  18198. 1623.82 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  18199. 1623.83 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  18200. 1623.84 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  18201. 1624.00 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  18202. 1624.01 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  18203. 1624.01 s [quickcheck-instances] Haddock coverage:
  18204. 1624.01 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  18205. 1624.01 s [quickcheck-instances] Missing documentation for:
  18206. 1624.01 s [quickcheck-instances] Module header
  18207. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  18208. 1624.02 s [quickcheck-instances] Missing documentation for:
  18209. 1624.02 s [quickcheck-instances] Module header
  18210. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  18211. 1624.02 s [quickcheck-instances] Missing documentation for:
  18212. 1624.02 s [quickcheck-instances] Module header
  18213. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  18214. 1624.02 s [quickcheck-instances] Missing documentation for:
  18215. 1624.02 s [quickcheck-instances] Module header
  18216. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  18217. 1624.02 s [quickcheck-instances] Missing documentation for:
  18218. 1624.02 s [quickcheck-instances] Module header
  18219. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  18220. 1624.02 s [quickcheck-instances] Missing documentation for:
  18221. 1624.02 s [quickcheck-instances] Module header
  18222. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  18223. 1624.02 s [quickcheck-instances] Missing documentation for:
  18224. 1624.02 s [quickcheck-instances] Module header
  18225. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18226. 1624.02 s [quickcheck-instances] Missing documentation for:
  18227. 1624.02 s [quickcheck-instances] Module header
  18228. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18229. 1624.02 s [quickcheck-instances] Missing documentation for:
  18230. 1624.02 s [quickcheck-instances] Module header
  18231. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18232. 1624.02 s [quickcheck-instances] Missing documentation for:
  18233. 1624.02 s [quickcheck-instances] Module header
  18234. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18235. 1624.02 s [quickcheck-instances] Missing documentation for:
  18236. 1624.02 s [quickcheck-instances] Module header
  18237. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18238. 1624.02 s [quickcheck-instances] Missing documentation for:
  18239. 1624.02 s [quickcheck-instances] Module header
  18240. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18241. 1624.02 s [quickcheck-instances] Missing documentation for:
  18242. 1624.02 s [quickcheck-instances] Module header
  18243. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18244. 1624.02 s [quickcheck-instances] Missing documentation for:
  18245. 1624.02 s [quickcheck-instances] Module header
  18246. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18247. 1624.02 s [quickcheck-instances] Missing documentation for:
  18248. 1624.02 s [quickcheck-instances] Module header
  18249. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18250. 1624.02 s [quickcheck-instances] Missing documentation for:
  18251. 1624.02 s [quickcheck-instances] Module header
  18252. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18253. 1624.02 s [quickcheck-instances] Missing documentation for:
  18254. 1624.02 s [quickcheck-instances] Module header
  18255. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18256. 1624.02 s [quickcheck-instances] Missing documentation for:
  18257. 1624.02 s [quickcheck-instances] Module header
  18258. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18259. 1624.02 s [quickcheck-instances] Missing documentation for:
  18260. 1624.02 s [quickcheck-instances] Module header
  18261. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18262. 1624.02 s [quickcheck-instances] Missing documentation for:
  18263. 1624.02 s [quickcheck-instances] Module header
  18264. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18265. 1624.02 s [quickcheck-instances] Missing documentation for:
  18266. 1624.02 s [quickcheck-instances] Module header
  18267. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18268. 1624.02 s [quickcheck-instances] Missing documentation for:
  18269. 1624.02 s [quickcheck-instances] Module header
  18270. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18271. 1624.02 s [quickcheck-instances] Missing documentation for:
  18272. 1624.02 s [quickcheck-instances] Module header
  18273. 1624.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18274. 1624.02 s [quickcheck-instances] Missing documentation for:
  18275. 1624.02 s [quickcheck-instances] Module header
  18276. 1624.02 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18277. 1624.68 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18278. 1624.68 s [quickcheck-instances] - Data.Vector.Vector
  18279. 1624.68 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18280. 1624.68 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18281. 1624.68 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18282. 1624.68 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18283. 1624.68 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18284. 1628.10 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  18285. 1628.10 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18286. 1628.44 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18287. 1628.44 s [quickcheck-instances] Phase: installPhase
  18288. 1628.44 s [quickcheck-instances] Installing library in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  18289. 1628.65 s [quickcheck-instances] Phase: fixupPhase
  18290. 1628.66 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
  18291. 1628.68 s [quickcheck-instances] shrinking /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSquickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW-ghc9.8.4.so
  18292. 1628.69 s [quickcheck-instances] checking for references to /build/ in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33...
  18293. 1628.73 s [quickcheck-instances] patching script interpreter paths in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
  18294. 1628.73 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33/lib
  18295. 1628.82 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc
  18296. 1628.83 s [quickcheck-instances] checking for references to /build/ in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc...
  18297. 1628.86 s [quickcheck-instances] patching script interpreter paths in /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc
  18298. 1628.98 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
  18299. 1629.42 s [quickcheck-instances:post-build] Nothing to push - all store paths are already on Cachix.
  18300. 1629.44 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/swnz6r61cnairqaqx70a41fl6yhym8vh-quickcheck-instances-0.3.33-doc /nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33
  18301. 1629.49 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18302. 1629.53 s [quickcheck-instances:post-build] copying 1 paths...
  18303. 1629.53 s [quickcheck-instances:post-build] copying path '/nix/store/yv4wdigz2ndqsavhqcnqrax9pfib1acv-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18304. 1630.88 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18305. 1630.96 s [quickcheck-instances:post-build] copying 0 paths...
  18306. 1630.98 s Progress: 32 of 38 built, 559 of 559 downloaded from cache
  18307. 1631.05 s Building /nix/store/d0g8hbwhcil6pvpxfxz1sgq1ah60i8mj-extra-1.8.1.drv
  18308. 1631.20 s [extra] Phase: setupCompilerEnvironmentPhase
  18309. 1631.20 s [extra] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
  18310. 1631.40 s [extra] Phase: unpackPhase
  18311. 1631.41 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18312. 1631.41 s [extra] source root is extra-1.8.1
  18313. 1631.42 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18314. 1631.42 s [extra] Phase: patchPhase
  18315. 1631.43 s [extra] Phase: compileBuildDriverPhase
  18316. 1631.44 s [extra] setupCompileFlags: -package-db=/build/tmp.JkPI8tbbY1/setup-package.conf.d -threaded
  18317. 1631.48 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.JkPI8tbbY1/Main.o )
  18318. 1631.53 s [extra] [2 of 2] Linking Setup
  18319. 1632.90 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18320. 1632.91 s [extra] Phase: configurePhase
  18321. 1632.92 s [extra] configureFlags: --verbose --prefix=/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.JkPI8tbbY1/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
  18322. 1632.92 s [extra] Using Parsec parser
  18323. 1632.92 s [extra] Configuring extra-1.8.1...
  18324. 1633.21 s [extra] Dependency base >=4.9 && <5: using base-4.19.2.0
  18325. 1633.21 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18326. 1633.23 s [extra] Dependency directory: using directory-1.3.8.5
  18327. 1633.23 s [extra] Dependency filepath: using filepath-1.4.301.0
  18328. 1633.23 s [extra] Dependency process: using process-1.6.25.0
  18329. 1633.23 s [extra] Dependency time: using time-1.12.2
  18330. 1633.23 s [extra] Dependency unix: using unix-2.8.6.0
  18331. 1633.23 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18332. 1633.23 s [extra] Dependency base >=4 && <5: using base-4.19.2.0
  18333. 1633.23 s [extra] Dependency directory: using directory-1.3.8.5
  18334. 1633.23 s [extra] Dependency extra: using extra-1.8.1
  18335. 1633.23 s [extra] Dependency filepath: using filepath-1.4.301.0
  18336. 1633.23 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18337. 1633.23 s [extra] Dependency unix: using unix-2.8.6.0
  18338. 1633.46 s [extra] Source component graph:
  18339. 1633.46 s [extra] component lib
  18340. 1633.46 s [extra] component test:extra-test dependency lib
  18341. 1633.46 s [extra] Configured component graph:
  18342. 1633.46 s [extra] component extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  18343. 1633.46 s [extra] include base-4.19.2.0-8274
  18344. 1633.46 s [extra] include clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
  18345. 1633.46 s [extra] include directory-1.3.8.5-d63d
  18346. 1633.47 s [extra] include filepath-1.4.301.0-9527
  18347. 1633.47 s [extra] include process-1.6.25.0-6fc5
  18348. 1633.47 s [extra] include time-1.12.2-b11c
  18349. 1633.47 s [extra] include unix-2.8.6.0-e528
  18350. 1633.47 s [extra] component extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
  18351. 1633.47 s [extra] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  18352. 1633.47 s [extra] include base-4.19.2.0-8274
  18353. 1633.47 s [extra] include directory-1.3.8.5-d63d
  18354. 1633.47 s [extra] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  18355. 1633.47 s [extra] include filepath-1.4.301.0-9527
  18356. 1633.47 s [extra] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  18357. 1633.47 s [extra] include unix-2.8.6.0-e528
  18358. 1633.47 s [extra] Linked component graph:
  18359. 1633.47 s [extra] unit extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  18360. 1633.47 s [extra] include base-4.19.2.0-8274
  18361. 1633.47 s [extra] include clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
  18362. 1633.47 s [extra] include directory-1.3.8.5-d63d
  18363. 1633.47 s [extra] include filepath-1.4.301.0-9527
  18364. 1633.47 s [extra] include process-1.6.25.0-6fc5
  18365. 1633.47 s [extra] include time-1.12.2-b11c
  18366. 1633.47 s [extra] include unix-2.8.6.0-e528
  18367. 1633.47 s [extra] Control.Concurrent.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Data.Version.Extra,Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Extra,Numeric.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Numeric.Extra,System.Directory.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Environment.Extra,System.IO.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.IO.Extra,System.Info.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Info.Extra,System.Process.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Process.Extra,System.Time.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:System.Time.Extra,Text.Read.Extra=extra-1.8.1-EssMUQCsBco9gsyBCwwe73:Text.Read.Extra
  18368. 1633.47 s [extra] unit extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
  18369. 1633.47 s [extra] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  18370. 1633.47 s [extra] include base-4.19.2.0-8274
  18371. 1633.47 s [extra] include directory-1.3.8.5-d63d
  18372. 1633.47 s [extra] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  18373. 1633.47 s [extra] include filepath-1.4.301.0-9527
  18374. 1633.47 s [extra] include quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  18375. 1633.47 s [extra] include unix-2.8.6.0-e528
  18376. 1633.47 s [extra] Ready component graph:
  18377. 1633.47 s [extra] definite extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  18378. 1633.47 s [extra] depends base-4.19.2.0-8274
  18379. 1633.47 s [extra] depends clock-0.8.4-29TfRxmWsjd5NvULEp3eBt
  18380. 1633.47 s [extra] depends directory-1.3.8.5-d63d
  18381. 1633.47 s [extra] depends filepath-1.4.301.0-9527
  18382. 1633.47 s [extra] depends process-1.6.25.0-6fc5
  18383. 1633.47 s [extra] depends time-1.12.2-b11c
  18384. 1633.47 s [extra] depends unix-2.8.6.0-e528
  18385. 1633.47 s [extra] definite extra-1.8.1-LV1wyo3vfOdDgOxdN7at1y-extra-test
  18386. 1633.47 s [extra] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  18387. 1633.47 s [extra] depends base-4.19.2.0-8274
  18388. 1633.47 s [extra] depends directory-1.3.8.5-d63d
  18389. 1633.47 s [extra] depends extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  18390. 1633.47 s [extra] depends filepath-1.4.301.0-9527
  18391. 1633.47 s [extra] depends quickcheck-instances-0.3.33-Eq1AGcKEE1f6BkZVBZKnhW
  18392. 1633.47 s [extra] depends unix-2.8.6.0-e528
  18393. 1633.47 s [extra] Using Cabal-3.10.3.0 compiled by ghc-9.8
  18394. 1633.47 s [extra] Using compiler: ghc-9.8.4
  18395. 1633.47 s [extra] Using install prefix: /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
  18396. 1633.47 s [extra] Executables installed in:
  18397. 1633.47 s [extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/bin
  18398. 1633.47 s [extra] Libraries installed in:
  18399. 1633.47 s [extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  18400. 1633.47 s [extra] Dynamic Libraries installed in:
  18401. 1633.47 s [extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  18402. 1633.47 s [extra] Private executables installed in:
  18403. 1633.47 s [extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/libexec/x86_64-linux-ghc-9.8.4/extra-1.8.1
  18404. 1633.47 s [extra] Data files installed in:
  18405. 1633.47 s [extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/share/x86_64-linux-ghc-9.8.4/extra-1.8.1
  18406. 1633.47 s [extra] Documentation installed in:
  18407. 1633.47 s [extra] /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc/share/doc/extra-1.8.1
  18408. 1633.47 s [extra] Configuration files installed in:
  18409. 1633.47 s [extra] /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/etc
  18410. 1633.47 s [extra] No alex found
  18411. 1633.47 s [extra] Using ar found on system at:
  18412. 1633.47 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18413. 1633.47 s [extra] No c2hs found
  18414. 1633.47 s [extra] No cpphs found
  18415. 1633.47 s [extra] No doctest found
  18416. 1633.47 s [extra] Using gcc version 14.3.0 given by user at:
  18417. 1633.47 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18418. 1633.47 s [extra] Using ghc version 9.8.4 found on system at:
  18419. 1633.47 s [extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
  18420. 1633.47 s [extra] Using ghc-pkg version 9.8.4 found on system at:
  18421. 1633.47 s [extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
  18422. 1633.47 s [extra] No ghcjs found
  18423. 1633.47 s [extra] No ghcjs-pkg found
  18424. 1633.47 s [extra] No greencard found
  18425. 1633.47 s [extra] Using haddock version 2.30.0 found on system at:
  18426. 1633.47 s [extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
  18427. 1633.47 s [extra] No happy found
  18428. 1633.47 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18429. 1633.47 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18430. 1633.47 s [extra] No hmake found
  18431. 1633.47 s [extra] Using hpc version 0.69 found on system at:
  18432. 1633.47 s [extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
  18433. 1633.47 s [extra] Using hsc2hs version 0.68.10 found on system at:
  18434. 1633.47 s [extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  18435. 1633.47 s [extra] Using hscolour version 1.25 found on system at:
  18436. 1633.47 s [extra] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
  18437. 1633.47 s [extra] No jhc found
  18438. 1633.47 s [extra] Using ld found on system at:
  18439. 1633.47 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18440. 1633.47 s [extra] No pkg-config found
  18441. 1633.47 s [extra] Using runghc version 9.8.4 found on system at:
  18442. 1633.47 s [extra] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
  18443. 1633.47 s [extra] Using strip version 2.44 found on system at:
  18444. 1633.47 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18445. 1633.47 s [extra] Using tar found on system at:
  18446. 1633.47 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18447. 1633.47 s [extra] No uhc found
  18448. 1633.67 s [extra] Phase: buildPhase
  18449. 1633.72 s [extra] Preprocessing library for extra-1.8.1..
  18450. 1633.74 s [extra] Building library for extra-1.8.1..
  18451. 1633.98 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 )
  18452. 1634.07 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 )
  18453. 1634.07 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 )
  18454. 1634.08 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 )
  18455. 1634.08 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18456. 1634.08 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18457. 1634.08 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 )
  18458. 1635.15 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 )
  18459. 1635.21 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 )
  18460. 1635.30 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 )
  18461. 1635.30 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 )
  18462. 1635.30 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 )
  18463. 1635.49 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 )
  18464. 1635.55 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 )
  18465. 1635.77 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 )
  18466. 1635.77 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 )
  18467. 1635.77 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 )
  18468. 1636.29 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 )
  18469. 1636.29 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 )
  18470. 1636.34 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 )
  18471. 1636.34 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18472. 1636.40 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 )
  18473. 1636.81 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18474. 1636.99 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18475. 1636.99 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18476. 1637.02 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18477. 1637.02 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18478. 1637.02 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18479. 1637.02 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18480. 1638.44 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18481. 1638.85 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18482. 1638.86 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18483. 1638.86 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18484. 1638.86 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18485. 1639.16 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18486. 1639.33 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18487. 1639.85 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18488. 1639.85 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18489. 1639.85 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18490. 1640.10 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18491. 1640.10 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18492. 1640.25 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18493. 1640.25 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18494. 1640.40 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18495. 1641.47 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  18496. 1641.47 s [extra] Building test suite 'extra-test' for extra-1.8.1..
  18497. 1641.55 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18498. 1641.93 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18499. 1643.74 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18500. 1643.76 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18501. 1644.03 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18502. 1644.87 s [extra] Phase: checkPhase
  18503. 1644.90 s [extra] Running 1 test suites...
  18504. 1644.90 s [extra] Test suite extra-test: RUNNING...
  18505. 1644.91 s [extra] withTempFile
  18506. 1644.91 s [extra] +++ OK, passed 100 tests.
  18507. 1644.91 s [extra] captureOutput
  18508. 1644.91 s [extra] +++ OK, passed 100 tests.
  18509. 1644.91 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18510. 1644.94 s [extra] +++ OK, passed 100 tests.
  18511. 1644.94 s [extra] \(x :: IO Int) -> join (once x) == x
  18512. 1644.97 s [extra] +++ OK, passed 100 tests.
  18513. 1644.97 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18514. 1645.00 s [extra] +++ OK, passed 100 tests.
  18515. 1645.00 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18516. 1645.04 s [extra] +++ OK, passed 100 tests.
  18517. 1645.04 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18518. 1645.07 s [extra] +++ OK, passed 100 tests.
  18519. 1645.07 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18520. 1645.10 s [extra] +++ OK, passed 100 tests.
  18521. 1645.10 s [extra] stringException "test" == pure "test"
  18522. 1645.10 s [extra] +++ OK, passed 100 tests.
  18523. 1645.10 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18524. 1645.11 s [extra] +++ OK, passed 100 tests.
  18525. 1645.11 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18526. 1645.11 s [extra] +++ OK, passed 100 tests.
  18527. 1645.11 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18528. 1645.11 s [extra] +++ OK, passed 100 tests.
  18529. 1645.11 s [extra] ignore (print 1) == print 1
  18530. 1645.11 s [extra] +++ OK, passed 100 tests.
  18531. 1645.11 s [extra] ignore (fail "die") == pure ()
  18532. 1645.11 s [extra] +++ OK, passed 100 tests.
  18533. 1645.11 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18534. 1645.11 s [extra] +++ OK, passed 100 tests.
  18535. 1645.11 s [extra] seq (errorIO "foo") (print 1) == print 1
  18536. 1645.11 s [extra] +++ OK, passed 100 tests.
  18537. 1645.11 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18538. 1645.11 s [extra] +++ OK, passed 100 tests.
  18539. 1645.12 s [extra] seq (assertIO False) (print 1) == print 1
  18540. 1645.12 s [extra] +++ OK, passed 100 tests.
  18541. 1645.12 s [extra] retry 1 (print "x") == print "x"
  18542. 1645.12 s [extra] +++ OK, passed 100 tests.
  18543. 1645.12 s [extra] retry 3 (fail "die") == fail "die"
  18544. 1645.12 s [extra] +++ OK, passed 100 tests.
  18545. 1645.12 s [extra] whenJust Nothing print == pure ()
  18546. 1645.12 s [extra] +++ OK, passed 100 tests.
  18547. 1645.12 s [extra] whenJust (Just 1) print == print 1
  18548. 1645.12 s [extra] +++ OK, passed 100 tests.
  18549. 1645.12 s [extra] pureIf @Maybe True 5 == Just 5
  18550. 1645.12 s [extra] +++ OK, passed 100 tests.
  18551. 1645.12 s [extra] pureIf @Maybe False 5 == Nothing
  18552. 1645.12 s [extra] +++ OK, passed 100 tests.
  18553. 1645.12 s [extra] pureIf @[] True 5 == [5]
  18554. 1645.12 s [extra] +++ OK, passed 100 tests.
  18555. 1645.12 s [extra] pureIf @[] False 5 == []
  18556. 1645.12 s [extra] +++ OK, passed 100 tests.
  18557. 1645.12 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18558. 1645.12 s [extra] +++ OK, passed 100 tests.
  18559. 1645.12 s [extra] whenMaybe False (print 1) == pure Nothing
  18560. 1645.12 s [extra] +++ OK, passed 100 tests.
  18561. 1645.12 s [extra] \(x :: Maybe ()) -> unit x == x
  18562. 1645.12 s [extra] +++ OK, passed 100 tests.
  18563. 1645.12 s [extra] guarded even 2 == [2]
  18564. 1645.12 s [extra] +++ OK, passed 100 tests.
  18565. 1645.12 s [extra] guarded odd 2 == Nothing
  18566. 1645.12 s [extra] +++ OK, passed 100 tests.
  18567. 1645.12 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18568. 1645.12 s [extra] +++ OK, passed 100 tests.
  18569. 1645.12 s [extra] guardedA (return . even) 42 == Just [42]
  18570. 1645.12 s [extra] +++ OK, passed 100 tests.
  18571. 1645.12 s [extra] guardedA (return . odd) 42 == Just []
  18572. 1645.12 s [extra] +++ OK, passed 100 tests.
  18573. 1645.12 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18574. 1645.12 s [extra] +++ OK, passed 100 tests.
  18575. 1645.12 s [extra] fold1M (\x y -> Just x) [] == undefined
  18576. 1645.12 s [extra] +++ OK, passed 100 tests.
  18577. 1645.12 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18578. 1645.12 s [extra] +++ OK, passed 100 tests.
  18579. 1645.12 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18580. 1645.12 s [extra] +++ OK, passed 100 tests.
  18581. 1645.12 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18582. 1645.12 s [extra] +++ OK, passed 100 tests.
  18583. 1645.12 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18584. 1645.12 s [extra] +++ OK, passed 100 tests.
  18585. 1645.12 s [extra] Just True ||^ undefined == Just True
  18586. 1645.12 s [extra] +++ OK, passed 100 tests.
  18587. 1645.12 s [extra] Just False ||^ Just True == Just True
  18588. 1645.12 s [extra] +++ OK, passed 100 tests.
  18589. 1645.12 s [extra] Just False ||^ Just False == Just False
  18590. 1645.12 s [extra] +++ OK, passed 100 tests.
  18591. 1645.12 s [extra] Just False &&^ undefined == Just False
  18592. 1645.12 s [extra] +++ OK, passed 100 tests.
  18593. 1645.12 s [extra] Just True &&^ Just True == Just True
  18594. 1645.12 s [extra] +++ OK, passed 100 tests.
  18595. 1645.12 s [extra] Just True &&^ Just False == Just False
  18596. 1645.12 s [extra] +++ OK, passed 100 tests.
  18597. 1645.12 s [extra] anyM Just [False,True ,undefined] == Just True
  18598. 1645.12 s [extra] +++ OK, passed 100 tests.
  18599. 1645.12 s [extra] anyM Just [False,False,undefined] == undefined
  18600. 1645.12 s [extra] +++ OK, passed 100 tests.
  18601. 1645.12 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18602. 1645.12 s [extra] +++ OK, passed 100 tests.
  18603. 1645.12 s [extra] allM Just [True,False,undefined] == Just False
  18604. 1645.12 s [extra] +++ OK, passed 100 tests.
  18605. 1645.12 s [extra] allM Just [True,True ,undefined] == undefined
  18606. 1645.12 s [extra] +++ OK, passed 100 tests.
  18607. 1645.12 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18608. 1645.12 s [extra] +++ OK, passed 100 tests.
  18609. 1645.12 s [extra] orM [Just False,Just True ,undefined] == Just True
  18610. 1645.12 s [extra] +++ OK, passed 100 tests.
  18611. 1645.12 s [extra] orM [Just False,Just False,undefined] == undefined
  18612. 1645.12 s [extra] +++ OK, passed 100 tests.
  18613. 1645.12 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18614. 1645.12 s [extra] +++ OK, passed 100 tests.
  18615. 1645.12 s [extra] andM [Just True,Just False,undefined] == Just False
  18616. 1645.12 s [extra] +++ OK, passed 100 tests.
  18617. 1645.12 s [extra] andM [Just True,Just True ,undefined] == undefined
  18618. 1645.12 s [extra] +++ OK, passed 100 tests.
  18619. 1645.12 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18620. 1645.12 s [extra] +++ OK, passed 100 tests.
  18621. 1645.12 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18622. 1645.12 s [extra] +++ OK, passed 100 tests.
  18623. 1645.12 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18624. 1645.12 s [extra] +++ OK, passed 100 tests.
  18625. 1645.12 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18626. 1645.12 s [extra] +++ OK, passed 100 tests.
  18627. 1645.12 s [extra] fromLeft 1 (Left 3) == 3
  18628. 1645.12 s [extra] +++ OK, passed 100 tests.
  18629. 1645.12 s [extra] fromLeft 1 (Right "foo") == 1
  18630. 1645.12 s [extra] +++ OK, passed 100 tests.
  18631. 1645.12 s [extra] fromRight 1 (Right 3) == 3
  18632. 1645.12 s [extra] +++ OK, passed 100 tests.
  18633. 1645.12 s [extra] fromRight 1 (Left "foo") == 1
  18634. 1645.12 s [extra] +++ OK, passed 100 tests.
  18635. 1645.12 s [extra] \x -> fromLeft' (Left x) == x
  18636. 1645.12 s [extra] +++ OK, passed 100 tests.
  18637. 1645.12 s [extra] \x -> fromLeft' (Right x) == undefined
  18638. 1645.12 s [extra] +++ OK, passed 100 tests.
  18639. 1645.12 s [extra] \x -> fromRight' (Right x) == x
  18640. 1645.12 s [extra] +++ OK, passed 100 tests.
  18641. 1645.12 s [extra] \x -> fromRight' (Left x) == undefined
  18642. 1645.12 s [extra] +++ OK, passed 100 tests.
  18643. 1645.12 s [extra] \x -> fromEither (Left x ) == x
  18644. 1645.12 s [extra] +++ OK, passed 100 tests.
  18645. 1645.13 s [extra] \x -> fromEither (Right x) == x
  18646. 1645.13 s [extra] +++ OK, passed 100 tests.
  18647. 1645.13 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18648. 1645.13 s [extra] +++ OK, passed 100 tests.
  18649. 1645.13 s [extra] \a -> maybeToEither a Nothing == Left a
  18650. 1645.13 s [extra] +++ OK, passed 100 tests.
  18651. 1645.13 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18652. 1645.13 s [extra] +++ OK, passed 100 tests.
  18653. 1645.13 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18654. 1645.13 s [extra] +++ OK, passed 100 tests.
  18655. 1645.13 s [extra] mapLeft show (Left 1) == Left "1"
  18656. 1645.13 s [extra] +++ OK, passed 100 tests.
  18657. 1645.13 s [extra] mapLeft show (Right True) == Right True
  18658. 1645.13 s [extra] +++ OK, passed 100 tests.
  18659. 1645.13 s [extra] mapRight show (Left 1) == Left 1
  18660. 1645.13 s [extra] +++ OK, passed 100 tests.
  18661. 1645.13 s [extra] mapRight show (Right True) == Right "True"
  18662. 1645.13 s [extra] +++ OK, passed 100 tests.
  18663. 1645.13 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18664. 1645.13 s [extra] +++ OK, passed 100 tests.
  18665. 1645.13 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18666. 1645.13 s [extra] +++ OK, passed 100 tests.
  18667. 1645.13 s [extra] \xs -> repeatedly line1 xs == lines xs
  18668. 1645.13 s [extra] +++ OK, passed 100 tests.
  18669. 1645.13 s [extra] disjoint [1,2,3] [4,5] == True
  18670. 1645.13 s [extra] +++ OK, passed 100 tests.
  18671. 1645.13 s [extra] disjoint [1,2,3] [4,1] == False
  18672. 1645.13 s [extra] +++ OK, passed 100 tests.
  18673. 1645.13 s [extra] disjointOrd [1,2,3] [4,5] == True
  18674. 1645.13 s [extra] +++ OK, passed 100 tests.
  18675. 1645.13 s [extra] disjointOrd [1,2,3] [4,1] == False
  18676. 1645.13 s [extra] +++ OK, passed 100 tests.
  18677. 1645.13 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18678. 1645.13 s [extra] +++ OK, passed 100 tests.
  18679. 1645.13 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18680. 1645.13 s [extra] +++ OK, passed 100 tests.
  18681. 1645.13 s [extra] anySame [1,1,2] == True
  18682. 1645.13 s [extra] +++ OK, passed 100 tests.
  18683. 1645.13 s [extra] anySame [1,2,3] == False
  18684. 1645.13 s [extra] +++ OK, passed 100 tests.
  18685. 1645.13 s [extra] anySame (1:2:1:undefined) == True
  18686. 1645.13 s [extra] +++ OK, passed 100 tests.
  18687. 1645.13 s [extra] anySame [] == False
  18688. 1645.13 s [extra] +++ OK, passed 100 tests.
  18689. 1645.13 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18690. 1645.13 s [extra] +++ OK, passed 100 tests.
  18691. 1645.13 s [extra] allSame [1,1,2] == False
  18692. 1645.13 s [extra] +++ OK, passed 100 tests.
  18693. 1645.13 s [extra] allSame [1,1,1] == True
  18694. 1645.13 s [extra] +++ OK, passed 100 tests.
  18695. 1645.13 s [extra] allSame [1] == True
  18696. 1645.13 s [extra] +++ OK, passed 100 tests.
  18697. 1645.13 s [extra] allSame [] == True
  18698. 1645.13 s [extra] +++ OK, passed 100 tests.
  18699. 1645.13 s [extra] allSame (1:1:2:undefined) == False
  18700. 1645.13 s [extra] +++ OK, passed 100 tests.
  18701. 1645.13 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18702. 1645.13 s [extra] +++ OK, passed 100 tests.
  18703. 1645.13 s [extra] headDef 1 [] == 1
  18704. 1645.13 s [extra] +++ OK, passed 100 tests.
  18705. 1645.13 s [extra] headDef 1 [2,3,4] == 2
  18706. 1645.13 s [extra] +++ OK, passed 100 tests.
  18707. 1645.13 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18708. 1645.13 s [extra] +++ OK, passed 100 tests.
  18709. 1645.13 s [extra] lastDef 1 [] == 1
  18710. 1645.13 s [extra] +++ OK, passed 100 tests.
  18711. 1645.13 s [extra] lastDef 1 [2,3,4] == 4
  18712. 1645.13 s [extra] +++ OK, passed 100 tests.
  18713. 1645.13 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18714. 1645.13 s [extra] +++ OK, passed 100 tests.
  18715. 1645.13 s [extra] [2,3,4] !? 1 == Just 3
  18716. 1645.13 s [extra] +++ OK, passed 100 tests.
  18717. 1645.13 s [extra] [2,3,4] !? (-1) == Nothing
  18718. 1645.13 s [extra] +++ OK, passed 100 tests.
  18719. 1645.13 s [extra] [] !? 0 == Nothing
  18720. 1645.13 s [extra] +++ OK, passed 100 tests.
  18721. 1645.13 s [extra] notNull [] == False
  18722. 1645.13 s [extra] +++ OK, passed 100 tests.
  18723. 1645.13 s [extra] notNull [1] == True
  18724. 1645.13 s [extra] +++ OK, passed 100 tests.
  18725. 1645.13 s [extra] \xs -> notNull xs == not (null xs)
  18726. 1645.13 s [extra] +++ OK, passed 100 tests.
  18727. 1645.13 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18728. 1645.13 s [extra] +++ OK, passed 100 tests.
  18729. 1645.13 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18730. 1645.13 s [extra] +++ OK, passed 100 tests.
  18731. 1645.13 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  18732. 1645.13 s [extra] +++ OK, passed 100 tests.
  18733. 1645.13 s [extra] unsnoc "test" == Just ("tes",'t')
  18734. 1645.13 s [extra] +++ OK, passed 100 tests.
  18735. 1645.13 s [extra] unsnoc "" == Nothing
  18736. 1645.13 s [extra] +++ OK, passed 100 tests.
  18737. 1645.13 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  18738. 1645.13 s [extra] +++ OK, passed 100 tests.
  18739. 1645.14 s [extra] cons 't' "est" == "test"
  18740. 1645.14 s [extra] +++ OK, passed 100 tests.
  18741. 1645.14 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  18742. 1645.14 s [extra] +++ OK, passed 100 tests.
  18743. 1645.14 s [extra] snoc "tes" 't' == "test"
  18744. 1645.14 s [extra] +++ OK, passed 100 tests.
  18745. 1645.14 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  18746. 1645.14 s [extra] +++ OK, passed 100 tests.
  18747. 1645.14 s [extra] enumerate == [False, True]
  18748. 1645.14 s [extra] +++ OK, passed 100 tests.
  18749. 1645.14 s [extra] takeEnd 3 "hello" == "llo"
  18750. 1645.14 s [extra] +++ OK, passed 100 tests.
  18751. 1645.14 s [extra] takeEnd 5 "bye" == "bye"
  18752. 1645.14 s [extra] +++ OK, passed 100 tests.
  18753. 1645.14 s [extra] takeEnd (-1) "bye" == ""
  18754. 1645.14 s [extra] +++ OK, passed 100 tests.
  18755. 1645.14 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  18756. 1645.14 s [extra] +++ OK, passed 100 tests.
  18757. 1645.14 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  18758. 1645.14 s [extra] +++ OK, passed 100 tests.
  18759. 1645.14 s [extra] dropEnd 3 "hello" == "he"
  18760. 1645.14 s [extra] +++ OK, passed 100 tests.
  18761. 1645.14 s [extra] dropEnd 5 "bye" == ""
  18762. 1645.14 s [extra] +++ OK, passed 100 tests.
  18763. 1645.14 s [extra] dropEnd (-1) "bye" == "bye"
  18764. 1645.14 s [extra] +++ OK, passed 100 tests.
  18765. 1645.14 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  18766. 1645.14 s [extra] +++ OK, passed 100 tests.
  18767. 1645.14 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  18768. 1645.14 s [extra] +++ OK, passed 100 tests.
  18769. 1645.14 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  18770. 1645.14 s [extra] +++ OK, passed 100 tests.
  18771. 1645.14 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  18772. 1645.14 s [extra] +++ OK, passed 100 tests.
  18773. 1645.14 s [extra] splitAtEnd 3 "he" == ("", "he")
  18774. 1645.14 s [extra] +++ OK, passed 100 tests.
  18775. 1645.14 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  18776. 1645.14 s [extra] +++ OK, passed 100 tests.
  18777. 1645.14 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  18778. 1645.14 s [extra] +++ OK, passed 100 tests.
  18779. 1645.14 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  18780. 1645.14 s [extra] +++ OK, passed 100 tests.
  18781. 1645.14 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  18782. 1645.14 s [extra] +++ OK, passed 100 tests.
  18783. 1645.14 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  18784. 1645.14 s [extra] +++ OK, passed 100 tests.
  18785. 1645.14 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  18786. 1645.14 s [extra] +++ OK, passed 100 tests.
  18787. 1645.14 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  18788. 1645.14 s [extra] +++ OK, passed 100 tests.
  18789. 1645.14 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  18790. 1645.14 s [extra] +++ OK, passed 100 tests.
  18791. 1645.14 s [extra] trim " hello " == "hello"
  18792. 1645.14 s [extra] +++ OK, passed 100 tests.
  18793. 1645.14 s [extra] trimStart " hello " == "hello "
  18794. 1645.14 s [extra] +++ OK, passed 100 tests.
  18795. 1645.14 s [extra] trimEnd " hello " == " hello"
  18796. 1645.14 s [extra] +++ OK, passed 100 tests.
  18797. 1645.14 s [extra] \s -> trim s == trimEnd (trimStart s)
  18798. 1645.14 s [extra] +++ OK, passed 100 tests.
  18799. 1645.14 s [extra] lower "This is A TEST" == "this is a test"
  18800. 1645.14 s [extra] +++ OK, passed 100 tests.
  18801. 1645.14 s [extra] lower "" == ""
  18802. 1645.14 s [extra] +++ OK, passed 100 tests.
  18803. 1645.14 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  18804. 1645.14 s [extra] +++ OK, passed 100 tests.
  18805. 1645.14 s [extra] upper "" == ""
  18806. 1645.14 s [extra] +++ OK, passed 100 tests.
  18807. 1645.14 s [extra] word1 "" == ("", "")
  18808. 1645.14 s [extra] +++ OK, passed 100 tests.
  18809. 1645.14 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  18810. 1645.14 s [extra] +++ OK, passed 100 tests.
  18811. 1645.14 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  18812. 1645.14 s [extra] +++ OK, passed 100 tests.
  18813. 1645.14 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  18814. 1645.14 s [extra] +++ OK, passed 100 tests.
  18815. 1645.14 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  18816. 1645.14 s [extra] +++ OK, passed 100 tests.
  18817. 1645.14 s [extra] line1 "" == ("", "")
  18818. 1645.14 s [extra] +++ OK, passed 100 tests.
  18819. 1645.14 s [extra] line1 "test" == ("test","")
  18820. 1645.14 s [extra] +++ OK, passed 100 tests.
  18821. 1645.14 s [extra] line1 "test\n" == ("test","")
  18822. 1645.14 s [extra] +++ OK, passed 100 tests.
  18823. 1645.14 s [extra] line1 "test\nrest" == ("test","rest")
  18824. 1645.14 s [extra] +++ OK, passed 100 tests.
  18825. 1645.14 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  18826. 1645.14 s [extra] +++ OK, passed 100 tests.
  18827. 1645.14 s [extra] escapeHTML "this is a test" == "this is a test"
  18828. 1645.15 s [extra] +++ OK, passed 100 tests.
  18829. 1645.15 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  18830. 1645.15 s [extra] +++ OK, passed 100 tests.
  18831. 1645.15 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  18832. 1645.15 s [extra] +++ OK, passed 100 tests.
  18833. 1645.15 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  18834. 1645.15 s [extra] +++ OK, passed 100 tests.
  18835. 1645.15 s [extra] escapeJSON "this is a test" == "this is a test"
  18836. 1645.15 s [extra] +++ OK, passed 100 tests.
  18837. 1645.15 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  18838. 1645.15 s [extra] +++ OK, passed 100 tests.
  18839. 1645.15 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  18840. 1645.15 s [extra] +++ OK, passed 100 tests.
  18841. 1645.15 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  18842. 1645.15 s [extra] +++ OK, passed 100 tests.
  18843. 1645.15 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  18844. 1645.15 s [extra] +++ OK, passed 100 tests.
  18845. 1645.15 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  18846. 1645.15 s [extra] +++ OK, passed 100 tests.
  18847. 1645.15 s [extra] maximumOn id [] == undefined
  18848. 1645.15 s [extra] +++ OK, passed 100 tests.
  18849. 1645.15 s [extra] maximumOn length ["test","extra","a"] == "extra"
  18850. 1645.15 s [extra] +++ OK, passed 100 tests.
  18851. 1645.15 s [extra] minimumOn id [] == undefined
  18852. 1645.15 s [extra] +++ OK, passed 100 tests.
  18853. 1645.15 s [extra] minimumOn length ["test","extra","a"] == "a"
  18854. 1645.15 s [extra] +++ OK, passed 100 tests.
  18855. 1645.15 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  18856. 1645.15 s [extra] +++ OK, passed 100 tests.
  18857. 1645.15 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  18858. 1645.15 s [extra] +++ OK, passed 100 tests.
  18859. 1645.15 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  18860. 1645.15 s [extra] +++ OK, passed 100 tests.
  18861. 1645.15 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18862. 1645.15 s [extra] +++ OK, passed 100 tests.
  18863. 1645.15 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18864. 1645.15 s [extra] +++ OK, passed 100 tests.
  18865. 1645.15 s [extra] sum' [1, 2, 3] == 6
  18866. 1645.15 s [extra] +++ OK, passed 100 tests.
  18867. 1645.15 s [extra] sumOn' read ["1", "2", "3"] == 6
  18868. 1645.15 s [extra] +++ OK, passed 100 tests.
  18869. 1645.15 s [extra] product' [1, 2, 4] == 8
  18870. 1645.15 s [extra] +++ OK, passed 100 tests.
  18871. 1645.15 s [extra] productOn' read ["1", "2", "4"] == 8
  18872. 1645.15 s [extra] +++ OK, passed 100 tests.
  18873. 1645.15 s [extra] merge "ace" "bd" == "abcde"
  18874. 1645.15 s [extra] +++ OK, passed 100 tests.
  18875. 1645.15 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  18876. 1645.15 s [extra] +++ OK, passed 100 tests.
  18877. 1645.15 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  18878. 1645.15 s [extra] +++ OK, passed 100 tests.
  18879. 1645.15 s [extra] replace "el" "e" "Hello" == "Helo"
  18880. 1645.15 s [extra] +++ OK, passed 100 tests.
  18881. 1645.15 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  18882. 1645.15 s [extra] +++ OK, passed 100 tests.
  18883. 1645.15 s [extra] replace "" "x" "" == "x"
  18884. 1645.15 s [extra] +++ OK, passed 100 tests.
  18885. 1645.15 s [extra] \xs ys -> replace xs xs ys == ys
  18886. 1645.16 s [extra] +++ OK, passed 100 tests.
  18887. 1645.16 s [extra] breakEnd isLower "youRE" == ("you","RE")
  18888. 1645.16 s [extra] +++ OK, passed 100 tests.
  18889. 1645.16 s [extra] breakEnd isLower "youre" == ("youre","")
  18890. 1645.16 s [extra] +++ OK, passed 100 tests.
  18891. 1645.16 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  18892. 1645.16 s [extra] +++ OK, passed 100 tests.
  18893. 1645.16 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  18894. 1645.16 s [extra] +++ OK, passed 100 tests.
  18895. 1645.16 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  18896. 1645.16 s [extra] +++ OK, passed 100 tests.
  18897. 1645.16 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  18898. 1645.16 s [extra] +++ OK, passed 100 tests.
  18899. 1645.16 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  18900. 1645.16 s [extra] +++ OK, passed 100 tests.
  18901. 1645.16 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  18902. 1645.16 s [extra] +++ OK, passed 100 tests.
  18903. 1645.16 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  18904. 1645.16 s [extra] +++ OK, passed 100 tests.
  18905. 1645.16 s [extra] \s -> wordsBy isSpace s == words s
  18906. 1645.16 s [extra] +++ OK, passed 100 tests.
  18907. 1645.16 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  18908. 1645.16 s [extra] +++ OK, passed 100 tests.
  18909. 1645.16 s [extra] \s -> linesBy (== '\n') s == lines s
  18910. 1645.16 s [extra] +++ OK, passed 100 tests.
  18911. 1645.16 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  18912. 1645.16 s [extra] +++ OK, passed 100 tests.
  18913. 1645.16 s [extra] firstJust id [Nothing,Just 3] == Just 3
  18914. 1645.16 s [extra] +++ OK, passed 100 tests.
  18915. 1645.16 s [extra] firstJust id [Nothing,Nothing] == Nothing
  18916. 1645.16 s [extra] +++ OK, passed 100 tests.
  18917. 1645.16 s [extra] drop1 "" == ""
  18918. 1645.16 s [extra] +++ OK, passed 100 tests.
  18919. 1645.16 s [extra] drop1 "test" == "est"
  18920. 1645.16 s [extra] +++ OK, passed 100 tests.
  18921. 1645.16 s [extra] \xs -> drop 1 xs == drop1 xs
  18922. 1645.16 s [extra] +++ OK, passed 100 tests.
  18923. 1645.16 s [extra] dropEnd1 "" == ""
  18924. 1645.16 s [extra] +++ OK, passed 100 tests.
  18925. 1645.16 s [extra] dropEnd1 "test" == "tes"
  18926. 1645.16 s [extra] +++ OK, passed 100 tests.
  18927. 1645.16 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  18928. 1645.16 s [extra] +++ OK, passed 100 tests.
  18929. 1645.16 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  18930. 1645.16 s [extra] +++ OK, passed 100 tests.
  18931. 1645.16 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  18932. 1645.17 s [extra] +++ OK, passed 100 tests.
  18933. 1645.17 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  18934. 1645.17 s [extra] +++ OK, passed 100 tests.
  18935. 1645.17 s [extra] breakOn "/" "foobar" == ("foobar", "")
  18936. 1645.17 s [extra] +++ OK, passed 100 tests.
  18937. 1645.17 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  18938. 1645.17 s [extra] +++ OK, passed 100 tests.
  18939. 1645.17 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  18940. 1645.17 s [extra] +++ OK, passed 100 tests.
  18941. 1645.17 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  18942. 1645.17 s [extra] +++ OK, passed 100 tests.
  18943. 1645.17 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  18944. 1645.17 s [extra] +++ OK, passed 100 tests.
  18945. 1645.17 s [extra] splitOn "x" "x" == ["",""]
  18946. 1645.17 s [extra] +++ OK, passed 100 tests.
  18947. 1645.17 s [extra] splitOn "x" "" == [""]
  18948. 1645.17 s [extra] +++ OK, passed 100 tests.
  18949. 1645.17 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  18950. 1645.17 s [extra] +++ OK, passed 100 tests; 21 discarded.
  18951. 1645.18 s [extra] \c x -> splitOn [c] x == split (==c) x
  18952. 1645.18 s [extra] +++ OK, passed 100 tests.
  18953. 1645.18 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  18954. 1645.18 s [extra] +++ OK, passed 100 tests.
  18955. 1645.18 s [extra] split (== 'a') "" == [""]
  18956. 1645.18 s [extra] +++ OK, passed 100 tests.
  18957. 1645.18 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  18958. 1645.18 s [extra] +++ OK, passed 100 tests.
  18959. 1645.18 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  18960. 1645.18 s [extra] +++ OK, passed 100 tests.
  18961. 1645.18 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  18962. 1645.18 s [extra] +++ OK, passed 100 tests.
  18963. 1645.18 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  18964. 1645.18 s [extra] +++ OK, passed 100 tests.
  18965. 1645.18 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  18966. 1645.18 s [extra] +++ OK, passed 100 tests.
  18967. 1645.18 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  18968. 1645.18 s [extra] +++ OK, passed 100 tests.
  18969. 1645.18 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  18970. 1645.18 s [extra] +++ OK, passed 100 tests.
  18971. 1645.18 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  18972. 1645.18 s [extra] +++ OK, passed 100 tests.
  18973. 1645.18 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  18974. 1645.18 s [extra] +++ OK, passed 100 tests.
  18975. 1645.18 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  18976. 1645.18 s [extra] +++ OK, passed 100 tests.
  18977. 1645.18 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  18978. 1645.18 s [extra] +++ OK, passed 100 tests.
  18979. 1645.18 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  18980. 1645.18 s [extra] +++ OK, passed 100 tests.
  18981. 1645.18 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  18982. 1645.18 s [extra] +++ OK, passed 100 tests.
  18983. 1645.18 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  18984. 1645.18 s [extra] +++ OK, passed 100 tests.
  18985. 1645.18 s [extra] stripSuffix "" "baz" == Just "baz"
  18986. 1645.18 s [extra] +++ OK, passed 100 tests.
  18987. 1645.18 s [extra] stripSuffix "foo" "quux" == Nothing
  18988. 1645.18 s [extra] +++ OK, passed 100 tests.
  18989. 1645.18 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  18990. 1645.18 s [extra] +++ OK, passed 100 tests.
  18991. 1645.18 s [extra] stripInfix "/" "foobar" == Nothing
  18992. 1645.18 s [extra] +++ OK, passed 100 tests.
  18993. 1645.18 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  18994. 1645.18 s [extra] +++ OK, passed 100 tests.
  18995. 1645.18 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  18996. 1645.18 s [extra] +++ OK, passed 100 tests.
  18997. 1645.18 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  18998. 1645.18 s [extra] +++ OK, passed 100 tests.
  18999. 1645.18 s [extra] chunksOf 8 "" == []
  19000. 1645.18 s [extra] +++ OK, passed 100 tests.
  19001. 1645.18 s [extra] chunksOf 0 "test" == undefined
  19002. 1645.18 s [extra] +++ OK, passed 100 tests.
  19003. 1645.18 s [extra] nubSort "this is a test" == " aehist"
  19004. 1645.18 s [extra] +++ OK, passed 100 tests.
  19005. 1645.18 s [extra] \xs -> nubSort xs == nub (sort xs)
  19006. 1645.18 s [extra] +++ OK, passed 100 tests.
  19007. 1645.18 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  19008. 1645.18 s [extra] +++ OK, passed 100 tests.
  19009. 1645.18 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  19010. 1645.18 s [extra] +++ OK, passed 100 tests.
  19011. 1645.18 s [extra] nubOrd "this is a test" == "this ae"
  19012. 1645.18 s [extra] +++ OK, passed 100 tests.
  19013. 1645.18 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  19014. 1645.18 s [extra] +++ OK, passed 100 tests.
  19015. 1645.18 s [extra] \xs -> nubOrd xs == nub xs
  19016. 1645.18 s [extra] +++ OK, passed 100 tests.
  19017. 1645.18 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  19018. 1645.18 s [extra] +++ OK, passed 100 tests.
  19019. 1645.18 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  19020. 1645.18 s [extra] +++ OK, passed 100 tests.
  19021. 1645.18 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  19022. 1645.18 s [extra] +++ OK, passed 100 tests.
  19023. 1645.18 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  19024. 1645.18 s [extra] +++ OK, passed 100 tests.
  19025. 1645.18 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  19026. 1645.18 s [extra] +++ OK, passed 100 tests.
  19027. 1645.18 s [extra] comparingLength [1,2,3] [False] == GT
  19028. 1645.18 s [extra] +++ OK, passed 100 tests.
  19029. 1645.18 s [extra] comparingLength [1,2] "ab" == EQ
  19030. 1645.18 s [extra] +++ OK, passed 100 tests.
  19031. 1645.18 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  19032. 1645.18 s [extra] +++ OK, passed 100 tests.
  19033. 1645.18 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  19034. 1645.18 s [extra] +++ OK, passed 100 tests.
  19035. 1645.18 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  19036. 1645.18 s [extra] +++ OK, passed 100 tests.
  19037. 1645.18 s [extra] mwhen True "test" == "test"
  19038. 1645.18 s [extra] +++ OK, passed 100 tests.
  19039. 1645.18 s [extra] mwhen False "test" == ""
  19040. 1645.18 s [extra] +++ OK, passed 100 tests.
  19041. 1645.18 s [extra] first succ (1,"test") == (2,"test")
  19042. 1645.18 s [extra] +++ OK, passed 100 tests.
  19043. 1645.18 s [extra] second reverse (1,"test") == (1,"tset")
  19044. 1645.18 s [extra] +++ OK, passed 100 tests.
  19045. 1645.18 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  19046. 1645.18 s [extra] +++ OK, passed 100 tests.
  19047. 1645.19 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  19048. 1645.19 s [extra] +++ OK, passed 100 tests.
  19049. 1645.19 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  19050. 1645.19 s [extra] +++ OK, passed 100 tests.
  19051. 1645.19 s [extra] (succ &&& pred) 1 == (2,0)
  19052. 1645.19 s [extra] +++ OK, passed 100 tests.
  19053. 1645.19 s [extra] dupe 12 == (12, 12)
  19054. 1645.19 s [extra] +++ OK, passed 100 tests.
  19055. 1645.19 s [extra] both succ (1,2) == (2,3)
  19056. 1645.19 s [extra] +++ OK, passed 100 tests.
  19057. 1645.19 s [extra] first3 succ (1,1,1) == (2,1,1)
  19058. 1645.19 s [extra] +++ OK, passed 100 tests.
  19059. 1645.19 s [extra] second3 succ (1,1,1) == (1,2,1)
  19060. 1645.19 s [extra] +++ OK, passed 100 tests.
  19061. 1645.19 s [extra] third3 succ (1,1,1) == (1,1,2)
  19062. 1645.19 s [extra] +++ OK, passed 100 tests.
  19063. 1645.19 s [extra] \x -> readVersion (showVersion x) == x
  19064. 1645.19 s [extra] +++ OK, passed 100 tests.
  19065. 1645.19 s [extra] readVersion "hello" == undefined
  19066. 1645.19 s [extra] +++ OK, passed 100 tests.
  19067. 1645.19 s [extra] showDP 4 pi == "3.1416"
  19068. 1645.19 s [extra] +++ OK, passed 100 tests.
  19069. 1645.19 s [extra] showDP 0 pi == "3"
  19070. 1645.19 s [extra] +++ OK, passed 100 tests.
  19071. 1645.19 s [extra] showDP 2 3 == "3.00"
  19072. 1645.19 s [extra] +++ OK, passed 100 tests.
  19073. 1645.19 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  19074. 1645.19 s [extra] +++ OK, passed 100 tests.
  19075. 1645.19 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  19076. 1645.19 s [extra] +++ OK, passed 100 tests.
  19077. 1645.19 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  19078. 1645.19 s [extra] +++ OK, passed 100 tests.
  19079. 1645.19 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  19080. 1645.19 s [extra] +++ OK, passed 100 tests.
  19081. 1645.19 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  19082. 1645.19 s [extra] +++ OK, passed 100 tests.
  19083. 1645.19 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19084. 1645.19 s [extra] +++ OK, passed 100 tests.
  19085. 1645.19 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19086. 1645.19 s [extra] +++ OK, passed 100 tests.
  19087. 1645.19 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  19088. 1645.19 s [extra] +++ OK, passed 100 tests.
  19089. 1645.19 s [extra] isWindows == (os == "mingw32")
  19090. 1645.19 s [extra] +++ OK, passed 100 tests.
  19091. 1645.19 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  19092. 1645.21 s [extra] +++ OK, passed 100 tests.
  19093. 1645.21 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  19094. 1645.23 s [extra] +++ OK, passed 100 tests.
  19095. 1645.23 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  19096. 1645.24 s [extra] +++ OK, passed 100 tests.
  19097. 1645.24 s [extra] captureOutput (print 1) == pure ("1\n",())
  19098. 1645.24 s [extra] +++ OK, passed 100 tests.
  19099. 1645.24 s [extra] withTempFile doesFileExist == pure True
  19100. 1645.24 s [extra] +++ OK, passed 100 tests.
  19101. 1645.24 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  19102. 1645.24 s [extra] +++ OK, passed 100 tests.
  19103. 1645.24 s [extra] withTempFile readFile' == pure ""
  19104. 1645.24 s [extra] +++ OK, passed 100 tests.
  19105. 1645.24 s [extra] withTempDir doesDirectoryExist == pure True
  19106. 1645.25 s [extra] +++ OK, passed 100 tests.
  19107. 1645.25 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  19108. 1645.25 s [extra] +++ OK, passed 100 tests.
  19109. 1645.25 s [extra] withTempDir listFiles == pure []
  19110. 1645.25 s [extra] +++ OK, passed 100 tests.
  19111. 1645.25 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  19112. 1645.25 s [extra] +++ OK, passed 100 tests.
  19113. 1645.25 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  19114. 1645.25 s [extra] +++ OK, passed 100 tests.
  19115. 1645.25 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  19116. 1645.25 s [extra] +++ OK, passed 100 tests.
  19117. 1645.25 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  19118. 1645.25 s [extra] +++ OK, passed 100 tests.
  19119. 1645.25 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  19120. 1645.25 s [extra] +++ OK, passed 100 tests.
  19121. 1645.25 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  19122. 1645.25 s [extra] +++ OK, passed 100 tests.
  19123. 1645.25 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  19124. 1646.25 s [extra] +++ OK, passed 100 tests.
  19125. 1646.25 s [extra] timeout (-3) (print 1) == pure Nothing
  19126. 1646.25 s [extra] +++ OK, passed 100 tests.
  19127. 1646.25 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  19128. 1646.25 s [extra] +++ OK, passed 100 tests.
  19129. 1646.25 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  19130. 1646.35 s [extra] 0.10036990300000001
  19131. 1646.35 s [extra] +++ OK, passed 100 tests.
  19132. 1646.35 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  19133. 1646.45 s [extra] +++ OK, passed 100 tests.
  19134. 1646.45 s [extra] showDuration 3.435 == "3.44s"
  19135. 1646.45 s [extra] +++ OK, passed 100 tests.
  19136. 1646.45 s [extra] showDuration 623.8 == "10m24s"
  19137. 1646.45 s [extra] +++ OK, passed 100 tests.
  19138. 1646.45 s [extra] showDuration 62003.8 == "17h13m"
  19139. 1646.45 s [extra] +++ OK, passed 100 tests.
  19140. 1646.45 s [extra] showDuration 1e8 == "27777h47m"
  19141. 1646.45 s [extra] +++ OK, passed 100 tests.
  19142. 1646.45 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  19143. 1646.45 s [extra] +++ OK, passed 100 tests.
  19144. 1646.45 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  19145. 1647.46 s [extra] +++ OK, passed 100 tests.
  19146. 1647.46 s [extra] Extra export
  19147. 1647.46 s [extra] +++ OK, passed 100 tests.
  19148. 1647.46 s [extra] withTempFile
  19149. 1647.46 s [extra] ....done
  19150. 1647.46 s [extra] withTempDir
  19151. 1647.48 s [extra] ....done
  19152. 1647.48 s [extra] retry
  19153. 1647.48 s [extra] +++ OK, passed 100 tests.
  19154. 1647.48 s [extra] barrier
  19155. 1647.48 s [extra] Success (325 tests)
  19156. 1647.50 s [extra] Test suite extra-test: PASS
  19157. 1647.50 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  19158. 1647.50 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  19159. 1647.50 s [extra] Phase: haddockPhase
  19160. 1647.62 s [extra] Preprocessing library for extra-1.8.1..
  19161. 1647.63 s [extra] Running Haddock on library for extra-1.8.1..
  19162. 1647.67 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  19163. 1647.95 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  19164. 1647.96 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  19165. 1647.97 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  19166. 1647.98 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  19167. 1647.99 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  19168. 1648.00 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  19169. 1648.01 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  19170. 1648.26 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  19171. 1648.26 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  19172. 1648.28 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  19173. 1648.29 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  19174. 1648.31 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  19175. 1648.36 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  19176. 1648.37 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  19177. 1648.40 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  19178. 1648.43 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  19179. 1648.43 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  19180. 1648.55 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  19181. 1648.55 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  19182. 1648.57 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  19183. 1648.59 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  19184. 1648.65 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  19185. 1648.66 s [extra] Haddock coverage:
  19186. 1648.66 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  19187. 1648.66 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  19188. 1648.66 s [extra] Warning: 'Arrow' is out of scope.
  19189. 1648.66 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19190. 1648.66 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  19191. 1648.66 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  19192. 1648.67 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  19193. 1648.67 s [extra] Warning: '(:)' is out of scope.
  19194. 1648.67 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19195. 1648.67 s [extra] Warning: 'unzip' is ambiguous. It is defined
  19196. 1648.67 s [extra] * in ‘Data.Functor’
  19197. 1648.67 s [extra] * in ‘GHC.List’
  19198. 1648.67 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19199. 1648.67 s [extra] by specifying the type/value namespace explicitly.
  19200. 1648.67 s [extra] Defaulting to the one defined in ‘GHC.List’
  19201. 1648.67 s [extra] Warning: 'firstJustM' is out of scope.
  19202. 1648.67 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19203. 1648.68 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  19204. 1648.68 s [extra] Warning: 'Version' is ambiguous. It is defined
  19205. 1648.68 s [extra] * in ‘Data.Version’
  19206. 1648.68 s [extra] * in ‘Data.Version’
  19207. 1648.68 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19208. 1648.68 s [extra] by specifying the type/value namespace explicitly.
  19209. 1648.68 s [extra] Defaulting to the one defined in ‘Data.Version’
  19210. 1648.68 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  19211. 1648.68 s [extra] Warning: 'length' is ambiguous. It is defined
  19212. 1648.68 s [extra] * in ‘Data.Foldable’
  19213. 1648.68 s [extra] * in ‘Data.List.NonEmpty’
  19214. 1648.68 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19215. 1648.68 s [extra] by specifying the type/value namespace explicitly.
  19216. 1648.68 s [extra] Defaulting to the one defined in ‘Data.List.NonEmpty’
  19217. 1648.68 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  19218. 1648.68 s [extra] Warning: 'fromJust' is out of scope.
  19219. 1648.68 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19220. 1648.68 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  19221. 1648.68 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  19222. 1648.68 s [extra] * in ‘GHC.Exception’
  19223. 1648.68 s [extra] * in ‘GHC.Exception’
  19224. 1648.68 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19225. 1648.68 s [extra] by specifying the type/value namespace explicitly.
  19226. 1648.68 s [extra] Defaulting to the one defined in ‘GHC.Exception’
  19227. 1648.68 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  19228. 1648.68 s [extra] * in ‘GHC.IO.Exception’
  19229. 1648.68 s [extra] * in ‘GHC.IO.Exception’
  19230. 1648.68 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19231. 1648.68 s [extra] by specifying the type/value namespace explicitly.
  19232. 1648.68 s [extra] Defaulting to the one defined in ‘GHC.IO.Exception’
  19233. 1648.68 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  19234. 1648.68 s [extra] * in ‘GHC.Exception.Type’
  19235. 1648.68 s [extra] * in ‘GHC.Exception.Type’
  19236. 1648.68 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19237. 1648.68 s [extra] by specifying the type/value namespace explicitly.
  19238. 1648.68 s [extra] Defaulting to the one defined in ‘GHC.Exception.Type’
  19239. 1648.68 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19240. 1648.69 s [extra] Warning: 'partition' is out of scope.
  19241. 1648.69 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19242. 1648.69 s [extra] Warning: 'mconcatMap' is out of scope.
  19243. 1648.69 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19244. 1648.69 s [extra] Warning: 'find' is out of scope.
  19245. 1648.69 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19246. 1648.69 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19247. 1648.69 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19248. 1648.69 s [extra] Missing documentation for:
  19249. 1648.69 s [extra] Module header
  19250. 1648.69 s [extra] Warning: 'Lock' is ambiguous. It is defined
  19251. 1648.69 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  19252. 1648.69 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  19253. 1648.69 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19254. 1648.69 s [extra] by specifying the type/value namespace explicitly.
  19255. 1648.69 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  19256. 1648.69 s [extra] Warning: 'Var' is ambiguous. It is defined
  19257. 1648.69 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  19258. 1648.69 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  19259. 1648.69 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19260. 1648.69 s [extra] by specifying the type/value namespace explicitly.
  19261. 1648.69 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  19262. 1648.69 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  19263. 1648.69 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  19264. 1648.69 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  19265. 1648.69 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19266. 1648.69 s [extra] by specifying the type/value namespace explicitly.
  19267. 1648.69 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  19268. 1648.69 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19269. 1648.69 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19270. 1648.70 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19271. 1648.70 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19272. 1648.70 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19273. 1648.70 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19274. 1648.70 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19275. 1648.70 s [extra] 100% (270 /270) in 'Extra'
  19276. 1648.70 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19277. 1649.00 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  19278. 1649.00 s [extra] - GHC.Generics.Rep1_Solo
  19279. 1649.00 s [extra] - GHC.Generics.Rep_Solo
  19280. 1651.91 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  19281. 1651.97 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  19282. 1651.98 s [extra] Phase: installPhase
  19283. 1652.04 s [extra] Installing library in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  19284. 1652.44 s [extra] Phase: fixupPhase
  19285. 1652.47 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
  19286. 1652.47 s [extra] shrinking /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSextra-1.8.1-EssMUQCsBco9gsyBCwwe73-ghc9.8.4.so
  19287. 1652.49 s [extra] checking for references to /build/ in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1...
  19288. 1652.52 s [extra] patching script interpreter paths in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
  19289. 1652.52 s [extra] stripping (with command strip and flags -S -p) in /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1/lib
  19290. 1652.63 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc
  19291. 1652.66 s [extra] checking for references to /build/ in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc...
  19292. 1652.69 s [extra] patching script interpreter paths in /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc
  19293. 1652.83 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
  19294. 1653.21 s [extra:post-build] Nothing to push - all store paths are already on Cachix.
  19295. 1653.23 s [extra:post-build] Uploading to the NixCI cache: /nix/store/30654fg707ln12r1cax9q46j7m1fwnii-extra-1.8.1-doc /nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1
  19296. 1653.28 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19297. 1653.31 s [extra:post-build] copying 1 paths...
  19298. 1653.31 s [extra:post-build] copying path '/nix/store/p9zr9cvs35cxj87lljcfs0i442qs2aig-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19299. 1654.59 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19300. 1654.66 s [extra:post-build] copying 0 paths...
  19301. 1654.68 s Progress: 33 of 38 built, 559 of 559 downloaded from cache
  19302. 1654.72 s Building /nix/store/26c954c0i89di6h5jdfdb3jks1f0pfl8-algebraic-graphs-0.7.drv
  19303. 1654.81 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19304. 1654.81 s [algebraic-graphs] Build with /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4.
  19305. 1654.94 s [algebraic-graphs] Phase: unpackPhase
  19306. 1654.95 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19307. 1654.96 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19308. 1654.96 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19309. 1654.97 s [algebraic-graphs] Phase: patchPhase
  19310. 1654.97 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19311. 1654.98 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19312. 1654.98 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19313. 1654.98 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19314. 1654.98 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.6GvW7wedJ2/setup-package.conf.d -threaded
  19315. 1655.02 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.6GvW7wedJ2/Main.o )
  19316. 1655.08 s [algebraic-graphs] [2 of 2] Linking Setup
  19317. 1656.37 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19318. 1656.38 s [algebraic-graphs] Phase: configurePhase
  19319. 1656.39 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.6GvW7wedJ2/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/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/lib
  19320. 1656.39 s [algebraic-graphs] Using Parsec parser
  19321. 1656.39 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19322. 1656.63 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19323. 1656.63 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
  19324. 1656.63 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  19325. 1656.63 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  19326. 1656.63 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19327. 1656.63 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19328. 1656.63 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19329. 1656.63 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19330. 1656.63 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
  19331. 1656.63 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  19332. 1656.63 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  19333. 1656.63 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19334. 1656.63 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19335. 1656.63 s [algebraic-graphs] inspection-testing-0.6.2
  19336. 1656.63 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19337. 1656.86 s [algebraic-graphs] Source component graph:
  19338. 1656.86 s [algebraic-graphs] component lib
  19339. 1656.86 s [algebraic-graphs] component test:main dependency lib
  19340. 1656.86 s [algebraic-graphs] Configured component graph:
  19341. 1656.86 s [algebraic-graphs] component algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  19342. 1656.86 s [algebraic-graphs] include array-0.5.8.0-cf4f
  19343. 1656.86 s [algebraic-graphs] include base-4.19.2.0-8274
  19344. 1656.86 s [algebraic-graphs] include containers-0.6.8-15d9
  19345. 1656.86 s [algebraic-graphs] include deepseq-1.5.1.0-c64e
  19346. 1656.86 s [algebraic-graphs] include transformers-0.6.1.0-388b
  19347. 1656.86 s [algebraic-graphs] component algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
  19348. 1656.86 s [algebraic-graphs] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  19349. 1656.86 s [algebraic-graphs] include algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  19350. 1656.86 s [algebraic-graphs] include array-0.5.8.0-cf4f
  19351. 1656.86 s [algebraic-graphs] include base-4.19.2.0-8274
  19352. 1656.86 s [algebraic-graphs] include containers-0.6.8-15d9
  19353. 1656.86 s [algebraic-graphs] include deepseq-1.5.1.0-c64e
  19354. 1656.86 s [algebraic-graphs] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  19355. 1656.86 s [algebraic-graphs] include inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
  19356. 1656.86 s [algebraic-graphs] include transformers-0.6.1.0-388b
  19357. 1656.86 s [algebraic-graphs] Linked component graph:
  19358. 1656.86 s [algebraic-graphs] unit algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  19359. 1656.86 s [algebraic-graphs] include array-0.5.8.0-cf4f
  19360. 1656.86 s [algebraic-graphs] include base-4.19.2.0-8274
  19361. 1656.86 s [algebraic-graphs] include containers-0.6.8-15d9
  19362. 1656.86 s [algebraic-graphs] include deepseq-1.5.1.0-c64e
  19363. 1656.86 s [algebraic-graphs] include transformers-0.6.1.0-388b
  19364. 1656.86 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc:Data.Graph.Typed
  19365. 1656.86 s [algebraic-graphs] unit algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
  19366. 1656.86 s [algebraic-graphs] include QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  19367. 1656.86 s [algebraic-graphs] include algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  19368. 1656.86 s [algebraic-graphs] include array-0.5.8.0-cf4f
  19369. 1656.86 s [algebraic-graphs] include base-4.19.2.0-8274
  19370. 1656.86 s [algebraic-graphs] include containers-0.6.8-15d9
  19371. 1656.86 s [algebraic-graphs] include deepseq-1.5.1.0-c64e
  19372. 1656.86 s [algebraic-graphs] include extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  19373. 1656.86 s [algebraic-graphs] include inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
  19374. 1656.86 s [algebraic-graphs] include transformers-0.6.1.0-388b
  19375. 1656.86 s [algebraic-graphs] Ready component graph:
  19376. 1656.86 s [algebraic-graphs] definite algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  19377. 1656.86 s [algebraic-graphs] depends array-0.5.8.0-cf4f
  19378. 1656.86 s [algebraic-graphs] depends base-4.19.2.0-8274
  19379. 1656.86 s [algebraic-graphs] depends containers-0.6.8-15d9
  19380. 1656.86 s [algebraic-graphs] depends deepseq-1.5.1.0-c64e
  19381. 1656.86 s [algebraic-graphs] depends transformers-0.6.1.0-388b
  19382. 1656.86 s [algebraic-graphs] definite algebraic-graphs-0.7-5jtLgVA0WOj7VL6Fsh7koE-main
  19383. 1656.86 s [algebraic-graphs] depends QuickCheck-2.15.0.1-5u5mV1pqdXQ9rGVQgPoEeu
  19384. 1656.86 s [algebraic-graphs] depends algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  19385. 1656.86 s [algebraic-graphs] depends array-0.5.8.0-cf4f
  19386. 1656.86 s [algebraic-graphs] depends base-4.19.2.0-8274
  19387. 1656.86 s [algebraic-graphs] depends containers-0.6.8-15d9
  19388. 1656.86 s [algebraic-graphs] depends deepseq-1.5.1.0-c64e
  19389. 1656.86 s [algebraic-graphs] depends extra-1.8.1-EssMUQCsBco9gsyBCwwe73
  19390. 1656.86 s [algebraic-graphs] depends inspection-testing-0.6.2-35R0qsmblLV9uU1qS0yYOA
  19391. 1656.86 s [algebraic-graphs] depends transformers-0.6.1.0-388b
  19392. 1656.86 s [algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.8
  19393. 1656.86 s [algebraic-graphs] Using compiler: ghc-9.8.4
  19394. 1656.86 s [algebraic-graphs] Using install prefix:
  19395. 1656.86 s [algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
  19396. 1656.86 s [algebraic-graphs] Executables installed in:
  19397. 1656.86 s [algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/bin
  19398. 1656.86 s [algebraic-graphs] Libraries installed in:
  19399. 1656.86 s [algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  19400. 1656.86 s [algebraic-graphs] Dynamic Libraries installed in:
  19401. 1656.86 s [algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  19402. 1656.86 s [algebraic-graphs] Private executables installed in:
  19403. 1656.86 s [algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
  19404. 1656.86 s [algebraic-graphs] Data files installed in:
  19405. 1656.86 s [algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
  19406. 1656.86 s [algebraic-graphs] Documentation installed in:
  19407. 1656.86 s [algebraic-graphs] /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19408. 1656.86 s [algebraic-graphs] Configuration files installed in:
  19409. 1656.86 s [algebraic-graphs] /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/etc
  19410. 1656.86 s [algebraic-graphs] No alex found
  19411. 1656.86 s [algebraic-graphs] Using ar found on system at:
  19412. 1656.86 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  19413. 1656.86 s [algebraic-graphs] No c2hs found
  19414. 1656.86 s [algebraic-graphs] No cpphs found
  19415. 1656.86 s [algebraic-graphs] No doctest found
  19416. 1656.86 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19417. 1656.86 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  19418. 1656.86 s [algebraic-graphs] Using ghc version 9.8.4 found on system at:
  19419. 1656.86 s [algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc
  19420. 1656.86 s [algebraic-graphs] Using ghc-pkg version 9.8.4 found on system at:
  19421. 1656.86 s [algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/ghc-pkg-9.8.4
  19422. 1656.86 s [algebraic-graphs] No ghcjs found
  19423. 1656.86 s [algebraic-graphs] No ghcjs-pkg found
  19424. 1656.87 s [algebraic-graphs] No greencard found
  19425. 1656.87 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  19426. 1656.87 s [algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/haddock-ghc-9.8.4
  19427. 1656.87 s [algebraic-graphs] No happy found
  19428. 1656.87 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19429. 1656.87 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19430. 1656.87 s [algebraic-graphs] No hmake found
  19431. 1656.87 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  19432. 1656.87 s [algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hpc-ghc-9.8.4
  19433. 1656.87 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  19434. 1656.87 s [algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  19435. 1656.87 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19436. 1656.87 s [algebraic-graphs] /nix/store/palqpb4p9k5rqxhxjdgqrak8n91p6c4z-hscolour-1.25/bin/HsColour
  19437. 1656.87 s [algebraic-graphs] No jhc found
  19438. 1656.87 s [algebraic-graphs] Using ld found on system at:
  19439. 1656.87 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  19440. 1656.87 s [algebraic-graphs] No pkg-config found
  19441. 1656.87 s [algebraic-graphs] Using runghc version 9.8.4 found on system at:
  19442. 1656.87 s [algebraic-graphs] /nix/store/4yvzsc21abkayqx2bzncnj5fpx57hb6z-ghc-9.8.4/bin/runghc-9.8.4
  19443. 1656.87 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19444. 1656.87 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  19445. 1656.87 s [algebraic-graphs] Using tar found on system at:
  19446. 1656.87 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  19447. 1656.87 s [algebraic-graphs] No uhc found
  19448. 1657.03 s [algebraic-graphs] Phase: buildPhase
  19449. 1657.07 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19450. 1657.07 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  19451. 1657.16 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 )
  19452. 1658.01 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 )
  19453. 1658.61 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 )
  19454. 1658.91 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 )
  19455. 1658.91 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19456. 1660.01 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 )
  19457. 1660.24 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 )
  19458. 1660.73 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 )
  19459. 1661.37 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 )
  19460. 1661.37 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 )
  19461. 1661.37 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 )
  19462. 1661.37 s [algebraic-graphs]
  19463. 1661.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19464. 1661.37 s [algebraic-graphs] In the use of ‘head’
  19465. 1661.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19466. 1661.37 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19467. 1661.37 s [algebraic-graphs] |
  19468. 1661.37 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19469. 1661.37 s [algebraic-graphs] | ^^^^
  19470. 1661.37 s [algebraic-graphs]
  19471. 1661.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19472. 1661.37 s [algebraic-graphs] In the use of ‘tail’
  19473. 1661.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19474. 1661.37 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19475. 1661.37 s [algebraic-graphs] |
  19476. 1661.37 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19477. 1661.37 s [algebraic-graphs] | ^^^^
  19478. 1661.37 s [algebraic-graphs]
  19479. 1661.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19480. 1661.37 s [algebraic-graphs] In the use of ‘head’
  19481. 1661.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19482. 1661.37 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19483. 1661.37 s [algebraic-graphs] |
  19484. 1661.37 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19485. 1661.37 s [algebraic-graphs] | ^^^^
  19486. 1661.37 s [algebraic-graphs]
  19487. 1661.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19488. 1661.37 s [algebraic-graphs] In the use of ‘tail’
  19489. 1661.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19490. 1661.37 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19491. 1661.37 s [algebraic-graphs] |
  19492. 1661.37 s [algebraic-graphs] 397 | bnd' = tail bnd
  19493. 1661.37 s [algebraic-graphs] | ^^^^
  19494. 1661.37 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 )
  19495. 1661.37 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 )
  19496. 1661.37 s [algebraic-graphs]
  19497. 1661.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19498. 1661.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19499. 1661.37 s [algebraic-graphs] will become an error in a future GHC release.
  19500. 1661.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19501. 1661.37 s [algebraic-graphs] |
  19502. 1661.37 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19503. 1661.37 s [algebraic-graphs] | ^
  19504. 1661.37 s [algebraic-graphs]
  19505. 1661.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19506. 1661.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19507. 1661.37 s [algebraic-graphs] will become an error in a future GHC release.
  19508. 1661.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19509. 1661.37 s [algebraic-graphs] |
  19510. 1661.37 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19511. 1661.37 s [algebraic-graphs] | ^
  19512. 1661.37 s [algebraic-graphs]
  19513. 1661.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19514. 1661.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19515. 1661.37 s [algebraic-graphs] will become an error in a future GHC release.
  19516. 1661.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19517. 1661.37 s [algebraic-graphs] |
  19518. 1661.37 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19519. 1661.37 s [algebraic-graphs] | ^
  19520. 1661.37 s [algebraic-graphs]
  19521. 1661.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19522. 1661.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19523. 1661.37 s [algebraic-graphs] will become an error in a future GHC release.
  19524. 1661.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19525. 1661.37 s [algebraic-graphs] |
  19526. 1661.37 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19527. 1661.37 s [algebraic-graphs] | ^
  19528. 1661.37 s [algebraic-graphs]
  19529. 1661.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19530. 1661.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19531. 1661.37 s [algebraic-graphs] will become an error in a future GHC release.
  19532. 1661.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19533. 1661.37 s [algebraic-graphs] |
  19534. 1661.37 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19535. 1661.37 s [algebraic-graphs] | ^
  19536. 1661.37 s [algebraic-graphs]
  19537. 1661.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19538. 1661.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19539. 1661.37 s [algebraic-graphs] will become an error in a future GHC release.
  19540. 1661.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19541. 1661.37 s [algebraic-graphs] |
  19542. 1661.37 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19543. 1661.37 s [algebraic-graphs] | ^
  19544. 1661.37 s [algebraic-graphs]
  19545. 1661.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19546. 1661.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19547. 1661.37 s [algebraic-graphs] will become an error in a future GHC release.
  19548. 1661.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19549. 1661.37 s [algebraic-graphs] |
  19550. 1661.37 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19551. 1661.37 s [algebraic-graphs] | ^
  19552. 1661.37 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 )
  19553. 1661.43 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 )
  19554. 1661.74 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 )
  19555. 1661.81 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 )
  19556. 1661.81 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 )
  19557. 1662.21 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 )
  19558. 1662.35 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 )
  19559. 1662.56 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 )
  19560. 1662.56 s [algebraic-graphs]
  19561. 1662.56 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19562. 1662.56 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19563. 1662.56 s [algebraic-graphs] will become an error in a future GHC release.
  19564. 1662.56 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19565. 1662.56 s [algebraic-graphs] |
  19566. 1662.56 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19567. 1662.56 s [algebraic-graphs] | ^
  19568. 1662.56 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 )
  19569. 1662.56 s [algebraic-graphs]
  19570. 1662.56 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19571. 1662.56 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19572. 1662.56 s [algebraic-graphs] will become an error in a future GHC release.
  19573. 1662.56 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19574. 1662.56 s [algebraic-graphs] |
  19575. 1662.56 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19576. 1662.56 s [algebraic-graphs] | ^
  19577. 1662.56 s [algebraic-graphs]
  19578. 1662.56 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19579. 1662.56 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19580. 1662.56 s [algebraic-graphs] will become an error in a future GHC release.
  19581. 1662.56 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19582. 1662.56 s [algebraic-graphs] |
  19583. 1662.57 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19584. 1662.57 s [algebraic-graphs] | ^
  19585. 1662.57 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 )
  19586. 1662.57 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 )
  19587. 1662.57 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 )
  19588. 1662.57 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 )
  19589. 1662.57 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 )
  19590. 1662.57 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 )
  19591. 1662.57 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 )
  19592. 1662.81 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19593. 1663.74 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19594. 1664.28 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 )
  19595. 1664.61 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19596. 1664.61 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19597. 1665.71 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 )
  19598. 1666.05 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 )
  19599. 1666.48 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 )
  19600. 1667.18 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19601. 1667.18 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 )
  19602. 1667.18 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 )
  19603. 1667.18 s [algebraic-graphs]
  19604. 1667.18 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19605. 1667.18 s [algebraic-graphs] In the use of ‘head’
  19606. 1667.18 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19607. 1667.18 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19608. 1667.18 s [algebraic-graphs] |
  19609. 1667.18 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19610. 1667.18 s [algebraic-graphs] | ^^^^
  19611. 1667.18 s [algebraic-graphs]
  19612. 1667.18 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19613. 1667.18 s [algebraic-graphs] In the use of ‘tail’
  19614. 1667.18 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19615. 1667.18 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 Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19616. 1667.18 s [algebraic-graphs] |
  19617. 1667.18 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19618. 1667.18 s [algebraic-graphs] | ^^^^
  19619. 1667.18 s [algebraic-graphs]
  19620. 1667.18 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19621. 1667.18 s [algebraic-graphs] In the use of ‘head’
  19622. 1667.18 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19623. 1667.18 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19624. 1667.18 s [algebraic-graphs] |
  19625. 1667.18 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19626. 1667.18 s [algebraic-graphs] | ^^^^
  19627. 1667.18 s [algebraic-graphs]
  19628. 1667.18 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19629. 1667.18 s [algebraic-graphs] In the use of ‘tail’
  19630. 1667.18 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19631. 1667.18 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 Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19632. 1667.18 s [algebraic-graphs] |
  19633. 1667.18 s [algebraic-graphs] 397 | bnd' = tail bnd
  19634. 1667.18 s [algebraic-graphs] | ^^^^
  19635. 1667.18 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 )
  19636. 1667.18 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19637. 1667.18 s [algebraic-graphs]
  19638. 1667.18 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19639. 1667.18 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19640. 1667.18 s [algebraic-graphs] will become an error in a future GHC release.
  19641. 1667.18 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19642. 1667.18 s [algebraic-graphs] |
  19643. 1667.18 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19644. 1667.18 s [algebraic-graphs] | ^
  19645. 1667.18 s [algebraic-graphs]
  19646. 1667.18 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19647. 1667.18 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19648. 1667.18 s [algebraic-graphs] will become an error in a future GHC release.
  19649. 1667.18 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19650. 1667.18 s [algebraic-graphs] |
  19651. 1667.18 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19652. 1667.18 s [algebraic-graphs] | ^
  19653. 1667.18 s [algebraic-graphs]
  19654. 1667.18 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19655. 1667.18 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19656. 1667.18 s [algebraic-graphs] will become an error in a future GHC release.
  19657. 1667.18 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19658. 1667.18 s [algebraic-graphs] |
  19659. 1667.18 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19660. 1667.18 s [algebraic-graphs] | ^
  19661. 1667.18 s [algebraic-graphs]
  19662. 1667.18 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19663. 1667.18 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19664. 1667.18 s [algebraic-graphs] will become an error in a future GHC release.
  19665. 1667.18 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19666. 1667.18 s [algebraic-graphs] |
  19667. 1667.18 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19668. 1667.18 s [algebraic-graphs] | ^
  19669. 1667.18 s [algebraic-graphs]
  19670. 1667.18 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19671. 1667.18 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19672. 1667.18 s [algebraic-graphs] will become an error in a future GHC release.
  19673. 1667.18 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19674. 1667.18 s [algebraic-graphs] |
  19675. 1667.18 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19676. 1667.18 s [algebraic-graphs] | ^
  19677. 1667.18 s [algebraic-graphs]
  19678. 1667.18 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19679. 1667.18 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19680. 1667.18 s [algebraic-graphs] will become an error in a future GHC release.
  19681. 1667.18 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19682. 1667.18 s [algebraic-graphs] |
  19683. 1667.18 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19684. 1667.18 s [algebraic-graphs] | ^
  19685. 1667.18 s [algebraic-graphs]
  19686. 1667.18 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19687. 1667.18 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19688. 1667.18 s [algebraic-graphs] will become an error in a future GHC release.
  19689. 1667.18 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19690. 1667.18 s [algebraic-graphs] |
  19691. 1667.18 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19692. 1667.18 s [algebraic-graphs] | ^
  19693. 1667.18 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19694. 1667.34 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 )
  19695. 1667.74 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19696. 1667.74 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 )
  19697. 1667.74 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19698. 1668.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 )
  19699. 1668.43 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 )
  19700. 1668.57 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19701. 1668.57 s [algebraic-graphs]
  19702. 1668.57 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19703. 1668.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19704. 1668.57 s [algebraic-graphs] will become an error in a future GHC release.
  19705. 1668.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19706. 1668.57 s [algebraic-graphs] |
  19707. 1668.57 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19708. 1668.57 s [algebraic-graphs] | ^
  19709. 1668.57 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 )
  19710. 1668.57 s [algebraic-graphs]
  19711. 1668.57 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19712. 1668.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19713. 1668.57 s [algebraic-graphs] will become an error in a future GHC release.
  19714. 1668.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19715. 1668.57 s [algebraic-graphs] |
  19716. 1668.57 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19717. 1668.57 s [algebraic-graphs] | ^
  19718. 1668.57 s [algebraic-graphs]
  19719. 1668.57 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19720. 1668.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19721. 1668.57 s [algebraic-graphs] will become an error in a future GHC release.
  19722. 1668.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19723. 1668.57 s [algebraic-graphs] |
  19724. 1668.57 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19725. 1668.57 s [algebraic-graphs] | ^
  19726. 1668.57 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19727. 1668.57 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19728. 1668.57 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 )
  19729. 1668.67 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
  19730. 1668.67 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 )
  19731. 1668.67 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 )
  19732. 1668.70 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19733. 1669.68 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  19734. 1669.68 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  19735. 1669.80 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 )
  19736. 1670.92 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 )
  19737. 1673.44 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 )
  19738. 1673.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 )
  19739. 1673.52 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 )
  19740. 1675.41 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 )
  19741. 1675.41 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 )
  19742. 1675.41 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 )
  19743. 1678.96 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 )
  19744. 1679.13 s [algebraic-graphs] [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
  19745. 1679.13 s [algebraic-graphs] [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
  19746. 1679.84 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 )
  19747. 1679.84 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 )
  19748. 1679.84 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 )
  19749. 1680.72 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 )
  19750. 1680.72 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 )
  19751. 1680.72 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 )
  19752. 1680.72 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 )
  19753. 1680.72 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 )
  19754. 1680.72 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 )
  19755. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19756. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19757. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19758. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19759. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19760. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19761. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19762. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19763. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19764. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19765. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19766. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19767. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19768. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19769. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19770. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19771. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19772. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19773. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19774. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19775. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19776. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19777. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19778. 1680.72 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19779. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19780. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19781. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19782. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19783. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19784. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19785. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19786. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19787. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19788. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19789. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19790. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19791. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19792. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19793. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19794. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19795. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19796. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19797. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19798. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19799. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19800. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19801. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19802. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19803. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19804. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19805. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19806. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19807. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19808. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19809. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19810. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19811. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19812. 1680.73 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19813. 1680.73 s [algebraic-graphs] inspection testing successful
  19814. 1680.73 s [algebraic-graphs] expected successes: 58
  19815. 1680.73 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 )
  19816. 1680.73 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 )
  19817. 1680.73 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 )
  19818. 1681.42 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19819. 1682.35 s [algebraic-graphs] Phase: checkPhase
  19820. 1682.38 s [algebraic-graphs] Running 1 test suites...
  19821. 1682.38 s [algebraic-graphs] Test suite main: RUNNING...
  19822. 1688.52 s [algebraic-graphs]
  19823. 1688.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19824. 1689.29 s [algebraic-graphs] OK: show empty == "empty"
  19825. 1689.29 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19826. 1689.29 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19827. 1689.29 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19828. 1689.29 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19829. 1689.29 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19830. 1689.29 s [algebraic-graphs]
  19831. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19832. 1689.29 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19833. 1689.29 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19834. 1689.29 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19835. 1689.29 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19836. 1689.29 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19837. 1689.29 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19838. 1689.29 s [algebraic-graphs]
  19839. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19840. 1689.29 s [algebraic-graphs] OK: isEmpty empty == True
  19841. 1689.29 s [algebraic-graphs] OK: hasVertex x empty == False
  19842. 1689.29 s [algebraic-graphs] OK: vertexCount empty == 0
  19843. 1689.29 s [algebraic-graphs] OK: edgeCount empty == 0
  19844. 1689.29 s [algebraic-graphs]
  19845. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19846. 1689.29 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19847. 1689.29 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19848. 1689.29 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19849. 1689.29 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19850. 1689.29 s [algebraic-graphs]
  19851. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19852. 1689.29 s [algebraic-graphs] OK: vertices [] == empty
  19853. 1689.29 s [algebraic-graphs] OK: vertices [x] == vertex x
  19854. 1689.29 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19855. 1689.29 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19856. 1689.29 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19857. 1689.29 s [algebraic-graphs]
  19858. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  19859. 1689.29 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  19860. 1689.29 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  19861. 1689.29 s [algebraic-graphs]
  19862. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  19863. 1689.29 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  19864. 1689.29 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  19865. 1689.29 s [algebraic-graphs]
  19866. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  19867. 1689.29 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19868. 1689.29 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19869. 1689.29 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19870. 1689.29 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  19871. 1689.29 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19872. 1689.29 s [algebraic-graphs]
  19873. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  19874. 1689.29 s [algebraic-graphs] OK: isEmpty empty == True
  19875. 1689.29 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19876. 1689.29 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19877. 1689.29 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  19878. 1689.29 s [algebraic-graphs]
  19879. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  19880. 1689.29 s [algebraic-graphs] OK: hasVertex x empty == False
  19881. 1689.29 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19882. 1689.29 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19883. 1689.29 s [algebraic-graphs]
  19884. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  19885. 1689.29 s [algebraic-graphs] OK: hasEdge x y empty == False
  19886. 1689.29 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19887. 1689.29 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  19888. 1689.29 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19889. 1689.29 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19890. 1689.29 s [algebraic-graphs]
  19891. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  19892. 1689.29 s [algebraic-graphs] OK: vertexCount empty == 0
  19893. 1689.29 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19894. 1689.29 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19895. 1689.29 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19896. 1689.29 s [algebraic-graphs]
  19897. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  19898. 1689.29 s [algebraic-graphs] OK: edgeCount empty == 0
  19899. 1689.29 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19900. 1689.29 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  19901. 1689.29 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19902. 1689.29 s [algebraic-graphs]
  19903. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  19904. 1689.29 s [algebraic-graphs] OK: vertexList empty == []
  19905. 1689.29 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19906. 1689.29 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19907. 1689.29 s [algebraic-graphs]
  19908. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  19909. 1689.29 s [algebraic-graphs] OK: edgeList empty == []
  19910. 1689.29 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19911. 1689.29 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  19912. 1689.29 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19913. 1689.29 s [algebraic-graphs]
  19914. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  19915. 1689.29 s [algebraic-graphs] OK: adjacencyList empty == []
  19916. 1689.29 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19917. 1689.29 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  19918. 1689.29 s [algebraic-graphs]
  19919. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  19920. 1689.29 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19921. 1689.29 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19922. 1689.29 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19923. 1689.29 s [algebraic-graphs]
  19924. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  19925. 1689.29 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19926. 1689.29 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19927. 1689.29 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  19928. 1689.29 s [algebraic-graphs]
  19929. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  19930. 1689.29 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19931. 1689.29 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19932. 1689.29 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  19933. 1689.29 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  19934. 1689.29 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  19935. 1689.29 s [algebraic-graphs]
  19936. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  19937. 1689.29 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19938. 1689.29 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19939. 1689.29 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  19940. 1689.29 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  19941. 1689.29 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  19942. 1689.29 s [algebraic-graphs]
  19943. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  19944. 1689.29 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19945. 1689.29 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19946. 1689.29 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  19947. 1689.29 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19948. 1689.29 s [algebraic-graphs]
  19949. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  19950. 1689.29 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  19951. 1689.29 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19952. 1689.29 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19953. 1689.29 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  19954. 1689.29 s [algebraic-graphs]
  19955. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  19956. 1689.29 s [algebraic-graphs] OK: transpose empty == empty
  19957. 1689.29 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19958. 1689.29 s [algebraic-graphs] OK: transpose . transpose == id
  19959. 1689.29 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19960. 1689.29 s [algebraic-graphs]
  19961. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  19962. 1689.29 s [algebraic-graphs] OK: induce (const True ) x == x
  19963. 1689.29 s [algebraic-graphs] OK: induce (const False) x == empty
  19964. 1689.29 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19965. 1689.29 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19966. 1689.29 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19967. 1689.29 s [algebraic-graphs]
  19968. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  19969. 1689.29 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19970. 1689.29 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  19971. 1689.29 s [algebraic-graphs]
  19972. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  19973. 1689.29 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  19974. 1689.29 s [algebraic-graphs]
  19975. 1689.29 s [algebraic-graphs] OK: box x y ~~ box y x
  19976. 1689.29 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19977. 1689.29 s [algebraic-graphs] OK: box x empty ~~ empty
  19978. 1689.29 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19979. 1689.29 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19980. 1689.29 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19981. 1689.29 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19982. 1689.29 s [algebraic-graphs]
  19983. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  19984. 1689.29 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19985. 1689.29 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19986. 1689.29 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  19987. 1689.29 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19988. 1689.29 s [algebraic-graphs]
  19989. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  19990. 1689.29 s [algebraic-graphs] OK: topSort empty == []
  19991. 1689.29 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  19992. 1689.29 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  19993. 1689.29 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  19994. 1689.29 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  19995. 1689.29 s [algebraic-graphs]
  19996. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  19997. 1689.29 s [algebraic-graphs] OK: scc empty == empty
  19998. 1689.29 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  19999. 1689.29 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20000. 1689.29 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  20001. 1689.29 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20002. 1689.29 s [algebraic-graphs]
  20003. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  20004. 1689.29 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  20005. 1689.29 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  20006. 1689.29 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  20007. 1689.29 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  20008. 1689.29 s [algebraic-graphs]
  20009. 1689.29 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  20010. 1689.29 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  20011. 1689.29 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  20012. 1689.29 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  20013. 1689.29 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  20014. 1689.29 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  20015. 1689.29 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  20016. 1691.77 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  20017. 1691.77 s [algebraic-graphs]
  20018. 1691.77 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  20019. 1691.77 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  20020. 1691.77 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  20021. 1691.77 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  20022. 1691.77 s [algebraic-graphs]
  20023. 1691.77 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  20024. 1691.77 s [algebraic-graphs] OK: Arbitrary
  20025. 1691.77 s [algebraic-graphs] OK: empty
  20026. 1691.77 s [algebraic-graphs] OK: vertex
  20027. 1691.77 s [algebraic-graphs] OK: vertices
  20028. 1691.77 s [algebraic-graphs] OK: union
  20029. 1691.77 s [algebraic-graphs] OK: join
  20030. 1691.77 s [algebraic-graphs] OK: transpose
  20031. 1691.77 s [algebraic-graphs] OK: box
  20032. 1691.77 s [algebraic-graphs] OK: transitiveClosure
  20033. 1691.77 s [algebraic-graphs] OK: scc
  20034. 1691.77 s [algebraic-graphs] OK: toAcyclic
  20035. 1691.77 s [algebraic-graphs] OK: toAcyclicOrd
  20036. 1691.77 s [algebraic-graphs]
  20037. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap ============
  20038. 1691.77 s [algebraic-graphs] OK: Axioms of graphs
  20039. 1691.77 s [algebraic-graphs]
  20040. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  20041. 1691.77 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  20042. 1691.77 s [algebraic-graphs]
  20043. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  20044. 1691.77 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20045. 1691.77 s [algebraic-graphs]
  20046. 1691.77 s [algebraic-graphs] OK: consistent empty == True
  20047. 1691.77 s [algebraic-graphs] OK: consistent (vertex x) == True
  20048. 1691.77 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20049. 1691.77 s [algebraic-graphs] OK: consistent (connect x y) == True
  20050. 1691.77 s [algebraic-graphs] OK: consistent (edge x y) == True
  20051. 1691.77 s [algebraic-graphs] OK: consistent (edges xs) == True
  20052. 1691.77 s [algebraic-graphs] OK: consistent (stars xs) == True
  20053. 1691.77 s [algebraic-graphs]
  20054. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  20055. 1691.77 s [algebraic-graphs] OK: show (empty ) == "empty"
  20056. 1691.77 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20057. 1691.77 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20058. 1691.77 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20059. 1691.77 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20060. 1691.77 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20061. 1691.77 s [algebraic-graphs]
  20062. 1691.77 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20063. 1691.77 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20064. 1691.77 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20065. 1691.77 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20066. 1691.77 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20067. 1691.77 s [algebraic-graphs]
  20068. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  20069. 1691.77 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20070. 1691.77 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20071. 1691.77 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20072. 1691.77 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20073. 1691.77 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20074. 1691.77 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20075. 1691.77 s [algebraic-graphs] OK: x <= x + y
  20076. 1691.77 s [algebraic-graphs] OK: x + y <= x * y
  20077. 1691.77 s [algebraic-graphs]
  20078. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  20079. 1691.77 s [algebraic-graphs] OK: isEmpty empty == True
  20080. 1691.77 s [algebraic-graphs] OK: hasVertex x empty == False
  20081. 1691.77 s [algebraic-graphs] OK: vertexCount empty == 0
  20082. 1691.77 s [algebraic-graphs] OK: edgeCount empty == 0
  20083. 1691.77 s [algebraic-graphs]
  20084. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  20085. 1691.77 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20086. 1691.77 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20087. 1691.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20088. 1691.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20089. 1691.77 s [algebraic-graphs]
  20090. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  20091. 1691.77 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20092. 1691.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20093. 1691.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20094. 1691.77 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20095. 1691.77 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20096. 1691.77 s [algebraic-graphs]
  20097. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  20098. 1691.77 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20099. 1691.77 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20100. 1691.77 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20101. 1691.77 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20102. 1691.77 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20103. 1691.77 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20104. 1691.77 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20105. 1691.77 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20106. 1691.77 s [algebraic-graphs]
  20107. 1691.77 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  20108. 1691.77 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20109. 1691.77 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20110. 1691.77 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20111. 1691.77 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20112. 1691.77 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20113. 1691.77 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20114. 1691.77 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20115. 1691.78 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20116. 1691.78 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20117. 1691.78 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20118. 1691.78 s [algebraic-graphs]
  20119. 1691.78 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  20120. 1691.78 s [algebraic-graphs] OK: vertices [] == empty
  20121. 1691.78 s [algebraic-graphs] OK: vertices [x] == vertex x
  20122. 1691.78 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20123. 1691.78 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20124. 1691.78 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20125. 1691.78 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20126. 1691.78 s [algebraic-graphs]
  20127. 1691.78 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  20128. 1691.78 s [algebraic-graphs] OK: edges [] == empty
  20129. 1691.78 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20130. 1691.78 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20131. 1691.78 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20132. 1691.78 s [algebraic-graphs]
  20133. 1691.78 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  20134. 1691.78 s [algebraic-graphs] OK: overlays [] == empty
  20135. 1691.78 s [algebraic-graphs] OK: overlays [x] == x
  20136. 1691.78 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20137. 1691.78 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20138. 1691.78 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20139. 1691.78 s [algebraic-graphs]
  20140. 1691.78 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  20141. 1691.78 s [algebraic-graphs] OK: connects [] == empty
  20142. 1691.78 s [algebraic-graphs] OK: connects [x] == x
  20143. 1691.78 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20144. 1691.78 s [algebraic-graphs] OK: connects == foldr connect empty
  20145. 1691.78 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20146. 1691.78 s [algebraic-graphs]
  20147. 1691.78 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  20148. 1691.78 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  20149. 1691.78 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  20150. 1691.78 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  20151. 1691.78 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  20152. 1691.78 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  20153. 1691.78 s [algebraic-graphs]
  20154. 1691.78 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  20155. 1691.78 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20156. 1691.78 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20157. 1691.78 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20158. 1691.78 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20159. 1691.78 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20160. 1691.78 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20161. 1691.78 s [algebraic-graphs]
  20162. 1691.78 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  20163. 1691.78 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20164. 1691.78 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20165. 1691.78 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20166. 1691.78 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20167. 1691.78 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20168. 1691.78 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20169. 1691.78 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20170. 1691.78 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20171. 1691.78 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20172. 1691.78 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20173. 1691.78 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20174. 1691.78 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20175. 1691.78 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20176. 1691.78 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20177. 1691.78 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20178. 1691.78 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20179. 1691.78 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20180. 1691.78 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20181. 1691.78 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20182. 1691.78 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20183. 1691.78 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20184. 1691.78 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20185. 1691.78 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20186. 1691.78 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20187. 1691.78 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20188. 1691.78 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20189. 1691.78 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20190. 1691.78 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20191. 1691.78 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20192. 1691.78 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20193. 1691.78 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20194. 1691.78 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20195. 1691.78 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20196. 1691.78 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20197. 1692.53 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20198. 1692.53 s [algebraic-graphs]
  20199. 1692.53 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  20200. 1692.53 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20201. 1692.53 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20202. 1692.54 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20203. 1692.54 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20204. 1692.54 s [algebraic-graphs]
  20205. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  20206. 1692.54 s [algebraic-graphs] OK: isEmpty empty == True
  20207. 1692.54 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20208. 1692.54 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20209. 1692.54 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20210. 1692.54 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20211. 1692.54 s [algebraic-graphs]
  20212. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  20213. 1692.54 s [algebraic-graphs] OK: hasVertex x empty == False
  20214. 1692.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20215. 1692.54 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20216. 1692.54 s [algebraic-graphs]
  20217. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  20218. 1692.54 s [algebraic-graphs] OK: hasEdge x y empty == False
  20219. 1692.54 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20220. 1692.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20221. 1692.54 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20222. 1692.54 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20223. 1692.54 s [algebraic-graphs]
  20224. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20225. 1692.54 s [algebraic-graphs] OK: vertexCount empty == 0
  20226. 1692.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20227. 1692.54 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20228. 1692.54 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20229. 1692.54 s [algebraic-graphs]
  20230. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20231. 1692.54 s [algebraic-graphs] OK: edgeCount empty == 0
  20232. 1692.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20233. 1692.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20234. 1692.54 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20235. 1692.54 s [algebraic-graphs]
  20236. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20237. 1692.54 s [algebraic-graphs] OK: vertexList empty == []
  20238. 1692.54 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20239. 1692.54 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20240. 1692.54 s [algebraic-graphs]
  20241. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20242. 1692.54 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20243. 1692.54 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20244. 1692.54 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20245. 1692.54 s [algebraic-graphs]
  20246. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20247. 1692.54 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20248. 1692.54 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20249. 1692.54 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20250. 1692.54 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20251. 1692.54 s [algebraic-graphs]
  20252. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20253. 1692.54 s [algebraic-graphs] OK: edgeList empty == []
  20254. 1692.54 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20255. 1692.54 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20256. 1692.54 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20257. 1692.54 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20258. 1692.54 s [algebraic-graphs]
  20259. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20260. 1692.54 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20261. 1692.54 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20262. 1692.54 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20263. 1692.54 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20264. 1692.54 s [algebraic-graphs]
  20265. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20266. 1692.54 s [algebraic-graphs] OK: adjacencyList empty == []
  20267. 1692.54 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20268. 1692.54 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20269. 1692.54 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20270. 1692.54 s [algebraic-graphs]
  20271. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20272. 1692.54 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20273. 1692.54 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20274. 1692.54 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20275. 1692.54 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20276. 1692.54 s [algebraic-graphs]
  20277. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20278. 1692.54 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20279. 1692.54 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20280. 1692.54 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20281. 1692.54 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20282. 1692.54 s [algebraic-graphs]
  20283. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20284. 1692.54 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20285. 1692.54 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20286. 1692.54 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20287. 1692.54 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20288. 1692.54 s [algebraic-graphs]
  20289. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20290. 1692.54 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20291. 1692.54 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20292. 1692.54 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20293. 1692.54 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20294. 1692.54 s [algebraic-graphs]
  20295. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20296. 1692.54 s [algebraic-graphs] OK: path [] == empty
  20297. 1692.54 s [algebraic-graphs] OK: path [x] == vertex x
  20298. 1692.54 s [algebraic-graphs] OK: path [x,y] == edge x y
  20299. 1692.54 s [algebraic-graphs]
  20300. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20301. 1692.54 s [algebraic-graphs] OK: circuit [] == empty
  20302. 1692.54 s [algebraic-graphs] OK: circuit [x] == edge x x
  20303. 1692.54 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20304. 1692.54 s [algebraic-graphs]
  20305. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20306. 1692.54 s [algebraic-graphs] OK: clique [] == empty
  20307. 1692.54 s [algebraic-graphs] OK: clique [x] == vertex x
  20308. 1692.54 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20309. 1692.54 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20310. 1692.54 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20311. 1692.54 s [algebraic-graphs]
  20312. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20313. 1692.54 s [algebraic-graphs] OK: biclique [] [] == empty
  20314. 1692.54 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20315. 1692.54 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20316. 1692.54 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20317. 1692.54 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20318. 1692.54 s [algebraic-graphs]
  20319. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20320. 1692.54 s [algebraic-graphs] OK: star x [] == vertex x
  20321. 1692.54 s [algebraic-graphs] OK: star x [y] == edge x y
  20322. 1692.54 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20323. 1692.54 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20324. 1692.54 s [algebraic-graphs]
  20325. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20326. 1692.54 s [algebraic-graphs] OK: stars [] == empty
  20327. 1692.54 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20328. 1692.54 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20329. 1692.54 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20330. 1692.54 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20331. 1692.54 s [algebraic-graphs] OK: stars . adjacencyList == id
  20332. 1692.54 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20333. 1692.54 s [algebraic-graphs]
  20334. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20335. 1692.54 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20336. 1692.54 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20337. 1692.54 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20338. 1692.54 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20339. 1692.54 s [algebraic-graphs]
  20340. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20341. 1692.54 s [algebraic-graphs] OK: forest [] == empty
  20342. 1692.54 s [algebraic-graphs] OK: forest [x] == tree x
  20343. 1692.54 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20344. 1692.54 s [algebraic-graphs] OK: forest == overlays . map tree
  20345. 1692.54 s [algebraic-graphs]
  20346. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20347. 1692.54 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20348. 1692.54 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20349. 1692.54 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20350. 1692.54 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20351. 1692.54 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20352. 1692.54 s [algebraic-graphs]
  20353. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20354. 1692.54 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20355. 1692.54 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20356. 1692.54 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20357. 1692.54 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20358. 1692.54 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20359. 1692.54 s [algebraic-graphs]
  20360. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20361. 1692.54 s [algebraic-graphs] OK: replaceVertex x x == id
  20362. 1692.54 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20363. 1692.54 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20364. 1692.54 s [algebraic-graphs]
  20365. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20366. 1692.54 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20367. 1692.54 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20368. 1692.54 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20369. 1692.54 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20370. 1692.54 s [algebraic-graphs]
  20371. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20372. 1692.54 s [algebraic-graphs] OK: transpose empty == empty
  20373. 1692.54 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20374. 1692.54 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20375. 1692.54 s [algebraic-graphs] OK: transpose . transpose == id
  20376. 1692.54 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20377. 1692.54 s [algebraic-graphs]
  20378. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20379. 1692.54 s [algebraic-graphs] OK: gmap f empty == empty
  20380. 1692.54 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20381. 1692.54 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20382. 1692.54 s [algebraic-graphs] OK: gmap id == id
  20383. 1692.54 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20384. 1692.54 s [algebraic-graphs]
  20385. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20386. 1692.54 s [algebraic-graphs] OK: induce (const True ) x == x
  20387. 1692.54 s [algebraic-graphs] OK: induce (const False) x == empty
  20388. 1692.54 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20389. 1692.54 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20390. 1692.54 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20391. 1692.54 s [algebraic-graphs]
  20392. 1692.54 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20393. 1692.54 s [algebraic-graphs] OK: compose empty x == empty
  20394. 1692.54 s [algebraic-graphs] OK: compose x empty == empty
  20395. 1692.54 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20396. 1692.54 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20397. 1692.54 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20398. 1692.54 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20399. 1692.77 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20400. 1692.77 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20401. 1692.77 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20402. 1692.77 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20403. 1692.77 s [algebraic-graphs]
  20404. 1692.77 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20405. 1692.77 s [algebraic-graphs] OK: closure empty == empty
  20406. 1692.77 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20407. 1692.77 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20408. 1692.77 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20409. 1692.77 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20410. 1692.77 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20411. 1692.77 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20412. 1692.77 s [algebraic-graphs] OK: closure . closure == closure
  20413. 1692.77 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20414. 1692.77 s [algebraic-graphs]
  20415. 1692.77 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20416. 1692.77 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20417. 1692.77 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20418. 1692.77 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20419. 1692.77 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20420. 1692.77 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20421. 1692.77 s [algebraic-graphs]
  20422. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20423. 1692.78 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20424. 1692.78 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20425. 1692.78 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20426. 1692.78 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20427. 1692.78 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20428. 1692.78 s [algebraic-graphs]
  20429. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20430. 1692.78 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20431. 1692.78 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20432. 1692.78 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20433. 1692.78 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20434. 1692.78 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20435. 1692.78 s [algebraic-graphs]
  20436. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20437. 1692.78 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20438. 1692.78 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20439. 1692.78 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20440. 1692.78 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20441. 1692.78 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20442. 1692.78 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20443. 1692.78 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20444. 1692.78 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20445. 1692.78 s [algebraic-graphs] OK: bfsForest x [] == []
  20446. 1692.78 s [algebraic-graphs] OK: bfsForest empty vs == []
  20447. 1692.78 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20448. 1692.78 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20449. 1692.78 s [algebraic-graphs]
  20450. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20451. 1692.78 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20452. 1692.78 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20453. 1692.78 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20454. 1692.78 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20455. 1692.78 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20456. 1692.78 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20457. 1692.78 s [algebraic-graphs] OK: bfs empty vs == []
  20458. 1692.78 s [algebraic-graphs] OK: bfs x [] == []
  20459. 1692.78 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20460. 1692.78 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20461. 1692.78 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20462. 1692.78 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20463. 1692.78 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20464. 1692.78 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20465. 1692.78 s [algebraic-graphs]
  20466. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20467. 1692.78 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20468. 1692.78 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20469. 1692.78 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20470. 1692.78 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20471. 1692.78 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20472. 1692.78 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20473. 1692.78 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20474. 1692.78 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20475. 1692.78 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20476. 1692.78 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20477. 1692.78 s [algebraic-graphs]
  20478. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20479. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20480. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20481. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20482. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20483. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20484. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20485. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20486. 1692.78 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20487. 1692.78 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20488. 1692.78 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20489. 1692.78 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20490. 1692.78 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20491. 1692.78 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20492. 1692.78 s [algebraic-graphs]
  20493. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20494. 1692.78 s [algebraic-graphs] OK: dfs empty vs == []
  20495. 1692.78 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20496. 1692.78 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20497. 1692.78 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20498. 1692.78 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20499. 1692.78 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20500. 1692.78 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20501. 1692.78 s [algebraic-graphs] OK: dfs x [] == []
  20502. 1692.78 s [algebraic-graphs]
  20503. 1692.78 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20504. 1692.78 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20505. 1692.78 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20506. 1692.78 s [algebraic-graphs]
  20507. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20508. 1692.78 s [algebraic-graphs] OK: reachable empty x == []
  20509. 1692.78 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20510. 1692.78 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20511. 1692.78 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20512. 1692.78 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20513. 1692.78 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20514. 1692.78 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20515. 1692.78 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20516. 1692.78 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20517. 1692.78 s [algebraic-graphs]
  20518. 1692.78 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20519. 1692.78 s [algebraic-graphs]
  20520. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20521. 1692.78 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20522. 1692.78 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20523. 1692.78 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20524. 1692.78 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20525. 1692.78 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20526. 1692.78 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20527. 1692.78 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20528. 1692.78 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20529. 1692.78 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20530. 1692.78 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20531. 1692.78 s [algebraic-graphs]
  20532. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20533. 1692.78 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20534. 1692.78 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20535. 1692.78 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20536. 1692.78 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20537. 1692.78 s [algebraic-graphs]
  20538. 1692.78 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20539. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20540. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20541. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20542. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20543. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20544. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20545. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20546. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20547. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20548. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20549. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20550. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20551. 1692.78 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20552. 1697.37 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20553. 1697.37 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20554. 1697.43 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20555. 1697.43 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20556. 1697.43 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20557. 1697.43 s [algebraic-graphs]
  20558. 1697.43 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20559. 1697.43 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20560. 1697.43 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20561. 1697.43 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20562. 1697.43 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20563. 1697.43 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20564. 1697.43 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20565. 1697.43 s [algebraic-graphs]
  20566. 1697.43 s [algebraic-graphs] ============ AdjacencyMap ============
  20567. 1697.43 s [algebraic-graphs] OK: Axioms of graphs
  20568. 1697.43 s [algebraic-graphs]
  20569. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20570. 1697.43 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20571. 1697.43 s [algebraic-graphs]
  20572. 1697.43 s [algebraic-graphs] OK: consistent empty == True
  20573. 1697.43 s [algebraic-graphs] OK: consistent (vertex x) == True
  20574. 1697.43 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20575. 1697.43 s [algebraic-graphs] OK: consistent (connect x y) == True
  20576. 1697.43 s [algebraic-graphs] OK: consistent (edge x y) == True
  20577. 1697.43 s [algebraic-graphs] OK: consistent (edges xs) == True
  20578. 1697.43 s [algebraic-graphs] OK: consistent (stars xs) == True
  20579. 1697.43 s [algebraic-graphs]
  20580. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20581. 1697.43 s [algebraic-graphs] OK: show (empty ) == "empty"
  20582. 1697.43 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20583. 1697.43 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20584. 1697.43 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20585. 1697.43 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20586. 1697.43 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20587. 1697.43 s [algebraic-graphs]
  20588. 1697.43 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20589. 1697.43 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20590. 1697.43 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20591. 1697.43 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20592. 1697.43 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20593. 1697.43 s [algebraic-graphs]
  20594. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20595. 1697.43 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20596. 1697.43 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20597. 1697.43 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20598. 1697.43 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20599. 1697.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20600. 1697.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20601. 1697.43 s [algebraic-graphs] OK: x <= x + y
  20602. 1697.43 s [algebraic-graphs] OK: x + y <= x * y
  20603. 1697.43 s [algebraic-graphs]
  20604. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20605. 1697.43 s [algebraic-graphs] OK: isEmpty empty == True
  20606. 1697.43 s [algebraic-graphs] OK: hasVertex x empty == False
  20607. 1697.43 s [algebraic-graphs] OK: vertexCount empty == 0
  20608. 1697.43 s [algebraic-graphs] OK: edgeCount empty == 0
  20609. 1697.43 s [algebraic-graphs]
  20610. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20611. 1697.43 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20612. 1697.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20613. 1697.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20614. 1697.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20615. 1697.43 s [algebraic-graphs]
  20616. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20617. 1697.43 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20618. 1697.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20619. 1697.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20620. 1697.43 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20621. 1697.43 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20622. 1697.43 s [algebraic-graphs]
  20623. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20624. 1697.43 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20625. 1697.43 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20626. 1697.43 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20627. 1697.43 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20628. 1697.43 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20629. 1697.43 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20630. 1697.43 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20631. 1697.43 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20632. 1697.43 s [algebraic-graphs]
  20633. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20634. 1697.43 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20635. 1697.43 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20636. 1697.43 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20637. 1697.43 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20638. 1697.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20639. 1697.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20640. 1697.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20641. 1697.43 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20642. 1697.43 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20643. 1697.43 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20644. 1697.43 s [algebraic-graphs]
  20645. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20646. 1697.43 s [algebraic-graphs] OK: vertices [] == empty
  20647. 1697.43 s [algebraic-graphs] OK: vertices [x] == vertex x
  20648. 1697.43 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20649. 1697.43 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20650. 1697.43 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20651. 1697.43 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20652. 1697.43 s [algebraic-graphs]
  20653. 1697.43 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20654. 1697.43 s [algebraic-graphs] OK: edges [] == empty
  20655. 1697.43 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20656. 1697.43 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20657. 1697.43 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20658. 1697.44 s [algebraic-graphs]
  20659. 1697.44 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20660. 1697.44 s [algebraic-graphs] OK: overlays [] == empty
  20661. 1697.44 s [algebraic-graphs] OK: overlays [x] == x
  20662. 1697.44 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20663. 1697.44 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20664. 1697.44 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20665. 1697.44 s [algebraic-graphs]
  20666. 1697.44 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20667. 1697.44 s [algebraic-graphs] OK: connects [] == empty
  20668. 1697.44 s [algebraic-graphs] OK: connects [x] == x
  20669. 1697.44 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20670. 1697.44 s [algebraic-graphs] OK: connects == foldr connect empty
  20671. 1697.44 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20672. 1697.44 s [algebraic-graphs]
  20673. 1697.44 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20674. 1697.44 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20675. 1697.44 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20676. 1697.44 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20677. 1697.44 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20678. 1697.44 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20679. 1697.44 s [algebraic-graphs]
  20680. 1697.44 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20681. 1697.44 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20682. 1697.44 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20683. 1697.44 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20684. 1697.44 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20685. 1697.44 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20686. 1697.44 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20687. 1697.44 s [algebraic-graphs]
  20688. 1697.44 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20689. 1697.44 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20690. 1697.44 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20691. 1697.44 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20692. 1697.44 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20693. 1697.44 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20694. 1697.44 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20695. 1697.44 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20696. 1697.44 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20697. 1697.44 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20698. 1697.44 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20699. 1697.44 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20700. 1697.44 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20701. 1697.44 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20702. 1697.44 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20703. 1697.44 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20704. 1697.44 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20705. 1697.44 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20706. 1697.44 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20707. 1697.44 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20708. 1697.44 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20709. 1697.44 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20710. 1697.44 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20711. 1697.44 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20712. 1697.44 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20713. 1697.44 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20714. 1697.44 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20715. 1697.44 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20716. 1697.44 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20717. 1697.44 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20718. 1697.44 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20719. 1697.44 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20720. 1697.44 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20721. 1697.44 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20722. 1699.07 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20723. 1699.07 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20724. 1699.07 s [algebraic-graphs]
  20725. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20726. 1699.07 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20727. 1699.07 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20728. 1699.07 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20729. 1699.07 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20730. 1699.07 s [algebraic-graphs]
  20731. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20732. 1699.07 s [algebraic-graphs] OK: isEmpty empty == True
  20733. 1699.07 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20734. 1699.07 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20735. 1699.07 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20736. 1699.07 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20737. 1699.07 s [algebraic-graphs]
  20738. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20739. 1699.07 s [algebraic-graphs] OK: hasVertex x empty == False
  20740. 1699.07 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20741. 1699.07 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20742. 1699.07 s [algebraic-graphs]
  20743. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20744. 1699.07 s [algebraic-graphs] OK: hasEdge x y empty == False
  20745. 1699.07 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20746. 1699.07 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20747. 1699.07 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20748. 1699.07 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20749. 1699.07 s [algebraic-graphs]
  20750. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20751. 1699.07 s [algebraic-graphs] OK: vertexCount empty == 0
  20752. 1699.07 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20753. 1699.07 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20754. 1699.07 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20755. 1699.07 s [algebraic-graphs]
  20756. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20757. 1699.07 s [algebraic-graphs] OK: edgeCount empty == 0
  20758. 1699.07 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20759. 1699.07 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20760. 1699.07 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20761. 1699.07 s [algebraic-graphs]
  20762. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20763. 1699.07 s [algebraic-graphs] OK: vertexList empty == []
  20764. 1699.07 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20765. 1699.07 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20766. 1699.07 s [algebraic-graphs]
  20767. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20768. 1699.07 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20769. 1699.07 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20770. 1699.07 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20771. 1699.07 s [algebraic-graphs]
  20772. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20773. 1699.07 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20774. 1699.07 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20775. 1699.07 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20776. 1699.07 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20777. 1699.07 s [algebraic-graphs]
  20778. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20779. 1699.07 s [algebraic-graphs] OK: edgeList empty == []
  20780. 1699.07 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20781. 1699.07 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20782. 1699.07 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20783. 1699.07 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20784. 1699.07 s [algebraic-graphs]
  20785. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20786. 1699.07 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20787. 1699.07 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20788. 1699.07 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20789. 1699.07 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20790. 1699.07 s [algebraic-graphs]
  20791. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20792. 1699.07 s [algebraic-graphs] OK: adjacencyList empty == []
  20793. 1699.07 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20794. 1699.07 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20795. 1699.07 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20796. 1699.07 s [algebraic-graphs]
  20797. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20798. 1699.07 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20799. 1699.07 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20800. 1699.07 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20801. 1699.07 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20802. 1699.07 s [algebraic-graphs]
  20803. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20804. 1699.07 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20805. 1699.07 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20806. 1699.07 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20807. 1699.07 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20808. 1699.07 s [algebraic-graphs]
  20809. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20810. 1699.07 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20811. 1699.07 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20812. 1699.07 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20813. 1699.07 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20814. 1699.07 s [algebraic-graphs]
  20815. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20816. 1699.07 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20817. 1699.07 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20818. 1699.07 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20819. 1699.07 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20820. 1699.07 s [algebraic-graphs]
  20821. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20822. 1699.07 s [algebraic-graphs] OK: path [] == empty
  20823. 1699.07 s [algebraic-graphs] OK: path [x] == vertex x
  20824. 1699.07 s [algebraic-graphs] OK: path [x,y] == edge x y
  20825. 1699.07 s [algebraic-graphs]
  20826. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20827. 1699.07 s [algebraic-graphs] OK: circuit [] == empty
  20828. 1699.07 s [algebraic-graphs] OK: circuit [x] == edge x x
  20829. 1699.07 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20830. 1699.07 s [algebraic-graphs]
  20831. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20832. 1699.07 s [algebraic-graphs] OK: clique [] == empty
  20833. 1699.07 s [algebraic-graphs] OK: clique [x] == vertex x
  20834. 1699.07 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20835. 1699.07 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20836. 1699.07 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20837. 1699.07 s [algebraic-graphs]
  20838. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20839. 1699.07 s [algebraic-graphs] OK: biclique [] [] == empty
  20840. 1699.07 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20841. 1699.07 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20842. 1699.07 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20843. 1699.07 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20844. 1699.07 s [algebraic-graphs]
  20845. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20846. 1699.07 s [algebraic-graphs] OK: star x [] == vertex x
  20847. 1699.07 s [algebraic-graphs] OK: star x [y] == edge x y
  20848. 1699.07 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20849. 1699.07 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20850. 1699.07 s [algebraic-graphs]
  20851. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20852. 1699.07 s [algebraic-graphs] OK: stars [] == empty
  20853. 1699.07 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20854. 1699.07 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20855. 1699.07 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20856. 1699.07 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20857. 1699.07 s [algebraic-graphs] OK: stars . adjacencyList == id
  20858. 1699.07 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20859. 1699.07 s [algebraic-graphs]
  20860. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  20861. 1699.07 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20862. 1699.07 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20863. 1699.07 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20864. 1699.07 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20865. 1699.07 s [algebraic-graphs]
  20866. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  20867. 1699.07 s [algebraic-graphs] OK: forest [] == empty
  20868. 1699.07 s [algebraic-graphs] OK: forest [x] == tree x
  20869. 1699.07 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20870. 1699.07 s [algebraic-graphs] OK: forest == overlays . map tree
  20871. 1699.07 s [algebraic-graphs]
  20872. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  20873. 1699.07 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20874. 1699.07 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20875. 1699.07 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20876. 1699.07 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20877. 1699.07 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20878. 1699.07 s [algebraic-graphs]
  20879. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  20880. 1699.07 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20881. 1699.07 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20882. 1699.07 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20883. 1699.07 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20884. 1699.07 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20885. 1699.07 s [algebraic-graphs]
  20886. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  20887. 1699.07 s [algebraic-graphs] OK: replaceVertex x x == id
  20888. 1699.07 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20889. 1699.07 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20890. 1699.07 s [algebraic-graphs]
  20891. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  20892. 1699.07 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20893. 1699.07 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20894. 1699.07 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20895. 1699.07 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20896. 1699.07 s [algebraic-graphs]
  20897. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  20898. 1699.07 s [algebraic-graphs] OK: transpose empty == empty
  20899. 1699.07 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20900. 1699.07 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20901. 1699.07 s [algebraic-graphs] OK: transpose . transpose == id
  20902. 1699.07 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20903. 1699.07 s [algebraic-graphs]
  20904. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  20905. 1699.07 s [algebraic-graphs] OK: gmap f empty == empty
  20906. 1699.07 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20907. 1699.07 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20908. 1699.07 s [algebraic-graphs] OK: gmap id == id
  20909. 1699.07 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20910. 1699.07 s [algebraic-graphs]
  20911. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  20912. 1699.07 s [algebraic-graphs] OK: induce (const True ) x == x
  20913. 1699.07 s [algebraic-graphs] OK: induce (const False) x == empty
  20914. 1699.07 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20915. 1699.07 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20916. 1699.07 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20917. 1699.07 s [algebraic-graphs]
  20918. 1699.07 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  20919. 1699.07 s [algebraic-graphs] OK: compose empty x == empty
  20920. 1699.07 s [algebraic-graphs] OK: compose x empty == empty
  20921. 1699.07 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20922. 1699.07 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20923. 1699.07 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20924. 1699.07 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20925. 1701.34 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20926. 1701.34 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20927. 1701.34 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20928. 1701.34 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20929. 1701.34 s [algebraic-graphs]
  20930. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  20931. 1701.34 s [algebraic-graphs] OK: closure empty == empty
  20932. 1701.34 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20933. 1701.34 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20934. 1701.34 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20935. 1701.34 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20936. 1701.34 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20937. 1701.34 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20938. 1701.34 s [algebraic-graphs] OK: closure . closure == closure
  20939. 1701.34 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20940. 1701.34 s [algebraic-graphs]
  20941. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  20942. 1701.34 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20943. 1701.34 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20944. 1701.34 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20945. 1701.34 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20946. 1701.34 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20947. 1701.34 s [algebraic-graphs]
  20948. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  20949. 1701.34 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20950. 1701.34 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20951. 1701.34 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20952. 1701.34 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20953. 1701.34 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20954. 1701.34 s [algebraic-graphs]
  20955. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  20956. 1701.34 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20957. 1701.34 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20958. 1701.34 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20959. 1701.34 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20960. 1701.34 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20961. 1701.34 s [algebraic-graphs]
  20962. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.box ============
  20963. 1701.34 s [algebraic-graphs] OK: box x y ~~ box y x
  20964. 1701.34 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20965. 1701.34 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20966. 1701.34 s [algebraic-graphs] OK: box x empty ~~ empty
  20967. 1701.34 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20968. 1701.34 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20969. 1701.34 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20970. 1701.34 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20971. 1701.34 s [algebraic-graphs]
  20972. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  20973. 1701.34 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20974. 1701.34 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20975. 1701.34 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20976. 1701.34 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20977. 1701.34 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20978. 1701.34 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20979. 1701.34 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20980. 1701.34 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20981. 1701.34 s [algebraic-graphs] OK: bfsForest x [] == []
  20982. 1701.34 s [algebraic-graphs] OK: bfsForest empty vs == []
  20983. 1701.34 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20984. 1701.34 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20985. 1701.34 s [algebraic-graphs]
  20986. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  20987. 1701.34 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20988. 1701.34 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20989. 1701.34 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20990. 1701.34 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20991. 1701.34 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20992. 1701.34 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20993. 1701.34 s [algebraic-graphs] OK: bfs empty vs == []
  20994. 1701.34 s [algebraic-graphs] OK: bfs x [] == []
  20995. 1701.34 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20996. 1701.34 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20997. 1701.34 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20998. 1701.34 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20999. 1701.34 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  21000. 1701.34 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  21001. 1701.34 s [algebraic-graphs]
  21002. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  21003. 1701.34 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  21004. 1701.34 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  21005. 1701.34 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  21006. 1701.34 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  21007. 1701.34 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  21008. 1701.34 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  21009. 1701.34 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  21010. 1701.34 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  21011. 1701.34 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  21012. 1701.34 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  21013. 1701.34 s [algebraic-graphs]
  21014. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  21015. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  21016. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  21017. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  21018. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  21019. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  21020. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  21021. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  21022. 1701.34 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  21023. 1701.34 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  21024. 1701.34 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  21025. 1701.34 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  21026. 1701.34 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21027. 1701.34 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  21028. 1701.34 s [algebraic-graphs]
  21029. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21030. 1701.34 s [algebraic-graphs] OK: dfs empty vs == []
  21031. 1701.34 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  21032. 1701.34 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  21033. 1701.34 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  21034. 1701.34 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  21035. 1701.34 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  21036. 1701.34 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  21037. 1701.34 s [algebraic-graphs] OK: dfs x [] == []
  21038. 1701.34 s [algebraic-graphs]
  21039. 1701.34 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  21040. 1701.34 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  21041. 1701.34 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  21042. 1701.34 s [algebraic-graphs]
  21043. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21044. 1701.34 s [algebraic-graphs] OK: reachable empty x == []
  21045. 1701.34 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  21046. 1701.34 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  21047. 1701.34 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  21048. 1701.34 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  21049. 1701.34 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  21050. 1701.34 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  21051. 1701.34 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  21052. 1701.34 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  21053. 1701.34 s [algebraic-graphs]
  21054. 1701.34 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  21055. 1701.34 s [algebraic-graphs]
  21056. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  21057. 1701.34 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  21058. 1701.34 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  21059. 1701.34 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  21060. 1701.34 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  21061. 1701.34 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  21062. 1701.34 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  21063. 1701.34 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  21064. 1701.34 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  21065. 1701.34 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  21066. 1701.34 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  21067. 1701.34 s [algebraic-graphs]
  21068. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  21069. 1701.34 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  21070. 1701.34 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  21071. 1701.34 s [algebraic-graphs] OK: isAcyclic . circuit == null
  21072. 1701.34 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  21073. 1701.34 s [algebraic-graphs]
  21074. 1701.34 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  21075. 1701.34 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  21076. 1701.34 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  21077. 1701.34 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  21078. 1701.34 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  21079. 1701.34 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  21080. 1701.34 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  21081. 1701.34 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  21082. 1706.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  21083. 1706.71 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  21084. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  21085. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  21086. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  21087. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  21088. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  21089. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  21090. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  21091. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  21092. 1706.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  21093. 1706.72 s [algebraic-graphs]
  21094. 1706.72 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  21095. 1706.72 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  21096. 1706.72 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  21097. 1706.72 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  21098. 1706.72 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  21099. 1706.72 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  21100. 1706.72 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  21101. 1706.72 s [algebraic-graphs]
  21102. 1706.72 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  21103. 1706.72 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21104. 1706.72 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21105. 1706.72 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21106. 1706.72 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21107. 1706.72 s [algebraic-graphs]
  21108. 1706.72 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  21109. 1706.72 s [algebraic-graphs] OK: scc empty == empty
  21110. 1706.72 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  21111. 1706.72 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  21112. 1706.72 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  21113. 1706.72 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  21114. 1706.72 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  21115. 1706.72 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  21116. 1706.72 s [algebraic-graphs] OK: isAcyclic . scc == const True
  21117. 1706.72 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  21118. 1706.72 s [algebraic-graphs] OK: scc g == KL.scc g
  21119. 1706.72 s [algebraic-graphs]
  21120. 1706.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  21121. 1706.72 s [algebraic-graphs] OK: 0 == rightVertex 0
  21122. 1706.72 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  21123. 1706.72 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  21124. 1706.72 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  21125. 1706.72 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  21126. 1706.72 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  21127. 1706.72 s [algebraic-graphs]
  21128. 1706.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  21129. 1706.72 s [algebraic-graphs] OK: show empty == "empty"
  21130. 1706.72 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  21131. 1706.72 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  21132. 1706.72 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  21133. 1706.72 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  21134. 1706.72 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  21135. 1706.72 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  21136. 1706.72 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  21137. 1706.72 s [algebraic-graphs]
  21138. 1706.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  21139. 1706.72 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  21140. 1706.72 s [algebraic-graphs]
  21141. 1706.72 s [algebraic-graphs] OK: x + y == y + x
  21142. 1706.72 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  21143. 1706.72 s [algebraic-graphs] OK: x * empty == x
  21144. 1706.72 s [algebraic-graphs] OK: empty * x == x
  21145. 1706.72 s [algebraic-graphs] OK: x * y == y * x
  21146. 1706.72 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  21147. 1706.72 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  21148. 1706.72 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  21149. 1706.72 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  21150. 1706.72 s [algebraic-graphs] OK: x + empty == x
  21151. 1706.72 s [algebraic-graphs] OK: empty + x == x
  21152. 1706.72 s [algebraic-graphs] OK: x + x == x
  21153. 1706.72 s [algebraic-graphs] OK: x * y + x + y == x * y
  21154. 1706.72 s [algebraic-graphs] OK: x * x * x == x * x
  21155. 1706.72 s [algebraic-graphs]
  21156. 1706.72 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  21157. 1706.72 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  21158. 1706.72 s [algebraic-graphs]
  21159. 1706.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  21160. 1706.72 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21161. 1706.72 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21162. 1706.72 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21163. 1706.72 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21164. 1706.72 s [algebraic-graphs]
  21165. 1706.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  21166. 1706.72 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21167. 1706.72 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21168. 1706.72 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21169. 1706.73 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21170. 1706.73 s [algebraic-graphs]
  21171. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  21172. 1706.73 s [algebraic-graphs] OK: isEmpty empty == True
  21173. 1706.73 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21174. 1706.73 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21175. 1706.73 s [algebraic-graphs] OK: hasVertex x empty == False
  21176. 1706.73 s [algebraic-graphs]
  21177. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  21178. 1706.73 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21179. 1706.73 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21180. 1706.73 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21181. 1706.73 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21182. 1706.73 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  21183. 1706.73 s [algebraic-graphs]
  21184. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  21185. 1706.73 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21186. 1706.73 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21187. 1706.73 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21188. 1706.73 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21189. 1706.73 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  21190. 1706.73 s [algebraic-graphs]
  21191. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  21192. 1706.73 s [algebraic-graphs] OK: vertex . Left == leftVertex
  21193. 1706.73 s [algebraic-graphs] OK: vertex . Right == rightVertex
  21194. 1706.73 s [algebraic-graphs]
  21195. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  21196. 1706.73 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  21197. 1706.73 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21198. 1706.73 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21199. 1706.73 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21200. 1706.73 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  21201. 1706.73 s [algebraic-graphs]
  21202. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  21203. 1706.73 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21204. 1706.73 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21205. 1706.73 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21206. 1706.73 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21207. 1706.73 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21208. 1706.73 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21209. 1706.73 s [algebraic-graphs]
  21210. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  21211. 1706.73 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  21212. 1706.73 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  21213. 1706.73 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  21214. 1706.73 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  21215. 1706.73 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  21216. 1706.73 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21217. 1706.73 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21218. 1706.73 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21219. 1706.73 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21220. 1706.73 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21221. 1706.73 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  21222. 1706.73 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21223. 1706.73 s [algebraic-graphs]
  21224. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21225. 1706.73 s [algebraic-graphs] OK: vertices [] [] == empty
  21226. 1706.73 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21227. 1706.73 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21228. 1706.73 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21229. 1706.73 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21230. 1706.73 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21231. 1706.73 s [algebraic-graphs]
  21232. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21233. 1706.73 s [algebraic-graphs] OK: edges [] == empty
  21234. 1706.73 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21235. 1706.73 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21236. 1706.73 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21237. 1706.73 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21238. 1706.73 s [algebraic-graphs]
  21239. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21240. 1706.73 s [algebraic-graphs] OK: overlays [] == empty
  21241. 1706.73 s [algebraic-graphs] OK: overlays [x] == x
  21242. 1706.73 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21243. 1706.73 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21244. 1706.73 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21245. 1706.73 s [algebraic-graphs]
  21246. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21247. 1706.73 s [algebraic-graphs] OK: connects [] == empty
  21248. 1706.73 s [algebraic-graphs] OK: connects [x] == x
  21249. 1706.73 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21250. 1706.73 s [algebraic-graphs] OK: connects == foldr connect empty
  21251. 1706.73 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21252. 1706.73 s [algebraic-graphs]
  21253. 1706.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21254. 1707.93 s [algebraic-graphs] OK: swap empty == empty
  21255. 1707.93 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21256. 1707.93 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21257. 1707.94 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21258. 1707.94 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21259. 1707.94 s [algebraic-graphs] OK: swap . swap == id
  21260. 1707.94 s [algebraic-graphs]
  21261. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21262. 1707.94 s [algebraic-graphs] OK: toBipartite empty == empty
  21263. 1707.94 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21264. 1707.94 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21265. 1707.94 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21266. 1707.94 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21267. 1707.94 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21268. 1707.94 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21269. 1707.94 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21270. 1707.94 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21271. 1707.94 s [algebraic-graphs]
  21272. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21273. 1707.94 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21274. 1707.94 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21275. 1707.94 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21276. 1707.94 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21277. 1707.94 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21278. 1707.94 s [algebraic-graphs]
  21279. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21280. 1707.94 s [algebraic-graphs] OK: fromBipartite empty == empty
  21281. 1707.94 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21282. 1707.94 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21283. 1707.94 s [algebraic-graphs]
  21284. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21285. 1707.94 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21286. 1707.94 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21287. 1707.94 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21288. 1707.94 s [algebraic-graphs]
  21289. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21290. 1707.94 s [algebraic-graphs] OK: isEmpty empty == True
  21291. 1707.94 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21292. 1707.94 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21293. 1707.94 s [algebraic-graphs] OK: isEmpty == (==) empty
  21294. 1707.94 s [algebraic-graphs]
  21295. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21296. 1707.94 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21297. 1707.94 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21298. 1707.94 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21299. 1707.94 s [algebraic-graphs]
  21300. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21301. 1707.94 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21302. 1707.94 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21303. 1707.94 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21304. 1707.94 s [algebraic-graphs]
  21305. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21306. 1707.94 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21307. 1707.94 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21308. 1707.94 s [algebraic-graphs]
  21309. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21310. 1707.94 s [algebraic-graphs] OK: hasEdge x y empty == False
  21311. 1707.94 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21312. 1707.94 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21313. 1707.94 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21314. 1707.94 s [algebraic-graphs]
  21315. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21316. 1707.94 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21317. 1707.94 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21318. 1707.94 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21319. 1707.94 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21320. 1707.94 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21321. 1707.94 s [algebraic-graphs]
  21322. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21323. 1707.94 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21324. 1707.94 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21325. 1707.94 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21326. 1707.94 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21327. 1707.94 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21328. 1707.94 s [algebraic-graphs]
  21329. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21330. 1707.94 s [algebraic-graphs] OK: vertexCount empty == 0
  21331. 1707.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21332. 1707.94 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21333. 1707.94 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21334. 1707.94 s [algebraic-graphs]
  21335. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21336. 1707.94 s [algebraic-graphs] OK: edgeCount empty == 0
  21337. 1707.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21338. 1707.94 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21339. 1707.94 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21340. 1707.94 s [algebraic-graphs]
  21341. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21342. 1707.94 s [algebraic-graphs] OK: leftVertexList empty == []
  21343. 1707.94 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21344. 1707.94 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21345. 1707.94 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21346. 1707.94 s [algebraic-graphs]
  21347. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21348. 1707.94 s [algebraic-graphs] OK: rightVertexList empty == []
  21349. 1707.94 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21350. 1707.94 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21351. 1707.94 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21352. 1707.94 s [algebraic-graphs]
  21353. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21354. 1707.94 s [algebraic-graphs] OK: vertexList empty == []
  21355. 1707.94 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21356. 1707.94 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21357. 1707.94 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21358. 1707.94 s [algebraic-graphs]
  21359. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21360. 1707.94 s [algebraic-graphs] OK: edgeList empty == []
  21361. 1707.94 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21362. 1707.94 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21363. 1707.94 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21364. 1707.94 s [algebraic-graphs]
  21365. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21366. 1707.94 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21367. 1707.94 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21368. 1707.94 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21369. 1707.94 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21370. 1707.94 s [algebraic-graphs]
  21371. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21372. 1707.94 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21373. 1707.94 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21374. 1707.94 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21375. 1707.94 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21376. 1707.94 s [algebraic-graphs]
  21377. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21378. 1707.94 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21379. 1707.94 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21380. 1707.94 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21381. 1707.94 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21382. 1707.94 s [algebraic-graphs]
  21383. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21384. 1707.94 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21385. 1707.94 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21386. 1707.94 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21387. 1707.94 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21388. 1707.94 s [algebraic-graphs]
  21389. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21390. 1707.94 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21391. 1707.94 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21392. 1707.94 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21393. 1707.94 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21394. 1707.94 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21395. 1707.94 s [algebraic-graphs]
  21396. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21397. 1707.94 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21398. 1707.94 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21399. 1707.94 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21400. 1707.94 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21401. 1707.94 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21402. 1707.94 s [algebraic-graphs]
  21403. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21404. 1707.94 s [algebraic-graphs] OK: evenList [] == Nil
  21405. 1707.94 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21406. 1707.94 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21407. 1707.94 s [algebraic-graphs]
  21408. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21409. 1707.94 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21410. 1707.94 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21411. 1707.94 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21412. 1707.94 s [algebraic-graphs]
  21413. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21414. 1707.94 s [algebraic-graphs] OK: path Nil == empty
  21415. 1707.94 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21416. 1707.94 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21417. 1707.94 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21418. 1707.94 s [algebraic-graphs]
  21419. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21420. 1707.94 s [algebraic-graphs] OK: circuit [] == empty
  21421. 1707.94 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21422. 1707.94 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21423. 1707.94 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21424. 1707.94 s [algebraic-graphs]
  21425. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21426. 1707.94 s [algebraic-graphs] OK: biclique [] [] == empty
  21427. 1707.94 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21428. 1707.94 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21429. 1707.94 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21430. 1707.94 s [algebraic-graphs]
  21431. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21432. 1707.94 s [algebraic-graphs] OK: star x [] == leftVertex x
  21433. 1707.94 s [algebraic-graphs] OK: star x [y] == edge x y
  21434. 1707.94 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21435. 1707.94 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21436. 1707.94 s [algebraic-graphs]
  21437. 1707.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21438. 1707.94 s [algebraic-graphs] OK: stars [] == empty
  21439. 1707.94 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21440. 1707.94 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21441. 1707.94 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21442. 1721.59 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21443. 1721.61 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21444. 1721.61 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21445. 1721.61 s [algebraic-graphs]
  21446. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21447. 1721.61 s [algebraic-graphs] OK: mesh xs [] == empty
  21448. 1721.61 s [algebraic-graphs] OK: mesh [] ys == empty
  21449. 1721.61 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21450. 1721.61 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21451. 1721.61 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21452. 1721.61 s [algebraic-graphs]
  21453. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21454. 1721.61 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21455. 1721.61 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21456. 1721.61 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21457. 1721.61 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21458. 1721.61 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21459. 1721.61 s [algebraic-graphs]
  21460. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21461. 1721.61 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21462. 1721.61 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21463. 1721.61 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21464. 1721.61 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21465. 1721.61 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21466. 1721.61 s [algebraic-graphs]
  21467. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21468. 1721.61 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21469. 1721.61 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21470. 1721.61 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21471. 1721.61 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21472. 1721.61 s [algebraic-graphs]
  21473. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21474. 1721.61 s [algebraic-graphs] OK: bimap f g empty == empty
  21475. 1721.61 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21476. 1721.61 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21477. 1721.61 s [algebraic-graphs] OK: bimap id id == id
  21478. 1721.61 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21479. 1721.61 s [algebraic-graphs]
  21480. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21481. 1721.61 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21482. 1721.61 s [algebraic-graphs]
  21483. 1721.61 s [algebraic-graphs] OK: box x y ~~ box y x
  21484. 1721.61 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21485. 1721.61 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21486. 1721.61 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21487. 1721.61 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21488. 1721.61 s [algebraic-graphs] OK: box x empty ~~ empty
  21489. 1721.61 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21490. 1721.61 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21491. 1721.61 s [algebraic-graphs]
  21492. 1721.61 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21493. 1721.61 s [algebraic-graphs]
  21494. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21495. 1721.61 s [algebraic-graphs] OK: consistent empty == True
  21496. 1721.61 s [algebraic-graphs] OK: consistent (vertex x) == True
  21497. 1721.61 s [algebraic-graphs] OK: consistent (edge x y) == True
  21498. 1721.61 s [algebraic-graphs] OK: consistent (edges x) == True
  21499. 1721.61 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21500. 1721.61 s [algebraic-graphs] OK: consistent (swap x) == True
  21501. 1721.61 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21502. 1721.61 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21503. 1721.61 s [algebraic-graphs]
  21504. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21505. 1721.61 s [algebraic-graphs] OK: detectParts empty == Right empty
  21506. 1721.61 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21507. 1721.61 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21508. 1721.61 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21509. 1721.61 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21510. 1721.61 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21511. 1721.61 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21512. 1721.61 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21513. 1721.61 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21514. 1721.61 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21515. 1721.61 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21516. 1721.61 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21517. 1721.61 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21518. 1721.61 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21519. 1721.61 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21520. 1721.61 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21521. 1721.61 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21522. 1721.61 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21523. 1721.61 s [algebraic-graphs]
  21524. 1721.61 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21525. 1721.61 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21526. 1721.61 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21527. 1721.61 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21528. 1721.61 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21529. 1721.61 s [algebraic-graphs]
  21530. 1721.61 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21531. 1721.61 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21532. 1721.61 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21533. 1721.61 s [algebraic-graphs]
  21534. 1721.61 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21535. 1721.61 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21536. 1721.61 s [algebraic-graphs]
  21537. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21538. 1721.61 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21539. 1721.61 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21540. 1721.61 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21541. 1721.61 s [algebraic-graphs]
  21542. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21543. 1721.61 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21544. 1721.61 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21545. 1721.61 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21546. 1721.61 s [algebraic-graphs]
  21547. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21548. 1721.61 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21549. 1721.61 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21550. 1721.61 s [algebraic-graphs]
  21551. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21552. 1721.61 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21553. 1721.61 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21554. 1721.61 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21555. 1721.61 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21556. 1721.61 s [algebraic-graphs]
  21557. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21558. 1721.61 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21559. 1721.61 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21560. 1721.61 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21561. 1721.61 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21562. 1721.61 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21563. 1721.61 s [algebraic-graphs]
  21564. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21565. 1721.61 s [algebraic-graphs] OK: maxMatching empty == matching []
  21566. 1721.61 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21567. 1721.61 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21568. 1721.61 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21569. 1721.61 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21570. 1721.61 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21571. 1721.61 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21572. 1721.61 s [algebraic-graphs]
  21573. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21574. 1721.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21575. 1721.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21576. 1721.61 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21577. 1721.61 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21578. 1721.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21579. 1721.61 s [algebraic-graphs]
  21580. 1721.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21581. 1721.61 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21582. 1723.65 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21583. 1723.65 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21584. 1723.65 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21585. 1723.65 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21586. 1723.65 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21587. 1723.65 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21588. 1723.65 s [algebraic-graphs]
  21589. 1723.65 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21590. 1723.65 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21591. 1723.65 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21592. 1723.65 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21593. 1723.65 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21594. 1723.65 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21595. 1723.65 s [algebraic-graphs]
  21596. 1723.65 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21597. 1723.65 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21598. 1723.65 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21599. 1723.65 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21600. 1723.65 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21601. 1723.65 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21602. 1723.65 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21603. 1723.65 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21604. 1723.65 s [algebraic-graphs]
  21605. 1723.65 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21606. 1723.65 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21607. 1723.65 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21608. 1723.65 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21609. 1723.65 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21610. 1723.65 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21611. 1723.65 s [algebraic-graphs]
  21612. 1723.65 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21613. 1723.65 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21614. 1723.65 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21615. 1723.65 s [algebraic-graphs]
  21616. 1723.65 s [algebraic-graphs] ============ Export.Eq ============
  21617. 1723.65 s [algebraic-graphs] OK: mempty /= literal ""
  21618. 1723.65 s [algebraic-graphs]
  21619. 1723.65 s [algebraic-graphs] ============ Export.Ord ============
  21620. 1723.65 s [algebraic-graphs] OK: mempty < literal ""
  21621. 1723.65 s [algebraic-graphs]
  21622. 1723.65 s [algebraic-graphs] ============ Export.isEmpty ============
  21623. 1723.65 s [algebraic-graphs] OK: isEmpty mempty == True
  21624. 1723.65 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21625. 1723.65 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21626. 1723.65 s [algebraic-graphs]
  21627. 1723.65 s [algebraic-graphs] ============ Export.literal ============
  21628. 1723.65 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21629. 1723.65 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21630. 1723.65 s [algebraic-graphs] OK: render . literal == id
  21631. 1723.65 s [algebraic-graphs]
  21632. 1723.65 s [algebraic-graphs] ============ Export.render ============
  21633. 1723.65 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21634. 1723.65 s [algebraic-graphs] OK: render mempty == mempty
  21635. 1723.65 s [algebraic-graphs]
  21636. 1723.65 s [algebraic-graphs] ============ Export.<+> ============
  21637. 1723.65 s [algebraic-graphs] OK: x <+> mempty == x
  21638. 1723.65 s [algebraic-graphs] OK: mempty <+> x == x
  21639. 1723.65 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21640. 1723.65 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21641. 1723.65 s [algebraic-graphs]
  21642. 1723.65 s [algebraic-graphs] ============ Export.brackets ============
  21643. 1723.65 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21644. 1723.65 s [algebraic-graphs] OK: brackets mempty == "[]"
  21645. 1723.65 s [algebraic-graphs]
  21646. 1723.65 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21647. 1723.65 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21648. 1723.65 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21649. 1723.65 s [algebraic-graphs]
  21650. 1723.65 s [algebraic-graphs] ============ Export.indent ============
  21651. 1723.65 s [algebraic-graphs] OK: indent 0 == id
  21652. 1723.65 s [algebraic-graphs] OK: indent 1 mempty == " "
  21653. 1723.65 s [algebraic-graphs]
  21654. 1723.65 s [algebraic-graphs] ============ Export.unlines ============
  21655. 1723.65 s [algebraic-graphs] OK: unlines [] == mempty
  21656. 1723.65 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21657. 1723.65 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21658. 1723.65 s [algebraic-graphs]
  21659. 1723.65 s [algebraic-graphs] ============ Export.export ============
  21660. 1723.65 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21661. 1723.65 s [algebraic-graphs]
  21662. 1723.65 s [algebraic-graphs] ============ Export.Dot.export ============
  21663. 1723.65 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21664. 1723.65 s [algebraic-graphs]
  21665. 1723.65 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21666. 1723.65 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21667. 1723.65 s [algebraic-graphs]
  21668. 1723.65 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21669. 1723.65 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21670. 1723.65 s [algebraic-graphs]
  21671. 1723.65 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21672. 1723.65 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21673. 1723.65 s [algebraic-graphs]
  21674. 1723.65 s [algebraic-graphs] ============ Graph ============
  21675. 1723.65 s [algebraic-graphs] OK: Axioms of graphs
  21676. 1723.65 s [algebraic-graphs] OK: Theorems of graphs
  21677. 1723.65 s [algebraic-graphs]
  21678. 1723.65 s [algebraic-graphs] ============ Graph.Ord ============
  21679. 1723.65 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21680. 1723.65 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21681. 1723.65 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21682. 1723.65 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21683. 1723.65 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21684. 1723.65 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21685. 1723.65 s [algebraic-graphs] OK: x <= x + y
  21686. 1723.65 s [algebraic-graphs] OK: x + y <= x * y
  21687. 1723.65 s [algebraic-graphs]
  21688. 1723.65 s [algebraic-graphs] ============ Graph.empty ============
  21689. 1723.65 s [algebraic-graphs] OK: isEmpty empty == True
  21690. 1723.65 s [algebraic-graphs] OK: hasVertex x empty == False
  21691. 1723.65 s [algebraic-graphs] OK: vertexCount empty == 0
  21692. 1723.65 s [algebraic-graphs] OK: edgeCount empty == 0
  21693. 1723.65 s [algebraic-graphs]
  21694. 1723.65 s [algebraic-graphs] ============ Graph.vertex ============
  21695. 1723.65 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21696. 1723.65 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21697. 1723.65 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21698. 1723.65 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21699. 1723.65 s [algebraic-graphs]
  21700. 1723.65 s [algebraic-graphs] ============ Graph.edge ============
  21701. 1723.65 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21702. 1723.65 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21703. 1723.65 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21704. 1723.65 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21705. 1723.65 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21706. 1723.65 s [algebraic-graphs]
  21707. 1723.65 s [algebraic-graphs] ============ Graph.overlay ============
  21708. 1723.65 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21709. 1723.65 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21710. 1723.65 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21711. 1723.65 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21712. 1723.65 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21713. 1723.65 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21714. 1723.65 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21715. 1723.65 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21716. 1723.65 s [algebraic-graphs]
  21717. 1723.65 s [algebraic-graphs] ============ Graph.connect ============
  21718. 1723.65 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21719. 1723.65 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21720. 1723.65 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21721. 1723.65 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21722. 1723.65 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21723. 1723.65 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21724. 1723.65 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21725. 1723.65 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21726. 1723.65 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21727. 1723.65 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21728. 1723.65 s [algebraic-graphs]
  21729. 1723.65 s [algebraic-graphs] ============ Graph.vertices ============
  21730. 1723.65 s [algebraic-graphs] OK: vertices [] == empty
  21731. 1723.65 s [algebraic-graphs] OK: vertices [x] == vertex x
  21732. 1723.65 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21733. 1723.65 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21734. 1723.65 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21735. 1723.65 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21736. 1723.65 s [algebraic-graphs]
  21737. 1723.65 s [algebraic-graphs] ============ Graph.edges ============
  21738. 1723.65 s [algebraic-graphs] OK: edges [] == empty
  21739. 1723.65 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21740. 1723.65 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21741. 1723.65 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21742. 1723.65 s [algebraic-graphs]
  21743. 1723.65 s [algebraic-graphs] ============ Graph.overlays ============
  21744. 1723.65 s [algebraic-graphs] OK: overlays [] == empty
  21745. 1723.65 s [algebraic-graphs] OK: overlays [x] == x
  21746. 1723.65 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21747. 1723.65 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21748. 1723.65 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21749. 1723.65 s [algebraic-graphs]
  21750. 1723.65 s [algebraic-graphs] ============ Graph.connects ============
  21751. 1723.65 s [algebraic-graphs] OK: connects [] == empty
  21752. 1723.65 s [algebraic-graphs] OK: connects [x] == x
  21753. 1723.65 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21754. 1723.65 s [algebraic-graphs] OK: connects == foldr connect empty
  21755. 1723.65 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21756. 1723.65 s [algebraic-graphs]
  21757. 1723.65 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21758. 1723.65 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21759. 1723.65 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21760. 1723.65 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21761. 1723.65 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21762. 1723.65 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21763. 1723.65 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21764. 1723.65 s [algebraic-graphs]
  21765. 1723.65 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21766. 1723.65 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21767. 1723.65 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21768. 1723.65 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21769. 1723.65 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21770. 1723.65 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21771. 1723.65 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21772. 1723.65 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21773. 1723.65 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21774. 1723.65 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21775. 1724.31 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21776. 1724.31 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21777. 1724.31 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21778. 1724.31 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21779. 1724.31 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21780. 1724.31 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21781. 1724.31 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21782. 1724.31 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21783. 1724.31 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21784. 1724.31 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21785. 1724.31 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21786. 1724.31 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21787. 1724.31 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21788. 1724.31 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21789. 1724.31 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21790. 1724.31 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21791. 1724.31 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21792. 1724.31 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21793. 1724.31 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21794. 1724.31 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21795. 1724.31 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21796. 1724.31 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21797. 1724.31 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21798. 1724.31 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21799. 1724.31 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21800. 1724.31 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21801. 1724.31 s [algebraic-graphs]
  21802. 1724.31 s [algebraic-graphs] ============ Graph.foldg ============
  21803. 1724.31 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21804. 1724.31 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21805. 1724.31 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21806. 1724.31 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21807. 1724.31 s [algebraic-graphs]
  21808. 1724.31 s [algebraic-graphs] ============ Graph.isEmpty ============
  21809. 1724.31 s [algebraic-graphs] OK: isEmpty empty == True
  21810. 1724.31 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21811. 1724.31 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21812. 1724.31 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21813. 1724.31 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21814. 1724.31 s [algebraic-graphs]
  21815. 1724.31 s [algebraic-graphs] ============ Graph.hasVertex ============
  21816. 1724.31 s [algebraic-graphs] OK: hasVertex x empty == False
  21817. 1724.31 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21818. 1724.31 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21819. 1724.31 s [algebraic-graphs]
  21820. 1724.31 s [algebraic-graphs] ============ Graph.hasEdge ============
  21821. 1724.31 s [algebraic-graphs] OK: hasEdge x y empty == False
  21822. 1724.31 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21823. 1724.31 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21824. 1724.31 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21825. 1724.31 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21826. 1724.31 s [algebraic-graphs]
  21827. 1724.31 s [algebraic-graphs] ============ Graph.vertexCount ============
  21828. 1724.31 s [algebraic-graphs] OK: vertexCount empty == 0
  21829. 1724.31 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21830. 1724.31 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21831. 1724.31 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21832. 1724.31 s [algebraic-graphs]
  21833. 1724.31 s [algebraic-graphs] ============ Graph.edgeCount ============
  21834. 1724.31 s [algebraic-graphs] OK: edgeCount empty == 0
  21835. 1724.31 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21836. 1724.31 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21837. 1724.31 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21838. 1724.31 s [algebraic-graphs]
  21839. 1724.31 s [algebraic-graphs] ============ Graph.vertexList ============
  21840. 1724.31 s [algebraic-graphs] OK: vertexList empty == []
  21841. 1724.31 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21842. 1724.31 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21843. 1724.31 s [algebraic-graphs]
  21844. 1724.31 s [algebraic-graphs] ============ Graph.vertexSet ============
  21845. 1724.31 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21846. 1724.31 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21847. 1724.31 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21848. 1724.31 s [algebraic-graphs]
  21849. 1724.31 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21850. 1724.31 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21851. 1724.31 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21852. 1724.31 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21853. 1724.31 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21854. 1724.31 s [algebraic-graphs]
  21855. 1724.31 s [algebraic-graphs] ============ Graph.edgeList ============
  21856. 1724.31 s [algebraic-graphs] OK: edgeList empty == []
  21857. 1724.31 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21858. 1724.31 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21859. 1724.31 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21860. 1724.31 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21861. 1724.31 s [algebraic-graphs]
  21862. 1724.31 s [algebraic-graphs] ============ Graph.edgeSet ============
  21863. 1724.31 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21864. 1724.31 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21865. 1724.31 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21866. 1724.31 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21867. 1724.31 s [algebraic-graphs]
  21868. 1724.31 s [algebraic-graphs] ============ Graph.adjacencyList ============
  21869. 1724.31 s [algebraic-graphs] OK: adjacencyList empty == []
  21870. 1724.31 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21871. 1724.31 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21872. 1724.31 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21873. 1724.31 s [algebraic-graphs]
  21874. 1724.31 s [algebraic-graphs] ============ Graph.preSet ============
  21875. 1724.31 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21876. 1724.31 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21877. 1724.31 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21878. 1724.31 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21879. 1724.31 s [algebraic-graphs]
  21880. 1724.31 s [algebraic-graphs] ============ Graph.preIntSet ============
  21881. 1724.31 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21882. 1724.31 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21883. 1724.31 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21884. 1724.31 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21885. 1724.31 s [algebraic-graphs]
  21886. 1724.31 s [algebraic-graphs] ============ Graph.postSet ============
  21887. 1724.31 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21888. 1724.31 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21889. 1724.31 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21890. 1724.31 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21891. 1724.31 s [algebraic-graphs]
  21892. 1724.31 s [algebraic-graphs] ============ Graph.postIntSet ============
  21893. 1724.31 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21894. 1724.31 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21895. 1724.31 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21896. 1724.31 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21897. 1724.31 s [algebraic-graphs]
  21898. 1724.31 s [algebraic-graphs] ============ Graph.size ============
  21899. 1724.31 s [algebraic-graphs] OK: size empty == 1
  21900. 1724.31 s [algebraic-graphs] OK: size (vertex x) == 1
  21901. 1724.31 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  21902. 1724.31 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  21903. 1724.31 s [algebraic-graphs] OK: size x >= 1
  21904. 1724.31 s [algebraic-graphs] OK: size x >= vertexCount x
  21905. 1724.31 s [algebraic-graphs]
  21906. 1724.31 s [algebraic-graphs] ============ Graph.path ============
  21907. 1724.31 s [algebraic-graphs] OK: path [] == empty
  21908. 1724.31 s [algebraic-graphs] OK: path [x] == vertex x
  21909. 1724.31 s [algebraic-graphs] OK: path [x,y] == edge x y
  21910. 1724.31 s [algebraic-graphs]
  21911. 1724.31 s [algebraic-graphs] ============ Graph.circuit ============
  21912. 1724.31 s [algebraic-graphs] OK: circuit [] == empty
  21913. 1724.31 s [algebraic-graphs] OK: circuit [x] == edge x x
  21914. 1724.31 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21915. 1724.31 s [algebraic-graphs]
  21916. 1724.31 s [algebraic-graphs] ============ Graph.clique ============
  21917. 1724.31 s [algebraic-graphs] OK: clique [] == empty
  21918. 1724.31 s [algebraic-graphs] OK: clique [x] == vertex x
  21919. 1724.31 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21920. 1724.31 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21921. 1724.31 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21922. 1724.31 s [algebraic-graphs]
  21923. 1724.31 s [algebraic-graphs] ============ Graph.biclique ============
  21924. 1724.31 s [algebraic-graphs] OK: biclique [] [] == empty
  21925. 1724.31 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21926. 1724.31 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21927. 1724.31 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21928. 1724.31 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21929. 1724.31 s [algebraic-graphs]
  21930. 1724.31 s [algebraic-graphs] ============ Graph.star ============
  21931. 1724.31 s [algebraic-graphs] OK: star x [] == vertex x
  21932. 1724.31 s [algebraic-graphs] OK: star x [y] == edge x y
  21933. 1724.31 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21934. 1724.31 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21935. 1724.31 s [algebraic-graphs]
  21936. 1724.31 s [algebraic-graphs] ============ Graph.stars ============
  21937. 1724.31 s [algebraic-graphs] OK: stars [] == empty
  21938. 1724.31 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21939. 1724.31 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21940. 1724.31 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21941. 1724.31 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21942. 1724.31 s [algebraic-graphs] OK: stars . adjacencyList == id
  21943. 1724.31 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21944. 1724.31 s [algebraic-graphs]
  21945. 1724.31 s [algebraic-graphs] ============ Graph.tree ============
  21946. 1724.31 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21947. 1724.31 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21948. 1724.31 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21949. 1724.31 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21950. 1724.31 s [algebraic-graphs]
  21951. 1724.31 s [algebraic-graphs] ============ Graph.forest ============
  21952. 1724.31 s [algebraic-graphs] OK: forest [] == empty
  21953. 1724.31 s [algebraic-graphs] OK: forest [x] == tree x
  21954. 1724.31 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21955. 1724.31 s [algebraic-graphs] OK: forest == overlays . map tree
  21956. 1724.31 s [algebraic-graphs]
  21957. 1724.31 s [algebraic-graphs] ============ Graph.removeVertex ============
  21958. 1727.51 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21959. 1727.51 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21960. 1727.51 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21961. 1727.61 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21962. 1727.61 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21963. 1727.61 s [algebraic-graphs]
  21964. 1727.61 s [algebraic-graphs] ============ Graph.removeEdge ============
  21965. 1727.61 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21966. 1727.61 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21967. 1727.61 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21968. 1727.61 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21969. 1727.61 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21970. 1727.61 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  21971. 1727.61 s [algebraic-graphs]
  21972. 1727.61 s [algebraic-graphs] ============ Graph.replaceVertex ============
  21973. 1727.61 s [algebraic-graphs] OK: replaceVertex x x == id
  21974. 1727.61 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21975. 1727.61 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21976. 1727.61 s [algebraic-graphs]
  21977. 1727.61 s [algebraic-graphs] ============ Graph.mergeVertices ============
  21978. 1727.61 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21979. 1727.61 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21980. 1727.61 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21981. 1727.61 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21982. 1727.61 s [algebraic-graphs]
  21983. 1727.61 s [algebraic-graphs] ============ Graph.transpose ============
  21984. 1727.61 s [algebraic-graphs] OK: transpose empty == empty
  21985. 1727.61 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21986. 1727.61 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21987. 1727.61 s [algebraic-graphs] OK: transpose . transpose == id
  21988. 1727.61 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21989. 1727.61 s [algebraic-graphs]
  21990. 1727.61 s [algebraic-graphs] ============ Graph.gmap ============
  21991. 1727.61 s [algebraic-graphs] OK: gmap f empty == empty
  21992. 1727.61 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21993. 1727.61 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21994. 1727.61 s [algebraic-graphs] OK: gmap id == id
  21995. 1727.61 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21996. 1727.61 s [algebraic-graphs]
  21997. 1727.61 s [algebraic-graphs] ============ Graph.induce ============
  21998. 1727.61 s [algebraic-graphs] OK: induce (const True ) x == x
  21999. 1727.61 s [algebraic-graphs] OK: induce (const False) x == empty
  22000. 1727.61 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22001. 1727.61 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22002. 1727.61 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22003. 1727.61 s [algebraic-graphs]
  22004. 1727.61 s [algebraic-graphs] ============ Graph.induceJust ============
  22005. 1727.61 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22006. 1727.61 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22007. 1727.61 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22008. 1727.61 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22009. 1727.61 s [algebraic-graphs]
  22010. 1727.61 s [algebraic-graphs] ============ Graph.compose ============
  22011. 1727.61 s [algebraic-graphs] OK: compose empty x == empty
  22012. 1727.61 s [algebraic-graphs] OK: compose x empty == empty
  22013. 1727.61 s [algebraic-graphs] OK: compose (vertex x) y == empty
  22014. 1727.61 s [algebraic-graphs] OK: compose x (vertex y) == empty
  22015. 1727.61 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  22016. 1727.61 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  22017. 1727.61 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  22018. 1727.61 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  22019. 1727.61 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  22020. 1727.61 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  22021. 1727.61 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  22022. 1727.61 s [algebraic-graphs]
  22023. 1727.61 s [algebraic-graphs] ============ Graph.(===) ============
  22024. 1727.61 s [algebraic-graphs] OK: x === x == True
  22025. 1727.61 s [algebraic-graphs] OK: x === x + empty == False
  22026. 1727.61 s [algebraic-graphs] OK: x + y === x + y == True
  22027. 1727.61 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22028. 1727.61 s [algebraic-graphs] OK: x + y === x * y == False
  22029. 1727.61 s [algebraic-graphs]
  22030. 1727.61 s [algebraic-graphs] ============ Graph.mesh ============
  22031. 1727.61 s [algebraic-graphs] OK: mesh xs [] == empty
  22032. 1727.61 s [algebraic-graphs] OK: mesh [] ys == empty
  22033. 1727.61 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  22034. 1727.61 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  22035. 1727.61 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  22036. 1727.61 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22037. 1727.61 s [algebraic-graphs]
  22038. 1727.61 s [algebraic-graphs] ============ Graph.torus ============
  22039. 1727.61 s [algebraic-graphs] OK: torus xs [] == empty
  22040. 1727.62 s [algebraic-graphs] OK: torus [] ys == empty
  22041. 1727.62 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  22042. 1727.62 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  22043. 1727.62 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  22044. 1727.62 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  22045. 1727.62 s [algebraic-graphs]
  22046. 1727.62 s [algebraic-graphs] ============ Graph.deBruijn ============
  22047. 1727.62 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  22048. 1727.62 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  22049. 1727.62 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  22050. 1727.62 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  22051. 1727.62 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  22052. 1727.62 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  22053. 1727.62 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  22054. 1727.62 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  22055. 1727.62 s [algebraic-graphs]
  22056. 1727.62 s [algebraic-graphs] ============ Graph.splitVertex ============
  22057. 1727.62 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  22058. 1727.62 s [algebraic-graphs] OK: splitVertex x [x] == id
  22059. 1727.62 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  22060. 1727.62 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22061. 1727.62 s [algebraic-graphs]
  22062. 1727.62 s [algebraic-graphs] ============ Graph.bind ============
  22063. 1727.62 s [algebraic-graphs] OK: bind empty f == empty
  22064. 1727.62 s [algebraic-graphs] OK: bind (vertex x) f == f x
  22065. 1727.62 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  22066. 1727.62 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  22067. 1727.62 s [algebraic-graphs] OK: bind x (const empty) == empty
  22068. 1727.62 s [algebraic-graphs] OK: bind x vertex == x
  22069. 1727.62 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  22070. 1727.62 s [algebraic-graphs]
  22071. 1727.62 s [algebraic-graphs] ============ Graph.simplify ============
  22072. 1727.62 s [algebraic-graphs] OK: simplify == id
  22073. 1727.62 s [algebraic-graphs] OK: size (simplify x) <= size x
  22074. 1727.62 s [algebraic-graphs]
  22075. 1727.62 s [algebraic-graphs] ============ Graph.box ============
  22076. 1727.62 s [algebraic-graphs] OK: box x y ~~ box y x
  22077. 1727.62 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22078. 1727.62 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22079. 1727.62 s [algebraic-graphs] OK: box x empty ~~ empty
  22080. 1727.62 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22081. 1727.62 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22082. 1727.62 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22083. 1727.62 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22084. 1727.62 s [algebraic-graphs]
  22085. 1727.62 s [algebraic-graphs] ============ Graph.sparsify ============
  22086. 1727.62 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22087. 1727.62 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22088. 1727.62 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22089. 1727.62 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22090. 1727.62 s [algebraic-graphs]
  22091. 1727.62 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  22092. 1727.62 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22093. 1727.62 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22094. 1727.62 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22095. 1727.62 s [algebraic-graphs]
  22096. 1727.62 s [algebraic-graphs] ============ Graph.context ============
  22097. 1727.62 s [algebraic-graphs] OK: context (const False) x == Nothing
  22098. 1727.62 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  22099. 1727.62 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  22100. 1727.62 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  22101. 1727.62 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  22102. 1727.62 s [algebraic-graphs]
  22103. 1727.62 s [algebraic-graphs] ============ Graph.buildg ============
  22104. 1727.62 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  22105. 1727.62 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  22106. 1727.62 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
  22107. 1727.62 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
  22108. 1727.62 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  22109. 1727.62 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  22110. 1727.62 s [algebraic-graphs]
  22111. 1727.62 s [algebraic-graphs] ============ Internal.List ============
  22112. 1727.62 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  22113. 1727.62 s [algebraic-graphs]
  22114. 1727.62 s [algebraic-graphs] ============ Graph.Label ============
  22115. 1727.62 s [algebraic-graphs]
  22116. 1727.62 s [algebraic-graphs] ============ Any: instances ============
  22117. 1727.62 s [algebraic-graphs] OK: Semiring
  22118. 1727.62 s [algebraic-graphs] OK: StarSemiring
  22119. 1727.62 s [algebraic-graphs] OK: Dioid
  22120. 1727.62 s [algebraic-graphs]
  22121. 1727.62 s [algebraic-graphs] ============ Distance Int: instances ============
  22122. 1727.62 s [algebraic-graphs] OK: Semiring
  22123. 1727.62 s [algebraic-graphs] OK: StarSemiring
  22124. 1727.62 s [algebraic-graphs] OK: Dioid
  22125. 1727.62 s [algebraic-graphs]
  22126. 1727.62 s [algebraic-graphs] ============ Capacity Int: instances ============
  22127. 1727.62 s [algebraic-graphs] OK: Semiring
  22128. 1727.62 s [algebraic-graphs] OK: StarSemiring
  22129. 1727.62 s [algebraic-graphs] OK: Dioid
  22130. 1727.62 s [algebraic-graphs]
  22131. 1727.62 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  22132. 1727.62 s [algebraic-graphs] OK: LeftNearRing
  22133. 1727.62 s [algebraic-graphs]
  22134. 1727.62 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  22135. 1727.62 s [algebraic-graphs] OK: Semiring
  22136. 1727.62 s [algebraic-graphs] OK: Dioid
  22137. 1727.62 s [algebraic-graphs]
  22138. 1727.62 s [algebraic-graphs] ============ Count Int: instances ============
  22139. 1727.62 s [algebraic-graphs] OK: Semiring
  22140. 1727.62 s [algebraic-graphs] OK: StarSemiring
  22141. 1727.62 s [algebraic-graphs]
  22142. 1727.62 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  22143. 1727.62 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  22144. 1727.62 s [algebraic-graphs] OK: empty
  22145. 1727.62 s [algebraic-graphs] OK: vertex
  22146. 1727.62 s [algebraic-graphs] OK: edge
  22147. 1727.62 s [algebraic-graphs] OK: overlay
  22148. 1727.62 s [algebraic-graphs] OK: connect
  22149. 1727.62 s [algebraic-graphs] OK: vertices
  22150. 1727.62 s [algebraic-graphs] OK: edges
  22151. 1727.62 s [algebraic-graphs] OK: overlays
  22152. 1727.62 s [algebraic-graphs] OK: fromAdjacencyMaps
  22153. 1727.62 s [algebraic-graphs] OK: removeVertex
  22154. 1727.62 s [algebraic-graphs] OK: removeEdge
  22155. 1727.62 s [algebraic-graphs] OK: replaceVertex
  22156. 1727.62 s [algebraic-graphs] OK: replaceEdge
  22157. 1727.62 s [algebraic-graphs] OK: transpose
  22158. 1727.62 s [algebraic-graphs] OK: gmap
  22159. 1727.62 s [algebraic-graphs] OK: emap
  22160. 1727.62 s [algebraic-graphs] OK: induce
  22161. 1727.62 s [algebraic-graphs] OK: closure
  22162. 1727.62 s [algebraic-graphs] OK: reflexiveClosure
  22163. 1727.62 s [algebraic-graphs] OK: symmetricClosure
  22164. 1727.62 s [algebraic-graphs] OK: transitiveClosure
  22165. 1727.62 s [algebraic-graphs]
  22166. 1727.62 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  22167. 1727.62 s [algebraic-graphs] OK: isEmpty empty == True
  22168. 1727.62 s [algebraic-graphs] OK: hasVertex x empty == False
  22169. 1727.62 s [algebraic-graphs] OK: vertexCount empty == 0
  22170. 1727.62 s [algebraic-graphs] OK: edgeCount empty == 0
  22171. 1727.62 s [algebraic-graphs]
  22172. 1727.62 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  22173. 1727.62 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22174. 1727.62 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22175. 1727.62 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22176. 1727.62 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22177. 1727.62 s [algebraic-graphs]
  22178. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  22179. 1729.91 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22180. 1729.91 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22181. 1729.91 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22182. 1729.91 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22183. 1729.91 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22184. 1729.91 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22185. 1729.91 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22186. 1729.91 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22187. 1729.91 s [algebraic-graphs]
  22188. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  22189. 1729.91 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22190. 1729.91 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22191. 1729.91 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22192. 1729.91 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22193. 1729.91 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22194. 1729.91 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22195. 1729.91 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22196. 1729.91 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22197. 1729.91 s [algebraic-graphs]
  22198. 1729.91 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22199. 1729.91 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22200. 1729.91 s [algebraic-graphs]
  22201. 1729.91 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22202. 1729.91 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22203. 1729.91 s [algebraic-graphs]
  22204. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  22205. 1729.91 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22206. 1729.91 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22207. 1729.91 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22208. 1729.91 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22209. 1729.91 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22210. 1729.91 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22211. 1729.91 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22212. 1729.91 s [algebraic-graphs]
  22213. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  22214. 1729.91 s [algebraic-graphs] OK: vertices [] == empty
  22215. 1729.91 s [algebraic-graphs] OK: vertices [x] == vertex x
  22216. 1729.91 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22217. 1729.91 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22218. 1729.91 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22219. 1729.91 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22220. 1729.91 s [algebraic-graphs]
  22221. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  22222. 1729.91 s [algebraic-graphs] OK: edges [] == empty
  22223. 1729.91 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22224. 1729.91 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22225. 1729.91 s [algebraic-graphs]
  22226. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22227. 1729.91 s [algebraic-graphs] OK: overlays [] == empty
  22228. 1729.91 s [algebraic-graphs] OK: overlays [x] == x
  22229. 1729.91 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22230. 1729.91 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22231. 1729.91 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22232. 1729.91 s [algebraic-graphs]
  22233. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22234. 1729.91 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22235. 1729.91 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22236. 1729.91 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22237. 1729.91 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22238. 1729.91 s [algebraic-graphs]
  22239. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22240. 1729.91 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22241. 1729.91 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22242. 1729.91 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22243. 1729.91 s [algebraic-graphs]
  22244. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22245. 1729.91 s [algebraic-graphs] OK: isEmpty empty == True
  22246. 1729.91 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22247. 1729.91 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22248. 1729.91 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22249. 1729.91 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22250. 1729.91 s [algebraic-graphs]
  22251. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22252. 1729.91 s [algebraic-graphs] OK: hasVertex x empty == False
  22253. 1729.91 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22254. 1729.91 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22255. 1729.91 s [algebraic-graphs]
  22256. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22257. 1729.91 s [algebraic-graphs] OK: hasEdge x y empty == False
  22258. 1729.91 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22259. 1729.91 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22260. 1729.91 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22261. 1729.91 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22262. 1729.91 s [algebraic-graphs]
  22263. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22264. 1729.91 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22265. 1729.91 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22266. 1729.91 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22267. 1729.91 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22268. 1729.91 s [algebraic-graphs]
  22269. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22270. 1729.91 s [algebraic-graphs] OK: vertexCount empty == 0
  22271. 1729.91 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22272. 1729.91 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22273. 1729.91 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22274. 1729.91 s [algebraic-graphs]
  22275. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22276. 1729.91 s [algebraic-graphs] OK: edgeCount empty == 0
  22277. 1729.91 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22278. 1729.91 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22279. 1729.91 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22280. 1729.91 s [algebraic-graphs]
  22281. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22282. 1729.91 s [algebraic-graphs] OK: vertexList empty == []
  22283. 1729.91 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22284. 1729.91 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22285. 1729.91 s [algebraic-graphs]
  22286. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22287. 1729.91 s [algebraic-graphs] OK: edgeList empty == []
  22288. 1729.91 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22289. 1729.91 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22290. 1729.91 s [algebraic-graphs]
  22291. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22292. 1729.91 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22293. 1729.91 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22294. 1729.91 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22295. 1729.91 s [algebraic-graphs]
  22296. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22297. 1729.91 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22298. 1729.91 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22299. 1729.91 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22300. 1729.91 s [algebraic-graphs]
  22301. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22302. 1729.91 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22303. 1729.91 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22304. 1729.91 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22305. 1729.91 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22306. 1729.91 s [algebraic-graphs]
  22307. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22308. 1729.91 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22309. 1729.91 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22310. 1729.91 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22311. 1729.91 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22312. 1729.91 s [algebraic-graphs]
  22313. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22314. 1729.91 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22315. 1729.91 s [algebraic-graphs]
  22316. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22317. 1729.91 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22318. 1729.91 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22319. 1729.91 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22320. 1729.91 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22321. 1729.91 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22322. 1729.91 s [algebraic-graphs]
  22323. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22324. 1729.91 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22325. 1729.91 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22326. 1729.91 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22327. 1729.91 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22328. 1729.91 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22329. 1729.91 s [algebraic-graphs]
  22330. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22331. 1729.91 s [algebraic-graphs] OK: replaceVertex x x == id
  22332. 1729.91 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22333. 1729.91 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22334. 1729.91 s [algebraic-graphs]
  22335. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22336. 1729.91 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22337. 1729.91 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22338. 1729.91 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22339. 1729.91 s [algebraic-graphs]
  22340. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22341. 1729.91 s [algebraic-graphs] OK: transpose empty == empty
  22342. 1729.91 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22343. 1729.91 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22344. 1729.91 s [algebraic-graphs] OK: transpose . transpose == id
  22345. 1729.91 s [algebraic-graphs]
  22346. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22347. 1729.91 s [algebraic-graphs] OK: gmap f empty == empty
  22348. 1729.91 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22349. 1729.91 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22350. 1729.91 s [algebraic-graphs] OK: gmap id == id
  22351. 1729.91 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22352. 1729.91 s [algebraic-graphs]
  22353. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22354. 1729.91 s [algebraic-graphs] OK: emap h empty == empty
  22355. 1729.91 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22356. 1729.91 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22357. 1729.91 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22358. 1729.91 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22359. 1729.91 s [algebraic-graphs] OK: emap id == id
  22360. 1729.91 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22361. 1729.91 s [algebraic-graphs]
  22362. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22363. 1729.91 s [algebraic-graphs] OK: induce (const True ) x == x
  22364. 1729.91 s [algebraic-graphs] OK: induce (const False) x == empty
  22365. 1729.91 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22366. 1729.91 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22367. 1729.91 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22368. 1729.91 s [algebraic-graphs]
  22369. 1729.91 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22370. 1731.06 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22371. 1731.06 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22372. 1731.06 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22373. 1731.06 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22374. 1731.06 s [algebraic-graphs]
  22375. 1731.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22376. 1731.06 s [algebraic-graphs] OK: closure empty == empty
  22377. 1731.06 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22378. 1731.06 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22379. 1731.06 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22380. 1731.06 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22381. 1731.06 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22382. 1731.07 s [algebraic-graphs] OK: closure . closure == closure
  22383. 1731.07 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22384. 1731.07 s [algebraic-graphs]
  22385. 1731.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22386. 1731.07 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22387. 1731.07 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22388. 1731.07 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22389. 1731.07 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22390. 1731.07 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22391. 1731.07 s [algebraic-graphs]
  22392. 1731.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22393. 1731.07 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22394. 1731.07 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22395. 1731.07 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22396. 1731.07 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22397. 1731.07 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22398. 1731.07 s [algebraic-graphs]
  22399. 1731.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22400. 1731.07 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22401. 1731.07 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22402. 1731.07 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22403. 1731.07 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22404. 1731.07 s [algebraic-graphs]
  22405. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22406. 1731.07 s [algebraic-graphs] OK: isEmpty empty == True
  22407. 1731.07 s [algebraic-graphs] OK: hasVertex x empty == False
  22408. 1731.07 s [algebraic-graphs] OK: vertexCount empty == 0
  22409. 1731.07 s [algebraic-graphs] OK: edgeCount empty == 0
  22410. 1731.07 s [algebraic-graphs]
  22411. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22412. 1731.07 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22413. 1731.07 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22414. 1731.07 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22415. 1731.07 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22416. 1731.07 s [algebraic-graphs]
  22417. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22418. 1731.07 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22419. 1731.07 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22420. 1731.07 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22421. 1731.07 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22422. 1731.07 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22423. 1731.07 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22424. 1731.07 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22425. 1731.07 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22426. 1731.07 s [algebraic-graphs]
  22427. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22428. 1731.07 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22429. 1731.07 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22430. 1731.07 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22431. 1731.07 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22432. 1731.07 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22433. 1731.07 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22434. 1731.07 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22435. 1731.07 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22436. 1731.07 s [algebraic-graphs]
  22437. 1731.07 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22438. 1731.07 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22439. 1731.07 s [algebraic-graphs]
  22440. 1731.07 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22441. 1731.07 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22442. 1731.07 s [algebraic-graphs]
  22443. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22444. 1731.07 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22445. 1731.07 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22446. 1731.07 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22447. 1731.07 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22448. 1731.07 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22449. 1731.07 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22450. 1731.07 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22451. 1731.07 s [algebraic-graphs]
  22452. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22453. 1731.07 s [algebraic-graphs] OK: vertices [] == empty
  22454. 1731.07 s [algebraic-graphs] OK: vertices [x] == vertex x
  22455. 1731.07 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22456. 1731.07 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22457. 1731.07 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22458. 1731.07 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22459. 1731.07 s [algebraic-graphs]
  22460. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22461. 1731.07 s [algebraic-graphs] OK: edges [] == empty
  22462. 1731.07 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22463. 1731.07 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22464. 1731.07 s [algebraic-graphs]
  22465. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22466. 1731.07 s [algebraic-graphs] OK: overlays [] == empty
  22467. 1731.07 s [algebraic-graphs] OK: overlays [x] == x
  22468. 1731.07 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22469. 1731.07 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22470. 1731.07 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22471. 1731.07 s [algebraic-graphs]
  22472. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22473. 1731.07 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22474. 1731.07 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22475. 1731.07 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22476. 1731.07 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22477. 1731.07 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22478. 1731.07 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22479. 1731.07 s [algebraic-graphs]
  22480. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22481. 1731.07 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22482. 1731.07 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22483. 1731.07 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22484. 1731.07 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22485. 1731.07 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22486. 1731.07 s [algebraic-graphs]
  22487. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22488. 1731.07 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22489. 1731.07 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22490. 1731.07 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22491. 1731.07 s [algebraic-graphs]
  22492. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22493. 1731.07 s [algebraic-graphs] OK: isEmpty empty == True
  22494. 1731.07 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22495. 1731.07 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22496. 1731.07 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22497. 1731.07 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22498. 1731.07 s [algebraic-graphs]
  22499. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22500. 1731.07 s [algebraic-graphs] OK: size empty == 1
  22501. 1731.07 s [algebraic-graphs] OK: size (vertex x) == 1
  22502. 1731.07 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22503. 1731.07 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22504. 1731.07 s [algebraic-graphs] OK: size x >= 1
  22505. 1731.07 s [algebraic-graphs] OK: size x >= vertexCount x
  22506. 1731.07 s [algebraic-graphs]
  22507. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22508. 1731.07 s [algebraic-graphs] OK: hasVertex x empty == False
  22509. 1731.07 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22510. 1731.07 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22511. 1731.07 s [algebraic-graphs]
  22512. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22513. 1731.07 s [algebraic-graphs] OK: hasEdge x y empty == False
  22514. 1731.07 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22515. 1731.07 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22516. 1731.07 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22517. 1731.07 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22518. 1731.07 s [algebraic-graphs]
  22519. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22520. 1731.07 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22521. 1731.07 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22522. 1731.07 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22523. 1731.07 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22524. 1731.07 s [algebraic-graphs]
  22525. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22526. 1731.07 s [algebraic-graphs] OK: vertexCount empty == 0
  22527. 1731.07 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22528. 1731.07 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22529. 1731.07 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22530. 1731.07 s [algebraic-graphs]
  22531. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22532. 1731.07 s [algebraic-graphs] OK: edgeCount empty == 0
  22533. 1731.07 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22534. 1731.07 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22535. 1731.07 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22536. 1731.07 s [algebraic-graphs]
  22537. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22538. 1731.07 s [algebraic-graphs] OK: vertexList empty == []
  22539. 1731.07 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22540. 1731.07 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22541. 1731.07 s [algebraic-graphs]
  22542. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22543. 1731.07 s [algebraic-graphs] OK: edgeList empty == []
  22544. 1731.07 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22545. 1731.07 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22546. 1731.07 s [algebraic-graphs]
  22547. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22548. 1731.07 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22549. 1731.07 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22550. 1731.07 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22551. 1731.07 s [algebraic-graphs]
  22552. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22553. 1731.07 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22554. 1731.07 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22555. 1731.07 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22556. 1731.07 s [algebraic-graphs]
  22557. 1731.07 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22558. 1731.07 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22559. 1731.07 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22560. 1733.79 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22561. 1733.86 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22562. 1733.86 s [algebraic-graphs]
  22563. 1733.86 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22564. 1733.86 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22565. 1733.86 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22566. 1733.86 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22567. 1733.86 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22568. 1733.86 s [algebraic-graphs]
  22569. 1733.86 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22570. 1733.86 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22571. 1733.86 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22572. 1733.86 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22573. 1733.86 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22574. 1733.86 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22575. 1733.86 s [algebraic-graphs]
  22576. 1733.86 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22577. 1733.86 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22578. 1733.86 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22579. 1733.86 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22580. 1733.86 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22581. 1733.86 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22582. 1733.86 s [algebraic-graphs]
  22583. 1733.86 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22584. 1733.86 s [algebraic-graphs] OK: replaceVertex x x == id
  22585. 1733.86 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22586. 1733.86 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22587. 1733.86 s [algebraic-graphs]
  22588. 1733.86 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22589. 1733.86 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22590. 1733.87 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22591. 1733.87 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22592. 1733.87 s [algebraic-graphs]
  22593. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22594. 1733.87 s [algebraic-graphs] OK: transpose empty == empty
  22595. 1733.87 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22596. 1733.87 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22597. 1733.87 s [algebraic-graphs] OK: transpose . transpose == id
  22598. 1733.87 s [algebraic-graphs]
  22599. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22600. 1733.87 s [algebraic-graphs] OK: fmap f empty == empty
  22601. 1733.87 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22602. 1733.87 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22603. 1733.87 s [algebraic-graphs] OK: fmap id == id
  22604. 1733.87 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22605. 1733.87 s [algebraic-graphs]
  22606. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22607. 1733.87 s [algebraic-graphs] OK: emap h empty == empty
  22608. 1733.87 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22609. 1733.87 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22610. 1733.87 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22611. 1733.87 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22612. 1733.87 s [algebraic-graphs] OK: emap id == id
  22613. 1733.87 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22614. 1733.87 s [algebraic-graphs]
  22615. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22616. 1733.87 s [algebraic-graphs] OK: induce (const True ) x == x
  22617. 1733.87 s [algebraic-graphs] OK: induce (const False) x == empty
  22618. 1733.87 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22619. 1733.87 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22620. 1733.87 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22621. 1733.87 s [algebraic-graphs]
  22622. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22623. 1733.87 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22624. 1733.87 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22625. 1733.87 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22626. 1733.87 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22627. 1733.87 s [algebraic-graphs]
  22628. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22629. 1733.87 s [algebraic-graphs] OK: closure empty == empty
  22630. 1733.87 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22631. 1733.87 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22632. 1733.87 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22633. 1733.87 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22634. 1733.87 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22635. 1733.87 s [algebraic-graphs] OK: closure . closure == closure
  22636. 1733.87 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22637. 1733.87 s [algebraic-graphs]
  22638. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22639. 1733.87 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22640. 1733.87 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22641. 1733.87 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22642. 1733.87 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22643. 1733.87 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22644. 1733.87 s [algebraic-graphs]
  22645. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22646. 1733.87 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22647. 1733.87 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22648. 1733.87 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22649. 1733.87 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22650. 1733.87 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22651. 1733.87 s [algebraic-graphs]
  22652. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22653. 1733.87 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22654. 1733.87 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22655. 1733.87 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22656. 1733.87 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22657. 1733.87 s [algebraic-graphs]
  22658. 1733.87 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22659. 1733.87 s [algebraic-graphs] OK: context (const False) x == Nothing
  22660. 1733.87 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22661. 1733.87 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22662. 1733.87 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22663. 1733.87 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22664. 1733.87 s [algebraic-graphs]
  22665. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22666. 1733.87 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22667. 1733.87 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22668. 1733.87 s [algebraic-graphs]
  22669. 1733.87 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22670. 1733.87 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22671. 1733.87 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22672. 1733.87 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22673. 1733.87 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22674. 1733.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22675. 1733.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22676. 1733.87 s [algebraic-graphs] OK: x <= x + y
  22677. 1733.87 s [algebraic-graphs] OK: x + y <= x * y
  22678. 1733.87 s [algebraic-graphs]
  22679. 1733.87 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22680. 1733.87 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22681. 1733.87 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22682. 1733.87 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22683. 1733.87 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22684. 1733.87 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22685. 1733.87 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22686. 1733.87 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22687. 1733.87 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22688. 1733.87 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22689. 1733.87 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22690. 1733.87 s [algebraic-graphs]
  22691. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22692. 1733.87 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22693. 1733.87 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22694. 1733.87 s [algebraic-graphs]
  22695. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22696. 1733.87 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22697. 1733.87 s [algebraic-graphs]
  22698. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22699. 1733.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22700. 1733.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22701. 1733.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22702. 1733.87 s [algebraic-graphs]
  22703. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22704. 1733.87 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22705. 1733.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22706. 1733.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22707. 1733.87 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22708. 1733.87 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22709. 1733.87 s [algebraic-graphs]
  22710. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22711. 1733.87 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22712. 1733.87 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22713. 1733.87 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22714. 1733.87 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22715. 1733.87 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22716. 1733.87 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22717. 1733.87 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22718. 1733.87 s [algebraic-graphs]
  22719. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22720. 1733.87 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22721. 1733.87 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22722. 1733.87 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22723. 1733.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22724. 1733.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22725. 1733.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22726. 1733.87 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22727. 1733.87 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22728. 1733.87 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22729. 1733.87 s [algebraic-graphs]
  22730. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22731. 1733.87 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22732. 1733.87 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22733. 1733.87 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22734. 1733.87 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22735. 1733.87 s [algebraic-graphs]
  22736. 1733.87 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22737. 1733.87 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22738. 1733.87 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22739. 1733.87 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22740. 1733.87 s [algebraic-graphs]
  22741. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22742. 1736.73 s [algebraic-graphs] OK: overlays1 [x] == x
  22743. 1736.73 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22744. 1736.73 s [algebraic-graphs]
  22745. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22746. 1736.73 s [algebraic-graphs] OK: connects1 [x] == x
  22747. 1736.73 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22748. 1736.73 s [algebraic-graphs]
  22749. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22750. 1736.73 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22751. 1736.73 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22752. 1736.73 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22753. 1736.73 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22754. 1736.73 s [algebraic-graphs]
  22755. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22756. 1736.73 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22757. 1736.73 s [algebraic-graphs]
  22758. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22759. 1736.73 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22760. 1736.73 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22761. 1736.73 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22762. 1736.73 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22763. 1736.73 s [algebraic-graphs]
  22764. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22765. 1736.73 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22766. 1736.73 s [algebraic-graphs] OK: vertexCount x >= 1
  22767. 1736.73 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22768. 1736.73 s [algebraic-graphs]
  22769. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22770. 1736.73 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22771. 1736.73 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22772. 1736.73 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22773. 1736.73 s [algebraic-graphs]
  22774. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22775. 1736.73 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22776. 1736.73 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22777. 1736.73 s [algebraic-graphs]
  22778. 1736.73 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22779. 1736.73 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22780. 1736.73 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22781. 1736.73 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22782. 1736.74 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22783. 1736.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22784. 1736.74 s [algebraic-graphs]
  22785. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22786. 1736.74 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22787. 1736.74 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22788. 1736.74 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22789. 1736.74 s [algebraic-graphs]
  22790. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22791. 1736.74 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22792. 1736.74 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22793. 1736.74 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22794. 1736.74 s [algebraic-graphs]
  22795. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22796. 1736.74 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22797. 1736.74 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22798. 1736.74 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22799. 1736.74 s [algebraic-graphs]
  22800. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22801. 1736.74 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22802. 1736.74 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22803. 1736.74 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22804. 1736.74 s [algebraic-graphs]
  22805. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22806. 1736.74 s [algebraic-graphs] OK: path1 [x] == vertex x
  22807. 1736.74 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22808. 1736.74 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22809. 1736.74 s [algebraic-graphs]
  22810. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22811. 1736.74 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22812. 1736.74 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22813. 1736.74 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22814. 1736.74 s [algebraic-graphs]
  22815. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22816. 1736.74 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22817. 1736.74 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22818. 1736.74 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22819. 1736.74 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22820. 1736.74 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22821. 1736.74 s [algebraic-graphs]
  22822. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22823. 1736.74 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22824. 1736.74 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22825. 1736.74 s [algebraic-graphs]
  22826. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22827. 1736.74 s [algebraic-graphs] OK: star x [] == vertex x
  22828. 1736.74 s [algebraic-graphs] OK: star x [y] == edge x y
  22829. 1736.74 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22830. 1736.74 s [algebraic-graphs]
  22831. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22832. 1736.74 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22833. 1736.74 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22834. 1736.74 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22835. 1736.74 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22836. 1736.74 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22837. 1736.74 s [algebraic-graphs]
  22838. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22839. 1736.74 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22840. 1736.74 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22841. 1736.74 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22842. 1736.74 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22843. 1736.74 s [algebraic-graphs]
  22844. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22845. 1736.74 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22846. 1736.74 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22847. 1736.74 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22848. 1736.74 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22849. 1736.74 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22850. 1736.74 s [algebraic-graphs]
  22851. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  22852. 1736.74 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22853. 1736.74 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22854. 1736.74 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22855. 1736.74 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22856. 1736.74 s [algebraic-graphs]
  22857. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  22858. 1736.74 s [algebraic-graphs] OK: replaceVertex x x == id
  22859. 1736.74 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22860. 1736.74 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22861. 1736.74 s [algebraic-graphs]
  22862. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  22863. 1736.74 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22864. 1736.74 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22865. 1736.74 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22866. 1736.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22867. 1736.74 s [algebraic-graphs]
  22868. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  22869. 1736.74 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22870. 1736.74 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22871. 1736.74 s [algebraic-graphs] OK: transpose . transpose == id
  22872. 1736.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22873. 1736.74 s [algebraic-graphs]
  22874. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  22875. 1736.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22876. 1736.74 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22877. 1736.74 s [algebraic-graphs] OK: gmap id == id
  22878. 1736.74 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22879. 1736.74 s [algebraic-graphs]
  22880. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  22881. 1736.74 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22882. 1736.74 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22883. 1736.74 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22884. 1736.74 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22885. 1736.74 s [algebraic-graphs]
  22886. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  22887. 1736.74 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22888. 1736.74 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22889. 1736.74 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  22890. 1736.74 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  22891. 1736.74 s [algebraic-graphs]
  22892. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  22893. 1736.74 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  22894. 1736.74 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  22895. 1736.74 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22896. 1736.74 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  22897. 1736.74 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22898. 1736.74 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22899. 1736.74 s [algebraic-graphs] OK: closure . closure == closure
  22900. 1736.74 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22901. 1736.74 s [algebraic-graphs]
  22902. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  22903. 1736.74 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  22904. 1736.74 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  22905. 1736.74 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22906. 1736.74 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22907. 1736.74 s [algebraic-graphs]
  22908. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  22909. 1736.74 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22910. 1736.74 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  22911. 1736.74 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22912. 1736.74 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22913. 1736.74 s [algebraic-graphs]
  22914. 1736.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  22915. 1736.74 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22916. 1736.74 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  22917. 1736.74 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  22918. 1736.74 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22919. 1736.74 s [algebraic-graphs]
  22920. 1736.74 s [algebraic-graphs] ============ NonEmpty.Graph.============
  22921. 1736.74 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22922. 1736.74 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22923. 1736.74 s [algebraic-graphs]
  22924. 1736.74 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  22925. 1736.74 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22926. 1736.74 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22927. 1736.74 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22928. 1736.74 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22929. 1736.74 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22930. 1736.74 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22931. 1736.74 s [algebraic-graphs] OK: x <= x + y
  22932. 1736.74 s [algebraic-graphs] OK: x + y <= x * y
  22933. 1736.74 s [algebraic-graphs]
  22934. 1736.74 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  22935. 1736.74 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22936. 1736.74 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  22937. 1736.74 s [algebraic-graphs] OK: fmap id == id
  22938. 1736.74 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22939. 1736.74 s [algebraic-graphs]
  22940. 1736.74 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  22941. 1736.74 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  22942. 1738.06 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  22943. 1738.06 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  22944. 1738.06 s [algebraic-graphs] OK: (x >>= vertex) == x
  22945. 1738.06 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  22946. 1738.06 s [algebraic-graphs]
  22947. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  22948. 1738.06 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22949. 1738.06 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  22950. 1738.06 s [algebraic-graphs]
  22951. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  22952. 1738.06 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22953. 1738.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22954. 1738.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22955. 1738.06 s [algebraic-graphs] OK: size (vertex x) == 1
  22956. 1738.06 s [algebraic-graphs]
  22957. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  22958. 1738.06 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22959. 1738.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22960. 1738.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22961. 1738.06 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22962. 1738.06 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22963. 1738.06 s [algebraic-graphs]
  22964. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  22965. 1738.06 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22966. 1738.06 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22967. 1738.06 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22968. 1738.06 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22969. 1738.06 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22970. 1738.06 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22971. 1738.06 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22972. 1738.06 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22973. 1738.06 s [algebraic-graphs]
  22974. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  22975. 1738.06 s [algebraic-graphs] OK: overlay1 empty x == x
  22976. 1738.06 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  22977. 1738.06 s [algebraic-graphs]
  22978. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  22979. 1738.06 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22980. 1738.06 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22981. 1738.06 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22982. 1738.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22983. 1738.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22984. 1738.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22985. 1738.06 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22986. 1738.06 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22987. 1738.06 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22988. 1738.06 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22989. 1738.06 s [algebraic-graphs]
  22990. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  22991. 1738.06 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22992. 1738.06 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22993. 1738.06 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22994. 1738.06 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22995. 1738.06 s [algebraic-graphs]
  22996. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  22997. 1738.06 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22998. 1738.06 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22999. 1738.06 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  23000. 1738.06 s [algebraic-graphs]
  23001. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  23002. 1738.06 s [algebraic-graphs] OK: overlays1 [x] == x
  23003. 1738.06 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23004. 1738.06 s [algebraic-graphs]
  23005. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  23006. 1738.06 s [algebraic-graphs] OK: connects1 [x] == x
  23007. 1738.06 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23008. 1738.06 s [algebraic-graphs]
  23009. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  23010. 1738.06 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  23011. 1738.06 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  23012. 1738.06 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  23013. 1738.06 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  23014. 1738.06 s [algebraic-graphs]
  23015. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  23016. 1738.06 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23017. 1738.06 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23018. 1738.06 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23019. 1738.06 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23020. 1738.06 s [algebraic-graphs]
  23021. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  23022. 1738.06 s [algebraic-graphs] OK: x === x == True
  23023. 1738.06 s [algebraic-graphs] OK: x + y === x + y == True
  23024. 1738.06 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  23025. 1738.06 s [algebraic-graphs] OK: x + y === x * y == False
  23026. 1738.06 s [algebraic-graphs]
  23027. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  23028. 1738.06 s [algebraic-graphs] OK: size (vertex x) == 1
  23029. 1738.06 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23030. 1738.06 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23031. 1738.06 s [algebraic-graphs] OK: size x >= 1
  23032. 1738.06 s [algebraic-graphs] OK: size x >= vertexCount x
  23033. 1738.06 s [algebraic-graphs]
  23034. 1738.06 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  23035. 1738.07 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23036. 1738.07 s [algebraic-graphs]
  23037. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  23038. 1738.07 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23039. 1738.07 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23040. 1738.07 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23041. 1738.07 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23042. 1738.07 s [algebraic-graphs]
  23043. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  23044. 1738.07 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23045. 1738.07 s [algebraic-graphs] OK: vertexCount x >= 1
  23046. 1738.07 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23047. 1738.07 s [algebraic-graphs]
  23048. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  23049. 1738.07 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23050. 1738.07 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23051. 1738.07 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23052. 1738.07 s [algebraic-graphs]
  23053. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  23054. 1738.07 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23055. 1738.07 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23056. 1738.07 s [algebraic-graphs]
  23057. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  23058. 1738.07 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23059. 1738.07 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23060. 1738.07 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23061. 1738.07 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23062. 1738.07 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23063. 1738.07 s [algebraic-graphs]
  23064. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  23065. 1738.07 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23066. 1738.07 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23067. 1738.07 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23068. 1738.07 s [algebraic-graphs]
  23069. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  23070. 1738.07 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23071. 1738.07 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23072. 1738.07 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23073. 1738.07 s [algebraic-graphs]
  23074. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  23075. 1738.07 s [algebraic-graphs] OK: path1 [x] == vertex x
  23076. 1738.07 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23077. 1738.07 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23078. 1738.07 s [algebraic-graphs]
  23079. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  23080. 1738.07 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23081. 1738.07 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23082. 1738.07 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23083. 1738.07 s [algebraic-graphs]
  23084. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  23085. 1738.07 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23086. 1738.07 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23087. 1738.07 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23088. 1738.07 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23089. 1738.07 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23090. 1738.07 s [algebraic-graphs]
  23091. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  23092. 1738.07 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23093. 1738.07 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23094. 1738.07 s [algebraic-graphs]
  23095. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  23096. 1738.07 s [algebraic-graphs] OK: star x [] == vertex x
  23097. 1738.07 s [algebraic-graphs] OK: star x [y] == edge x y
  23098. 1738.07 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23099. 1738.07 s [algebraic-graphs]
  23100. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  23101. 1738.07 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23102. 1738.07 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23103. 1738.07 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23104. 1738.07 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23105. 1738.07 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23106. 1738.07 s [algebraic-graphs]
  23107. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  23108. 1738.07 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23109. 1738.07 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23110. 1738.07 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23111. 1738.07 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23112. 1738.07 s [algebraic-graphs]
  23113. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  23114. 1738.07 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  23115. 1738.07 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  23116. 1738.07 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  23117. 1738.07 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  23118. 1738.07 s [algebraic-graphs]
  23119. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  23120. 1738.07 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  23121. 1738.07 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  23122. 1738.07 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  23123. 1738.07 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  23124. 1738.07 s [algebraic-graphs]
  23125. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  23126. 1738.07 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23127. 1738.07 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23128. 1738.07 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23129. 1738.07 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23130. 1738.07 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23131. 1738.07 s [algebraic-graphs]
  23132. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  23133. 1738.07 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23134. 1738.07 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23135. 1738.07 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23136. 1738.07 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23137. 1738.07 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  23138. 1738.07 s [algebraic-graphs]
  23139. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  23140. 1738.07 s [algebraic-graphs] OK: replaceVertex x x == id
  23141. 1738.07 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23142. 1738.07 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23143. 1738.07 s [algebraic-graphs]
  23144. 1738.07 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  23145. 1738.07 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23146. 1743.76 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23147. 1743.76 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23148. 1743.77 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23149. 1743.77 s [algebraic-graphs]
  23150. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  23151. 1743.77 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  23152. 1743.77 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  23153. 1743.77 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  23154. 1743.77 s [algebraic-graphs]
  23155. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  23156. 1743.77 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23157. 1743.77 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23158. 1743.77 s [algebraic-graphs] OK: transpose . transpose == id
  23159. 1743.77 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23160. 1743.77 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23161. 1743.77 s [algebraic-graphs]
  23162. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  23163. 1743.77 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23164. 1743.77 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23165. 1743.77 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23166. 1743.77 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23167. 1743.77 s [algebraic-graphs]
  23168. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  23169. 1743.77 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23170. 1743.77 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23171. 1743.77 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  23172. 1743.77 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  23173. 1743.77 s [algebraic-graphs]
  23174. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  23175. 1743.77 s [algebraic-graphs] OK: simplify == id
  23176. 1743.77 s [algebraic-graphs] OK: size (simplify x) <= size x
  23177. 1743.77 s [algebraic-graphs] OK: simplify 1 === 1
  23178. 1743.77 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  23179. 1743.77 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  23180. 1743.77 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  23181. 1743.77 s [algebraic-graphs]
  23182. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  23183. 1743.77 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  23184. 1743.77 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  23185. 1743.77 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  23186. 1743.77 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  23187. 1743.77 s [algebraic-graphs]
  23188. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  23189. 1743.77 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  23190. 1743.77 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  23191. 1743.77 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  23192. 1743.77 s [algebraic-graphs]
  23193. 1743.77 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  23194. 1743.77 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  23195. 1743.77 s [algebraic-graphs] OK: box x y ~~ box y x
  23196. 1743.77 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  23197. 1743.77 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  23198. 1743.77 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  23199. 1743.77 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23200. 1743.77 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  23201. 1743.77 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  23202. 1743.77 s [algebraic-graphs]
  23203. 1743.77 s [algebraic-graphs] ============ Relation ============
  23204. 1743.77 s [algebraic-graphs] OK: Axioms of graphs
  23205. 1743.77 s [algebraic-graphs]
  23206. 1743.77 s [algebraic-graphs] ============ Relation.consistent ============
  23207. 1743.77 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23208. 1743.77 s [algebraic-graphs]
  23209. 1743.77 s [algebraic-graphs] OK: consistent empty == True
  23210. 1743.77 s [algebraic-graphs] OK: consistent (vertex x) == True
  23211. 1743.77 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23212. 1743.77 s [algebraic-graphs] OK: consistent (connect x y) == True
  23213. 1743.77 s [algebraic-graphs] OK: consistent (edge x y) == True
  23214. 1743.77 s [algebraic-graphs] OK: consistent (edges xs) == True
  23215. 1743.77 s [algebraic-graphs] OK: consistent (stars xs) == True
  23216. 1743.77 s [algebraic-graphs]
  23217. 1743.77 s [algebraic-graphs] ============ Relation.Show ============
  23218. 1743.77 s [algebraic-graphs] OK: show (empty ) == "empty"
  23219. 1743.77 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23220. 1743.77 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23221. 1743.77 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23222. 1743.77 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23223. 1743.77 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23224. 1743.77 s [algebraic-graphs]
  23225. 1743.77 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23226. 1743.77 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23227. 1743.77 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23228. 1743.77 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23229. 1743.77 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23230. 1743.77 s [algebraic-graphs]
  23231. 1743.77 s [algebraic-graphs] ============ Relation.Ord ============
  23232. 1743.77 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23233. 1743.77 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23234. 1743.77 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23235. 1743.77 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23236. 1743.77 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23237. 1743.77 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23238. 1743.77 s [algebraic-graphs] OK: x <= x + y
  23239. 1743.77 s [algebraic-graphs] OK: x + y <= x * y
  23240. 1743.77 s [algebraic-graphs]
  23241. 1743.77 s [algebraic-graphs] ============ Relation.empty ============
  23242. 1743.77 s [algebraic-graphs] OK: isEmpty empty == True
  23243. 1743.77 s [algebraic-graphs] OK: hasVertex x empty == False
  23244. 1743.77 s [algebraic-graphs] OK: vertexCount empty == 0
  23245. 1743.77 s [algebraic-graphs] OK: edgeCount empty == 0
  23246. 1743.77 s [algebraic-graphs]
  23247. 1743.77 s [algebraic-graphs] ============ Relation.vertex ============
  23248. 1743.77 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23249. 1743.77 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23250. 1743.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23251. 1743.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23252. 1743.77 s [algebraic-graphs]
  23253. 1743.77 s [algebraic-graphs] ============ Relation.edge ============
  23254. 1743.77 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23255. 1743.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23256. 1743.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23257. 1743.77 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23258. 1743.77 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23259. 1743.77 s [algebraic-graphs]
  23260. 1743.77 s [algebraic-graphs] ============ Relation.overlay ============
  23261. 1743.77 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23262. 1743.77 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23263. 1743.77 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23264. 1743.77 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23265. 1743.77 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23266. 1743.77 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23267. 1743.77 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23268. 1743.77 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23269. 1743.77 s [algebraic-graphs]
  23270. 1743.77 s [algebraic-graphs] ============ Relation.connect ============
  23271. 1743.77 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23272. 1743.77 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23273. 1743.77 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23274. 1743.77 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23275. 1743.77 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23276. 1743.77 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23277. 1743.77 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23278. 1743.77 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23279. 1743.77 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23280. 1743.77 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23281. 1743.77 s [algebraic-graphs]
  23282. 1743.77 s [algebraic-graphs] ============ Relation.vertices ============
  23283. 1743.77 s [algebraic-graphs] OK: vertices [] == empty
  23284. 1743.77 s [algebraic-graphs] OK: vertices [x] == vertex x
  23285. 1743.77 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23286. 1743.77 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23287. 1743.77 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23288. 1743.77 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23289. 1743.77 s [algebraic-graphs]
  23290. 1743.77 s [algebraic-graphs] ============ Relation.edges ============
  23291. 1743.77 s [algebraic-graphs] OK: edges [] == empty
  23292. 1743.77 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23293. 1743.77 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23294. 1743.77 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23295. 1743.77 s [algebraic-graphs]
  23296. 1743.77 s [algebraic-graphs] ============ Relation.overlays ============
  23297. 1743.77 s [algebraic-graphs] OK: overlays [] == empty
  23298. 1743.77 s [algebraic-graphs] OK: overlays [x] == x
  23299. 1743.77 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23300. 1743.77 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23301. 1743.77 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23302. 1743.77 s [algebraic-graphs]
  23303. 1743.77 s [algebraic-graphs] ============ Relation.connects ============
  23304. 1743.77 s [algebraic-graphs] OK: connects [] == empty
  23305. 1743.77 s [algebraic-graphs] OK: connects [x] == x
  23306. 1743.77 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23307. 1743.77 s [algebraic-graphs] OK: connects == foldr connect empty
  23308. 1743.77 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23309. 1743.77 s [algebraic-graphs]
  23310. 1743.77 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23311. 1743.77 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23312. 1743.77 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23313. 1743.77 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23314. 1743.77 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23315. 1743.77 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23316. 1743.77 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23317. 1743.77 s [algebraic-graphs]
  23318. 1743.77 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23319. 1743.77 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23320. 1743.77 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23321. 1743.77 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23322. 1743.77 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23323. 1743.77 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23324. 1743.77 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23325. 1743.77 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23326. 1743.77 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23327. 1743.77 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23328. 1743.77 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23329. 1743.77 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23330. 1743.77 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23331. 1743.77 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23332. 1743.77 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23333. 1743.77 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23334. 1743.77 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23335. 1743.77 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23336. 1746.88 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23337. 1746.88 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23338. 1746.88 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23339. 1746.88 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23340. 1746.88 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23341. 1746.88 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23342. 1746.88 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23343. 1746.88 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23344. 1746.88 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23345. 1746.88 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23346. 1746.88 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23347. 1746.88 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23348. 1746.88 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23349. 1746.88 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23350. 1746.88 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23351. 1746.88 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23352. 1746.88 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23353. 1746.88 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23354. 1746.88 s [algebraic-graphs]
  23355. 1746.88 s [algebraic-graphs] ============ Relation.foldg ============
  23356. 1746.88 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23357. 1746.88 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23358. 1746.88 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23359. 1746.88 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23360. 1746.88 s [algebraic-graphs]
  23361. 1746.88 s [algebraic-graphs] ============ Relation.isEmpty ============
  23362. 1746.88 s [algebraic-graphs] OK: isEmpty empty == True
  23363. 1746.88 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23364. 1746.88 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23365. 1746.88 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23366. 1746.88 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23367. 1746.88 s [algebraic-graphs]
  23368. 1746.88 s [algebraic-graphs] ============ Relation.hasVertex ============
  23369. 1746.88 s [algebraic-graphs] OK: hasVertex x empty == False
  23370. 1746.88 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23371. 1746.88 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23372. 1746.88 s [algebraic-graphs]
  23373. 1746.88 s [algebraic-graphs] ============ Relation.hasEdge ============
  23374. 1746.88 s [algebraic-graphs] OK: hasEdge x y empty == False
  23375. 1746.88 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23376. 1746.88 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23377. 1746.88 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23378. 1746.88 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23379. 1746.88 s [algebraic-graphs]
  23380. 1746.88 s [algebraic-graphs] ============ Relation.vertexCount ============
  23381. 1746.88 s [algebraic-graphs] OK: vertexCount empty == 0
  23382. 1746.88 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23383. 1746.88 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23384. 1746.88 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23385. 1746.88 s [algebraic-graphs]
  23386. 1746.88 s [algebraic-graphs] ============ Relation.edgeCount ============
  23387. 1746.88 s [algebraic-graphs] OK: edgeCount empty == 0
  23388. 1746.88 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23389. 1746.88 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23390. 1746.88 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23391. 1746.88 s [algebraic-graphs]
  23392. 1746.88 s [algebraic-graphs] ============ Relation.vertexList ============
  23393. 1746.88 s [algebraic-graphs] OK: vertexList empty == []
  23394. 1746.88 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23395. 1746.88 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23396. 1746.88 s [algebraic-graphs]
  23397. 1746.88 s [algebraic-graphs] ============ Relation.vertexSet ============
  23398. 1746.88 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23399. 1746.88 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23400. 1746.88 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23401. 1746.88 s [algebraic-graphs]
  23402. 1746.88 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23403. 1746.88 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23404. 1746.88 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23405. 1746.88 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23406. 1746.88 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23407. 1746.88 s [algebraic-graphs]
  23408. 1746.88 s [algebraic-graphs] ============ Relation.edgeList ============
  23409. 1746.88 s [algebraic-graphs] OK: edgeList empty == []
  23410. 1746.88 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23411. 1746.88 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23412. 1746.88 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23413. 1746.88 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23414. 1746.88 s [algebraic-graphs]
  23415. 1746.88 s [algebraic-graphs] ============ Relation.edgeSet ============
  23416. 1746.88 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23417. 1746.88 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23418. 1746.88 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23419. 1746.88 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23420. 1746.88 s [algebraic-graphs]
  23421. 1746.88 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23422. 1746.88 s [algebraic-graphs] OK: adjacencyList empty == []
  23423. 1746.88 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23424. 1746.88 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23425. 1746.88 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23426. 1746.88 s [algebraic-graphs]
  23427. 1746.88 s [algebraic-graphs] ============ Relation.preSet ============
  23428. 1746.88 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23429. 1746.88 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23430. 1746.88 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23431. 1746.88 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23432. 1746.88 s [algebraic-graphs]
  23433. 1746.88 s [algebraic-graphs] ============ Relation.preIntSet ============
  23434. 1746.88 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23435. 1746.88 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23436. 1746.88 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23437. 1746.88 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23438. 1746.88 s [algebraic-graphs]
  23439. 1746.88 s [algebraic-graphs] ============ Relation.postSet ============
  23440. 1746.88 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23441. 1746.88 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23442. 1746.88 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23443. 1746.88 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23444. 1746.88 s [algebraic-graphs]
  23445. 1746.88 s [algebraic-graphs] ============ Relation.postIntSet ============
  23446. 1746.88 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23447. 1746.88 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23448. 1746.88 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23449. 1746.88 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23450. 1746.88 s [algebraic-graphs]
  23451. 1746.88 s [algebraic-graphs] ============ Relation.path ============
  23452. 1746.88 s [algebraic-graphs] OK: path [] == empty
  23453. 1746.88 s [algebraic-graphs] OK: path [x] == vertex x
  23454. 1746.88 s [algebraic-graphs] OK: path [x,y] == edge x y
  23455. 1746.88 s [algebraic-graphs]
  23456. 1746.88 s [algebraic-graphs] ============ Relation.circuit ============
  23457. 1746.88 s [algebraic-graphs] OK: circuit [] == empty
  23458. 1746.88 s [algebraic-graphs] OK: circuit [x] == edge x x
  23459. 1746.88 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23460. 1746.88 s [algebraic-graphs]
  23461. 1746.89 s [algebraic-graphs] ============ Relation.clique ============
  23462. 1746.89 s [algebraic-graphs] OK: clique [] == empty
  23463. 1746.89 s [algebraic-graphs] OK: clique [x] == vertex x
  23464. 1746.89 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23465. 1746.89 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23466. 1746.89 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23467. 1746.89 s [algebraic-graphs]
  23468. 1746.89 s [algebraic-graphs] ============ Relation.biclique ============
  23469. 1746.89 s [algebraic-graphs] OK: biclique [] [] == empty
  23470. 1746.89 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23471. 1746.89 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23472. 1746.89 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23473. 1746.89 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23474. 1746.89 s [algebraic-graphs]
  23475. 1746.89 s [algebraic-graphs] ============ Relation.star ============
  23476. 1746.89 s [algebraic-graphs] OK: star x [] == vertex x
  23477. 1746.89 s [algebraic-graphs] OK: star x [y] == edge x y
  23478. 1746.89 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23479. 1746.89 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23480. 1746.89 s [algebraic-graphs]
  23481. 1746.89 s [algebraic-graphs] ============ Relation.stars ============
  23482. 1746.89 s [algebraic-graphs] OK: stars [] == empty
  23483. 1746.89 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23484. 1746.89 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23485. 1746.89 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23486. 1746.89 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23487. 1746.89 s [algebraic-graphs] OK: stars . adjacencyList == id
  23488. 1746.89 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23489. 1746.89 s [algebraic-graphs]
  23490. 1746.89 s [algebraic-graphs] ============ Relation.tree ============
  23491. 1746.89 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23492. 1746.89 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23493. 1746.89 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23494. 1746.89 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23495. 1746.89 s [algebraic-graphs]
  23496. 1746.89 s [algebraic-graphs] ============ Relation.forest ============
  23497. 1746.89 s [algebraic-graphs] OK: forest [] == empty
  23498. 1746.89 s [algebraic-graphs] OK: forest [x] == tree x
  23499. 1746.89 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23500. 1746.89 s [algebraic-graphs] OK: forest == overlays . map tree
  23501. 1746.89 s [algebraic-graphs]
  23502. 1746.89 s [algebraic-graphs] ============ Relation.removeVertex ============
  23503. 1746.89 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23504. 1746.89 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23505. 1746.89 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23506. 1746.89 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23507. 1746.89 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23508. 1746.89 s [algebraic-graphs]
  23509. 1746.89 s [algebraic-graphs] ============ Relation.removeEdge ============
  23510. 1746.89 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23511. 1746.89 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23512. 1746.89 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23513. 1746.89 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23514. 1746.89 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23515. 1746.89 s [algebraic-graphs]
  23516. 1746.89 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23517. 1746.89 s [algebraic-graphs] OK: replaceVertex x x == id
  23518. 1746.89 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23519. 1746.89 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23520. 1746.89 s [algebraic-graphs]
  23521. 1746.89 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23522. 1746.89 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23523. 1765.80 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23524. 1765.80 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23525. 1765.81 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23526. 1765.81 s [algebraic-graphs]
  23527. 1765.81 s [algebraic-graphs] ============ Relation.transpose ============
  23528. 1765.81 s [algebraic-graphs] OK: transpose empty == empty
  23529. 1765.81 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23530. 1765.81 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23531. 1765.81 s [algebraic-graphs] OK: transpose . transpose == id
  23532. 1765.81 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23533. 1765.81 s [algebraic-graphs]
  23534. 1765.81 s [algebraic-graphs] ============ Relation.gmap ============
  23535. 1765.81 s [algebraic-graphs] OK: gmap f empty == empty
  23536. 1765.81 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23537. 1765.81 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23538. 1765.81 s [algebraic-graphs] OK: gmap id == id
  23539. 1765.81 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23540. 1765.81 s [algebraic-graphs]
  23541. 1765.81 s [algebraic-graphs] ============ Relation.induce ============
  23542. 1765.81 s [algebraic-graphs] OK: induce (const True ) x == x
  23543. 1765.81 s [algebraic-graphs] OK: induce (const False) x == empty
  23544. 1765.81 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23545. 1765.81 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23546. 1765.81 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23547. 1765.81 s [algebraic-graphs]
  23548. 1765.81 s [algebraic-graphs] ============ Relation.compose ============
  23549. 1765.81 s [algebraic-graphs] OK: compose empty x == empty
  23550. 1765.81 s [algebraic-graphs] OK: compose x empty == empty
  23551. 1765.81 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23552. 1765.81 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23553. 1765.81 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23554. 1765.81 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23555. 1765.81 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23556. 1765.81 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23557. 1765.81 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23558. 1765.81 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23559. 1765.81 s [algebraic-graphs]
  23560. 1765.81 s [algebraic-graphs] ============ Relation.closure ============
  23561. 1765.81 s [algebraic-graphs] OK: closure empty == empty
  23562. 1765.81 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23563. 1765.81 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23564. 1765.81 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23565. 1765.81 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23566. 1765.81 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23567. 1765.81 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23568. 1765.81 s [algebraic-graphs] OK: closure . closure == closure
  23569. 1765.81 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23570. 1765.81 s [algebraic-graphs]
  23571. 1765.81 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23572. 1765.81 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23573. 1765.81 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23574. 1765.81 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23575. 1765.81 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23576. 1765.81 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23577. 1765.81 s [algebraic-graphs]
  23578. 1765.81 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23579. 1765.81 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23580. 1765.81 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23581. 1765.81 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23582. 1765.81 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23583. 1765.81 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23584. 1765.81 s [algebraic-graphs]
  23585. 1765.81 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23586. 1765.81 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23587. 1765.81 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23588. 1765.81 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23589. 1765.81 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23590. 1765.81 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23591. 1765.81 s [algebraic-graphs]
  23592. 1765.81 s [algebraic-graphs] ============ Relation.induceJust ============
  23593. 1765.81 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23594. 1765.81 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23595. 1765.81 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23596. 1765.81 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23597. 1765.81 s [algebraic-graphs]
  23598. 1765.81 s [algebraic-graphs] ============ ReflexiveRelation ============
  23599. 1765.81 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23600. 1765.81 s [algebraic-graphs]
  23601. 1765.81 s [algebraic-graphs] ============ TransitiveRelation ============
  23602. 1765.81 s [algebraic-graphs] OK: Axioms of transitive graphs
  23603. 1765.81 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23604. 1765.81 s [algebraic-graphs]
  23605. 1765.81 s [algebraic-graphs] ============ PreorderRelation ============
  23606. 1765.81 s [algebraic-graphs] OK: Axioms of preorder graphs
  23607. 1765.81 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23608. 1765.81 s [algebraic-graphs]
  23609. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation ============
  23610. 1765.81 s [algebraic-graphs] OK: Axioms of undirected graphs
  23611. 1765.81 s [algebraic-graphs]
  23612. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23613. 1765.81 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23614. 1765.81 s [algebraic-graphs]
  23615. 1765.81 s [algebraic-graphs] OK: consistent empty == True
  23616. 1765.81 s [algebraic-graphs] OK: consistent (vertex x) == True
  23617. 1765.81 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23618. 1765.81 s [algebraic-graphs] OK: consistent (connect x y) == True
  23619. 1765.81 s [algebraic-graphs] OK: consistent (edge x y) == True
  23620. 1765.81 s [algebraic-graphs] OK: consistent (edges xs) == True
  23621. 1765.81 s [algebraic-graphs] OK: consistent (stars xs) == True
  23622. 1765.81 s [algebraic-graphs]
  23623. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23624. 1765.81 s [algebraic-graphs] OK: show (empty ) == "empty"
  23625. 1765.81 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23626. 1765.81 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23627. 1765.81 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23628. 1765.81 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23629. 1765.81 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23630. 1765.81 s [algebraic-graphs]
  23631. 1765.81 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23632. 1765.81 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23633. 1765.81 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23634. 1765.81 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23635. 1765.81 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23636. 1765.81 s [algebraic-graphs]
  23637. 1765.81 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23638. 1765.81 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23639. 1765.81 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23640. 1765.81 s [algebraic-graphs]
  23641. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23642. 1765.81 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23643. 1765.81 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23644. 1765.81 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23645. 1765.81 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23646. 1765.81 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23647. 1765.81 s [algebraic-graphs]
  23648. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23649. 1765.81 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23650. 1765.81 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23651. 1765.81 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23652. 1765.81 s [algebraic-graphs]
  23653. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23654. 1765.81 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23655. 1765.81 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23656. 1765.81 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23657. 1765.81 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23658. 1765.81 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23659. 1765.81 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23660. 1765.81 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23661. 1765.81 s [algebraic-graphs] OK: x <= x + y
  23662. 1765.81 s [algebraic-graphs] OK: x + y <= x * y
  23663. 1765.81 s [algebraic-graphs]
  23664. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23665. 1765.81 s [algebraic-graphs] OK: isEmpty empty == True
  23666. 1765.81 s [algebraic-graphs] OK: hasVertex x empty == False
  23667. 1765.81 s [algebraic-graphs] OK: vertexCount empty == 0
  23668. 1765.81 s [algebraic-graphs] OK: edgeCount empty == 0
  23669. 1765.81 s [algebraic-graphs]
  23670. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23671. 1765.81 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23672. 1765.81 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23673. 1765.81 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23674. 1765.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23675. 1765.81 s [algebraic-graphs]
  23676. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23677. 1765.81 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23678. 1765.81 s [algebraic-graphs] OK: edge x y == edge y x
  23679. 1765.81 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23680. 1765.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23681. 1765.81 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23682. 1765.81 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23683. 1765.81 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23684. 1765.81 s [algebraic-graphs]
  23685. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23686. 1765.81 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23687. 1765.81 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23688. 1765.81 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23689. 1765.81 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23690. 1765.81 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23691. 1765.81 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23692. 1765.81 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23693. 1765.81 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23694. 1765.81 s [algebraic-graphs]
  23695. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23696. 1765.81 s [algebraic-graphs] OK: connect x y == connect y x
  23697. 1765.81 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23698. 1765.81 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23699. 1765.81 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23700. 1765.81 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23701. 1765.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23702. 1765.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23703. 1765.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23704. 1765.81 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23705. 1765.81 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23706. 1765.81 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23707. 1765.81 s [algebraic-graphs]
  23708. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23709. 1765.81 s [algebraic-graphs] OK: vertices [] == empty
  23710. 1765.81 s [algebraic-graphs] OK: vertices [x] == vertex x
  23711. 1765.81 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23712. 1765.81 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23713. 1765.81 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23714. 1765.81 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23715. 1765.81 s [algebraic-graphs]
  23716. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23717. 1765.81 s [algebraic-graphs] OK: edges [] == empty
  23718. 1765.81 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23719. 1765.81 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23720. 1765.81 s [algebraic-graphs]
  23721. 1765.81 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23722. 1765.81 s [algebraic-graphs] OK: overlays [] == empty
  23723. 1776.48 s [algebraic-graphs] OK: overlays [x] == x
  23724. 1776.49 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23725. 1776.49 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23726. 1776.49 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23727. 1776.49 s [algebraic-graphs]
  23728. 1776.49 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23729. 1776.49 s [algebraic-graphs] OK: connects [] == empty
  23730. 1776.49 s [algebraic-graphs] OK: connects [x] == x
  23731. 1776.49 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23732. 1776.49 s [algebraic-graphs] OK: connects == foldr connect empty
  23733. 1776.49 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23734. 1776.49 s [algebraic-graphs] OK: connects == connects . reverse
  23735. 1776.49 s [algebraic-graphs]
  23736. 1776.49 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23737. 1776.49 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23738. 1776.49 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23739. 1776.49 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23740. 1776.49 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23741. 1776.49 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23742. 1776.49 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23743. 1776.49 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23744. 1776.49 s [algebraic-graphs]
  23745. 1776.49 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23746. 1776.49 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23747. 1776.49 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23748. 1776.49 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23749. 1776.49 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23750. 1776.49 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23751. 1776.49 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23752. 1776.49 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23753. 1776.49 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23754. 1776.49 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23755. 1776.49 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23756. 1776.49 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23757. 1776.49 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23758. 1776.49 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23759. 1776.49 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23760. 1776.49 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23761. 1776.49 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23762. 1776.49 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23763. 1776.49 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23764. 1776.49 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23765. 1776.49 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23766. 1776.49 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23767. 1776.49 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23768. 1776.49 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23769. 1776.49 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23770. 1776.49 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23771. 1776.49 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23772. 1776.49 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23773. 1776.49 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23774. 1776.49 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23775. 1776.49 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23776. 1776.49 s [algebraic-graphs]
  23777. 1776.49 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23778. 1776.49 s [algebraic-graphs] OK: isEmpty empty == True
  23779. 1776.49 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23780. 1776.49 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23781. 1776.49 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23782. 1776.49 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23783. 1776.49 s [algebraic-graphs]
  23784. 1776.49 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23785. 1776.49 s [algebraic-graphs] OK: hasVertex x empty == False
  23786. 1776.49 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23787. 1776.49 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23788. 1776.49 s [algebraic-graphs]
  23789. 1776.49 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23790. 1776.49 s [algebraic-graphs] OK: hasEdge x y empty == False
  23791. 1776.49 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23792. 1776.49 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23793. 1776.49 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23794. 1776.49 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23795. 1776.50 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23796. 1776.50 s [algebraic-graphs]
  23797. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23798. 1776.50 s [algebraic-graphs] OK: vertexCount empty == 0
  23799. 1776.50 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23800. 1776.50 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23801. 1776.50 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23802. 1776.50 s [algebraic-graphs]
  23803. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23804. 1776.50 s [algebraic-graphs] OK: edgeCount empty == 0
  23805. 1776.50 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23806. 1776.50 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23807. 1776.50 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23808. 1776.50 s [algebraic-graphs]
  23809. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23810. 1776.50 s [algebraic-graphs] OK: vertexList empty == []
  23811. 1776.50 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23812. 1776.50 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23813. 1776.50 s [algebraic-graphs]
  23814. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23815. 1776.50 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23816. 1776.50 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23817. 1776.50 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23818. 1776.50 s [algebraic-graphs]
  23819. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23820. 1776.50 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23821. 1776.50 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23822. 1776.50 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23823. 1776.50 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23824. 1776.50 s [algebraic-graphs]
  23825. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23826. 1776.50 s [algebraic-graphs] OK: edgeList empty == []
  23827. 1776.50 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23828. 1776.50 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23829. 1776.50 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23830. 1776.50 s [algebraic-graphs]
  23831. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23832. 1776.50 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23833. 1776.50 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23834. 1776.50 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23835. 1776.50 s [algebraic-graphs]
  23836. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23837. 1776.50 s [algebraic-graphs] OK: adjacencyList empty == []
  23838. 1776.50 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23839. 1776.50 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23840. 1776.50 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23841. 1776.50 s [algebraic-graphs]
  23842. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23843. 1776.50 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23844. 1776.50 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23845. 1776.50 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23846. 1776.50 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23847. 1776.50 s [algebraic-graphs]
  23848. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23849. 1776.50 s [algebraic-graphs] OK: path [] == empty
  23850. 1776.50 s [algebraic-graphs] OK: path [x] == vertex x
  23851. 1776.50 s [algebraic-graphs] OK: path [x,y] == edge x y
  23852. 1776.50 s [algebraic-graphs] OK: path == path . reverse
  23853. 1776.50 s [algebraic-graphs]
  23854. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  23855. 1776.50 s [algebraic-graphs] OK: circuit [] == empty
  23856. 1776.50 s [algebraic-graphs] OK: circuit [x] == edge x x
  23857. 1776.50 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23858. 1776.50 s [algebraic-graphs] OK: circuit == circuit . reverse
  23859. 1776.50 s [algebraic-graphs]
  23860. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  23861. 1776.50 s [algebraic-graphs] OK: clique [] == empty
  23862. 1776.50 s [algebraic-graphs] OK: clique [x] == vertex x
  23863. 1776.50 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23864. 1776.50 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23865. 1776.50 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23866. 1776.50 s [algebraic-graphs] OK: clique == clique . reverse
  23867. 1776.50 s [algebraic-graphs]
  23868. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  23869. 1776.50 s [algebraic-graphs] OK: biclique [] [] == empty
  23870. 1776.50 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23871. 1776.50 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23872. 1776.50 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23873. 1776.50 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23874. 1776.50 s [algebraic-graphs]
  23875. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  23876. 1776.50 s [algebraic-graphs] OK: star x [] == vertex x
  23877. 1776.50 s [algebraic-graphs] OK: star x [y] == edge x y
  23878. 1776.50 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23879. 1776.50 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23880. 1776.50 s [algebraic-graphs]
  23881. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  23882. 1776.50 s [algebraic-graphs] OK: stars [] == empty
  23883. 1776.50 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23884. 1776.50 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23885. 1776.50 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23886. 1776.50 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23887. 1776.50 s [algebraic-graphs] OK: stars . adjacencyList == id
  23888. 1776.50 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23889. 1776.50 s [algebraic-graphs]
  23890. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  23891. 1776.50 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23892. 1776.50 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23893. 1776.50 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23894. 1776.50 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23895. 1776.50 s [algebraic-graphs]
  23896. 1776.50 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  23897. 1776.50 s [algebraic-graphs] OK: forest [] == empty
  23898. 1782.79 s [algebraic-graphs] OK: forest [x] == tree x
  23899. 1782.79 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23900. 1782.81 s [algebraic-graphs] OK: forest == overlays . map tree
  23901. 1782.81 s [algebraic-graphs]
  23902. 1782.81 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  23903. 1782.81 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23904. 1782.81 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23905. 1782.81 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23906. 1782.81 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23907. 1782.81 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23908. 1782.81 s [algebraic-graphs]
  23909. 1782.81 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  23910. 1782.81 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23911. 1782.81 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23912. 1782.81 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23913. 1782.81 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23914. 1782.81 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23915. 1782.81 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23916. 1782.81 s [algebraic-graphs]
  23917. 1782.81 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  23918. 1782.81 s [algebraic-graphs] OK: replaceVertex x x == id
  23919. 1782.81 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23920. 1782.81 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23921. 1782.81 s [algebraic-graphs]
  23922. 1782.81 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  23923. 1782.81 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23924. 1782.81 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23925. 1782.81 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23926. 1782.81 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23927. 1782.81 s [algebraic-graphs]
  23928. 1782.81 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  23929. 1782.81 s [algebraic-graphs] OK: gmap f empty == empty
  23930. 1782.81 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23931. 1782.81 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23932. 1782.81 s [algebraic-graphs] OK: gmap id == id
  23933. 1782.81 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23934. 1782.81 s [algebraic-graphs]
  23935. 1782.81 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  23936. 1782.81 s [algebraic-graphs] OK: induce (const True ) x == x
  23937. 1782.81 s [algebraic-graphs] OK: induce (const False) x == empty
  23938. 1782.81 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23939. 1782.81 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23940. 1782.81 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23941. 1782.81 s [algebraic-graphs]
  23942. 1782.81 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  23943. 1782.81 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23944. 1782.81 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23945. 1782.81 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23946. 1782.81 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23947. 1782.81 s [algebraic-graphs]
  23948. 1782.81 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  23949. 1782.81 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  23950. 1782.81 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  23951. 1782.81 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  23952. 1782.81 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  23953. 1782.81 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  23954. 1782.81 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  23955. 1782.81 s [algebraic-graphs]
  23956. 1782.81 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  23957. 1782.81 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  23958. 1782.81 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  23959. 1782.81 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  23960. 1782.81 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  23961. 1782.81 s [algebraic-graphs]
  23962. 1782.81 s [algebraic-graphs] ============ Typed ============
  23963. 1782.81 s [algebraic-graphs]
  23964. 1782.81 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  23965. 1782.81 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23966. 1782.81 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23967. 1782.81 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  23968. 1782.81 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23969. 1782.81 s [algebraic-graphs]
  23970. 1782.81 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  23971. 1782.81 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23972. 1782.81 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23973. 1782.81 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  23974. 1782.81 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23975. 1782.81 s [algebraic-graphs]
  23976. 1782.81 s [algebraic-graphs] ============ Typed.dfsForest ============
  23977. 1782.81 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  23978. 1782.81 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  23979. 1782.81 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  23980. 1782.81 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  23981. 1782.81 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  23982. 1782.81 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  23983. 1782.81 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  23984. 1782.81 s [algebraic-graphs]
  23985. 1782.81 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  23986. 1782.81 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  23987. 1782.81 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  23988. 1782.81 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  23989. 1782.81 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  23990. 1782.81 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  23991. 1782.81 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  23992. 1782.81 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  23993. 1782.81 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  23994. 1782.81 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  23995. 1782.81 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  23996. 1782.81 s [algebraic-graphs]
  23997. 1782.81 s [algebraic-graphs] ============ Typed.dfs ============
  23998. 1782.81 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  23999. 1782.81 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  24000. 1782.81 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  24001. 1782.81 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  24002. 1782.81 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  24003. 1782.81 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  24004. 1782.81 s [algebraic-graphs] OK: dfs % x $ [] == []
  24005. 1782.81 s [algebraic-graphs]
  24006. 1782.81 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  24007. 1782.81 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  24008. 1782.81 s [algebraic-graphs]
  24009. 1782.81 s [algebraic-graphs] ============ Typed.topSort ============
  24010. 1782.81 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  24011. 1782.81 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  24012. 1782.81 s [algebraic-graphs]
  24013. 1782.81 s [algebraic-graphs] ============ Graph.Undirected ============
  24014. 1782.81 s [algebraic-graphs] OK: Axioms of undirected graphs
  24015. 1782.81 s [algebraic-graphs]
  24016. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  24017. 1782.81 s [algebraic-graphs] OK: show (empty ) == "empty"
  24018. 1782.81 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  24019. 1782.81 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  24020. 1782.81 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  24021. 1782.81 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  24022. 1782.81 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  24023. 1782.81 s [algebraic-graphs]
  24024. 1782.81 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  24025. 1782.81 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  24026. 1782.81 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  24027. 1782.81 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  24028. 1782.81 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24029. 1782.81 s [algebraic-graphs]
  24030. 1782.81 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24031. 1782.81 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24032. 1782.81 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24033. 1782.81 s [algebraic-graphs]
  24034. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  24035. 1782.81 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  24036. 1782.81 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24037. 1782.81 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  24038. 1782.81 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  24039. 1782.81 s [algebraic-graphs]
  24040. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  24041. 1782.81 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  24042. 1782.81 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24043. 1782.81 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  24044. 1782.81 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  24045. 1782.81 s [algebraic-graphs]
  24046. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  24047. 1782.81 s [algebraic-graphs] OK: complement empty == empty
  24048. 1782.81 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  24049. 1782.81 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  24050. 1782.81 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  24051. 1782.81 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  24052. 1782.81 s [algebraic-graphs] OK: complement . complement == id
  24053. 1782.81 s [algebraic-graphs]
  24054. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  24055. 1782.81 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24056. 1782.81 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24057. 1782.81 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24058. 1782.81 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24059. 1782.81 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24060. 1782.81 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24061. 1782.81 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24062. 1782.81 s [algebraic-graphs] OK: x <= x + y
  24063. 1782.81 s [algebraic-graphs] OK: x + y <= x * y
  24064. 1782.81 s [algebraic-graphs]
  24065. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  24066. 1782.81 s [algebraic-graphs] OK: isEmpty empty == True
  24067. 1782.81 s [algebraic-graphs] OK: hasVertex x empty == False
  24068. 1782.81 s [algebraic-graphs] OK: vertexCount empty == 0
  24069. 1782.81 s [algebraic-graphs] OK: edgeCount empty == 0
  24070. 1782.81 s [algebraic-graphs]
  24071. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  24072. 1782.81 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24073. 1782.81 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24074. 1782.81 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24075. 1782.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24076. 1782.81 s [algebraic-graphs]
  24077. 1782.81 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  24078. 1782.81 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24079. 1782.81 s [algebraic-graphs] OK: edge x y == edge y x
  24080. 1790.25 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24081. 1790.25 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24082. 1790.25 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24083. 1790.26 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24084. 1790.26 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24085. 1790.26 s [algebraic-graphs]
  24086. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  24087. 1790.26 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24088. 1790.26 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24089. 1790.26 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24090. 1790.26 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24091. 1790.26 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24092. 1790.26 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24093. 1790.26 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24094. 1790.26 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24095. 1790.26 s [algebraic-graphs]
  24096. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  24097. 1790.26 s [algebraic-graphs] OK: connect x y == connect y x
  24098. 1790.26 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24099. 1790.26 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24100. 1790.26 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24101. 1790.26 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24102. 1790.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24103. 1790.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24104. 1790.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24105. 1790.26 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24106. 1790.26 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24107. 1790.26 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24108. 1790.26 s [algebraic-graphs]
  24109. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  24110. 1790.26 s [algebraic-graphs] OK: vertices [] == empty
  24111. 1790.26 s [algebraic-graphs] OK: vertices [x] == vertex x
  24112. 1790.26 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24113. 1790.26 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24114. 1790.26 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24115. 1790.26 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24116. 1790.26 s [algebraic-graphs]
  24117. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  24118. 1790.26 s [algebraic-graphs] OK: edges [] == empty
  24119. 1790.26 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24120. 1790.26 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24121. 1790.26 s [algebraic-graphs]
  24122. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  24123. 1790.26 s [algebraic-graphs] OK: overlays [] == empty
  24124. 1790.26 s [algebraic-graphs] OK: overlays [x] == x
  24125. 1790.26 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24126. 1790.26 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24127. 1790.26 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24128. 1790.26 s [algebraic-graphs]
  24129. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  24130. 1790.26 s [algebraic-graphs] OK: connects [] == empty
  24131. 1790.26 s [algebraic-graphs] OK: connects [x] == x
  24132. 1790.26 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24133. 1790.26 s [algebraic-graphs] OK: connects == foldr connect empty
  24134. 1790.26 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24135. 1790.26 s [algebraic-graphs] OK: connects == connects . reverse
  24136. 1790.26 s [algebraic-graphs]
  24137. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  24138. 1790.26 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24139. 1790.26 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24140. 1790.26 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24141. 1790.26 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24142. 1790.26 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24143. 1790.26 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24144. 1790.26 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24145. 1790.26 s [algebraic-graphs]
  24146. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.path ============
  24147. 1790.26 s [algebraic-graphs] OK: path [] == empty
  24148. 1790.26 s [algebraic-graphs] OK: path [x] == vertex x
  24149. 1790.26 s [algebraic-graphs] OK: path [x,y] == edge x y
  24150. 1790.26 s [algebraic-graphs] OK: path == path . reverse
  24151. 1790.26 s [algebraic-graphs]
  24152. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  24153. 1790.26 s [algebraic-graphs] OK: circuit [] == empty
  24154. 1790.26 s [algebraic-graphs] OK: circuit [x] == edge x x
  24155. 1790.26 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24156. 1790.26 s [algebraic-graphs] OK: circuit == circuit . reverse
  24157. 1790.26 s [algebraic-graphs]
  24158. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  24159. 1790.26 s [algebraic-graphs] OK: clique [] == empty
  24160. 1790.26 s [algebraic-graphs] OK: clique [x] == vertex x
  24161. 1790.26 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24162. 1790.26 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24163. 1790.26 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24164. 1790.26 s [algebraic-graphs] OK: clique == clique . reverse
  24165. 1790.26 s [algebraic-graphs]
  24166. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  24167. 1790.26 s [algebraic-graphs] OK: biclique [] [] == empty
  24168. 1790.26 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24169. 1790.26 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24170. 1790.26 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24171. 1790.26 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24172. 1790.26 s [algebraic-graphs]
  24173. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.star ============
  24174. 1790.26 s [algebraic-graphs] OK: star x [] == vertex x
  24175. 1790.26 s [algebraic-graphs] OK: star x [y] == edge x y
  24176. 1790.26 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24177. 1790.26 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24178. 1790.26 s [algebraic-graphs]
  24179. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  24180. 1790.26 s [algebraic-graphs] OK: stars [] == empty
  24181. 1790.26 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24182. 1790.26 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24183. 1790.26 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24184. 1790.26 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24185. 1790.26 s [algebraic-graphs] OK: stars . adjacencyList == id
  24186. 1790.26 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24187. 1790.26 s [algebraic-graphs]
  24188. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  24189. 1790.26 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24190. 1790.26 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24191. 1790.26 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24192. 1790.26 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24193. 1790.26 s [algebraic-graphs]
  24194. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  24195. 1790.26 s [algebraic-graphs] OK: forest [] == empty
  24196. 1790.26 s [algebraic-graphs] OK: forest [x] == tree x
  24197. 1790.26 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24198. 1790.26 s [algebraic-graphs] OK: forest == overlays . map tree
  24199. 1790.26 s [algebraic-graphs]
  24200. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24201. 1790.26 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24202. 1790.26 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24203. 1790.26 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24204. 1790.26 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24205. 1790.26 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24206. 1790.26 s [algebraic-graphs]
  24207. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24208. 1790.26 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24209. 1790.26 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24210. 1790.26 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24211. 1790.26 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24212. 1790.26 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24213. 1790.26 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24214. 1790.26 s [algebraic-graphs]
  24215. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24216. 1790.26 s [algebraic-graphs] OK: replaceVertex x x == id
  24217. 1790.26 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24218. 1790.26 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24219. 1790.26 s [algebraic-graphs]
  24220. 1790.26 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24221. 1790.26 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24222. 1790.26 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24223. 1790.26 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24224. 1790.26 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24225. 1790.26 s [algebraic-graphs]
  24226. 1790.27 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24227. 1790.27 s [algebraic-graphs] OK: gmap f empty == empty
  24228. 1790.27 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24229. 1790.27 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24230. 1790.27 s [algebraic-graphs] OK: gmap id == id
  24231. 1790.27 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24232. 1790.27 s [algebraic-graphs]
  24233. 1790.27 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24234. 1790.27 s [algebraic-graphs] OK: induce (const True ) x == x
  24235. 1790.27 s [algebraic-graphs] OK: induce (const False) x == empty
  24236. 1790.27 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24237. 1790.27 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24238. 1790.27 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24239. 1790.27 s [algebraic-graphs]
  24240. 1790.27 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24241. 1790.27 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24242. 1790.27 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24243. 1790.27 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24244. 1790.27 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24245. 1790.27 s [algebraic-graphs] Test suite main: PASS
  24246. 1790.27 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24247. 1790.27 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24248. 1790.27 s [algebraic-graphs] checkPhase completed in 1 minutes 48 seconds
  24249. 1790.27 s [algebraic-graphs] Phase: haddockPhase
  24250. 1790.35 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  24251. 1790.35 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  24252. 1790.38 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  24253. 1790.48 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  24254. 1790.70 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  24255. 1790.74 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  24256. 1790.78 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  24257. 1790.81 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  24258. 1790.97 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  24259. 1791.00 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  24260. 1791.13 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  24261. 1791.19 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  24262. 1791.35 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  24263. 1791.39 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  24264. 1791.45 s [algebraic-graphs]
  24265. 1791.45 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  24266. 1791.45 s [algebraic-graphs] In the use of ‘head’
  24267. 1791.45 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24268. 1791.45 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24269. 1791.45 s [algebraic-graphs] |
  24270. 1791.45 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  24271. 1791.45 s [algebraic-graphs] | ^^^^
  24272. 1791.45 s [algebraic-graphs]
  24273. 1791.45 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  24274. 1791.45 s [algebraic-graphs] In the use of ‘tail’
  24275. 1791.45 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24276. 1791.45 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24277. 1791.45 s [algebraic-graphs] |
  24278. 1791.45 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  24279. 1791.45 s [algebraic-graphs] | ^^^^
  24280. 1791.45 s [algebraic-graphs]
  24281. 1791.45 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  24282. 1791.45 s [algebraic-graphs] In the use of ‘head’
  24283. 1791.45 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24284. 1791.45 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24285. 1791.45 s [algebraic-graphs] |
  24286. 1791.45 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  24287. 1791.45 s [algebraic-graphs] | ^^^^
  24288. 1791.45 s [algebraic-graphs]
  24289. 1791.46 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  24290. 1791.46 s [algebraic-graphs] In the use of ‘tail’
  24291. 1791.46 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24292. 1791.46 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 Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24293. 1791.46 s [algebraic-graphs] |
  24294. 1791.46 s [algebraic-graphs] 397 | bnd' = tail bnd
  24295. 1791.46 s [algebraic-graphs] | ^^^^
  24296. 1791.46 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  24297. 1791.48 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  24298. 1791.58 s [algebraic-graphs]
  24299. 1791.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24300. 1791.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24301. 1791.58 s [algebraic-graphs] will become an error in a future GHC release.
  24302. 1791.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24303. 1791.58 s [algebraic-graphs] |
  24304. 1791.58 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24305. 1791.58 s [algebraic-graphs] | ^
  24306. 1791.58 s [algebraic-graphs]
  24307. 1791.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24308. 1791.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24309. 1791.58 s [algebraic-graphs] will become an error in a future GHC release.
  24310. 1791.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24311. 1791.58 s [algebraic-graphs] |
  24312. 1791.58 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24313. 1791.58 s [algebraic-graphs] | ^
  24314. 1791.58 s [algebraic-graphs]
  24315. 1791.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24316. 1791.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24317. 1791.58 s [algebraic-graphs] will become an error in a future GHC release.
  24318. 1791.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24319. 1791.58 s [algebraic-graphs] |
  24320. 1791.58 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24321. 1791.59 s [algebraic-graphs] | ^
  24322. 1791.59 s [algebraic-graphs]
  24323. 1791.59 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24324. 1791.59 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24325. 1791.59 s [algebraic-graphs] will become an error in a future GHC release.
  24326. 1791.59 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24327. 1791.59 s [algebraic-graphs] |
  24328. 1791.59 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24329. 1791.59 s [algebraic-graphs] | ^
  24330. 1791.59 s [algebraic-graphs]
  24331. 1791.59 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24332. 1791.59 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24333. 1791.59 s [algebraic-graphs] will become an error in a future GHC release.
  24334. 1791.59 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24335. 1791.59 s [algebraic-graphs] |
  24336. 1791.59 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24337. 1791.59 s [algebraic-graphs] | ^
  24338. 1791.59 s [algebraic-graphs]
  24339. 1791.59 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24340. 1791.59 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24341. 1791.59 s [algebraic-graphs] will become an error in a future GHC release.
  24342. 1791.59 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24343. 1791.59 s [algebraic-graphs] |
  24344. 1791.59 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24345. 1791.59 s [algebraic-graphs] | ^
  24346. 1791.59 s [algebraic-graphs]
  24347. 1791.59 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24348. 1791.59 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24349. 1791.59 s [algebraic-graphs] will become an error in a future GHC release.
  24350. 1791.59 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24351. 1791.59 s [algebraic-graphs] |
  24352. 1791.59 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24353. 1791.59 s [algebraic-graphs] | ^
  24354. 1791.59 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  24355. 1791.65 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  24356. 1791.69 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  24357. 1791.77 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  24358. 1791.89 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  24359. 1791.96 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  24360. 1791.97 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  24361. 1791.98 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  24362. 1791.99 s [algebraic-graphs]
  24363. 1791.99 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24364. 1791.99 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24365. 1791.99 s [algebraic-graphs] will become an error in a future GHC release.
  24366. 1791.99 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24367. 1791.99 s [algebraic-graphs] |
  24368. 1791.99 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24369. 1791.99 s [algebraic-graphs] | ^
  24370. 1791.99 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  24371. 1792.05 s [algebraic-graphs]
  24372. 1792.05 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24373. 1792.05 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24374. 1792.05 s [algebraic-graphs] will become an error in a future GHC release.
  24375. 1792.05 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24376. 1792.05 s [algebraic-graphs] |
  24377. 1792.05 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24378. 1792.05 s [algebraic-graphs] | ^
  24379. 1792.05 s [algebraic-graphs]
  24380. 1792.05 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24381. 1792.05 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24382. 1792.05 s [algebraic-graphs] will become an error in a future GHC release.
  24383. 1792.05 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24384. 1792.05 s [algebraic-graphs] |
  24385. 1792.05 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24386. 1792.05 s [algebraic-graphs] | ^
  24387. 1792.05 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  24388. 1792.10 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  24389. 1792.13 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  24390. 1792.14 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  24391. 1792.15 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  24392. 1792.16 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  24393. 1792.17 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  24394. 1792.18 s [algebraic-graphs] Haddock coverage:
  24395. 1792.19 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24396. 1792.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24397. 1792.19 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24398. 1792.19 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24399. 1792.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24400. 1792.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24401. 1792.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24402. 1792.20 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24403. 1792.20 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24404. 1792.20 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24405. 1792.20 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  24406. 1792.20 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  24407. 1792.20 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24408. 1792.20 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24409. 1792.20 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24410. 1792.22 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24411. 1792.23 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24412. 1792.23 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24413. 1792.23 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24414. 1792.23 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24415. 1792.23 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24416. 1792.23 s [algebraic-graphs] Missing documentation for:
  24417. 1792.23 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24418. 1792.23 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  24419. 1792.23 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  24420. 1792.23 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  24421. 1792.23 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24422. 1792.23 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24423. 1792.23 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  24424. 1792.23 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24425. 1792.23 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24426. 1792.23 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24427. 1792.23 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24428. 1792.23 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  24429. 1792.23 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  24430. 1792.23 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24431. 1792.23 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24432. 1792.23 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  24433. 1792.24 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24434. 1792.24 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24435. 1792.24 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24436. 1792.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24437. 1792.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24438. 1792.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  24439. 1792.26 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24440. 1792.26 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24441. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24442. 1792.26 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24443. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24444. 1792.26 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24445. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24446. 1792.26 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24447. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24448. 1792.26 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24449. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24450. 1792.26 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24451. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24452. 1792.26 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24453. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24454. 1792.26 s [algebraic-graphs] Warning: 'box' is out of scope.
  24455. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24456. 1792.26 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24457. 1792.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24458. 1792.27 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24459. 1792.27 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24460. 1792.27 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24461. 1792.27 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24462. 1792.27 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24463. 1792.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24464. 1792.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24465. 1792.27 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24466. 1792.27 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24467. 1792.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24468. 1792.28 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  24469. 1792.28 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24470. 1792.28 s [algebraic-graphs] * in ‘Data.Tuple’
  24471. 1792.28 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24472. 1792.28 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24473. 1792.28 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24474. 1792.29 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24475. 1792.29 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24476. 1792.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24477. 1792.29 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  24478. 1792.29 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  24479. 1792.29 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24480. 1792.29 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24481. 1792.29 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24482. 1792.29 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24483. 1792.29 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24484. 1792.29 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24485. 1792.29 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24486. 1792.29 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24487. 1792.29 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24488. 1792.29 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24489. 1792.30 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24490. 1792.30 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  24491. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  24492. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  24493. 1792.30 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24494. 1792.30 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24495. 1792.30 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  24496. 1792.30 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  24497. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  24498. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  24499. 1792.30 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24500. 1792.30 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24501. 1792.30 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  24502. 1792.30 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  24503. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  24504. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  24505. 1792.30 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24506. 1792.30 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24507. 1792.30 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  24508. 1792.30 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  24509. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  24510. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  24511. 1792.30 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24512. 1792.30 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24513. 1792.30 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  24514. 1792.30 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  24515. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  24516. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  24517. 1792.30 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24518. 1792.30 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24519. 1792.30 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  24520. 1792.30 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24521. 1792.30 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  24522. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  24523. 1792.30 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24524. 1792.30 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24525. 1792.31 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24526. 1792.31 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24527. 1792.31 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24528. 1792.31 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24529. 1792.31 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24530. 1792.31 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24531. 1792.31 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24532. 1792.31 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24533. 1792.31 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24534. 1792.31 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24535. 1792.31 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24536. 1792.31 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24537. 1792.32 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24538. 1792.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24539. 1792.32 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24540. 1792.32 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24541. 1792.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24542. 1792.32 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24543. 1792.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24544. 1792.32 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24545. 1792.32 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24546. 1792.32 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24547. 1792.32 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24548. 1792.32 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24549. 1792.32 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24550. 1792.32 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24551. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  24552. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24553. 1792.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24554. 1792.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24555. 1792.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24556. 1792.33 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24557. 1792.33 s [algebraic-graphs] Missing documentation for:
  24558. 1792.33 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24559. 1792.33 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24560. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24561. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24562. 1792.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24563. 1792.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24564. 1792.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24565. 1792.33 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24566. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  24567. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24568. 1792.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24569. 1792.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24570. 1792.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24571. 1792.33 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24572. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  24573. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24574. 1792.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24575. 1792.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24576. 1792.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24577. 1792.33 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24578. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  24579. 1792.33 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24580. 1792.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24581. 1792.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24582. 1792.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24583. 1792.34 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24584. 1792.34 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  24585. 1792.34 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24586. 1792.34 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24587. 1792.34 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24588. 1792.34 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24589. 1792.34 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24590. 1792.34 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  24591. 1792.34 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  24592. 1792.34 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  24593. 1792.34 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24594. 1792.34 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24595. 1792.34 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  24596. 1792.35 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24597. 1792.35 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  24598. 1792.35 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  24599. 1792.35 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  24600. 1792.35 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24601. 1792.35 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24602. 1792.35 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  24603. 1792.35 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24604. 1792.35 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24605. 1792.35 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24606. 1792.35 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24607. 1792.35 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24608. 1792.35 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24609. 1792.36 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24610. 1792.36 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24611. 1792.42 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24612. 1792.42 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24613. 1792.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  24614. 1792.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24615. 1792.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24616. 1792.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24617. 1792.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24618. 1792.42 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24619. 1792.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  24620. 1792.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24621. 1792.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24622. 1792.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24623. 1792.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24624. 1792.42 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24625. 1792.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24626. 1792.42 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24627. 1792.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24628. 1792.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24629. 1792.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24630. 1792.43 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24631. 1792.44 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24632. 1792.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24633. 1792.45 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24634. 1792.45 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24635. 1792.45 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24636. 1792.45 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24637. 1792.45 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24638. 1792.45 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24639. 1792.45 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24640. 1792.46 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  24641. 1792.46 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  24642. 1792.46 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24643. 1792.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24644. 1792.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24645. 1792.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24646. 1792.46 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24647. 1792.46 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24648. 1792.46 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  24649. 1792.46 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  24650. 1792.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24651. 1792.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24652. 1792.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  24653. 1792.46 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24654. 1792.46 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  24655. 1792.46 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24656. 1792.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24657. 1792.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24658. 1792.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  24659. 1792.48 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  24660. 1792.48 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  24661. 1792.48 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  24662. 1792.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24663. 1792.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24664. 1792.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  24665. 1792.48 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24666. 1792.48 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24667. 1792.48 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24668. 1792.48 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  24669. 1792.48 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  24670. 1792.48 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  24671. 1792.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24672. 1792.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24673. 1792.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  24674. 1792.48 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24675. 1792.48 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  24676. 1792.48 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  24677. 1792.48 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  24678. 1792.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24679. 1792.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24680. 1792.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  24681. 1792.49 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24682. 1792.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24683. 1792.49 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24684. 1792.50 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24685. 1792.50 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24686. 1792.50 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24687. 1792.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24688. 1792.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24689. 1792.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24690. 1792.50 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24691. 1792.51 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24692. 1792.51 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  24693. 1792.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  24694. 1792.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24695. 1792.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24696. 1792.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24697. 1792.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24698. 1792.51 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24699. 1792.51 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24700. 1792.51 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24701. 1792.51 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  24702. 1792.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  24703. 1792.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24704. 1792.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24705. 1792.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24706. 1792.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24707. 1792.51 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24708. 1792.51 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24709. 1792.51 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24710. 1792.51 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  24711. 1792.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  24712. 1792.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24713. 1792.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24714. 1792.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24715. 1792.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24716. 1792.51 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24717. 1792.51 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24718. 1792.51 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24719. 1792.51 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24720. 1792.51 s [algebraic-graphs] Missing documentation for:
  24721. 1792.51 s [algebraic-graphs] Module header
  24722. 1792.51 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24723. 1792.51 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  24724. 1792.51 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  24725. 1792.51 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  24726. 1792.51 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  24727. 1792.51 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  24728. 1792.51 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  24729. 1792.51 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  24730. 1792.51 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  24731. 1792.51 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  24732. 1792.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24733. 1792.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24734. 1792.51 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  24735. 1792.51 s [algebraic-graphs] Warning: 'array' is out of scope.
  24736. 1792.51 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24737. 1792.52 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24738. 1792.52 s [algebraic-graphs] Missing documentation for:
  24739. 1792.52 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  24740. 1792.66 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  24741. 1792.66 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  24742. 1792.66 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24743. 1792.66 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24744. 1792.67 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  24745. 1792.67 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  24746. 1792.67 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24747. 1792.67 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24748. 1792.67 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  24749. 1792.67 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  24750. 1792.67 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  24751. 1792.67 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  24752. 1792.67 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24753. 1792.67 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24754. 1792.81 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  24755. 1792.81 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  24756. 1792.81 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  24757. 1792.81 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  24758. 1792.81 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  24759. 1792.81 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  24760. 1792.81 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  24761. 1792.81 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  24762. 1792.81 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  24763. 1792.82 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  24764. 1792.82 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  24765. 1792.82 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24766. 1792.82 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  24767. 1792.82 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24768. 1792.82 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24769. 1792.82 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24770. 1792.82 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24771. 1792.82 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24772. 1792.82 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24773. 1792.82 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24774. 1792.82 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24775. 1792.82 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24776. 1792.83 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  24777. 1792.83 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24778. 1792.83 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24779. 1792.83 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  24780. 1792.83 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24781. 1792.83 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24782. 1792.83 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  24783. 1792.83 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24784. 1792.84 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  24785. 1792.84 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24786. 1792.84 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  24787. 1792.84 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24788. 1792.84 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24789. 1792.84 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24790. 1792.84 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  24791. 1792.84 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24792. 1792.85 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  24793. 1792.85 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  24794. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24795. 1792.85 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  24796. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  24797. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  24798. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  24799. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  24800. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  24801. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24802. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24803. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24804. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24805. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24806. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24807. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24808. 1792.85 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24809. 1792.85 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24810. 1792.85 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24811. 1792.85 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24812. 1792.85 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24813. 1792.85 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  24814. 1792.85 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24815. 1792.85 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  24816. 1792.85 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24817. 1792.85 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  24818. 1792.85 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24819. 1792.85 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  24820. 1792.85 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24821. 1795.78 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  24822. 1795.88 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24823. 1795.88 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24824. 1795.88 s [algebraic-graphs] Phase: installPhase
  24825. 1795.89 s [algebraic-graphs] Installing library in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc
  24826. 1796.44 s [algebraic-graphs] Phase: fixupPhase
  24827. 1796.46 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
  24828. 1796.47 s [algebraic-graphs] shrinking /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSalgebraic-graphs-0.7-3ndkMdwguZ5Lho5tSSwXpc-ghc9.8.4.so
  24829. 1796.48 s [algebraic-graphs] checking for references to /build/ in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7...
  24830. 1796.51 s [algebraic-graphs] patching script interpreter paths in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7
  24831. 1796.52 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/lib
  24832. 1796.75 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
  24833. 1796.77 s [algebraic-graphs] checking for references to /build/ in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc...
  24834. 1796.80 s [algebraic-graphs] patching script interpreter paths in /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
  24835. 1796.95 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
  24836. 1797.29 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  24837. 1797.30 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7 /nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc
  24838. 1797.34 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24839. 1797.35 s [algebraic-graphs:post-build] copying 2 paths...
  24840. 1797.35 s [algebraic-graphs:post-build] copying path '/nix/store/n01rzn4h2fyfhi59xs0i56qikkd9w1ns-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24841. 1798.51 s [algebraic-graphs:post-build] copying path '/nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24842. 1803.48 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24843. 1803.54 s [algebraic-graphs:post-build] copying 0 paths...
  24844. 1803.56 s Progress: 34 of 38 built, 559 of 559 downloaded from cache
  24845. 1803.61 s Building /nix/store/w9blpl2j2z1mg64k6daxymyd52b744r1-ghc-9.8.4-with-packages.drv
  24846. 1803.66 s [ghc-9.8.4-with-packages] /nix/store/2klaxh0nypzbiz11icjn7a3gr0w50dfp-doctest-0.24.2/nix-support:
  24847. 1803.66 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24848. 1803.66 s [ghc-9.8.4-with-packages] /nix/store/wjan1s58nap9s2y9c6r89bgjgnncm53g-ghc-compat-plugin-0.1.0.1/nix-support:
  24849. 1803.66 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24850. 1803.67 s [ghc-9.8.4-with-packages] /nix/store/yjaggp1g4sqis3107rgrlgkvfj8vlxpb-hedgehog-1.5/nix-support:
  24851. 1803.67 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24852. 1803.69 s [ghc-9.8.4-with-packages] /nix/store/c23g9fxnkkkmdpb5395r4vf5migp8afg-Cabal-3.12.1.0/nix-support:
  24853. 1803.69 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24854. 1803.71 s [ghc-9.8.4-with-packages] /nix/store/2y5q3na3kzygn18zww6mj42gavla7yl6-cabal-doctest-1.0.12/nix-support:
  24855. 1803.71 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24856. 1803.72 s [ghc-9.8.4-with-packages] /nix/store/nvg0b7lllw0n51565aqx91sdpa62c52g-temporary-1.3/nix-support:
  24857. 1803.72 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24858. 1803.72 s [ghc-9.8.4-with-packages] /nix/store/nvg0b7lllw0n51565aqx91sdpa62c52g-temporary-1.3/nix-support:
  24859. 1803.72 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24860. 1803.72 s [ghc-9.8.4-with-packages] /nix/store/z47anpqicydbbjxi2xwvahq4m83j7zm0-ansi-terminal-1.1.3/nix-support:
  24861. 1803.72 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24862. 1803.72 s [ghc-9.8.4-with-packages] /nix/store/z47anpqicydbbjxi2xwvahq4m83j7zm0-ansi-terminal-1.1.3/nix-support:
  24863. 1803.72 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24864. 1803.73 s [ghc-9.8.4-with-packages] /nix/store/v1bbgll4iw7q1d2b3hkllfblph1gfkfi-async-2.2.5/nix-support:
  24865. 1803.73 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24866. 1803.73 s [ghc-9.8.4-with-packages] /nix/store/v1bbgll4iw7q1d2b3hkllfblph1gfkfi-async-2.2.5/nix-support:
  24867. 1803.73 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24868. 1803.73 s [ghc-9.8.4-with-packages] /nix/store/0ry8i8l979dmlrvb7zj8fgpgddzlcsgx-barbies-2.1.1.0/nix-support:
  24869. 1803.73 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24870. 1803.73 s [ghc-9.8.4-with-packages] /nix/store/0ry8i8l979dmlrvb7zj8fgpgddzlcsgx-barbies-2.1.1.0/nix-support:
  24871. 1803.73 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24872. 1803.74 s [ghc-9.8.4-with-packages] /nix/store/cmcnavxnxs21nl079ihfcz9r8bikc3si-concurrent-output-1.10.21/nix-support:
  24873. 1803.74 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24874. 1803.74 s [ghc-9.8.4-with-packages] /nix/store/cmcnavxnxs21nl079ihfcz9r8bikc3si-concurrent-output-1.10.21/nix-support:
  24875. 1803.74 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24876. 1803.74 s [ghc-9.8.4-with-packages] /nix/store/635raa5l4zzmrxz67jnyzn2ayf0wrn7q-lifted-async-0.10.2.7/nix-support:
  24877. 1803.74 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24878. 1803.74 s [ghc-9.8.4-with-packages] /nix/store/635raa5l4zzmrxz67jnyzn2ayf0wrn7q-lifted-async-0.10.2.7/nix-support:
  24879. 1803.74 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24880. 1803.74 s [ghc-9.8.4-with-packages] /nix/store/n5sx1iv4pjywxqyhb6644x8lz4i9lba5-mmorph-1.2.1/nix-support:
  24881. 1803.74 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24882. 1803.75 s [ghc-9.8.4-with-packages] /nix/store/n5sx1iv4pjywxqyhb6644x8lz4i9lba5-mmorph-1.2.1/nix-support:
  24883. 1803.75 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24884. 1803.75 s [ghc-9.8.4-with-packages] /nix/store/g1xwfxzw06xcwk0md2c3dsmbjh53pvfw-monad-control-1.0.3.1/nix-support:
  24885. 1803.75 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24886. 1803.75 s [ghc-9.8.4-with-packages] /nix/store/g1xwfxzw06xcwk0md2c3dsmbjh53pvfw-monad-control-1.0.3.1/nix-support:
  24887. 1803.75 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24888. 1803.75 s [ghc-9.8.4-with-packages] /nix/store/gjn5g66y2finjvl6qxpygkl4nikgy9sh-pretty-show-1.10/nix-support:
  24889. 1803.75 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24890. 1803.75 s [ghc-9.8.4-with-packages] /nix/store/gjn5g66y2finjvl6qxpygkl4nikgy9sh-pretty-show-1.10/nix-support:
  24891. 1803.75 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24892. 1803.75 s [ghc-9.8.4-with-packages] /nix/store/47s8r3aghzw86sw2w05qrmks9xfm9i9q-primitive-0.9.1.0/nix-support:
  24893. 1803.76 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24894. 1803.76 s [ghc-9.8.4-with-packages] /nix/store/47s8r3aghzw86sw2w05qrmks9xfm9i9q-primitive-0.9.1.0/nix-support:
  24895. 1803.76 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24896. 1803.76 s [ghc-9.8.4-with-packages] /nix/store/s79715agzkq8mhyr9fsm43h7z7ac2l04-random-1.2.1.3/nix-support:
  24897. 1803.76 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24898. 1803.76 s [ghc-9.8.4-with-packages] /nix/store/s79715agzkq8mhyr9fsm43h7z7ac2l04-random-1.2.1.3/nix-support:
  24899. 1803.76 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24900. 1803.76 s [ghc-9.8.4-with-packages] /nix/store/6wqs30zg2ypzn15z1acpafc8zwxkj6wb-resourcet-1.3.0/nix-support:
  24901. 1803.76 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24902. 1803.76 s [ghc-9.8.4-with-packages] /nix/store/6wqs30zg2ypzn15z1acpafc8zwxkj6wb-resourcet-1.3.0/nix-support:
  24903. 1803.76 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24904. 1803.76 s [ghc-9.8.4-with-packages] /nix/store/11g1dmdb7lifr29wl0i3h589jn673iy7-safe-exceptions-0.1.7.4/nix-support:
  24905. 1803.76 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24906. 1803.77 s [ghc-9.8.4-with-packages] /nix/store/11g1dmdb7lifr29wl0i3h589jn673iy7-safe-exceptions-0.1.7.4/nix-support:
  24907. 1803.77 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24908. 1803.77 s [ghc-9.8.4-with-packages] /nix/store/f29lcbw106v0cnnl6nz59mwznp2qs70z-transformers-base-0.4.6/nix-support:
  24909. 1803.77 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24910. 1803.77 s [ghc-9.8.4-with-packages] /nix/store/f29lcbw106v0cnnl6nz59mwznp2qs70z-transformers-base-0.4.6/nix-support:
  24911. 1803.77 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24912. 1803.77 s [ghc-9.8.4-with-packages] /nix/store/ni07y6jsg1apn0srs3jsy6vdbgr9winx-wl-pprint-annotated-0.1.0.1/nix-support:
  24913. 1803.77 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24914. 1803.77 s [ghc-9.8.4-with-packages] /nix/store/ni07y6jsg1apn0srs3jsy6vdbgr9winx-wl-pprint-annotated-0.1.0.1/nix-support:
  24915. 1803.77 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24916. 1803.79 s [ghc-9.8.4-with-packages] /nix/store/rfmdrav11ynn3sfmv1cci9rwnch8x7ip-Cabal-syntax-3.12.1.0/nix-support:
  24917. 1803.79 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24918. 1803.80 s [ghc-9.8.4-with-packages] /nix/store/rfmdrav11ynn3sfmv1cci9rwnch8x7ip-Cabal-syntax-3.12.1.0/nix-support:
  24919. 1803.80 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24920. 1803.80 s [ghc-9.8.4-with-packages] /nix/store/005hdm8qnhj4zl0q8788fllgfg6z3fjx-ansi-terminal-types-1.1.3/nix-support:
  24921. 1803.80 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24922. 1803.80 s [ghc-9.8.4-with-packages] /nix/store/005hdm8qnhj4zl0q8788fllgfg6z3fjx-ansi-terminal-types-1.1.3/nix-support:
  24923. 1803.80 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24924. 1803.81 s [ghc-9.8.4-with-packages] /nix/store/zvhln8s72qwgz4ckrzn2d8cip2j33g64-hashable-1.5.0.0/nix-support:
  24925. 1803.81 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24926. 1803.81 s [ghc-9.8.4-with-packages] /nix/store/zvhln8s72qwgz4ckrzn2d8cip2j33g64-hashable-1.5.0.0/nix-support:
  24927. 1803.81 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24928. 1803.81 s [ghc-9.8.4-with-packages] /nix/store/qhd0bphgldgkc8ir7ph2q4a66daa2kz5-distributive-0.6.2.1/nix-support:
  24929. 1803.81 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24930. 1803.81 s [ghc-9.8.4-with-packages] /nix/store/qhd0bphgldgkc8ir7ph2q4a66daa2kz5-distributive-0.6.2.1/nix-support:
  24931. 1803.81 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24932. 1803.81 s [ghc-9.8.4-with-packages] /nix/store/pcgwgbz3q9h42kdk0fzfcv894hi3jywp-constraints-0.14.2/nix-support:
  24933. 1803.81 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24934. 1803.82 s [ghc-9.8.4-with-packages] /nix/store/pcgwgbz3q9h42kdk0fzfcv894hi3jywp-constraints-0.14.2/nix-support:
  24935. 1803.82 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24936. 1803.82 s [ghc-9.8.4-with-packages] /nix/store/3m25xgvipja12agpxz4qz1m0fx80bh7d-lifted-base-0.2.3.12/nix-support:
  24937. 1803.82 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24938. 1803.82 s [ghc-9.8.4-with-packages] /nix/store/3m25xgvipja12agpxz4qz1m0fx80bh7d-lifted-base-0.2.3.12/nix-support:
  24939. 1803.82 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24940. 1803.82 s [ghc-9.8.4-with-packages] /nix/store/5rcyrxlp2jfnq536ly1kpk4agsijcxs3-transformers-compat-0.7.2/nix-support:
  24941. 1803.82 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24942. 1803.82 s [ghc-9.8.4-with-packages] /nix/store/5rcyrxlp2jfnq536ly1kpk4agsijcxs3-transformers-compat-0.7.2/nix-support:
  24943. 1803.82 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24944. 1803.83 s [ghc-9.8.4-with-packages] /nix/store/26jd7x2cwjr44xxw327qly5px101qvj7-splitmix-0.1.3.1/nix-support:
  24945. 1803.83 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24946. 1803.83 s [ghc-9.8.4-with-packages] /nix/store/26jd7x2cwjr44xxw327qly5px101qvj7-splitmix-0.1.3.1/nix-support:
  24947. 1803.83 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24948. 1803.83 s [ghc-9.8.4-with-packages] /nix/store/idxrblvqkyslgimxh040iyd3rn2jbm6f-unliftio-core-0.2.1.0/nix-support:
  24949. 1803.83 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24950. 1803.83 s [ghc-9.8.4-with-packages] /nix/store/idxrblvqkyslgimxh040iyd3rn2jbm6f-unliftio-core-0.2.1.0/nix-support:
  24951. 1803.83 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24952. 1803.84 s [ghc-9.8.4-with-packages] /nix/store/xv8k031kh4n0bpk2zy81a5gwvgkkbyjf-base-orphans-0.9.3/nix-support:
  24953. 1803.84 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24954. 1803.84 s [ghc-9.8.4-with-packages] /nix/store/xv8k031kh4n0bpk2zy81a5gwvgkkbyjf-base-orphans-0.9.3/nix-support:
  24955. 1803.84 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24956. 1803.84 s [ghc-9.8.4-with-packages] /nix/store/f2r5j3mrypcxprcl8sx1p1bn964pbih9-os-string-2.0.8/nix-support:
  24957. 1803.84 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24958. 1803.84 s [ghc-9.8.4-with-packages] /nix/store/f2r5j3mrypcxprcl8sx1p1bn964pbih9-os-string-2.0.8/nix-support:
  24959. 1803.84 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24960. 1803.84 s [ghc-9.8.4-with-packages] /nix/store/6q8zi610nrws76v0aamfj2xn4f8v6rab-tagged-0.8.9/nix-support:
  24961. 1803.84 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24962. 1803.84 s [ghc-9.8.4-with-packages] /nix/store/6q8zi610nrws76v0aamfj2xn4f8v6rab-tagged-0.8.9/nix-support:
  24963. 1803.84 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24964. 1803.85 s [ghc-9.8.4-with-packages] /nix/store/415gs6mywspvfwwbwry2pq01k6a9dghd-boring-0.2.2/nix-support:
  24965. 1803.85 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24966. 1803.85 s [ghc-9.8.4-with-packages] /nix/store/415gs6mywspvfwwbwry2pq01k6a9dghd-boring-0.2.2/nix-support:
  24967. 1803.85 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/ffd0dh24zc3kmkqmdlc3sqfpik5nmqlx-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24968. 1804.43 s [ghc-9.8.4-with-packages] Warning: include-dirs: /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages/lib/ghc-9.8.4/lib/../lib/x86_64-linux-ghc-9.8.4/directory-1.3.8.5-d63d/include doesn't exist or isn't a directory
  24969. 1805.53 s [ghc-9.8.4-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages
  24970. 1805.93 s [ghc-9.8.4-with-packages:post-build] Pushing 1 paths (154 are already present) using zstd to cache sellout ⏳
  24971. 1805.93 s [ghc-9.8.4-with-packages:post-build]
  24972. 1806.27 s [ghc-9.8.4-with-packages:post-build] Pushing /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages (4.98 MiB)
  24973. 1808.15 s [ghc-9.8.4-with-packages:post-build]
  24974. 1808.15 s [ghc-9.8.4-with-packages:post-build] All done.
  24975. 1808.17 s [ghc-9.8.4-with-packages:post-build] Uploading to the NixCI cache: /nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages
  24976. 1808.21 s [ghc-9.8.4-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24977. 1808.35 s [ghc-9.8.4-with-packages:post-build] copying 1 paths...
  24978. 1808.35 s [ghc-9.8.4-with-packages:post-build] copying path '/nix/store/7c2qyd1wylw3xzfsdv9cz9704bk0l2xi-ghc-9.8.4-with-packages' to 'https://cache.nix-ci.com'...
  24979. 1809.37 s [ghc-9.8.4-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24980. 1809.58 s [ghc-9.8.4-with-packages:post-build] copying 1 paths...
  24981. 1809.58 s [ghc-9.8.4-with-packages:post-build] copying path '/nix/store/w9blpl2j2z1mg64k6daxymyd52b744r1-ghc-9.8.4-with-packages.drv' to 'https://cache.nix-ci.com'...
  24982. 1809.76 s Progress: 35 of 37 built, 559 of 559 downloaded from cache
  24983. 1809.82 s Building /nix/store/xqwrq2d439jy2k1r352psdr2bzjpyr2v-ghc-shell-for-packages-0.drv
  24984. 1809.92 s [ghc-shell-for-packages:post-build] Uploading to cachix cache "sellout": /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0
  24985. 1810.35 s [ghc-shell-for-packages:post-build] Pushing 1 paths (337 are already present) using zstd to cache sellout ⏳
  24986. 1810.35 s [ghc-shell-for-packages:post-build]
  24987. 1810.76 s [ghc-shell-for-packages:post-build] Pushing /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0 (256.00 B)
  24988. 1811.67 s [ghc-shell-for-packages:post-build]
  24989. 1811.67 s [ghc-shell-for-packages:post-build] All done.
  24990. 1811.68 s [ghc-shell-for-packages:post-build] Uploading to the NixCI cache: /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0
  24991. 1811.72 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1811.75 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24993. 1811.75 s [ghc-shell-for-packages:post-build] copying path '/nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  24994. 1811.99 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1812.29 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24996. 1812.29 s [ghc-shell-for-packages:post-build] copying path '/nix/store/xqwrq2d439jy2k1r352psdr2bzjpyr2v-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  24997. 1812.43 s Progress: 36 of 37 built, 559 of 559 downloaded from cache
  24998. 1812.43 s Progress: 37 of 37 built, 559 of 559 downloaded from cache
  24999. 1812.44 s /nix/store/an0y5cqcqjvnc5fnz1pxw68bq55m688i-ghc-shell-for-packages-0
  25000. 1812.50 s Build succeeded.