1. 853.45 s [vector] mut_modify: OK
  2. 853.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3. 853.45 s [vector] mut_generate: OK
  4. 853.45 s [vector] +++ OK, passed 100 tests.
  5. 853.45 s [vector] mut_generateM: OK (0.01s)
  6. 853.45 s [vector] +++ OK, passed 100 tests.
  7. 853.45 s [vector] mut_mapM_: OK (0.02s)
  8. 853.45 s [vector] +++ OK, passed 100 tests.
  9. 853.45 s [vector] mut_imapM_: OK (0.02s)
  10. 853.45 s [vector] +++ OK, passed 100 tests.
  11. 853.45 s [vector] mut_forM_: OK (0.02s)
  12. 853.45 s [vector] +++ OK, passed 100 tests.
  13. 853.45 s [vector] mut_iforM_: OK (0.02s)
  14. 853.45 s [vector] +++ OK, passed 100 tests.
  15. 853.45 s [vector] mut_foldr: OK
  16. 853.45 s [vector] +++ OK, passed 100 tests.
  17. 853.45 s [vector] mut_foldr': OK
  18. 853.45 s [vector] +++ OK, passed 100 tests.
  19. 853.45 s [vector] mut_foldl: OK
  20. 853.45 s [vector] +++ OK, passed 100 tests.
  21. 853.45 s [vector] mut_foldl': OK
  22. 853.45 s [vector] +++ OK, passed 100 tests.
  23. 853.45 s [vector] mut_ifoldr: OK
  24. 853.45 s [vector] +++ OK, passed 100 tests.
  25. 853.45 s [vector] mut_ifoldr': OK
  26. 853.45 s [vector] +++ OK, passed 100 tests.
  27. 853.45 s [vector] mut_ifoldl: OK
  28. 853.45 s [vector] +++ OK, passed 100 tests.
  29. 853.45 s [vector] mut_ifoldl': OK
  30. 853.45 s [vector] +++ OK, passed 100 tests.
  31. 853.45 s [vector] mut_foldM: OK
  32. 853.45 s [vector] +++ OK, passed 100 tests.
  33. 853.45 s [vector] mut_foldM': OK
  34. 853.45 s [vector] +++ OK, passed 100 tests.
  35. 853.45 s [vector] mut_foldrM: OK
  36. 853.45 s [vector] +++ OK, passed 100 tests.
  37. 853.45 s [vector] mut_foldrM': OK
  38. 853.45 s [vector] +++ OK, passed 100 tests.
  39. 853.45 s [vector] mut_ifoldM: OK
  40. 853.45 s [vector] +++ OK, passed 100 tests.
  41. 853.45 s [vector] mut_ifoldM': OK
  42. 853.45 s [vector] +++ OK, passed 100 tests.
  43. 853.45 s [vector] mut_ifoldrM: OK
  44. 853.45 s [vector] +++ OK, passed 100 tests.
  45. 853.45 s [vector] mut_ifoldrM': OK
  46. 853.45 s [vector] +++ OK, passed 100 tests.
  47. 853.45 s [vector] compare: OK
  48. 853.45 s [vector] +++ OK, passed 100 tests.
  49. 853.45 s [vector] maximum: OK
  50. 853.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  51. 853.45 s [vector] minimum: OK
  52. 853.45 s [vector] +++ OK, passed 100 tests; 22 discarded.
  53. 853.45 s [vector] minIndex: OK
  54. 853.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  55. 853.45 s [vector] maxIndex: OK
  56. 853.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  57. 853.45 s [vector] maximumBy: OK
  58. 853.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  59. 853.45 s [vector] minimumBy: OK
  60. 853.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  61. 853.45 s [vector] maximumOn: OK
  62. 853.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  63. 853.45 s [vector] minimumOn: OK
  64. 853.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  65. 853.45 s [vector] maxIndexBy: OK
  66. 853.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  67. 853.45 s [vector] minIndexBy: OK
  68. 853.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  69. 853.45 s [vector] ListFirstMaxIndexWins: OK
  70. 853.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  71. 853.45 s [vector] FalseListFirstMaxIndexWins: OK
  72. 853.45 s [vector] +++ OK, failed as expected. (after 1 test):
  73. 853.45 s [vector] Exception:
  74. 853.45 s [vector] Prelude.foldr1: empty list
  75. 853.45 s [vector] CallStack (from HasCallStack):
  76. 853.45 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  77. 853.45 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  78. 853.45 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  79. 853.45 s [vector] []
  80. 853.45 s [vector] zip: OK
  81. 853.45 s [vector] +++ OK, passed 100 tests.
  82. 853.45 s [vector] zip3: OK
  83. 853.45 s [vector] +++ OK, passed 100 tests.
  84. 853.45 s [vector] unzip: OK
  85. 853.45 s [vector] +++ OK, passed 100 tests.
  86. 853.45 s [vector] unzip3: OK
  87. 853.45 s [vector] +++ OK, passed 100 tests.
  88. 853.45 s [vector] indexed: OK
  89. 853.45 s [vector] +++ OK, passed 100 tests.
  90. 853.45 s [vector] update: OK
  91. 853.45 s [vector] +++ OK, passed 100 tests.
  92. 853.45 s [vector] concat: OK (0.01s)
  93. 853.45 s [vector] +++ OK, passed 100 tests.
  94. 853.45 s [vector] mempty: OK
  95. 853.45 s [vector] +++ OK, passed 1 test.
  96. 853.45 s [vector] mappend: OK
  97. 853.45 s [vector] +++ OK, passed 100 tests.
  98. 853.45 s [vector] mconcat: OK (0.01s)
  99. 853.45 s [vector] +++ OK, passed 100 tests.
  100. 853.45 s [vector] fmap: OK
  101. 853.45 s [vector] +++ OK, passed 100 tests.
  102. 853.45 s [vector] return: OK
  103. 853.45 s [vector] +++ OK, passed 100 tests.
  104. 853.45 s [vector] bind: OK (0.02s)
  105. 853.45 s [vector] +++ OK, passed 100 tests.
  106. 853.45 s [vector] mzip: OK
  107. 853.45 s [vector] +++ OK, passed 100 tests.
  108. 853.45 s [vector] munzip: OK
  109. 853.45 s [vector] +++ OK, passed 100 tests.
  110. 853.45 s [vector] applicative_pure: OK
  111. 853.45 s [vector] +++ OK, passed 100 tests.
  112. 853.45 s [vector] applicative_appl: OK (0.04s)
  113. 853.45 s [vector] +++ OK, passed 100 tests.
  114. 853.45 s [vector] alternative_empty: OK
  115. 853.45 s [vector] +++ OK, passed 1 test.
  116. 853.45 s [vector] alternative_or: OK
  117. 853.45 s [vector] +++ OK, passed 100 tests.
  118. 853.45 s [vector] sequence: OK (0.05s)
  119. 853.45 s [vector] +++ OK, passed 100 tests.
  120. 853.45 s [vector] sequence_: OK (0.01s)
  121. 853.45 s [vector] +++ OK, passed 100 tests.
  122. 853.45 s [vector] glength: OK
  123. 853.45 s [vector] +++ OK, passed 100 tests.
  124. 853.45 s [vector] sum: OK
  125. 853.45 s [vector] +++ OK, passed 100 tests.
  126. 853.45 s [vector] product: OK
  127. 853.45 s [vector] +++ OK, passed 100 tests.
  128. 853.45 s [vector] enumFromN: OK
  129. 853.45 s [vector] +++ OK, passed 100 tests.
  130. 853.45 s [vector] enumFromThenN: OK
  131. 853.45 s [vector] +++ OK, passed 100 tests.
  132. 853.45 s [vector] enumFromTo: OK
  133. 853.45 s [vector] +++ OK, passed 100 tests.
  134. 853.45 s [vector] enumFromThenTo: OK
  135. 853.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  136. 853.45 s [vector] unstream
  137. 853.45 s [vector] unstream == vunstream (exact): OK
  138. 853.45 s [vector] +++ OK, passed 100 tests.
  139. 853.45 s [vector] unstream == vunstream (unknown): OK
  140. 853.45 s [vector] +++ OK, passed 100 tests.
  141. 853.45 s [vector] unstreamR ~= vunstream (exact): OK
  142. 853.45 s [vector] +++ OK, passed 100 tests.
  143. 853.45 s [vector] unstreamR ~= vunstream (unknown): OK
  144. 853.45 s [vector] +++ OK, passed 100 tests.
  145. 853.45 s [vector] Tests.Vector.Primitive
  146. 853.45 s [vector] Int
  147. 853.45 s [vector] fromList.toList == id: OK
  148. 853.45 s [vector] +++ OK, passed 100 tests.
  149. 853.45 s [vector] toList.fromList == id: OK
  150. 853.45 s [vector] +++ OK, passed 100 tests.
  151. 853.45 s [vector] unstream.stream == id: OK
  152. 853.45 s [vector] +++ OK, passed 100 tests.
  153. 853.45 s [vector] stream.unstream == id: OK
  154. 853.45 s [vector] +++ OK, passed 100 tests.
  155. 853.45 s [vector] eq: OK
  156. 853.45 s [vector] +++ OK, passed 100 tests.
  157. 853.45 s [vector] length: OK
  158. 853.45 s [vector] +++ OK, passed 100 tests.
  159. 853.45 s [vector] null: OK
  160. 853.45 s [vector] +++ OK, passed 100 tests.
  161. 853.45 s [vector] index: OK
  162. 853.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  163. 853.45 s [vector] safeIndex: OK
  164. 853.45 s [vector] +++ OK, passed 100 tests.
  165. 853.45 s [vector] head: OK
  166. 853.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  167. 853.45 s [vector] last: OK
  168. 853.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  169. 853.45 s [vector] unsafeIndex: OK
  170. 853.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  171. 853.45 s [vector] unsafeHead: OK
  172. 853.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  173. 853.45 s [vector] unsafeLast: OK
  174. 853.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  175. 853.45 s [vector] slice: OK
  176. 853.45 s [vector] +++ OK, passed 100 tests.
  177. 853.45 s [vector] init: OK
  178. 853.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  179. 853.45 s [vector] tail: OK
  180. 853.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  181. 853.45 s [vector] take: OK
  182. 853.45 s [vector] +++ OK, passed 100 tests.
  183. 853.45 s [vector] drop: OK
  184. 853.45 s [vector] +++ OK, passed 100 tests.
  185. 853.45 s [vector] splitAt: OK
  186. 853.45 s [vector] +++ OK, passed 100 tests.
  187. 853.45 s [vector] empty: OK
  188. 853.45 s [vector] +++ OK, passed 1 test.
  189. 853.45 s [vector] singleton: OK
  190. 853.45 s [vector] +++ OK, passed 100 tests.
  191. 853.45 s [vector] replicate: OK
  192. 853.45 s [vector] +++ OK, passed 100 tests.
  193. 853.45 s [vector] generate: OK
  194. 853.45 s [vector] +++ OK, passed 100 tests.
  195. 853.45 s [vector] iterateN: OK
  196. 853.45 s [vector] +++ OK, passed 100 tests.
  197. 853.45 s [vector] iterateNM: OK (0.06s)
  198. 853.45 s [vector] +++ OK, passed 100 tests.
  199. 853.45 s [vector] generateM: OK
  200. 853.45 s [vector] +++ OK, passed 100 tests.
  201. 853.45 s [vector] replicateM: OK (0.02s)
  202. 853.45 s [vector] +++ OK, passed 100 tests.
  203. 853.45 s [vector] create: OK
  204. 853.45 s [vector] +++ OK, passed 100 tests.
  205. 853.45 s [vector] createT: OK
  206. 853.45 s [vector] +++ OK, passed 100 tests.
  207. 853.45 s [vector] unfoldr: OK
  208. 853.45 s [vector] +++ OK, passed 100 tests.
  209. 853.45 s [vector] unfoldrN: OK
  210. 853.45 s [vector] +++ OK, passed 100 tests.
  211. 853.45 s [vector] unfoldrExactN: OK
  212. 853.45 s [vector] +++ OK, passed 100 tests.
  213. 853.45 s [vector] unfoldrM: OK
  214. 853.45 s [vector] +++ OK, passed 100 tests.
  215. 853.45 s [vector] unfoldrNM: OK
  216. 853.45 s [vector] +++ OK, passed 100 tests.
  217. 853.45 s [vector] unfoldrExactNM: OK (0.04s)
  218. 853.45 s [vector] +++ OK, passed 100 tests.
  219. 853.45 s [vector] constructN: OK
  220. 853.45 s [vector] +++ OK, passed 100 tests.
  221. 853.45 s [vector] constructrN: OK
  222. 853.45 s [vector] +++ OK, passed 100 tests.
  223. 853.45 s [vector] cons: OK
  224. 853.45 s [vector] +++ OK, passed 100 tests.
  225. 853.45 s [vector] snoc: OK
  226. 853.45 s [vector] +++ OK, passed 100 tests.
  227. 853.45 s [vector] append: OK
  228. 853.45 s [vector] +++ OK, passed 100 tests.
  229. 853.45 s [vector] concat: OK (0.02s)
  230. 853.45 s [vector] +++ OK, passed 100 tests.
  231. 853.45 s [vector] force: OK
  232. 853.45 s [vector] +++ OK, passed 100 tests.
  233. 853.45 s [vector] upd: OK
  234. 853.45 s [vector] +++ OK, passed 100 tests.
  235. 853.45 s [vector] accum: OK
  236. 853.45 s [vector] +++ OK, passed 100 tests.
  237. 853.45 s [vector] reverse: OK
  238. 853.45 s [vector] +++ OK, passed 100 tests.
  239. 853.45 s [vector] backpermute: OK
  240. 853.45 s [vector] +++ OK, passed 100 tests.
  241. 853.45 s [vector] map: OK
  242. 853.45 s [vector] +++ OK, passed 100 tests.
  243. 853.45 s [vector] imap: OK
  244. 853.45 s [vector] +++ OK, passed 100 tests.
  245. 853.45 s [vector] concatMap: OK
  246. 853.45 s [vector] +++ OK, passed 100 tests.
  247. 853.45 s [vector] mapM: OK
  248. 853.45 s [vector] +++ OK, passed 100 tests.
  249. 853.45 s [vector] mapM_: OK (0.02s)
  250. 853.45 s [vector] +++ OK, passed 100 tests.
  251. 853.45 s [vector] forM: OK
  252. 853.45 s [vector] +++ OK, passed 100 tests.
  253. 853.45 s [vector] forM_: OK (0.02s)
  254. 853.45 s [vector] +++ OK, passed 100 tests.
  255. 853.45 s [vector] imapM: OK
  256. 853.45 s [vector] +++ OK, passed 100 tests.
  257. 853.45 s [vector] imapM_: OK (0.02s)
  258. 853.45 s [vector] +++ OK, passed 100 tests.
  259. 853.45 s [vector] zipWith: OK
  260. 853.45 s [vector] +++ OK, passed 100 tests.
  261. 853.45 s [vector] zipWith3: OK
  262. 853.45 s [vector] +++ OK, passed 100 tests.
  263. 853.45 s [vector] izipWith: OK
  264. 853.45 s [vector] +++ OK, passed 100 tests.
  265. 853.45 s [vector] izipWith3: OK
  266. 853.45 s [vector] +++ OK, passed 100 tests.
  267. 853.45 s [vector] izipWithM: OK
  268. 853.45 s [vector] +++ OK, passed 100 tests.
  269. 853.45 s [vector] izipWithM_: OK (0.01s)
  270. 853.45 s [vector] +++ OK, passed 100 tests.
  271. 853.46 s [vector] zipWithM: OK
  272. 853.46 s [vector] +++ OK, passed 100 tests.
  273. 853.46 s [vector] zipWithM_: OK (0.01s)
  274. 853.46 s [vector] +++ OK, passed 100 tests.
  275. 853.46 s [vector] filter: OK
  276. 853.46 s [vector] +++ OK, passed 100 tests.
  277. 853.46 s [vector] ifilter: OK
  278. 853.46 s [vector] +++ OK, passed 100 tests.
  279. 853.46 s [vector] filterM: OK (0.04s)
  280. 853.46 s [vector] +++ OK, passed 100 tests.
  281. 853.46 s [vector] uniq: OK
  282. 853.46 s [vector] +++ OK, passed 100 tests.
  283. 853.46 s [vector] mapMaybe: OK
  284. 853.46 s [vector] +++ OK, passed 100 tests.
  285. 853.46 s [vector] imapMaybe: OK
  286. 853.46 s [vector] +++ OK, passed 100 tests.
  287. 853.46 s [vector] takeWhile: OK
  288. 853.46 s [vector] +++ OK, passed 100 tests.
  289. 853.46 s [vector] dropWhile: OK
  290. 853.46 s [vector] +++ OK, passed 100 tests.
  291. 853.46 s [vector] partition: OK
  292. 853.46 s [vector] +++ OK, passed 100 tests.
  293. 853.46 s [vector] partitionWith: OK
  294. 853.46 s [vector] +++ OK, passed 100 tests.
  295. 853.46 s [vector] span: OK
  296. 853.46 s [vector] +++ OK, passed 100 tests.
  297. 853.46 s [vector] break: OK
  298. 853.46 s [vector] +++ OK, passed 100 tests.
  299. 853.46 s [vector] spanR: OK
  300. 853.46 s [vector] +++ OK, passed 100 tests.
  301. 853.46 s [vector] breakR: OK
  302. 853.46 s [vector] +++ OK, passed 100 tests.
  303. 853.46 s [vector] groupBy: OK
  304. 853.46 s [vector] +++ OK, passed 100 tests.
  305. 853.46 s [vector] elem: OK
  306. 853.46 s [vector] +++ OK, passed 100 tests.
  307. 853.46 s [vector] notElem: OK
  308. 853.46 s [vector] +++ OK, passed 100 tests.
  309. 853.46 s [vector] find: OK
  310. 853.46 s [vector] +++ OK, passed 100 tests.
  311. 853.46 s [vector] findIndex: OK
  312. 853.46 s [vector] +++ OK, passed 100 tests.
  313. 853.46 s [vector] findIndexR: OK
  314. 853.46 s [vector] +++ OK, passed 100 tests.
  315. 853.46 s [vector] findIndices: OK
  316. 853.46 s [vector] +++ OK, passed 100 tests.
  317. 853.46 s [vector] elemIndex: OK
  318. 853.46 s [vector] +++ OK, passed 100 tests.
  319. 853.46 s [vector] elemIndices: OK
  320. 853.46 s [vector] +++ OK, passed 100 tests.
  321. 853.46 s [vector] foldl: OK
  322. 853.46 s [vector] +++ OK, passed 100 tests.
  323. 853.46 s [vector] foldl1: OK
  324. 853.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  325. 853.46 s [vector] foldl': OK
  326. 853.46 s [vector] +++ OK, passed 100 tests.
  327. 853.46 s [vector] foldl1': OK
  328. 853.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  329. 853.46 s [vector] foldr: OK
  330. 853.46 s [vector] +++ OK, passed 100 tests.
  331. 853.46 s [vector] foldr1: OK
  332. 853.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  333. 853.46 s [vector] foldr': OK
  334. 853.46 s [vector] +++ OK, passed 100 tests.
  335. 853.46 s [vector] foldr1': OK
  336. 853.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  337. 853.46 s [vector] ifoldl: OK
  338. 853.46 s [vector] +++ OK, passed 100 tests.
  339. 853.46 s [vector] ifoldl': OK
  340. 853.46 s [vector] +++ OK, passed 100 tests.
  341. 853.46 s [vector] ifoldr: OK
  342. 853.46 s [vector] +++ OK, passed 100 tests.
  343. 853.46 s [vector] ifoldr': OK
  344. 853.46 s [vector] +++ OK, passed 100 tests.
  345. 853.46 s [vector] ifoldM: OK
  346. 853.46 s [vector] +++ OK, passed 100 tests.
  347. 853.46 s [vector] ifoldM': OK
  348. 853.46 s [vector] +++ OK, passed 100 tests.
  349. 853.46 s [vector] ifoldM_: OK (0.02s)
  350. 853.46 s [vector] +++ OK, passed 100 tests.
  351. 853.46 s [vector] ifoldM'_: OK (0.02s)
  352. 853.46 s [vector] +++ OK, passed 100 tests.
  353. 853.46 s [vector] all: OK
  354. 853.46 s [vector] +++ OK, passed 100 tests.
  355. 853.46 s [vector] any: OK
  356. 853.46 s [vector] +++ OK, passed 100 tests.
  357. 853.46 s [vector] prescanl: OK
  358. 853.46 s [vector] +++ OK, passed 100 tests.
  359. 853.46 s [vector] prescanl': OK
  360. 853.46 s [vector] +++ OK, passed 100 tests.
  361. 853.46 s [vector] postscanl: OK
  362. 853.46 s [vector] +++ OK, passed 100 tests.
  363. 853.46 s [vector] postscanl': OK
  364. 853.46 s [vector] +++ OK, passed 100 tests.
  365. 853.46 s [vector] scanl: OK
  366. 853.46 s [vector] +++ OK, passed 100 tests.
  367. 853.46 s [vector] scanl': OK
  368. 853.46 s [vector] +++ OK, passed 100 tests.
  369. 853.46 s [vector] scanl1: OK
  370. 853.46 s [vector] +++ OK, passed 100 tests.
  371. 853.46 s [vector] scanl1': OK
  372. 853.46 s [vector] +++ OK, passed 100 tests.
  373. 853.46 s [vector] iscanl: OK
  374. 853.46 s [vector] +++ OK, passed 100 tests.
  375. 853.46 s [vector] iscanl': OK
  376. 853.46 s [vector] +++ OK, passed 100 tests.
  377. 853.46 s [vector] prescanr: OK
  378. 853.46 s [vector] +++ OK, passed 100 tests.
  379. 853.46 s [vector] prescanr': OK
  380. 853.46 s [vector] +++ OK, passed 100 tests.
  381. 853.46 s [vector] postscanr: OK
  382. 853.46 s [vector] +++ OK, passed 100 tests.
  383. 853.46 s [vector] postscanr': OK
  384. 853.46 s [vector] +++ OK, passed 100 tests.
  385. 853.46 s [vector] scanr: OK
  386. 853.46 s [vector] +++ OK, passed 100 tests.
  387. 853.46 s [vector] scanr': OK
  388. 853.46 s [vector] +++ OK, passed 100 tests.
  389. 853.46 s [vector] scanr1: OK
  390. 853.46 s [vector] +++ OK, passed 100 tests.
  391. 853.46 s [vector] scanr1': OK
  392. 853.46 s [vector] +++ OK, passed 100 tests.
  393. 853.46 s [vector] iscanr: OK
  394. 853.46 s [vector] +++ OK, passed 100 tests.
  395. 853.46 s [vector] iscanr': OK
  396. 853.46 s [vector] +++ OK, passed 100 tests.
  397. 853.46 s [vector] mut_read: OK
  398. 853.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  399. 853.46 s [vector] mut_write: OK
  400. 853.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  401. 853.46 s [vector] mut_modify: OK
  402. 853.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  403. 853.46 s [vector] mut_generate: OK
  404. 853.46 s [vector] +++ OK, passed 100 tests.
  405. 853.46 s [vector] mut_generateM: OK
  406. 853.46 s [vector] +++ OK, passed 100 tests.
  407. 853.46 s [vector] mut_mapM_: OK (0.02s)
  408. 853.46 s [vector] +++ OK, passed 100 tests.
  409. 853.46 s [vector] mut_imapM_: OK (0.02s)
  410. 853.46 s [vector] +++ OK, passed 100 tests.
  411. 853.46 s [vector] mut_forM_: OK (0.02s)
  412. 853.46 s [vector] +++ OK, passed 100 tests.
  413. 853.46 s [vector] mut_iforM_: OK
  414. 853.46 s [vector] +++ OK, passed 100 tests.
  415. 853.46 s [vector] mut_foldr: OK
  416. 853.46 s [vector] +++ OK, passed 100 tests.
  417. 853.46 s [vector] mut_foldr': OK
  418. 853.46 s [vector] +++ OK, passed 100 tests.
  419. 853.46 s [vector] mut_foldl: OK
  420. 853.46 s [vector] +++ OK, passed 100 tests.
  421. 853.46 s [vector] mut_foldl': OK
  422. 853.46 s [vector] +++ OK, passed 100 tests.
  423. 853.46 s [vector] mut_ifoldr: OK
  424. 853.46 s [vector] +++ OK, passed 100 tests.
  425. 853.46 s [vector] mut_ifoldr': OK
  426. 853.46 s [vector] +++ OK, passed 100 tests.
  427. 853.46 s [vector] mut_ifoldl: OK
  428. 853.46 s [vector] +++ OK, passed 100 tests.
  429. 853.46 s [vector] mut_ifoldl': OK
  430. 853.46 s [vector] +++ OK, passed 100 tests.
  431. 853.46 s [vector] mut_foldM: OK
  432. 853.46 s [vector] +++ OK, passed 100 tests.
  433. 853.46 s [vector] mut_foldM': OK
  434. 853.46 s [vector] +++ OK, passed 100 tests.
  435. 853.46 s [vector] mut_foldrM: OK
  436. 853.46 s [vector] +++ OK, passed 100 tests.
  437. 853.46 s [vector] mut_foldrM': OK
  438. 853.46 s [vector] +++ OK, passed 100 tests.
  439. 853.46 s [vector] mut_ifoldM: OK
  440. 853.46 s [vector] +++ OK, passed 100 tests.
  441. 853.46 s [vector] mut_ifoldM': OK
  442. 853.46 s [vector] +++ OK, passed 100 tests.
  443. 853.46 s [vector] mut_ifoldrM: OK
  444. 853.46 s [vector] +++ OK, passed 100 tests.
  445. 853.46 s [vector] mut_ifoldrM': OK
  446. 853.46 s [vector] +++ OK, passed 100 tests.
  447. 853.46 s [vector] compare: OK
  448. 853.46 s [vector] +++ OK, passed 100 tests.
  449. 853.46 s [vector] maximum: OK
  450. 853.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  451. 853.46 s [vector] minimum: OK
  452. 853.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  453. 853.46 s [vector] minIndex: OK
  454. 853.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  455. 853.46 s [vector] maxIndex: OK
  456. 853.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  457. 853.46 s [vector] maximumBy: OK
  458. 853.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  459. 853.46 s [vector] minimumBy: OK
  460. 853.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  461. 853.46 s [vector] maximumOn: OK
  462. 853.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  463. 853.46 s [vector] minimumOn: OK
  464. 853.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  465. 853.46 s [vector] maxIndexBy: OK
  466. 853.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  467. 853.46 s [vector] minIndexBy: OK
  468. 853.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  469. 853.46 s [vector] ListFirstMaxIndexWins: OK
  470. 853.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  471. 853.46 s [vector] FalseListFirstMaxIndexWins: OK
  472. 853.46 s [vector] +++ OK, failed as expected. (after 1 test):
  473. 853.46 s [vector] Exception:
  474. 853.46 s [vector] Prelude.foldr1: empty list
  475. 853.46 s [vector] CallStack (from HasCallStack):
  476. 853.46 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  477. 853.46 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  478. 853.46 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  479. 853.46 s [vector] []
  480. 853.46 s [vector] mempty: OK
  481. 853.46 s [vector] +++ OK, passed 1 test.
  482. 853.46 s [vector] mappend: OK
  483. 853.46 s [vector] +++ OK, passed 100 tests.
  484. 853.46 s [vector] mconcat: OK (0.02s)
  485. 853.46 s [vector] +++ OK, passed 100 tests.
  486. 853.46 s [vector] glength: OK
  487. 853.46 s [vector] +++ OK, passed 100 tests.
  488. 853.46 s [vector] sum: OK
  489. 853.46 s [vector] +++ OK, passed 100 tests.
  490. 853.46 s [vector] product: OK
  491. 853.46 s [vector] +++ OK, passed 100 tests.
  492. 853.46 s [vector] enumFromN: OK
  493. 853.46 s [vector] +++ OK, passed 100 tests.
  494. 853.46 s [vector] enumFromThenN: OK
  495. 853.46 s [vector] +++ OK, passed 100 tests.
  496. 853.46 s [vector] enumFromTo: OK
  497. 853.46 s [vector] +++ OK, passed 100 tests.
  498. 853.46 s [vector] enumFromThenTo: OK
  499. 853.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  500. 853.46 s [vector] Double
  501. 853.46 s [vector] fromList.toList == id: OK
  502. 853.46 s [vector] +++ OK, passed 100 tests.
  503. 853.46 s [vector] toList.fromList == id: OK
  504. 853.46 s [vector] +++ OK, passed 100 tests.
  505. 853.46 s [vector] unstream.stream == id: OK
  506. 853.46 s [vector] +++ OK, passed 100 tests.
  507. 853.46 s [vector] stream.unstream == id: OK
  508. 853.46 s [vector] +++ OK, passed 100 tests.
  509. 853.46 s [vector] eq: OK
  510. 853.46 s [vector] +++ OK, passed 100 tests.
  511. 853.46 s [vector] length: OK
  512. 853.46 s [vector] +++ OK, passed 100 tests.
  513. 853.46 s [vector] null: OK
  514. 853.46 s [vector] +++ OK, passed 100 tests.
  515. 853.46 s [vector] index: OK
  516. 853.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  517. 853.46 s [vector] safeIndex: OK
  518. 853.46 s [vector] +++ OK, passed 100 tests.
  519. 853.46 s [vector] head: OK
  520. 853.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  521. 853.46 s [vector] last: OK
  522. 853.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  523. 853.46 s [vector] unsafeIndex: OK
  524. 853.46 s [vector] +++ OK, passed 100 tests; 30 discarded.
  525. 853.46 s [vector] unsafeHead: OK
  526. 853.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  527. 853.46 s [vector] unsafeLast: OK
  528. 853.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  529. 853.46 s [vector] slice: OK
  530. 853.46 s [vector] +++ OK, passed 100 tests.
  531. 853.46 s [vector] init: OK
  532. 853.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  533. 853.46 s [vector] tail: OK
  534. 853.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  535. 853.46 s [vector] take: OK
  536. 853.46 s [vector] +++ OK, passed 100 tests.
  537. 853.46 s [vector] drop: OK
  538. 853.46 s [vector] +++ OK, passed 100 tests.
  539. 853.46 s [vector] splitAt: OK
  540. 853.46 s [vector] +++ OK, passed 100 tests.
  541. 853.46 s [vector] empty: OK
  542. 853.46 s [vector] +++ OK, passed 1 test.
  543. 853.46 s [vector] singleton: OK
  544. 853.46 s [vector] +++ OK, passed 100 tests.
  545. 853.46 s [vector] replicate: OK
  546. 853.46 s [vector] +++ OK, passed 100 tests.
  547. 853.46 s [vector] generate: OK
  548. 853.46 s [vector] +++ OK, passed 100 tests.
  549. 853.46 s [vector] iterateN: OK
  550. 853.47 s [vector] +++ OK, passed 100 tests.
  551. 853.47 s [vector] iterateNM: OK (0.05s)
  552. 853.47 s [vector] +++ OK, passed 100 tests.
  553. 853.47 s [vector] generateM: OK (0.02s)
  554. 853.47 s [vector] +++ OK, passed 100 tests.
  555. 853.47 s [vector] replicateM: OK (0.01s)
  556. 853.47 s [vector] +++ OK, passed 100 tests.
  557. 853.47 s [vector] create: OK
  558. 853.47 s [vector] +++ OK, passed 100 tests.
  559. 853.47 s [vector] createT: OK
  560. 853.47 s [vector] +++ OK, passed 100 tests.
  561. 853.47 s [vector] unfoldr: OK
  562. 853.47 s [vector] +++ OK, passed 100 tests.
  563. 853.47 s [vector] unfoldrN: OK
  564. 853.47 s [vector] +++ OK, passed 100 tests.
  565. 853.47 s [vector] unfoldrExactN: OK
  566. 853.47 s [vector] +++ OK, passed 100 tests.
  567. 853.47 s [vector] unfoldrM: OK
  568. 853.47 s [vector] +++ OK, passed 100 tests.
  569. 853.47 s [vector] unfoldrNM: OK
  570. 853.47 s [vector] +++ OK, passed 100 tests.
  571. 853.47 s [vector] unfoldrExactNM: OK (0.05s)
  572. 853.47 s [vector] +++ OK, passed 100 tests.
  573. 853.47 s [vector] constructN: OK (0.02s)
  574. 853.47 s [vector] +++ OK, passed 100 tests.
  575. 853.47 s [vector] constructrN: OK (0.02s)
  576. 853.47 s [vector] +++ OK, passed 100 tests.
  577. 853.47 s [vector] cons: OK
  578. 853.47 s [vector] +++ OK, passed 100 tests.
  579. 853.47 s [vector] snoc: OK
  580. 853.47 s [vector] +++ OK, passed 100 tests.
  581. 853.47 s [vector] append: OK
  582. 853.47 s [vector] +++ OK, passed 100 tests.
  583. 853.47 s [vector] concat: OK (0.03s)
  584. 853.47 s [vector] +++ OK, passed 100 tests.
  585. 853.47 s [vector] force: OK
  586. 853.47 s [vector] +++ OK, passed 100 tests.
  587. 853.47 s [vector] upd: OK
  588. 853.47 s [vector] +++ OK, passed 100 tests.
  589. 853.47 s [vector] accum: OK (0.02s)
  590. 853.47 s [vector] +++ OK, passed 100 tests.
  591. 853.47 s [vector] reverse: OK
  592. 853.47 s [vector] +++ OK, passed 100 tests.
  593. 853.47 s [vector] backpermute: OK
  594. 853.47 s [vector] +++ OK, passed 100 tests.
  595. 853.47 s [vector] map: OK
  596. 853.47 s [vector] +++ OK, passed 100 tests.
  597. 853.47 s [vector] imap: OK
  598. 853.47 s [vector] +++ OK, passed 100 tests.
  599. 853.47 s [vector] concatMap: OK
  600. 853.47 s [vector] +++ OK, passed 100 tests.
  601. 853.47 s [vector] mapM: OK
  602. 853.47 s [vector] +++ OK, passed 100 tests.
  603. 853.47 s [vector] mapM_: OK (0.04s)
  604. 853.47 s [vector] +++ OK, passed 100 tests.
  605. 853.47 s [vector] forM: OK
  606. 853.47 s [vector] +++ OK, passed 100 tests.
  607. 853.47 s [vector] forM_: OK (0.04s)
  608. 853.47 s [vector] +++ OK, passed 100 tests.
  609. 853.47 s [vector] imapM: OK (0.01s)
  610. 853.47 s [vector] +++ OK, passed 100 tests.
  611. 853.47 s [vector] imapM_: OK (0.04s)
  612. 853.47 s [vector] +++ OK, passed 100 tests.
  613. 853.47 s [vector] zipWith: OK (0.01s)
  614. 853.47 s [vector] +++ OK, passed 100 tests.
  615. 853.47 s [vector] zipWith3: OK (0.01s)
  616. 853.47 s [vector] +++ OK, passed 100 tests.
  617. 853.47 s [vector] izipWith: OK (0.01s)
  618. 853.47 s [vector] +++ OK, passed 100 tests.
  619. 853.47 s [vector] izipWith3: OK (0.01s)
  620. 853.47 s [vector] +++ OK, passed 100 tests.
  621. 853.47 s [vector] izipWithM: OK (0.01s)
  622. 853.47 s [vector] +++ OK, passed 100 tests.
  623. 853.47 s [vector] izipWithM_: OK
  624. 853.47 s [vector] +++ OK, passed 100 tests.
  625. 853.47 s [vector] zipWithM: OK (0.01s)
  626. 853.47 s [vector] +++ OK, passed 100 tests.
  627. 853.47 s [vector] zipWithM_: OK (0.04s)
  628. 853.47 s [vector] +++ OK, passed 100 tests.
  629. 853.47 s [vector] filter: OK
  630. 853.47 s [vector] +++ OK, passed 100 tests.
  631. 853.47 s [vector] ifilter: OK
  632. 853.47 s [vector] +++ OK, passed 100 tests.
  633. 853.47 s [vector] filterM: OK (0.05s)
  634. 853.47 s [vector] +++ OK, passed 100 tests.
  635. 853.47 s [vector] uniq: OK
  636. 853.47 s [vector] +++ OK, passed 100 tests.
  637. 853.47 s [vector] mapMaybe: OK
  638. 853.47 s [vector] +++ OK, passed 100 tests.
  639. 853.47 s [vector] imapMaybe: OK
  640. 853.47 s [vector] +++ OK, passed 100 tests.
  641. 853.47 s [vector] takeWhile: OK
  642. 853.47 s [vector] +++ OK, passed 100 tests.
  643. 853.47 s [vector] dropWhile: OK
  644. 853.47 s [vector] +++ OK, passed 100 tests.
  645. 853.47 s [vector] partition: OK
  646. 853.47 s [vector] +++ OK, passed 100 tests.
  647. 853.47 s [vector] partitionWith: OK
  648. 853.47 s [vector] +++ OK, passed 100 tests.
  649. 853.47 s [vector] span: OK
  650. 853.47 s [vector] +++ OK, passed 100 tests.
  651. 853.47 s [vector] break: OK
  652. 853.47 s [vector] +++ OK, passed 100 tests.
  653. 853.47 s [vector] spanR: OK
  654. 853.47 s [vector] +++ OK, passed 100 tests.
  655. 853.47 s [vector] breakR: OK
  656. 853.47 s [vector] +++ OK, passed 100 tests.
  657. 853.47 s [vector] groupBy: OK (0.01s)
  658. 853.47 s [vector] +++ OK, passed 100 tests.
  659. 853.47 s [vector] elem: OK
  660. 853.47 s [vector] +++ OK, passed 100 tests.
  661. 853.47 s [vector] notElem: OK
  662. 853.47 s [vector] +++ OK, passed 100 tests.
  663. 853.47 s [vector] find: OK
  664. 853.47 s [vector] +++ OK, passed 100 tests.
  665. 853.47 s [vector] findIndex: OK
  666. 853.47 s [vector] +++ OK, passed 100 tests.
  667. 853.47 s [vector] findIndexR: OK
  668. 853.47 s [vector] +++ OK, passed 100 tests.
  669. 853.47 s [vector] findIndices: OK
  670. 853.47 s [vector] +++ OK, passed 100 tests.
  671. 853.47 s [vector] elemIndex: OK
  672. 853.47 s [vector] +++ OK, passed 100 tests.
  673. 853.47 s [vector] elemIndices: OK
  674. 853.47 s [vector] +++ OK, passed 100 tests.
  675. 853.47 s [vector] foldl: OK (0.01s)
  676. 853.47 s [vector] +++ OK, passed 100 tests.
  677. 853.47 s [vector] foldl1: OK (0.01s)
  678. 853.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  679. 853.47 s [vector] foldl': OK (0.01s)
  680. 853.47 s [vector] +++ OK, passed 100 tests.
  681. 853.47 s [vector] foldl1': OK (0.01s)
  682. 853.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  683. 853.47 s [vector] foldr: OK (0.01s)
  684. 853.47 s [vector] +++ OK, passed 100 tests.
  685. 853.47 s [vector] foldr1: OK (0.01s)
  686. 853.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  687. 853.47 s [vector] foldr': OK (0.02s)
  688. 853.47 s [vector] +++ OK, passed 100 tests.
  689. 853.47 s [vector] foldr1': OK (0.01s)
  690. 853.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  691. 853.47 s [vector] ifoldl: OK (0.01s)
  692. 853.47 s [vector] +++ OK, passed 100 tests.
  693. 853.47 s [vector] ifoldl': OK (0.01s)
  694. 853.47 s [vector] +++ OK, passed 100 tests.
  695. 853.47 s [vector] ifoldr: OK (0.01s)
  696. 853.47 s [vector] +++ OK, passed 100 tests.
  697. 853.47 s [vector] ifoldr': OK (0.01s)
  698. 853.47 s [vector] +++ OK, passed 100 tests.
  699. 853.47 s [vector] ifoldM: OK (0.01s)
  700. 853.47 s [vector] +++ OK, passed 100 tests.
  701. 853.47 s [vector] ifoldM': OK (0.02s)
  702. 853.47 s [vector] +++ OK, passed 100 tests.
  703. 853.47 s [vector] ifoldM_: OK (0.05s)
  704. 853.47 s [vector] +++ OK, passed 100 tests.
  705. 853.47 s [vector] ifoldM'_: OK (0.04s)
  706. 853.47 s [vector] +++ OK, passed 100 tests.
  707. 853.47 s [vector] all: OK
  708. 853.47 s [vector] +++ OK, passed 100 tests.
  709. 853.47 s [vector] any: OK
  710. 853.47 s [vector] +++ OK, passed 100 tests.
  711. 853.47 s [vector] prescanl: OK (0.02s)
  712. 853.47 s [vector] +++ OK, passed 100 tests.
  713. 853.47 s [vector] prescanl': OK (0.01s)
  714. 853.47 s [vector] +++ OK, passed 100 tests.
  715. 853.47 s [vector] postscanl: OK (0.01s)
  716. 853.47 s [vector] +++ OK, passed 100 tests.
  717. 853.47 s [vector] postscanl': OK (0.02s)
  718. 853.47 s [vector] +++ OK, passed 100 tests.
  719. 853.47 s [vector] scanl: OK (0.02s)
  720. 853.47 s [vector] +++ OK, passed 100 tests.
  721. 853.47 s [vector] scanl': OK (0.02s)
  722. 853.47 s [vector] +++ OK, passed 100 tests.
  723. 853.47 s [vector] scanl1: OK (0.01s)
  724. 853.47 s [vector] +++ OK, passed 100 tests.
  725. 853.47 s [vector] scanl1': OK (0.02s)
  726. 853.47 s [vector] +++ OK, passed 100 tests.
  727. 853.47 s [vector] iscanl: OK (0.02s)
  728. 853.47 s [vector] +++ OK, passed 100 tests.
  729. 853.47 s [vector] iscanl': OK (0.02s)
  730. 853.47 s [vector] +++ OK, passed 100 tests.
  731. 853.47 s [vector] prescanr: OK (0.01s)
  732. 853.47 s [vector] +++ OK, passed 100 tests.
  733. 853.47 s [vector] prescanr': OK (0.02s)
  734. 853.47 s [vector] +++ OK, passed 100 tests.
  735. 853.47 s [vector] postscanr: OK (0.02s)
  736. 853.47 s [vector] +++ OK, passed 100 tests.
  737. 853.47 s [vector] postscanr': OK (0.01s)
  738. 853.47 s [vector] +++ OK, passed 100 tests.
  739. 853.47 s [vector] scanr: OK (0.02s)
  740. 853.47 s [vector] +++ OK, passed 100 tests.
  741. 853.47 s [vector] scanr': OK (0.02s)
  742. 853.47 s [vector] +++ OK, passed 100 tests.
  743. 853.47 s [vector] scanr1: OK (0.02s)
  744. 853.47 s [vector] +++ OK, passed 100 tests.
  745. 853.47 s [vector] scanr1': OK (0.02s)
  746. 853.47 s [vector] +++ OK, passed 100 tests.
  747. 853.47 s [vector] iscanr: OK (0.02s)
  748. 853.47 s [vector] +++ OK, passed 100 tests.
  749. 853.47 s [vector] iscanr': OK (0.02s)
  750. 853.47 s [vector] +++ OK, passed 100 tests.
  751. 853.47 s [vector] mut_read: OK
  752. 853.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  753. 853.47 s [vector] mut_write: OK
  754. 853.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  755. 853.47 s [vector] mut_modify: OK
  756. 853.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  757. 853.47 s [vector] mut_generate: OK
  758. 853.47 s [vector] +++ OK, passed 100 tests.
  759. 853.47 s [vector] mut_generateM: OK (0.03s)
  760. 853.47 s [vector] +++ OK, passed 100 tests.
  761. 853.47 s [vector] mut_mapM_: OK (0.04s)
  762. 853.47 s [vector] +++ OK, passed 100 tests.
  763. 853.47 s [vector] mut_imapM_: OK (0.04s)
  764. 853.47 s [vector] +++ OK, passed 100 tests.
  765. 853.47 s [vector] mut_forM_: OK (0.04s)
  766. 853.47 s [vector] +++ OK, passed 100 tests.
  767. 853.47 s [vector] mut_iforM_: OK (0.05s)
  768. 853.47 s [vector] +++ OK, passed 100 tests.
  769. 853.47 s [vector] mut_foldr: OK (0.02s)
  770. 853.47 s [vector] +++ OK, passed 100 tests.
  771. 853.47 s [vector] mut_foldr': OK (0.01s)
  772. 853.47 s [vector] +++ OK, passed 100 tests.
  773. 853.47 s [vector] mut_foldl: OK (0.01s)
  774. 853.47 s [vector] +++ OK, passed 100 tests.
  775. 853.47 s [vector] mut_foldl': OK (0.02s)
  776. 853.47 s [vector] +++ OK, passed 100 tests.
  777. 853.47 s [vector] mut_ifoldr: OK (0.02s)
  778. 853.47 s [vector] +++ OK, passed 100 tests.
  779. 853.47 s [vector] mut_ifoldr': OK (0.02s)
  780. 853.47 s [vector] +++ OK, passed 100 tests.
  781. 853.47 s [vector] mut_ifoldl: OK (0.01s)
  782. 853.47 s [vector] +++ OK, passed 100 tests.
  783. 853.47 s [vector] mut_ifoldl': OK (0.02s)
  784. 853.47 s [vector] +++ OK, passed 100 tests.
  785. 853.47 s [vector] mut_foldM: OK (0.01s)
  786. 853.47 s [vector] +++ OK, passed 100 tests.
  787. 853.47 s [vector] mut_foldM': OK (0.01s)
  788. 853.47 s [vector] +++ OK, passed 100 tests.
  789. 853.47 s [vector] mut_foldrM: OK (0.01s)
  790. 853.47 s [vector] +++ OK, passed 100 tests.
  791. 853.47 s [vector] mut_foldrM': OK (0.02s)
  792. 853.47 s [vector] +++ OK, passed 100 tests.
  793. 853.47 s [vector] mut_ifoldM: OK (0.02s)
  794. 853.47 s [vector] +++ OK, passed 100 tests.
  795. 853.47 s [vector] mut_ifoldM': OK (0.01s)
  796. 853.47 s [vector] +++ OK, passed 100 tests.
  797. 853.47 s [vector] mut_ifoldrM: OK (0.02s)
  798. 853.47 s [vector] +++ OK, passed 100 tests.
  799. 853.47 s [vector] mut_ifoldrM': OK (0.02s)
  800. 853.47 s [vector] +++ OK, passed 100 tests.
  801. 853.47 s [vector] compare: OK
  802. 853.47 s [vector] +++ OK, passed 100 tests.
  803. 853.47 s [vector] maximum: OK
  804. 853.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  805. 853.47 s [vector] minimum: OK
  806. 853.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  807. 853.47 s [vector] minIndex: OK
  808. 853.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  809. 853.47 s [vector] maxIndex: OK
  810. 853.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  811. 853.47 s [vector] maximumBy: OK
  812. 853.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  813. 853.47 s [vector] minimumBy: OK
  814. 853.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  815. 853.47 s [vector] maximumOn: OK
  816. 853.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  817. 853.47 s [vector] minimumOn: OK
  818. 853.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  819. 853.47 s [vector] maxIndexBy: OK
  820. 853.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  821. 853.47 s [vector] minIndexBy: OK
  822. 853.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  823. 853.47 s [vector] ListFirstMaxIndexWins: OK
  824. 853.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  825. 853.47 s [vector] FalseListFirstMaxIndexWins: OK
  826. 853.47 s [vector] +++ OK, failed as expected. (after 1 test):
  827. 853.47 s [vector] Exception:
  828. 853.47 s [vector] Prelude.foldr1: empty list
  829. 853.47 s [vector] CallStack (from HasCallStack):
  830. 853.47 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  831. 853.47 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  832. 853.47 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  833. 853.47 s [vector] []
  834. 853.47 s [vector] mempty: OK
  835. 853.47 s [vector] +++ OK, passed 1 test.
  836. 853.47 s [vector] mappend: OK
  837. 853.47 s [vector] +++ OK, passed 100 tests.
  838. 853.47 s [vector] mconcat: OK (0.03s)
  839. 853.47 s [vector] +++ OK, passed 100 tests.
  840. 853.47 s [vector] glength: OK
  841. 853.47 s [vector] +++ OK, passed 100 tests.
  842. 853.47 s [vector] sum: OK
  843. 853.47 s [vector] +++ OK, passed 100 tests.
  844. 853.47 s [vector] product: OK
  845. 853.47 s [vector] +++ OK, passed 100 tests.
  846. 853.47 s [vector] enumFromN: OK
  847. 853.47 s [vector] +++ OK, passed 100 tests.
  848. 853.47 s [vector] enumFromThenN: OK
  849. 853.47 s [vector] +++ OK, passed 100 tests.
  850. 853.47 s [vector] enumFromTo: OK
  851. 853.47 s [vector] +++ OK, passed 100 tests.
  852. 853.47 s [vector] enumFromThenTo: OK
  853. 853.47 s [vector] +++ OK, passed 100 tests; 2 discarded.
  854. 853.47 s [vector] unstream
  855. 853.47 s [vector] unstream == vunstream (exact): OK
  856. 853.47 s [vector] +++ OK, passed 100 tests.
  857. 853.47 s [vector] unstream == vunstream (unknown): OK
  858. 853.47 s [vector] +++ OK, passed 100 tests.
  859. 853.47 s [vector] unstreamR ~= vunstream (exact): OK
  860. 853.47 s [vector] +++ OK, passed 100 tests.
  861. 853.47 s [vector] unstreamR ~= vunstream (unknown): OK
  862. 853.47 s [vector] +++ OK, passed 100 tests.
  863. 853.47 s [vector] Tests.Vector.Storable
  864. 853.47 s [vector] Data.Vector.Storable.Vector (Int)
  865. 853.47 s [vector] fromList.toList == id: OK
  866. 853.47 s [vector] +++ OK, passed 100 tests.
  867. 853.47 s [vector] toList.fromList == id: OK
  868. 853.47 s [vector] +++ OK, passed 100 tests.
  869. 853.47 s [vector] unstream.stream == id: OK
  870. 853.47 s [vector] +++ OK, passed 100 tests.
  871. 853.47 s [vector] stream.unstream == id: OK
  872. 853.47 s [vector] +++ OK, passed 100 tests.
  873. 853.47 s [vector] eq: OK
  874. 853.47 s [vector] +++ OK, passed 100 tests.
  875. 853.47 s [vector] length: OK
  876. 853.47 s [vector] +++ OK, passed 100 tests.
  877. 853.47 s [vector] null: OK
  878. 853.47 s [vector] +++ OK, passed 100 tests.
  879. 853.47 s [vector] index: OK
  880. 853.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  881. 853.47 s [vector] safeIndex: OK
  882. 853.47 s [vector] +++ OK, passed 100 tests.
  883. 853.47 s [vector] head: OK
  884. 853.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  885. 853.47 s [vector] last: OK
  886. 853.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  887. 853.47 s [vector] unsafeIndex: OK
  888. 853.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  889. 853.47 s [vector] unsafeHead: OK
  890. 853.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  891. 853.47 s [vector] unsafeLast: OK
  892. 853.47 s [vector] +++ OK, passed 100 tests; 23 discarded.
  893. 853.48 s [vector] slice: OK
  894. 853.48 s [vector] +++ OK, passed 100 tests.
  895. 853.48 s [vector] init: OK
  896. 853.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  897. 853.48 s [vector] tail: OK
  898. 853.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  899. 853.48 s [vector] take: OK
  900. 853.48 s [vector] +++ OK, passed 100 tests.
  901. 853.48 s [vector] drop: OK
  902. 853.48 s [vector] +++ OK, passed 100 tests.
  903. 853.48 s [vector] splitAt: OK
  904. 853.48 s [vector] +++ OK, passed 100 tests.
  905. 853.48 s [vector] empty: OK
  906. 853.48 s [vector] +++ OK, passed 1 test.
  907. 853.48 s [vector] singleton: OK
  908. 853.48 s [vector] +++ OK, passed 100 tests.
  909. 853.48 s [vector] replicate: OK
  910. 853.48 s [vector] +++ OK, passed 100 tests.
  911. 853.48 s [vector] generate: OK
  912. 853.48 s [vector] +++ OK, passed 100 tests.
  913. 853.48 s [vector] iterateN: OK
  914. 853.48 s [vector] +++ OK, passed 100 tests.
  915. 853.48 s [vector] iterateNM: OK (0.02s)
  916. 853.48 s [vector] +++ OK, passed 100 tests.
  917. 853.48 s [vector] generateM: OK (0.04s)
  918. 853.48 s [vector] +++ OK, passed 100 tests.
  919. 853.48 s [vector] replicateM: OK (0.01s)
  920. 853.48 s [vector] +++ OK, passed 100 tests.
  921. 853.48 s [vector] create: OK
  922. 853.48 s [vector] +++ OK, passed 100 tests.
  923. 853.48 s [vector] createT: OK
  924. 853.48 s [vector] +++ OK, passed 100 tests.
  925. 853.48 s [vector] unfoldr: OK
  926. 853.48 s [vector] +++ OK, passed 100 tests.
  927. 853.48 s [vector] unfoldrN: OK
  928. 853.48 s [vector] +++ OK, passed 100 tests.
  929. 853.48 s [vector] unfoldrExactN: OK
  930. 853.48 s [vector] +++ OK, passed 100 tests.
  931. 853.48 s [vector] unfoldrM: OK
  932. 853.48 s [vector] +++ OK, passed 100 tests.
  933. 853.48 s [vector] unfoldrNM: OK
  934. 853.48 s [vector] +++ OK, passed 100 tests.
  935. 853.48 s [vector] unfoldrExactNM: OK (0.04s)
  936. 853.48 s [vector] +++ OK, passed 100 tests.
  937. 853.48 s [vector] constructN: OK
  938. 853.48 s [vector] +++ OK, passed 100 tests.
  939. 853.48 s [vector] constructrN: OK
  940. 853.48 s [vector] +++ OK, passed 100 tests.
  941. 853.48 s [vector] cons: OK
  942. 853.48 s [vector] +++ OK, passed 100 tests.
  943. 853.48 s [vector] snoc: OK
  944. 853.48 s [vector] +++ OK, passed 100 tests.
  945. 853.48 s [vector] append: OK
  946. 853.48 s [vector] +++ OK, passed 100 tests.
  947. 853.48 s [vector] concat: OK (0.02s)
  948. 853.48 s [vector] +++ OK, passed 100 tests.
  949. 853.48 s [vector] force: OK
  950. 853.48 s [vector] +++ OK, passed 100 tests.
  951. 853.48 s [vector] upd: OK
  952. 853.48 s [vector] +++ OK, passed 100 tests.
  953. 853.48 s [vector] accum: OK (0.01s)
  954. 853.48 s [vector] +++ OK, passed 100 tests.
  955. 853.48 s [vector] reverse: OK
  956. 853.48 s [vector] +++ OK, passed 100 tests.
  957. 853.48 s [vector] backpermute: OK
  958. 853.48 s [vector] +++ OK, passed 100 tests.
  959. 853.48 s [vector] map: OK
  960. 853.48 s [vector] +++ OK, passed 100 tests.
  961. 853.48 s [vector] imap: OK
  962. 853.48 s [vector] +++ OK, passed 100 tests.
  963. 853.48 s [vector] concatMap: OK
  964. 853.48 s [vector] +++ OK, passed 100 tests.
  965. 853.48 s [vector] mapM: OK
  966. 853.48 s [vector] +++ OK, passed 100 tests.
  967. 853.48 s [vector] mapM_: OK (0.02s)
  968. 853.48 s [vector] +++ OK, passed 100 tests.
  969. 853.48 s [vector] forM: OK
  970. 853.48 s [vector] +++ OK, passed 100 tests.
  971. 853.48 s [vector] forM_: OK (0.02s)
  972. 853.48 s [vector] +++ OK, passed 100 tests.
  973. 853.48 s [vector] imapM: OK
  974. 853.48 s [vector] +++ OK, passed 100 tests.
  975. 853.48 s [vector] imapM_: OK (0.02s)
  976. 853.48 s [vector] +++ OK, passed 100 tests.
  977. 853.48 s [vector] zipWith: OK
  978. 853.48 s [vector] +++ OK, passed 100 tests.
  979. 853.48 s [vector] zipWith3: OK
  980. 853.48 s [vector] +++ OK, passed 100 tests.
  981. 853.48 s [vector] izipWith: OK
  982. 853.48 s [vector] +++ OK, passed 100 tests.
  983. 853.48 s [vector] izipWith3: OK
  984. 853.48 s [vector] +++ OK, passed 100 tests.
  985. 853.48 s [vector] izipWithM: OK
  986. 853.48 s [vector] +++ OK, passed 100 tests.
  987. 853.48 s [vector] izipWithM_: OK (0.02s)
  988. 853.48 s [vector] +++ OK, passed 100 tests.
  989. 853.48 s [vector] zipWithM: OK
  990. 853.48 s [vector] +++ OK, passed 100 tests.
  991. 853.48 s [vector] zipWithM_: OK (0.01s)
  992. 853.48 s [vector] +++ OK, passed 100 tests.
  993. 853.48 s [vector] filter: OK
  994. 853.48 s [vector] +++ OK, passed 100 tests.
  995. 853.48 s [vector] ifilter: OK
  996. 853.48 s [vector] +++ OK, passed 100 tests.
  997. 853.48 s [vector] filterM: OK (0.03s)
  998. 853.48 s [vector] +++ OK, passed 100 tests.
  999. 853.48 s [vector] uniq: OK
  1000. 853.48 s [vector] +++ OK, passed 100 tests.
  1001. 853.48 s [vector] mapMaybe: OK
  1002. 853.48 s [vector] +++ OK, passed 100 tests.
  1003. 853.48 s [vector] imapMaybe: OK
  1004. 853.48 s [vector] +++ OK, passed 100 tests.
  1005. 853.48 s [vector] takeWhile: OK
  1006. 853.48 s [vector] +++ OK, passed 100 tests.
  1007. 853.48 s [vector] dropWhile: OK
  1008. 853.48 s [vector] +++ OK, passed 100 tests.
  1009. 853.48 s [vector] partition: OK
  1010. 853.48 s [vector] +++ OK, passed 100 tests.
  1011. 853.48 s [vector] partitionWith: OK
  1012. 853.48 s [vector] +++ OK, passed 100 tests.
  1013. 853.48 s [vector] span: OK
  1014. 853.48 s [vector] +++ OK, passed 100 tests.
  1015. 853.48 s [vector] break: OK
  1016. 853.48 s [vector] +++ OK, passed 100 tests.
  1017. 853.48 s [vector] spanR: OK
  1018. 853.48 s [vector] +++ OK, passed 100 tests.
  1019. 853.48 s [vector] breakR: OK
  1020. 853.48 s [vector] +++ OK, passed 100 tests.
  1021. 853.48 s [vector] groupBy: OK
  1022. 853.48 s [vector] +++ OK, passed 100 tests.
  1023. 853.48 s [vector] elem: OK
  1024. 853.48 s [vector] +++ OK, passed 100 tests.
  1025. 853.48 s [vector] notElem: OK
  1026. 853.48 s [vector] +++ OK, passed 100 tests.
  1027. 853.48 s [vector] find: OK
  1028. 853.48 s [vector] +++ OK, passed 100 tests.
  1029. 853.48 s [vector] findIndex: OK
  1030. 853.48 s [vector] +++ OK, passed 100 tests.
  1031. 853.48 s [vector] findIndexR: OK
  1032. 853.48 s [vector] +++ OK, passed 100 tests.
  1033. 853.48 s [vector] findIndices: OK
  1034. 853.48 s [vector] +++ OK, passed 100 tests.
  1035. 853.48 s [vector] elemIndex: OK
  1036. 853.48 s [vector] +++ OK, passed 100 tests.
  1037. 853.48 s [vector] elemIndices: OK
  1038. 853.48 s [vector] +++ OK, passed 100 tests.
  1039. 853.48 s [vector] foldl: OK
  1040. 853.48 s [vector] +++ OK, passed 100 tests.
  1041. 853.48 s [vector] foldl1: OK
  1042. 853.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1043. 853.48 s [vector] foldl': OK
  1044. 853.48 s [vector] +++ OK, passed 100 tests.
  1045. 853.48 s [vector] foldl1': OK
  1046. 853.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1047. 853.48 s [vector] foldr: OK
  1048. 853.49 s [vector] +++ OK, passed 100 tests.
  1049. 853.49 s [vector] foldr1: OK
  1050. 853.49 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1051. 853.49 s [vector] foldr': OK
  1052. 853.49 s [vector] +++ OK, passed 100 tests.
  1053. 853.49 s [vector] foldr1': OK
  1054. 853.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1055. 853.49 s [vector] ifoldl: OK
  1056. 853.49 s [vector] +++ OK, passed 100 tests.
  1057. 853.49 s [vector] ifoldl': OK
  1058. 853.49 s [vector] +++ OK, passed 100 tests.
  1059. 853.49 s [vector] ifoldr: OK
  1060. 853.49 s [vector] +++ OK, passed 100 tests.
  1061. 853.49 s [vector] ifoldr': OK
  1062. 853.49 s [vector] +++ OK, passed 100 tests.
  1063. 853.49 s [vector] ifoldM: OK
  1064. 853.49 s [vector] +++ OK, passed 100 tests.
  1065. 853.49 s [vector] ifoldM': OK
  1066. 853.49 s [vector] +++ OK, passed 100 tests.
  1067. 853.49 s [vector] ifoldM_: OK (0.02s)
  1068. 853.49 s [vector] +++ OK, passed 100 tests.
  1069. 853.49 s [vector] ifoldM'_: OK (0.02s)
  1070. 853.49 s [vector] +++ OK, passed 100 tests.
  1071. 853.49 s [vector] all: OK
  1072. 853.49 s [vector] +++ OK, passed 100 tests.
  1073. 853.49 s [vector] any: OK
  1074. 853.49 s [vector] +++ OK, passed 100 tests.
  1075. 853.49 s [vector] prescanl: OK
  1076. 853.49 s [vector] +++ OK, passed 100 tests.
  1077. 853.49 s [vector] prescanl': OK
  1078. 853.49 s [vector] +++ OK, passed 100 tests.
  1079. 853.49 s [vector] postscanl: OK
  1080. 853.49 s [vector] +++ OK, passed 100 tests.
  1081. 853.49 s [vector] postscanl': OK
  1082. 853.49 s [vector] +++ OK, passed 100 tests.
  1083. 853.49 s [vector] scanl: OK
  1084. 853.49 s [vector] +++ OK, passed 100 tests.
  1085. 853.49 s [vector] scanl': OK
  1086. 853.49 s [vector] +++ OK, passed 100 tests.
  1087. 853.49 s [vector] scanl1: OK
  1088. 853.49 s [vector] +++ OK, passed 100 tests.
  1089. 853.49 s [vector] scanl1': OK
  1090. 853.49 s [vector] +++ OK, passed 100 tests.
  1091. 853.49 s [vector] iscanl: OK
  1092. 853.49 s [vector] +++ OK, passed 100 tests.
  1093. 853.49 s [vector] iscanl': OK
  1094. 853.49 s [vector] +++ OK, passed 100 tests.
  1095. 853.49 s [vector] prescanr: OK
  1096. 853.49 s [vector] +++ OK, passed 100 tests.
  1097. 853.49 s [vector] prescanr': OK
  1098. 853.49 s [vector] +++ OK, passed 100 tests.
  1099. 853.49 s [vector] postscanr: OK (0.01s)
  1100. 853.49 s [vector] +++ OK, passed 100 tests.
  1101. 853.49 s [vector] postscanr': OK
  1102. 853.49 s [vector] +++ OK, passed 100 tests.
  1103. 853.49 s [vector] scanr: OK
  1104. 853.49 s [vector] +++ OK, passed 100 tests.
  1105. 853.49 s [vector] scanr': OK
  1106. 853.49 s [vector] +++ OK, passed 100 tests.
  1107. 853.49 s [vector] scanr1: OK
  1108. 853.49 s [vector] +++ OK, passed 100 tests.
  1109. 853.49 s [vector] scanr1': OK
  1110. 853.49 s [vector] +++ OK, passed 100 tests.
  1111. 853.49 s [vector] iscanr: OK
  1112. 853.49 s [vector] +++ OK, passed 100 tests.
  1113. 853.49 s [vector] iscanr': OK
  1114. 853.49 s [vector] +++ OK, passed 100 tests.
  1115. 853.49 s [vector] mut_read: OK
  1116. 853.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  1117. 853.49 s [vector] mut_write: OK
  1118. 853.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1119. 853.49 s [vector] mut_modify: OK
  1120. 853.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1121. 853.49 s [vector] mut_generate: OK
  1122. 853.49 s [vector] +++ OK, passed 100 tests.
  1123. 853.49 s [vector] mut_generateM: OK (0.01s)
  1124. 853.49 s [vector] +++ OK, passed 100 tests.
  1125. 853.49 s [vector] mut_mapM_: OK (0.02s)
  1126. 853.49 s [vector] +++ OK, passed 100 tests.
  1127. 853.49 s [vector] mut_imapM_: OK (0.02s)
  1128. 853.49 s [vector] +++ OK, passed 100 tests.
  1129. 853.49 s [vector] mut_forM_: OK (0.03s)
  1130. 853.49 s [vector] +++ OK, passed 100 tests.
  1131. 853.49 s [vector] mut_iforM_: OK (0.02s)
  1132. 853.49 s [vector] +++ OK, passed 100 tests.
  1133. 853.49 s [vector] mut_foldr: OK
  1134. 853.49 s [vector] +++ OK, passed 100 tests.
  1135. 853.49 s [vector] mut_foldr': OK
  1136. 853.49 s [vector] +++ OK, passed 100 tests.
  1137. 853.49 s [vector] mut_foldl: OK
  1138. 853.49 s [vector] +++ OK, passed 100 tests.
  1139. 853.49 s [vector] mut_foldl': OK
  1140. 853.49 s [vector] +++ OK, passed 100 tests.
  1141. 853.49 s [vector] mut_ifoldr: OK
  1142. 853.49 s [vector] +++ OK, passed 100 tests.
  1143. 853.49 s [vector] mut_ifoldr': OK
  1144. 853.49 s [vector] +++ OK, passed 100 tests.
  1145. 853.49 s [vector] mut_ifoldl: OK
  1146. 853.49 s [vector] +++ OK, passed 100 tests.
  1147. 853.49 s [vector] mut_ifoldl': OK
  1148. 853.49 s [vector] +++ OK, passed 100 tests.
  1149. 853.49 s [vector] mut_foldM: OK
  1150. 853.49 s [vector] +++ OK, passed 100 tests.
  1151. 853.49 s [vector] mut_foldM': OK
  1152. 853.49 s [vector] +++ OK, passed 100 tests.
  1153. 853.49 s [vector] mut_foldrM: OK
  1154. 853.49 s [vector] +++ OK, passed 100 tests.
  1155. 853.49 s [vector] mut_foldrM': OK
  1156. 853.49 s [vector] +++ OK, passed 100 tests.
  1157. 853.49 s [vector] mut_ifoldM: OK
  1158. 853.49 s [vector] +++ OK, passed 100 tests.
  1159. 853.49 s [vector] mut_ifoldM': OK
  1160. 853.49 s [vector] +++ OK, passed 100 tests.
  1161. 853.49 s [vector] mut_ifoldrM: OK
  1162. 853.49 s [vector] +++ OK, passed 100 tests.
  1163. 853.49 s [vector] mut_ifoldrM': OK
  1164. 853.49 s [vector] +++ OK, passed 100 tests.
  1165. 853.49 s [vector] compare: OK
  1166. 853.49 s [vector] +++ OK, passed 100 tests.
  1167. 853.49 s [vector] maximum: OK
  1168. 853.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1169. 853.49 s [vector] minimum: OK
  1170. 853.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1171. 853.49 s [vector] minIndex: OK
  1172. 853.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1173. 853.49 s [vector] maxIndex: OK
  1174. 853.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1175. 853.49 s [vector] maximumBy: OK
  1176. 853.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1177. 853.49 s [vector] minimumBy: OK
  1178. 853.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1179. 853.49 s [vector] maximumOn: OK
  1180. 853.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1181. 853.49 s [vector] minimumOn: OK
  1182. 853.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1183. 853.49 s [vector] maxIndexBy: OK
  1184. 853.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1185. 853.49 s [vector] minIndexBy: OK
  1186. 853.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1187. 853.49 s [vector] ListFirstMaxIndexWins: OK
  1188. 853.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1189. 853.49 s [vector] FalseListFirstMaxIndexWins: OK
  1190. 853.49 s [vector] +++ OK, failed as expected. (after 1 test):
  1191. 853.49 s [vector] Exception:
  1192. 853.49 s [vector] Prelude.foldr1: empty list
  1193. 853.49 s [vector] CallStack (from HasCallStack):
  1194. 853.49 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  1195. 853.49 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  1196. 853.49 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  1197. 853.49 s [vector] []
  1198. 853.49 s [vector] mempty: OK
  1199. 853.49 s [vector] +++ OK, passed 1 test.
  1200. 853.49 s [vector] mappend: OK
  1201. 853.49 s [vector] +++ OK, passed 100 tests.
  1202. 853.49 s [vector] mconcat: OK (0.02s)
  1203. 853.49 s [vector] +++ OK, passed 100 tests.
  1204. 853.49 s [vector] glength: OK
  1205. 853.49 s [vector] +++ OK, passed 100 tests.
  1206. 853.49 s [vector] sum: OK
  1207. 853.49 s [vector] +++ OK, passed 100 tests.
  1208. 853.49 s [vector] product: OK
  1209. 853.49 s [vector] +++ OK, passed 100 tests.
  1210. 853.49 s [vector] enumFromN: OK
  1211. 853.49 s [vector] +++ OK, passed 100 tests.
  1212. 853.49 s [vector] enumFromThenN: OK
  1213. 853.49 s [vector] +++ OK, passed 100 tests.
  1214. 853.49 s [vector] enumFromTo: OK
  1215. 853.49 s [vector] +++ OK, passed 100 tests.
  1216. 853.49 s [vector] enumFromThenTo: OK
  1217. 853.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1218. 853.49 s [vector] Data.Vector.Storable.Vector (Double)
  1219. 853.49 s [vector] fromList.toList == id: OK
  1220. 853.49 s [vector] +++ OK, passed 100 tests.
  1221. 853.49 s [vector] toList.fromList == id: OK
  1222. 853.49 s [vector] +++ OK, passed 100 tests.
  1223. 853.49 s [vector] unstream.stream == id: OK
  1224. 853.49 s [vector] +++ OK, passed 100 tests.
  1225. 853.49 s [vector] stream.unstream == id: OK
  1226. 853.49 s [vector] +++ OK, passed 100 tests.
  1227. 853.49 s [vector] eq: OK
  1228. 853.49 s [vector] +++ OK, passed 100 tests.
  1229. 853.49 s [vector] length: OK
  1230. 853.49 s [vector] +++ OK, passed 100 tests.
  1231. 853.49 s [vector] null: OK
  1232. 853.49 s [vector] +++ OK, passed 100 tests.
  1233. 853.49 s [vector] index: OK
  1234. 853.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1235. 853.49 s [vector] safeIndex: OK
  1236. 853.49 s [vector] +++ OK, passed 100 tests.
  1237. 853.49 s [vector] head: OK
  1238. 853.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1239. 853.49 s [vector] last: OK
  1240. 853.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1241. 853.49 s [vector] unsafeIndex: OK
  1242. 853.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1243. 853.49 s [vector] unsafeHead: OK
  1244. 853.49 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1245. 853.49 s [vector] unsafeLast: OK
  1246. 853.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1247. 853.49 s [vector] slice: OK
  1248. 853.49 s [vector] +++ OK, passed 100 tests.
  1249. 853.49 s [vector] init: OK
  1250. 853.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1251. 853.49 s [vector] tail: OK
  1252. 853.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1253. 853.49 s [vector] take: OK
  1254. 853.49 s [vector] +++ OK, passed 100 tests.
  1255. 853.49 s [vector] drop: OK
  1256. 853.49 s [vector] +++ OK, passed 100 tests.
  1257. 853.49 s [vector] splitAt: OK
  1258. 853.49 s [vector] +++ OK, passed 100 tests.
  1259. 853.49 s [vector] empty: OK
  1260. 853.49 s [vector] +++ OK, passed 1 test.
  1261. 853.49 s [vector] singleton: OK
  1262. 853.49 s [vector] +++ OK, passed 100 tests.
  1263. 853.49 s [vector] replicate: OK
  1264. 853.49 s [vector] +++ OK, passed 100 tests.
  1265. 853.49 s [vector] generate: OK
  1266. 853.49 s [vector] +++ OK, passed 100 tests.
  1267. 853.49 s [vector] iterateN: OK
  1268. 853.49 s [vector] +++ OK, passed 100 tests.
  1269. 853.49 s [vector] iterateNM: OK (0.06s)
  1270. 853.49 s [vector] +++ OK, passed 100 tests.
  1271. 853.49 s [vector] generateM: OK (0.03s)
  1272. 853.49 s [vector] +++ OK, passed 100 tests.
  1273. 853.49 s [vector] replicateM: OK
  1274. 853.49 s [vector] +++ OK, passed 100 tests.
  1275. 853.49 s [vector] create: OK
  1276. 853.49 s [vector] +++ OK, passed 100 tests.
  1277. 853.49 s [vector] createT: OK
  1278. 853.49 s [vector] +++ OK, passed 100 tests.
  1279. 853.49 s [vector] unfoldr: OK
  1280. 853.49 s [vector] +++ OK, passed 100 tests.
  1281. 853.49 s [vector] unfoldrN: OK
  1282. 853.49 s [vector] +++ OK, passed 100 tests.
  1283. 853.49 s [vector] unfoldrExactN: OK
  1284. 853.49 s [vector] +++ OK, passed 100 tests.
  1285. 853.49 s [vector] unfoldrM: OK
  1286. 853.49 s [vector] +++ OK, passed 100 tests.
  1287. 853.49 s [vector] unfoldrNM: OK (0.02s)
  1288. 853.49 s [vector] +++ OK, passed 100 tests.
  1289. 853.49 s [vector] unfoldrExactNM: OK (0.05s)
  1290. 853.49 s [vector] +++ OK, passed 100 tests.
  1291. 853.49 s [vector] constructN: OK (0.02s)
  1292. 853.49 s [vector] +++ OK, passed 100 tests.
  1293. 853.49 s [vector] constructrN: OK (0.02s)
  1294. 853.49 s [vector] +++ OK, passed 100 tests.
  1295. 853.49 s [vector] cons: OK
  1296. 853.49 s [vector] +++ OK, passed 100 tests.
  1297. 853.49 s [vector] snoc: OK
  1298. 853.49 s [vector] +++ OK, passed 100 tests.
  1299. 853.49 s [vector] append: OK
  1300. 853.49 s [vector] +++ OK, passed 100 tests.
  1301. 853.49 s [vector] concat: OK (0.03s)
  1302. 853.49 s [vector] +++ OK, passed 100 tests.
  1303. 853.49 s [vector] force: OK
  1304. 853.49 s [vector] +++ OK, passed 100 tests.
  1305. 853.49 s [vector] upd: OK
  1306. 853.49 s [vector] +++ OK, passed 100 tests.
  1307. 853.49 s [vector] accum: OK (0.02s)
  1308. 853.49 s [vector] +++ OK, passed 100 tests.
  1309. 853.49 s [vector] reverse: OK
  1310. 853.49 s [vector] +++ OK, passed 100 tests.
  1311. 853.49 s [vector] backpermute: OK
  1312. 853.49 s [vector] +++ OK, passed 100 tests.
  1313. 853.49 s [vector] map: OK
  1314. 853.49 s [vector] +++ OK, passed 100 tests.
  1315. 853.49 s [vector] imap: OK
  1316. 853.49 s [vector] +++ OK, passed 100 tests.
  1317. 853.49 s [vector] concatMap: OK
  1318. 853.49 s [vector] +++ OK, passed 100 tests.
  1319. 853.49 s [vector] mapM: OK
  1320. 853.49 s [vector] +++ OK, passed 100 tests.
  1321. 853.49 s [vector] mapM_: OK (0.04s)
  1322. 853.49 s [vector] +++ OK, passed 100 tests.
  1323. 853.49 s [vector] forM: OK
  1324. 853.49 s [vector] +++ OK, passed 100 tests.
  1325. 853.49 s [vector] forM_: OK (0.03s)
  1326. 853.49 s [vector] +++ OK, passed 100 tests.
  1327. 853.49 s [vector] imapM: OK
  1328. 853.49 s [vector] +++ OK, passed 100 tests.
  1329. 853.49 s [vector] imapM_: OK (0.04s)
  1330. 853.49 s [vector] +++ OK, passed 100 tests.
  1331. 853.49 s [vector] zipWith: OK (0.01s)
  1332. 853.49 s [vector] +++ OK, passed 100 tests.
  1333. 853.49 s [vector] zipWith3: OK (0.01s)
  1334. 853.49 s [vector] +++ OK, passed 100 tests.
  1335. 853.49 s [vector] izipWith: OK (0.01s)
  1336. 853.49 s [vector] +++ OK, passed 100 tests.
  1337. 853.49 s [vector] izipWith3: OK (0.01s)
  1338. 853.49 s [vector] +++ OK, passed 100 tests.
  1339. 853.49 s [vector] izipWithM: OK (0.01s)
  1340. 853.49 s [vector] +++ OK, passed 100 tests.
  1341. 853.49 s [vector] izipWithM_: OK (0.04s)
  1342. 853.49 s [vector] +++ OK, passed 100 tests.
  1343. 853.49 s [vector] zipWithM: OK (0.01s)
  1344. 853.49 s [vector] +++ OK, passed 100 tests.
  1345. 853.49 s [vector] zipWithM_: OK (0.04s)
  1346. 853.49 s [vector] +++ OK, passed 100 tests.
  1347. 853.49 s [vector] filter: OK
  1348. 853.49 s [vector] +++ OK, passed 100 tests.
  1349. 853.49 s [vector] ifilter: OK
  1350. 853.49 s [vector] +++ OK, passed 100 tests.
  1351. 853.49 s [vector] filterM: OK (0.05s)
  1352. 853.49 s [vector] +++ OK, passed 100 tests.
  1353. 853.50 s [vector] uniq: OK
  1354. 853.50 s [vector] +++ OK, passed 100 tests.
  1355. 853.50 s [vector] mapMaybe: OK
  1356. 853.50 s [vector] +++ OK, passed 100 tests.
  1357. 853.50 s [vector] imapMaybe: OK
  1358. 853.50 s [vector] +++ OK, passed 100 tests.
  1359. 853.50 s [vector] takeWhile: OK
  1360. 853.50 s [vector] +++ OK, passed 100 tests.
  1361. 853.50 s [vector] dropWhile: OK
  1362. 853.50 s [vector] +++ OK, passed 100 tests.
  1363. 853.50 s [vector] partition: OK
  1364. 853.50 s [vector] +++ OK, passed 100 tests.
  1365. 853.50 s [vector] partitionWith: OK
  1366. 853.50 s [vector] +++ OK, passed 100 tests.
  1367. 853.50 s [vector] span: OK
  1368. 853.50 s [vector] +++ OK, passed 100 tests.
  1369. 853.50 s [vector] break: OK
  1370. 853.50 s [vector] +++ OK, passed 100 tests.
  1371. 853.50 s [vector] spanR: OK
  1372. 853.50 s [vector] +++ OK, passed 100 tests.
  1373. 853.50 s [vector] breakR: OK
  1374. 853.50 s [vector] +++ OK, passed 100 tests.
  1375. 853.50 s [vector] groupBy: OK (0.01s)
  1376. 853.50 s [vector] +++ OK, passed 100 tests.
  1377. 853.50 s [vector] elem: OK
  1378. 853.50 s [vector] +++ OK, passed 100 tests.
  1379. 853.50 s [vector] notElem: OK
  1380. 853.50 s [vector] +++ OK, passed 100 tests.
  1381. 853.50 s [vector] find: OK
  1382. 853.50 s [vector] +++ OK, passed 100 tests.
  1383. 853.50 s [vector] findIndex: OK
  1384. 853.50 s [vector] +++ OK, passed 100 tests.
  1385. 853.50 s [vector] findIndexR: OK
  1386. 853.50 s [vector] +++ OK, passed 100 tests.
  1387. 853.50 s [vector] findIndices: OK
  1388. 853.50 s [vector] +++ OK, passed 100 tests.
  1389. 853.50 s [vector] elemIndex: OK
  1390. 853.50 s [vector] +++ OK, passed 100 tests.
  1391. 853.50 s [vector] elemIndices: OK
  1392. 853.50 s [vector] +++ OK, passed 100 tests.
  1393. 853.50 s [vector] foldl: OK (0.01s)
  1394. 853.50 s [vector] +++ OK, passed 100 tests.
  1395. 853.50 s [vector] foldl1: OK (0.01s)
  1396. 853.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1397. 853.50 s [vector] foldl': OK (0.02s)
  1398. 853.50 s [vector] +++ OK, passed 100 tests.
  1399. 853.50 s [vector] foldl1': OK (0.02s)
  1400. 853.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1401. 853.50 s [vector] foldr: OK (0.02s)
  1402. 853.50 s [vector] +++ OK, passed 100 tests.
  1403. 853.50 s [vector] foldr1: OK (0.02s)
  1404. 853.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1405. 853.50 s [vector] foldr': OK (0.02s)
  1406. 853.50 s [vector] +++ OK, passed 100 tests.
  1407. 853.50 s [vector] foldr1': OK (0.02s)
  1408. 853.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1409. 853.50 s [vector] ifoldl: OK (0.02s)
  1410. 853.50 s [vector] +++ OK, passed 100 tests.
  1411. 853.50 s [vector] ifoldl': OK (0.02s)
  1412. 853.50 s [vector] +++ OK, passed 100 tests.
  1413. 853.50 s [vector] ifoldr: OK (0.02s)
  1414. 853.50 s [vector] +++ OK, passed 100 tests.
  1415. 853.50 s [vector] ifoldr': OK (0.02s)
  1416. 853.50 s [vector] +++ OK, passed 100 tests.
  1417. 853.50 s [vector] ifoldM: OK (0.02s)
  1418. 853.50 s [vector] +++ OK, passed 100 tests.
  1419. 853.50 s [vector] ifoldM': OK (0.02s)
  1420. 853.50 s [vector] +++ OK, passed 100 tests.
  1421. 853.50 s [vector] ifoldM_: OK (0.04s)
  1422. 853.50 s [vector] +++ OK, passed 100 tests.
  1423. 853.50 s [vector] ifoldM'_: OK (0.04s)
  1424. 853.50 s [vector] +++ OK, passed 100 tests.
  1425. 853.50 s [vector] all: OK
  1426. 853.50 s [vector] +++ OK, passed 100 tests.
  1427. 853.50 s [vector] any: OK
  1428. 853.50 s [vector] +++ OK, passed 100 tests.
  1429. 853.50 s [vector] prescanl: OK (0.02s)
  1430. 853.50 s [vector] +++ OK, passed 100 tests.
  1431. 853.50 s [vector] prescanl': OK
  1432. 853.50 s [vector] +++ OK, passed 100 tests.
  1433. 853.50 s [vector] postscanl: OK (0.02s)
  1434. 853.50 s [vector] +++ OK, passed 100 tests.
  1435. 853.50 s [vector] postscanl': OK (0.02s)
  1436. 853.50 s [vector] +++ OK, passed 100 tests.
  1437. 853.50 s [vector] scanl: OK (0.02s)
  1438. 853.50 s [vector] +++ OK, passed 100 tests.
  1439. 853.50 s [vector] scanl': OK (0.02s)
  1440. 853.50 s [vector] +++ OK, passed 100 tests.
  1441. 853.50 s [vector] scanl1: OK (0.01s)
  1442. 853.50 s [vector] +++ OK, passed 100 tests.
  1443. 853.50 s [vector] scanl1': OK (0.02s)
  1444. 853.50 s [vector] +++ OK, passed 100 tests.
  1445. 853.50 s [vector] iscanl: OK (0.02s)
  1446. 853.50 s [vector] +++ OK, passed 100 tests.
  1447. 853.50 s [vector] iscanl': OK (0.02s)
  1448. 853.50 s [vector] +++ OK, passed 100 tests.
  1449. 853.50 s [vector] prescanr: OK (0.02s)
  1450. 853.50 s [vector] +++ OK, passed 100 tests.
  1451. 853.50 s [vector] prescanr': OK (0.03s)
  1452. 853.50 s [vector] +++ OK, passed 100 tests.
  1453. 853.50 s [vector] postscanr: OK (0.02s)
  1454. 853.50 s [vector] +++ OK, passed 100 tests.
  1455. 853.50 s [vector] postscanr': OK (0.01s)
  1456. 853.50 s [vector] +++ OK, passed 100 tests.
  1457. 853.50 s [vector] scanr: OK (0.02s)
  1458. 853.50 s [vector] +++ OK, passed 100 tests.
  1459. 853.50 s [vector] scanr': OK (0.02s)
  1460. 853.50 s [vector] +++ OK, passed 100 tests.
  1461. 853.50 s [vector] scanr1: OK (0.01s)
  1462. 853.50 s [vector] +++ OK, passed 100 tests.
  1463. 853.50 s [vector] scanr1': OK (0.02s)
  1464. 853.50 s [vector] +++ OK, passed 100 tests.
  1465. 853.50 s [vector] iscanr: OK (0.02s)
  1466. 853.50 s [vector] +++ OK, passed 100 tests.
  1467. 853.50 s [vector] iscanr': OK (0.02s)
  1468. 853.50 s [vector] +++ OK, passed 100 tests.
  1469. 853.50 s [vector] mut_read: OK
  1470. 853.50 s [vector] +++ OK, passed 100 tests; 11 discarded.
  1471. 853.50 s [vector] mut_write: OK
  1472. 853.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1473. 853.50 s [vector] mut_modify: OK
  1474. 853.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1475. 853.50 s [vector] mut_generate: OK
  1476. 853.50 s [vector] +++ OK, passed 100 tests.
  1477. 853.50 s [vector] mut_generateM: OK (0.01s)
  1478. 853.50 s [vector] +++ OK, passed 100 tests.
  1479. 853.50 s [vector] mut_mapM_: OK (0.04s)
  1480. 853.50 s [vector] +++ OK, passed 100 tests.
  1481. 853.50 s [vector] mut_imapM_: OK (0.04s)
  1482. 853.50 s [vector] +++ OK, passed 100 tests.
  1483. 853.50 s [vector] mut_forM_: OK (0.05s)
  1484. 853.50 s [vector] +++ OK, passed 100 tests.
  1485. 853.50 s [vector] mut_iforM_: OK (0.04s)
  1486. 853.50 s [vector] +++ OK, passed 100 tests.
  1487. 853.50 s [vector] mut_foldr: OK (0.02s)
  1488. 853.50 s [vector] +++ OK, passed 100 tests.
  1489. 853.50 s [vector] mut_foldr': OK (0.01s)
  1490. 853.50 s [vector] +++ OK, passed 100 tests.
  1491. 853.50 s [vector] mut_foldl: OK (0.01s)
  1492. 853.50 s [vector] +++ OK, passed 100 tests.
  1493. 853.50 s [vector] mut_foldl': OK (0.01s)
  1494. 853.50 s [vector] +++ OK, passed 100 tests.
  1495. 853.50 s [vector] mut_ifoldr: OK (0.01s)
  1496. 853.50 s [vector] +++ OK, passed 100 tests.
  1497. 853.50 s [vector] mut_ifoldr': OK (0.02s)
  1498. 853.50 s [vector] +++ OK, passed 100 tests.
  1499. 853.50 s [vector] mut_ifoldl: OK (0.02s)
  1500. 853.50 s [vector] +++ OK, passed 100 tests.
  1501. 853.50 s [vector] mut_ifoldl': OK (0.02s)
  1502. 853.50 s [vector] +++ OK, passed 100 tests.
  1503. 853.50 s [vector] mut_foldM: OK (0.01s)
  1504. 853.50 s [vector] +++ OK, passed 100 tests.
  1505. 853.50 s [vector] mut_foldM': OK (0.02s)
  1506. 853.50 s [vector] +++ OK, passed 100 tests.
  1507. 853.50 s [vector] mut_foldrM: OK (0.01s)
  1508. 853.50 s [vector] +++ OK, passed 100 tests.
  1509. 853.50 s [vector] mut_foldrM': OK (0.02s)
  1510. 853.50 s [vector] +++ OK, passed 100 tests.
  1511. 853.50 s [vector] mut_ifoldM: OK (0.02s)
  1512. 853.50 s [vector] +++ OK, passed 100 tests.
  1513. 853.50 s [vector] mut_ifoldM': OK (0.02s)
  1514. 853.50 s [vector] +++ OK, passed 100 tests.
  1515. 853.50 s [vector] mut_ifoldrM: OK (0.02s)
  1516. 853.50 s [vector] +++ OK, passed 100 tests.
  1517. 853.50 s [vector] mut_ifoldrM': OK (0.02s)
  1518. 853.50 s [vector] +++ OK, passed 100 tests.
  1519. 853.50 s [vector] compare: OK
  1520. 853.50 s [vector] +++ OK, passed 100 tests.
  1521. 853.50 s [vector] maximum: OK
  1522. 853.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1523. 853.50 s [vector] minimum: OK
  1524. 853.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1525. 853.50 s [vector] minIndex: OK
  1526. 853.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1527. 853.50 s [vector] maxIndex: OK
  1528. 853.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1529. 853.50 s [vector] maximumBy: OK
  1530. 853.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1531. 853.50 s [vector] minimumBy: OK
  1532. 853.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1533. 853.50 s [vector] maximumOn: OK
  1534. 853.50 s [vector] +++ OK, passed 100 tests; 11 discarded.
  1535. 853.50 s [vector] minimumOn: OK
  1536. 853.50 s [vector] +++ OK, passed 100 tests; 23 discarded.
  1537. 853.50 s [vector] maxIndexBy: OK
  1538. 853.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1539. 853.50 s [vector] minIndexBy: OK
  1540. 853.50 s [vector] +++ OK, passed 100 tests; 21 discarded.
  1541. 853.50 s [vector] ListFirstMaxIndexWins: OK
  1542. 853.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1543. 853.50 s [vector] FalseListFirstMaxIndexWins: OK
  1544. 853.50 s [vector] +++ OK, failed as expected. (after 1 test):
  1545. 853.50 s [vector] Exception:
  1546. 853.50 s [vector] Prelude.foldr1: empty list
  1547. 853.50 s [vector] CallStack (from HasCallStack):
  1548. 853.50 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  1549. 853.50 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  1550. 853.50 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  1551. 853.50 s [vector] []
  1552. 853.50 s [vector] mempty: OK
  1553. 853.50 s [vector] +++ OK, passed 1 test.
  1554. 853.50 s [vector] mappend: OK
  1555. 853.50 s [vector] +++ OK, passed 100 tests.
  1556. 853.50 s [vector] mconcat: OK (0.03s)
  1557. 853.50 s [vector] +++ OK, passed 100 tests.
  1558. 853.50 s [vector] glength: OK
  1559. 853.50 s [vector] +++ OK, passed 100 tests.
  1560. 853.50 s [vector] sum: OK
  1561. 853.50 s [vector] +++ OK, passed 100 tests.
  1562. 853.50 s [vector] product: OK
  1563. 853.50 s [vector] +++ OK, passed 100 tests.
  1564. 853.50 s [vector] enumFromN: OK
  1565. 853.50 s [vector] +++ OK, passed 100 tests.
  1566. 853.50 s [vector] enumFromThenN: OK
  1567. 853.50 s [vector] +++ OK, passed 100 tests.
  1568. 853.50 s [vector] enumFromTo: OK
  1569. 853.50 s [vector] +++ OK, passed 100 tests.
  1570. 853.50 s [vector] enumFromThenTo: OK
  1571. 853.51 s [vector] +++ OK, passed 100 tests; 6 discarded.
  1572. 853.51 s [vector] unstream
  1573. 853.51 s [vector] unstream == vunstream (exact): OK
  1574. 853.51 s [vector] +++ OK, passed 100 tests.
  1575. 853.51 s [vector] unstream == vunstream (unknown): OK
  1576. 853.51 s [vector] +++ OK, passed 100 tests.
  1577. 853.51 s [vector] unstreamR ~= vunstream (exact): OK
  1578. 853.51 s [vector] +++ OK, passed 100 tests.
  1579. 853.51 s [vector] unstreamR ~= vunstream (unknown): OK
  1580. 853.51 s [vector] +++ OK, passed 100 tests.
  1581. 853.51 s [vector] Tests.Vector.Strict
  1582. 853.51 s [vector] Bool
  1583. 853.51 s [vector] fromList.toList == id: OK
  1584. 853.51 s [vector] +++ OK, passed 100 tests.
  1585. 853.51 s [vector] toList.fromList == id: OK
  1586. 853.51 s [vector] +++ OK, passed 100 tests.
  1587. 853.51 s [vector] unstream.stream == id: OK
  1588. 853.51 s [vector] +++ OK, passed 100 tests.
  1589. 853.51 s [vector] stream.unstream == id: OK
  1590. 853.51 s [vector] +++ OK, passed 100 tests.
  1591. 853.51 s [vector] eq: OK
  1592. 853.51 s [vector] +++ OK, passed 100 tests.
  1593. 853.51 s [vector] length: OK
  1594. 853.51 s [vector] +++ OK, passed 100 tests.
  1595. 853.51 s [vector] null: OK
  1596. 853.51 s [vector] +++ OK, passed 100 tests.
  1597. 853.51 s [vector] index: OK
  1598. 853.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1599. 853.51 s [vector] safeIndex: OK
  1600. 853.51 s [vector] +++ OK, passed 100 tests.
  1601. 853.51 s [vector] head: OK
  1602. 853.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1603. 853.51 s [vector] last: OK
  1604. 853.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1605. 853.51 s [vector] unsafeIndex: OK
  1606. 853.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1607. 853.51 s [vector] unsafeHead: OK
  1608. 853.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1609. 853.51 s [vector] unsafeLast: OK
  1610. 853.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1611. 853.51 s [vector] slice: OK
  1612. 853.51 s [vector] +++ OK, passed 100 tests.
  1613. 853.51 s [vector] init: OK
  1614. 853.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1615. 853.51 s [vector] tail: OK
  1616. 853.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1617. 853.51 s [vector] take: OK
  1618. 853.51 s [vector] +++ OK, passed 100 tests.
  1619. 853.51 s [vector] drop: OK
  1620. 853.51 s [vector] +++ OK, passed 100 tests.
  1621. 853.51 s [vector] splitAt: OK
  1622. 853.51 s [vector] +++ OK, passed 100 tests.
  1623. 853.51 s [vector] empty: OK
  1624. 853.51 s [vector] +++ OK, passed 1 test.
  1625. 853.51 s [vector] singleton: OK
  1626. 853.51 s [vector] +++ OK, passed 100 tests.
  1627. 853.51 s [vector] replicate: OK
  1628. 853.51 s [vector] +++ OK, passed 100 tests.
  1629. 853.51 s [vector] generate: OK
  1630. 853.51 s [vector] +++ OK, passed 100 tests.
  1631. 853.51 s [vector] iterateN: OK
  1632. 853.51 s [vector] +++ OK, passed 100 tests.
  1633. 853.51 s [vector] iterateNM: OK (0.04s)
  1634. 853.51 s [vector] +++ OK, passed 100 tests.
  1635. 853.51 s [vector] generateM: OK (0.01s)
  1636. 853.51 s [vector] +++ OK, passed 100 tests.
  1637. 853.51 s [vector] replicateM: OK
  1638. 853.51 s [vector] +++ OK, passed 100 tests.
  1639. 853.51 s [vector] create: OK
  1640. 853.51 s [vector] +++ OK, passed 100 tests.
  1641. 853.51 s [vector] createT: OK
  1642. 853.51 s [vector] +++ OK, passed 100 tests.
  1643. 853.51 s [vector] unfoldr: OK
  1644. 853.51 s [vector] +++ OK, passed 100 tests.
  1645. 853.51 s [vector] unfoldrN: OK
  1646. 853.51 s [vector] +++ OK, passed 100 tests.
  1647. 853.51 s [vector] unfoldrExactN: OK
  1648. 853.51 s [vector] +++ OK, passed 100 tests.
  1649. 853.51 s [vector] unfoldrM: OK (0.02s)
  1650. 853.51 s [vector] +++ OK, passed 100 tests.
  1651. 853.51 s [vector] unfoldrNM: OK
  1652. 853.51 s [vector] +++ OK, passed 100 tests.
  1653. 853.51 s [vector] unfoldrExactNM: OK (0.02s)
  1654. 853.51 s [vector] +++ OK, passed 100 tests.
  1655. 853.51 s [vector] constructN: OK
  1656. 853.51 s [vector] +++ OK, passed 100 tests.
  1657. 853.51 s [vector] constructrN: OK
  1658. 853.51 s [vector] +++ OK, passed 100 tests.
  1659. 853.51 s [vector] cons: OK
  1660. 853.51 s [vector] +++ OK, passed 100 tests.
  1661. 853.51 s [vector] snoc: OK
  1662. 853.51 s [vector] +++ OK, passed 100 tests.
  1663. 853.51 s [vector] append: OK
  1664. 853.51 s [vector] +++ OK, passed 100 tests.
  1665. 853.51 s [vector] concat: OK
  1666. 853.51 s [vector] +++ OK, passed 100 tests.
  1667. 853.51 s [vector] force: OK
  1668. 853.51 s [vector] +++ OK, passed 100 tests.
  1669. 853.51 s [vector] upd: OK
  1670. 853.51 s [vector] +++ OK, passed 100 tests.
  1671. 853.51 s [vector] accum: OK
  1672. 853.51 s [vector] +++ OK, passed 100 tests.
  1673. 853.51 s [vector] reverse: OK (0.01s)
  1674. 853.51 s [vector] +++ OK, passed 100 tests.
  1675. 853.51 s [vector] backpermute: OK
  1676. 853.51 s [vector] +++ OK, passed 100 tests.
  1677. 853.51 s [vector] map: OK
  1678. 853.51 s [vector] +++ OK, passed 100 tests.
  1679. 853.51 s [vector] imap: OK
  1680. 853.51 s [vector] +++ OK, passed 100 tests.
  1681. 853.51 s [vector] concatMap: OK
  1682. 853.51 s [vector] +++ OK, passed 100 tests.
  1683. 853.51 s [vector] mapM: OK
  1684. 853.51 s [vector] +++ OK, passed 100 tests.
  1685. 853.51 s [vector] mapM_: OK (0.01s)
  1686. 853.51 s [vector] +++ OK, passed 100 tests.
  1687. 853.51 s [vector] forM: OK
  1688. 853.51 s [vector] +++ OK, passed 100 tests.
  1689. 853.51 s [vector] forM_: OK (0.01s)
  1690. 853.51 s [vector] +++ OK, passed 100 tests.
  1691. 853.51 s [vector] imapM: OK
  1692. 853.51 s [vector] +++ OK, passed 100 tests.
  1693. 853.51 s [vector] imapM_: OK (0.01s)
  1694. 853.51 s [vector] +++ OK, passed 100 tests.
  1695. 853.51 s [vector] zipWith: OK
  1696. 853.51 s [vector] +++ OK, passed 100 tests.
  1697. 853.51 s [vector] zipWith3: OK
  1698. 853.51 s [vector] +++ OK, passed 100 tests.
  1699. 853.51 s [vector] izipWith: OK
  1700. 853.51 s [vector] +++ OK, passed 100 tests.
  1701. 853.51 s [vector] izipWith3: OK
  1702. 853.51 s [vector] +++ OK, passed 100 tests.
  1703. 853.51 s [vector] izipWithM: OK
  1704. 853.51 s [vector] +++ OK, passed 100 tests.
  1705. 853.51 s [vector] izipWithM_: OK (0.01s)
  1706. 853.51 s [vector] +++ OK, passed 100 tests.
  1707. 853.51 s [vector] zipWithM: OK
  1708. 853.51 s [vector] +++ OK, passed 100 tests.
  1709. 853.51 s [vector] zipWithM_: OK
  1710. 853.51 s [vector] +++ OK, passed 100 tests.
  1711. 853.51 s [vector] filter: OK
  1712. 853.51 s [vector] +++ OK, passed 100 tests.
  1713. 853.51 s [vector] ifilter: OK
  1714. 853.51 s [vector] +++ OK, passed 100 tests.
  1715. 853.51 s [vector] filterM: OK (0.02s)
  1716. 853.51 s [vector] +++ OK, passed 100 tests.
  1717. 853.51 s [vector] uniq: OK
  1718. 853.51 s [vector] +++ OK, passed 100 tests.
  1719. 853.51 s [vector] mapMaybe: OK
  1720. 853.51 s [vector] +++ OK, passed 100 tests.
  1721. 853.51 s [vector] imapMaybe: OK
  1722. 853.51 s [vector] +++ OK, passed 100 tests.
  1723. 853.51 s [vector] takeWhile: OK
  1724. 853.51 s [vector] +++ OK, passed 100 tests.
  1725. 853.51 s [vector] dropWhile: OK
  1726. 853.51 s [vector] +++ OK, passed 100 tests.
  1727. 853.51 s [vector] partition: OK
  1728. 853.51 s [vector] +++ OK, passed 100 tests.
  1729. 853.51 s [vector] partitionWith: OK
  1730. 853.51 s [vector] +++ OK, passed 100 tests.
  1731. 853.51 s [vector] span: OK
  1732. 853.51 s [vector] +++ OK, passed 100 tests.
  1733. 853.51 s [vector] break: OK
  1734. 853.51 s [vector] +++ OK, passed 100 tests.
  1735. 853.51 s [vector] spanR: OK
  1736. 853.51 s [vector] +++ OK, passed 100 tests.
  1737. 853.51 s [vector] breakR: OK
  1738. 853.51 s [vector] +++ OK, passed 100 tests.
  1739. 853.51 s [vector] groupBy: OK
  1740. 853.51 s [vector] +++ OK, passed 100 tests.
  1741. 853.51 s [vector] elem: OK
  1742. 853.51 s [vector] +++ OK, passed 100 tests.
  1743. 853.51 s [vector] notElem: OK
  1744. 853.51 s [vector] +++ OK, passed 100 tests.
  1745. 853.51 s [vector] find: OK
  1746. 853.51 s [vector] +++ OK, passed 100 tests.
  1747. 853.51 s [vector] findIndex: OK
  1748. 853.51 s [vector] +++ OK, passed 100 tests.
  1749. 853.51 s [vector] findIndexR: OK
  1750. 853.51 s [vector] +++ OK, passed 100 tests.
  1751. 853.51 s [vector] findIndices: OK
  1752. 853.51 s [vector] +++ OK, passed 100 tests.
  1753. 853.51 s [vector] elemIndex: OK
  1754. 853.51 s [vector] +++ OK, passed 100 tests.
  1755. 853.51 s [vector] elemIndices: OK
  1756. 853.51 s [vector] +++ OK, passed 100 tests.
  1757. 853.51 s [vector] foldl: OK
  1758. 853.51 s [vector] +++ OK, passed 100 tests.
  1759. 853.51 s [vector] foldl1: OK
  1760. 853.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1761. 853.51 s [vector] foldl': OK
  1762. 853.51 s [vector] +++ OK, passed 100 tests.
  1763. 853.51 s [vector] foldl1': OK
  1764. 853.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1765. 853.51 s [vector] foldr: OK
  1766. 853.51 s [vector] +++ OK, passed 100 tests.
  1767. 853.51 s [vector] foldr1: OK
  1768. 853.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1769. 853.51 s [vector] foldr': OK
  1770. 853.51 s [vector] +++ OK, passed 100 tests.
  1771. 853.51 s [vector] foldr1': OK
  1772. 853.51 s [vector] +++ OK, passed 100 tests; 22 discarded.
  1773. 853.51 s [vector] ifoldl: OK
  1774. 853.51 s [vector] +++ OK, passed 100 tests.
  1775. 853.51 s [vector] ifoldl': OK
  1776. 853.51 s [vector] +++ OK, passed 100 tests.
  1777. 853.51 s [vector] ifoldr: OK
  1778. 853.51 s [vector] +++ OK, passed 100 tests.
  1779. 853.51 s [vector] ifoldr': OK
  1780. 853.51 s [vector] +++ OK, passed 100 tests.
  1781. 853.51 s [vector] ifoldM: OK
  1782. 853.51 s [vector] +++ OK, passed 100 tests.
  1783. 853.51 s [vector] ifoldM': OK
  1784. 853.51 s [vector] +++ OK, passed 100 tests.
  1785. 853.51 s [vector] ifoldM_: OK (0.01s)
  1786. 853.51 s [vector] +++ OK, passed 100 tests.
  1787. 853.51 s [vector] ifoldM'_: OK (0.01s)
  1788. 853.51 s [vector] +++ OK, passed 100 tests.
  1789. 853.51 s [vector] all: OK
  1790. 853.51 s [vector] +++ OK, passed 100 tests.
  1791. 853.51 s [vector] any: OK
  1792. 853.51 s [vector] +++ OK, passed 100 tests.
  1793. 853.51 s [vector] prescanl: OK
  1794. 853.51 s [vector] +++ OK, passed 100 tests.
  1795. 853.51 s [vector] prescanl': OK
  1796. 853.51 s [vector] +++ OK, passed 100 tests.
  1797. 853.51 s [vector] postscanl: OK
  1798. 853.51 s [vector] +++ OK, passed 100 tests.
  1799. 853.51 s [vector] postscanl': OK
  1800. 853.51 s [vector] +++ OK, passed 100 tests.
  1801. 853.51 s [vector] scanl: OK
  1802. 853.51 s [vector] +++ OK, passed 100 tests.
  1803. 853.51 s [vector] scanl': OK
  1804. 853.51 s [vector] +++ OK, passed 100 tests.
  1805. 853.51 s [vector] scanl1: OK
  1806. 853.52 s [vector] +++ OK, passed 100 tests.
  1807. 853.52 s [vector] scanl1': OK
  1808. 853.52 s [vector] +++ OK, passed 100 tests.
  1809. 853.52 s [vector] iscanl: OK
  1810. 853.52 s [vector] +++ OK, passed 100 tests.
  1811. 853.52 s [vector] iscanl': OK
  1812. 853.52 s [vector] +++ OK, passed 100 tests.
  1813. 853.52 s [vector] prescanr: OK
  1814. 853.52 s [vector] +++ OK, passed 100 tests.
  1815. 853.52 s [vector] prescanr': OK
  1816. 853.52 s [vector] +++ OK, passed 100 tests.
  1817. 853.52 s [vector] postscanr: OK
  1818. 853.52 s [vector] +++ OK, passed 100 tests.
  1819. 853.52 s [vector] postscanr': OK
  1820. 853.52 s [vector] +++ OK, passed 100 tests.
  1821. 853.52 s [vector] scanr: OK
  1822. 853.52 s [vector] +++ OK, passed 100 tests.
  1823. 853.52 s [vector] scanr': OK
  1824. 853.52 s [vector] +++ OK, passed 100 tests.
  1825. 853.52 s [vector] scanr1: OK
  1826. 853.52 s [vector] +++ OK, passed 100 tests.
  1827. 853.52 s [vector] scanr1': OK
  1828. 853.52 s [vector] +++ OK, passed 100 tests.
  1829. 853.52 s [vector] iscanr: OK
  1830. 853.52 s [vector] +++ OK, passed 100 tests.
  1831. 853.52 s [vector] iscanr': OK
  1832. 853.52 s [vector] +++ OK, passed 100 tests.
  1833. 853.52 s [vector] mut_read: OK
  1834. 853.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1835. 853.52 s [vector] mut_write: OK
  1836. 853.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1837. 853.52 s [vector] mut_modify: OK
  1838. 853.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1839. 853.52 s [vector] mut_generate: OK
  1840. 853.52 s [vector] +++ OK, passed 100 tests.
  1841. 853.52 s [vector] mut_generateM: OK
  1842. 853.52 s [vector] +++ OK, passed 100 tests.
  1843. 853.52 s [vector] mut_mapM_: OK (0.01s)
  1844. 853.52 s [vector] +++ OK, passed 100 tests.
  1845. 853.52 s [vector] mut_imapM_: OK (0.01s)
  1846. 853.52 s [vector] +++ OK, passed 100 tests.
  1847. 853.52 s [vector] mut_forM_: OK
  1848. 853.52 s [vector] +++ OK, passed 100 tests.
  1849. 853.52 s [vector] mut_iforM_: OK (0.01s)
  1850. 853.52 s [vector] +++ OK, passed 100 tests.
  1851. 853.52 s [vector] mut_foldr: OK
  1852. 853.52 s [vector] +++ OK, passed 100 tests.
  1853. 853.52 s [vector] mut_foldr': OK
  1854. 853.52 s [vector] +++ OK, passed 100 tests.
  1855. 853.52 s [vector] mut_foldl: OK
  1856. 853.52 s [vector] +++ OK, passed 100 tests.
  1857. 853.52 s [vector] mut_foldl': OK
  1858. 853.52 s [vector] +++ OK, passed 100 tests.
  1859. 853.52 s [vector] mut_ifoldr: OK
  1860. 853.52 s [vector] +++ OK, passed 100 tests.
  1861. 853.52 s [vector] mut_ifoldr': OK
  1862. 853.52 s [vector] +++ OK, passed 100 tests.
  1863. 853.52 s [vector] mut_ifoldl: OK
  1864. 853.52 s [vector] +++ OK, passed 100 tests.
  1865. 853.52 s [vector] mut_ifoldl': OK
  1866. 853.52 s [vector] +++ OK, passed 100 tests.
  1867. 853.52 s [vector] mut_foldM: OK
  1868. 853.52 s [vector] +++ OK, passed 100 tests.
  1869. 853.52 s [vector] mut_foldM': OK
  1870. 853.52 s [vector] +++ OK, passed 100 tests.
  1871. 853.52 s [vector] mut_foldrM: OK
  1872. 853.52 s [vector] +++ OK, passed 100 tests.
  1873. 853.52 s [vector] mut_foldrM': OK
  1874. 853.52 s [vector] +++ OK, passed 100 tests.
  1875. 853.52 s [vector] mut_ifoldM: OK
  1876. 853.52 s [vector] +++ OK, passed 100 tests.
  1877. 853.52 s [vector] mut_ifoldM': OK
  1878. 853.52 s [vector] +++ OK, passed 100 tests.
  1879. 853.52 s [vector] mut_ifoldrM: OK
  1880. 853.52 s [vector] +++ OK, passed 100 tests.
  1881. 853.52 s [vector] mut_ifoldrM': OK
  1882. 853.52 s [vector] +++ OK, passed 100 tests.
  1883. 853.52 s [vector] compare: OK
  1884. 853.52 s [vector] +++ OK, passed 100 tests.
  1885. 853.52 s [vector] maximum: OK
  1886. 853.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1887. 853.52 s [vector] minimum: OK
  1888. 853.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1889. 853.52 s [vector] minIndex: OK
  1890. 853.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1891. 853.52 s [vector] maxIndex: OK
  1892. 853.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1893. 853.52 s [vector] maximumBy: OK
  1894. 853.52 s [vector] +++ OK, passed 100 tests; 22 discarded.
  1895. 853.52 s [vector] minimumBy: OK
  1896. 853.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1897. 853.52 s [vector] maximumOn: OK
  1898. 853.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1899. 853.52 s [vector] minimumOn: OK
  1900. 853.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1901. 853.52 s [vector] maxIndexBy: OK
  1902. 853.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1903. 853.52 s [vector] minIndexBy: OK
  1904. 853.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1905. 853.52 s [vector] ListFirstMaxIndexWins: OK
  1906. 853.52 s [vector] +++ OK, passed 100 tests; 21 discarded.
  1907. 853.52 s [vector] FalseListFirstMaxIndexWins: OK
  1908. 853.52 s [vector] +++ OK, failed as expected. (after 1 test):
  1909. 853.52 s [vector] Exception:
  1910. 853.52 s [vector] Prelude.foldr1: empty list
  1911. 853.52 s [vector] CallStack (from HasCallStack):
  1912. 853.52 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  1913. 853.52 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  1914. 853.52 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  1915. 853.52 s [vector] []
  1916. 853.52 s [vector] zip: OK
  1917. 853.52 s [vector] +++ OK, passed 100 tests.
  1918. 853.52 s [vector] zip3: OK
  1919. 853.52 s [vector] +++ OK, passed 100 tests.
  1920. 853.52 s [vector] unzip: OK
  1921. 853.52 s [vector] +++ OK, passed 100 tests.
  1922. 853.52 s [vector] unzip3: OK
  1923. 853.52 s [vector] +++ OK, passed 100 tests.
  1924. 853.52 s [vector] indexed: OK
  1925. 853.52 s [vector] +++ OK, passed 100 tests.
  1926. 853.52 s [vector] update: OK
  1927. 853.52 s [vector] +++ OK, passed 100 tests.
  1928. 853.52 s [vector] concat: OK
  1929. 853.52 s [vector] +++ OK, passed 100 tests.
  1930. 853.52 s [vector] mempty: OK
  1931. 853.52 s [vector] +++ OK, passed 1 test.
  1932. 853.52 s [vector] mappend: OK
  1933. 853.52 s [vector] +++ OK, passed 100 tests.
  1934. 853.52 s [vector] mconcat: OK
  1935. 853.52 s [vector] +++ OK, passed 100 tests.
  1936. 853.52 s [vector] fmap: OK
  1937. 853.52 s [vector] +++ OK, passed 100 tests.
  1938. 853.52 s [vector] return: OK
  1939. 853.52 s [vector] +++ OK, passed 100 tests.
  1940. 853.52 s [vector] bind: OK (0.01s)
  1941. 853.52 s [vector] +++ OK, passed 100 tests.
  1942. 853.52 s [vector] mzip: OK
  1943. 853.52 s [vector] +++ OK, passed 100 tests.
  1944. 853.52 s [vector] munzip: OK
  1945. 853.52 s [vector] +++ OK, passed 100 tests.
  1946. 853.52 s [vector] applicative_pure: OK
  1947. 853.52 s [vector] +++ OK, passed 100 tests.
  1948. 853.52 s [vector] applicative_appl: OK (0.02s)
  1949. 853.52 s [vector] +++ OK, passed 100 tests.
  1950. 853.52 s [vector] alternative_empty: OK
  1951. 853.52 s [vector] +++ OK, passed 1 test.
  1952. 853.52 s [vector] alternative_or: OK
  1953. 853.52 s [vector] +++ OK, passed 100 tests.
  1954. 853.52 s [vector] sequence: OK (0.06s)
  1955. 853.52 s [vector] +++ OK, passed 100 tests.
  1956. 853.52 s [vector] sequence_: OK
  1957. 853.52 s [vector] +++ OK, passed 100 tests.
  1958. 853.52 s [vector] glength: OK
  1959. 853.52 s [vector] +++ OK, passed 100 tests.
  1960. 853.52 s [vector] and: OK
  1961. 853.52 s [vector] +++ OK, passed 100 tests.
  1962. 853.52 s [vector] or: OK
  1963. 853.52 s [vector] +++ OK, passed 100 tests.
  1964. 853.52 s [vector] Int
  1965. 853.52 s [vector] fromList.toList == id: OK
  1966. 853.52 s [vector] +++ OK, passed 100 tests.
  1967. 853.52 s [vector] toList.fromList == id: OK
  1968. 853.52 s [vector] +++ OK, passed 100 tests.
  1969. 853.52 s [vector] unstream.stream == id: OK
  1970. 853.52 s [vector] +++ OK, passed 100 tests.
  1971. 853.52 s [vector] stream.unstream == id: OK
  1972. 853.52 s [vector] +++ OK, passed 100 tests.
  1973. 853.52 s [vector] eq: OK
  1974. 853.52 s [vector] +++ OK, passed 100 tests.
  1975. 853.52 s [vector] length: OK
  1976. 853.52 s [vector] +++ OK, passed 100 tests.
  1977. 853.52 s [vector] null: OK
  1978. 853.52 s [vector] +++ OK, passed 100 tests.
  1979. 853.52 s [vector] index: OK
  1980. 853.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1981. 853.52 s [vector] safeIndex: OK
  1982. 853.52 s [vector] +++ OK, passed 100 tests.
  1983. 853.52 s [vector] head: OK
  1984. 853.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1985. 853.52 s [vector] last: OK
  1986. 853.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1987. 853.52 s [vector] unsafeIndex: OK
  1988. 853.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1989. 853.52 s [vector] unsafeHead: OK
  1990. 853.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1991. 853.52 s [vector] unsafeLast: OK
  1992. 853.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1993. 853.52 s [vector] slice: OK
  1994. 853.52 s [vector] +++ OK, passed 100 tests.
  1995. 853.52 s [vector] init: OK
  1996. 853.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1997. 853.52 s [vector] tail: OK
  1998. 853.52 s [vector] +++ OK, passed 100 tests; 22 discarded.
  1999. 853.52 s [vector] take: OK
  2000. 853.52 s [vector] +++ OK, passed 100 tests.
  2001. 853.52 s [vector] drop: OK
  2002. 853.52 s [vector] +++ OK, passed 100 tests.
  2003. 853.52 s [vector] splitAt: OK
  2004. 853.52 s [vector] +++ OK, passed 100 tests.
  2005. 853.52 s [vector] empty: OK
  2006. 853.52 s [vector] +++ OK, passed 1 test.
  2007. 853.52 s [vector] singleton: OK
  2008. 853.52 s [vector] +++ OK, passed 100 tests.
  2009. 853.52 s [vector] replicate: OK
  2010. 853.52 s [vector] +++ OK, passed 100 tests.
  2011. 853.52 s [vector] generate: OK
  2012. 853.52 s [vector] +++ OK, passed 100 tests.
  2013. 853.53 s [vector] iterateN: OK
  2014. 853.53 s [vector] +++ OK, passed 100 tests.
  2015. 853.53 s [vector] iterateNM: OK (0.03s)
  2016. 853.53 s [vector] +++ OK, passed 100 tests.
  2017. 853.53 s [vector] generateM: OK (0.03s)
  2018. 853.53 s [vector] +++ OK, passed 100 tests.
  2019. 853.53 s [vector] replicateM: OK
  2020. 853.53 s [vector] +++ OK, passed 100 tests.
  2021. 853.53 s [vector] create: OK
  2022. 853.53 s [vector] +++ OK, passed 100 tests.
  2023. 853.53 s [vector] createT: OK
  2024. 853.53 s [vector] +++ OK, passed 100 tests.
  2025. 853.53 s [vector] unfoldr: OK
  2026. 853.53 s [vector] +++ OK, passed 100 tests.
  2027. 853.53 s [vector] unfoldrN: OK
  2028. 853.53 s [vector] +++ OK, passed 100 tests.
  2029. 853.53 s [vector] unfoldrExactN: OK
  2030. 853.53 s [vector] +++ OK, passed 100 tests.
  2031. 853.53 s [vector] unfoldrM: OK
  2032. 853.53 s [vector] +++ OK, passed 100 tests.
  2033. 853.53 s [vector] unfoldrNM: OK
  2034. 853.53 s [vector] +++ OK, passed 100 tests.
  2035. 853.53 s [vector] unfoldrExactNM: OK (0.01s)
  2036. 853.53 s [vector] +++ OK, passed 100 tests.
  2037. 853.53 s [vector] constructN: OK
  2038. 853.53 s [vector] +++ OK, passed 100 tests.
  2039. 853.53 s [vector] constructrN: OK
  2040. 853.53 s [vector] +++ OK, passed 100 tests.
  2041. 853.53 s [vector] cons: OK
  2042. 853.53 s [vector] +++ OK, passed 100 tests.
  2043. 853.53 s [vector] snoc: OK
  2044. 853.53 s [vector] +++ OK, passed 100 tests.
  2045. 853.53 s [vector] append: OK
  2046. 853.53 s [vector] +++ OK, passed 100 tests.
  2047. 853.53 s [vector] concat: OK (0.01s)
  2048. 853.53 s [vector] +++ OK, passed 100 tests.
  2049. 853.53 s [vector] force: OK
  2050. 853.53 s [vector] +++ OK, passed 100 tests.
  2051. 853.53 s [vector] upd: OK
  2052. 853.53 s [vector] +++ OK, passed 100 tests.
  2053. 853.53 s [vector] accum: OK
  2054. 853.53 s [vector] +++ OK, passed 100 tests.
  2055. 853.53 s [vector] reverse: OK
  2056. 853.53 s [vector] +++ OK, passed 100 tests.
  2057. 853.53 s [vector] backpermute: OK
  2058. 853.53 s [vector] +++ OK, passed 100 tests.
  2059. 853.53 s [vector] map: OK
  2060. 853.53 s [vector] +++ OK, passed 100 tests.
  2061. 853.53 s [vector] imap: OK
  2062. 853.53 s [vector] +++ OK, passed 100 tests.
  2063. 853.53 s [vector] concatMap: OK
  2064. 853.53 s [vector] +++ OK, passed 100 tests.
  2065. 853.53 s [vector] mapM: OK
  2066. 853.53 s [vector] +++ OK, passed 100 tests.
  2067. 853.53 s [vector] mapM_: OK (0.02s)
  2068. 853.53 s [vector] +++ OK, passed 100 tests.
  2069. 853.53 s [vector] forM: OK
  2070. 853.53 s [vector] +++ OK, passed 100 tests.
  2071. 853.53 s [vector] forM_: OK (0.02s)
  2072. 853.53 s [vector] +++ OK, passed 100 tests.
  2073. 853.53 s [vector] imapM: OK
  2074. 853.53 s [vector] +++ OK, passed 100 tests.
  2075. 853.53 s [vector] imapM_: OK (0.02s)
  2076. 853.53 s [vector] +++ OK, passed 100 tests.
  2077. 853.53 s [vector] zipWith: OK
  2078. 853.53 s [vector] +++ OK, passed 100 tests.
  2079. 853.53 s [vector] zipWith3: OK
  2080. 853.53 s [vector] +++ OK, passed 100 tests.
  2081. 853.53 s [vector] izipWith: OK
  2082. 853.53 s [vector] +++ OK, passed 100 tests.
  2083. 853.53 s [vector] izipWith3: OK
  2084. 853.53 s [vector] +++ OK, passed 100 tests.
  2085. 853.53 s [vector] izipWithM: OK
  2086. 853.53 s [vector] +++ OK, passed 100 tests.
  2087. 853.53 s [vector] izipWithM_: OK (0.01s)
  2088. 853.53 s [vector] +++ OK, passed 100 tests.
  2089. 853.53 s [vector] zipWithM: OK
  2090. 853.53 s [vector] +++ OK, passed 100 tests.
  2091. 853.53 s [vector] zipWithM_: OK (0.01s)
  2092. 853.53 s [vector] +++ OK, passed 100 tests.
  2093. 853.53 s [vector] filter: OK
  2094. 853.53 s [vector] +++ OK, passed 100 tests.
  2095. 853.53 s [vector] ifilter: OK
  2096. 853.53 s [vector] +++ OK, passed 100 tests.
  2097. 853.53 s [vector] filterM: OK (0.02s)
  2098. 853.53 s [vector] +++ OK, passed 100 tests.
  2099. 853.53 s [vector] uniq: OK
  2100. 853.53 s [vector] +++ OK, passed 100 tests.
  2101. 853.53 s [vector] mapMaybe: OK
  2102. 853.53 s [vector] +++ OK, passed 100 tests.
  2103. 853.53 s [vector] imapMaybe: OK
  2104. 853.53 s [vector] +++ OK, passed 100 tests.
  2105. 853.53 s [vector] takeWhile: OK
  2106. 853.53 s [vector] +++ OK, passed 100 tests.
  2107. 853.53 s [vector] dropWhile: OK
  2108. 853.53 s [vector] +++ OK, passed 100 tests.
  2109. 853.53 s [vector] partition: OK
  2110. 853.53 s [vector] +++ OK, passed 100 tests.
  2111. 853.53 s [vector] partitionWith: OK
  2112. 853.53 s [vector] +++ OK, passed 100 tests.
  2113. 853.53 s [vector] span: OK
  2114. 853.53 s [vector] +++ OK, passed 100 tests.
  2115. 853.53 s [vector] break: OK
  2116. 853.53 s [vector] +++ OK, passed 100 tests.
  2117. 853.53 s [vector] spanR: OK
  2118. 853.53 s [vector] +++ OK, passed 100 tests.
  2119. 853.53 s [vector] breakR: OK
  2120. 853.53 s [vector] +++ OK, passed 100 tests.
  2121. 853.53 s [vector] groupBy: OK
  2122. 853.53 s [vector] +++ OK, passed 100 tests.
  2123. 853.53 s [vector] elem: OK
  2124. 853.53 s [vector] +++ OK, passed 100 tests.
  2125. 853.53 s [vector] notElem: OK
  2126. 853.53 s [vector] +++ OK, passed 100 tests.
  2127. 853.53 s [vector] find: OK
  2128. 853.53 s [vector] +++ OK, passed 100 tests.
  2129. 853.53 s [vector] findIndex: OK
  2130. 853.53 s [vector] +++ OK, passed 100 tests.
  2131. 853.53 s [vector] findIndexR: OK
  2132. 853.53 s [vector] +++ OK, passed 100 tests.
  2133. 853.53 s [vector] findIndices: OK
  2134. 853.53 s [vector] +++ OK, passed 100 tests.
  2135. 853.53 s [vector] elemIndex: OK
  2136. 853.53 s [vector] +++ OK, passed 100 tests.
  2137. 853.53 s [vector] elemIndices: OK
  2138. 853.53 s [vector] +++ OK, passed 100 tests.
  2139. 853.53 s [vector] foldl: OK
  2140. 853.53 s [vector] +++ OK, passed 100 tests.
  2141. 853.53 s [vector] foldl1: OK
  2142. 853.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2143. 853.53 s [vector] foldl': OK
  2144. 853.53 s [vector] +++ OK, passed 100 tests.
  2145. 853.53 s [vector] foldl1': OK
  2146. 853.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2147. 853.53 s [vector] foldr: OK
  2148. 853.53 s [vector] +++ OK, passed 100 tests.
  2149. 853.53 s [vector] foldr1: OK
  2150. 853.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2151. 853.53 s [vector] foldr': OK (0.01s)
  2152. 853.53 s [vector] +++ OK, passed 100 tests.
  2153. 853.53 s [vector] foldr1': OK
  2154. 853.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2155. 853.53 s [vector] ifoldl: OK
  2156. 853.53 s [vector] +++ OK, passed 100 tests.
  2157. 853.53 s [vector] ifoldl': OK
  2158. 853.53 s [vector] +++ OK, passed 100 tests.
  2159. 853.53 s [vector] ifoldr: OK
  2160. 853.53 s [vector] +++ OK, passed 100 tests.
  2161. 853.53 s [vector] ifoldr': OK
  2162. 853.53 s [vector] +++ OK, passed 100 tests.
  2163. 853.53 s [vector] ifoldM: OK
  2164. 853.53 s [vector] +++ OK, passed 100 tests.
  2165. 853.53 s [vector] ifoldM': OK
  2166. 853.53 s [vector] +++ OK, passed 100 tests.
  2167. 853.53 s [vector] ifoldM_: OK (0.02s)
  2168. 853.54 s [vector] +++ OK, passed 100 tests.
  2169. 853.54 s [vector] ifoldM'_: OK (0.02s)
  2170. 853.54 s [vector] +++ OK, passed 100 tests.
  2171. 853.54 s [vector] all: OK
  2172. 853.54 s [vector] +++ OK, passed 100 tests.
  2173. 853.54 s [vector] any: OK
  2174. 853.54 s [vector] +++ OK, passed 100 tests.
  2175. 853.54 s [vector] prescanl: OK
  2176. 853.54 s [vector] +++ OK, passed 100 tests.
  2177. 853.54 s [vector] prescanl': OK
  2178. 853.54 s [vector] +++ OK, passed 100 tests.
  2179. 853.54 s [vector] postscanl: OK
  2180. 853.54 s [vector] +++ OK, passed 100 tests.
  2181. 853.54 s [vector] postscanl': OK
  2182. 853.54 s [vector] +++ OK, passed 100 tests.
  2183. 853.54 s [vector] scanl: OK
  2184. 853.54 s [vector] +++ OK, passed 100 tests.
  2185. 853.54 s [vector] scanl': OK
  2186. 853.54 s [vector] +++ OK, passed 100 tests.
  2187. 853.54 s [vector] scanl1: OK
  2188. 853.54 s [vector] +++ OK, passed 100 tests.
  2189. 853.54 s [vector] scanl1': OK
  2190. 853.54 s [vector] +++ OK, passed 100 tests.
  2191. 853.54 s [vector] iscanl: OK
  2192. 853.54 s [vector] +++ OK, passed 100 tests.
  2193. 853.54 s [vector] iscanl': OK
  2194. 853.54 s [vector] +++ OK, passed 100 tests.
  2195. 853.54 s [vector] prescanr: OK
  2196. 853.54 s [vector] +++ OK, passed 100 tests.
  2197. 853.54 s [vector] prescanr': OK
  2198. 853.54 s [vector] +++ OK, passed 100 tests.
  2199. 853.54 s [vector] postscanr: OK
  2200. 853.54 s [vector] +++ OK, passed 100 tests.
  2201. 853.54 s [vector] postscanr': OK
  2202. 853.54 s [vector] +++ OK, passed 100 tests.
  2203. 853.54 s [vector] scanr: OK
  2204. 853.54 s [vector] +++ OK, passed 100 tests.
  2205. 853.54 s [vector] scanr': OK
  2206. 853.54 s [vector] +++ OK, passed 100 tests.
  2207. 853.54 s [vector] scanr1: OK
  2208. 853.54 s [vector] +++ OK, passed 100 tests.
  2209. 853.54 s [vector] scanr1': OK
  2210. 853.54 s [vector] +++ OK, passed 100 tests.
  2211. 853.54 s [vector] iscanr: OK
  2212. 853.54 s [vector] +++ OK, passed 100 tests.
  2213. 853.54 s [vector] iscanr': OK
  2214. 853.54 s [vector] +++ OK, passed 100 tests.
  2215. 853.54 s [vector] mut_read: OK
  2216. 853.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2217. 853.54 s [vector] mut_write: OK
  2218. 853.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2219. 853.54 s [vector] mut_modify: OK
  2220. 853.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2221. 853.54 s [vector] mut_generate: OK
  2222. 853.54 s [vector] +++ OK, passed 100 tests.
  2223. 853.54 s [vector] mut_generateM: OK (0.01s)
  2224. 853.54 s [vector] +++ OK, passed 100 tests.
  2225. 853.54 s [vector] mut_mapM_: OK (0.02s)
  2226. 853.54 s [vector] +++ OK, passed 100 tests.
  2227. 853.54 s [vector] mut_imapM_: OK (0.02s)
  2228. 853.54 s [vector] +++ OK, passed 100 tests.
  2229. 853.54 s [vector] mut_forM_: OK (0.02s)
  2230. 853.54 s [vector] +++ OK, passed 100 tests.
  2231. 853.54 s [vector] mut_iforM_: OK (0.02s)
  2232. 853.54 s [vector] +++ OK, passed 100 tests.
  2233. 853.54 s [vector] mut_foldr: OK
  2234. 853.54 s [vector] +++ OK, passed 100 tests.
  2235. 853.54 s [vector] mut_foldr': OK
  2236. 853.54 s [vector] +++ OK, passed 100 tests.
  2237. 853.54 s [vector] mut_foldl: OK
  2238. 853.54 s [vector] +++ OK, passed 100 tests.
  2239. 853.54 s [vector] mut_foldl': OK
  2240. 853.54 s [vector] +++ OK, passed 100 tests.
  2241. 853.54 s [vector] mut_ifoldr: OK
  2242. 853.54 s [vector] +++ OK, passed 100 tests.
  2243. 853.54 s [vector] mut_ifoldr': OK
  2244. 853.54 s [vector] +++ OK, passed 100 tests.
  2245. 853.54 s [vector] mut_ifoldl: OK
  2246. 853.54 s [vector] +++ OK, passed 100 tests.
  2247. 853.54 s [vector] mut_ifoldl': OK
  2248. 853.54 s [vector] +++ OK, passed 100 tests.
  2249. 853.54 s [vector] mut_foldM: OK
  2250. 853.54 s [vector] +++ OK, passed 100 tests.
  2251. 853.54 s [vector] mut_foldM': OK
  2252. 853.54 s [vector] +++ OK, passed 100 tests.
  2253. 853.54 s [vector] mut_foldrM: OK
  2254. 853.54 s [vector] +++ OK, passed 100 tests.
  2255. 853.54 s [vector] mut_foldrM': OK
  2256. 853.54 s [vector] +++ OK, passed 100 tests.
  2257. 853.54 s [vector] mut_ifoldM: OK
  2258. 853.54 s [vector] +++ OK, passed 100 tests.
  2259. 853.54 s [vector] mut_ifoldM': OK
  2260. 853.54 s [vector] +++ OK, passed 100 tests.
  2261. 853.54 s [vector] mut_ifoldrM: OK
  2262. 853.54 s [vector] +++ OK, passed 100 tests.
  2263. 853.54 s [vector] mut_ifoldrM': OK
  2264. 853.54 s [vector] +++ OK, passed 100 tests.
  2265. 853.54 s [vector] compare: OK
  2266. 853.54 s [vector] +++ OK, passed 100 tests.
  2267. 853.54 s [vector] maximum: OK
  2268. 853.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2269. 853.54 s [vector] minimum: OK
  2270. 853.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2271. 853.54 s [vector] minIndex: OK
  2272. 853.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2273. 853.54 s [vector] maxIndex: OK
  2274. 853.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2275. 853.54 s [vector] maximumBy: OK
  2276. 853.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2277. 853.54 s [vector] minimumBy: OK
  2278. 853.54 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2279. 853.54 s [vector] maximumOn: OK
  2280. 853.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2281. 853.54 s [vector] minimumOn: OK
  2282. 853.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2283. 853.54 s [vector] maxIndexBy: OK
  2284. 853.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2285. 853.54 s [vector] minIndexBy: OK
  2286. 853.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2287. 853.54 s [vector] ListFirstMaxIndexWins: OK
  2288. 853.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2289. 853.54 s [vector] FalseListFirstMaxIndexWins: OK
  2290. 853.54 s [vector] +++ OK, failed as expected. (after 1 test):
  2291. 853.54 s [vector] Exception:
  2292. 853.54 s [vector] Prelude.foldr1: empty list
  2293. 853.54 s [vector] CallStack (from HasCallStack):
  2294. 853.54 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  2295. 853.54 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  2296. 853.54 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  2297. 853.55 s [vector] []
  2298. 853.55 s [vector] zip: OK
  2299. 853.55 s [vector] +++ OK, passed 100 tests.
  2300. 853.55 s [vector] zip3: OK
  2301. 853.55 s [vector] +++ OK, passed 100 tests.
  2302. 853.55 s [vector] unzip: OK
  2303. 853.55 s [vector] +++ OK, passed 100 tests.
  2304. 853.55 s [vector] unzip3: OK
  2305. 853.55 s [vector] +++ OK, passed 100 tests.
  2306. 853.55 s [vector] indexed: OK
  2307. 853.55 s [vector] +++ OK, passed 100 tests.
  2308. 853.55 s [vector] update: OK
  2309. 853.55 s [vector] +++ OK, passed 100 tests.
  2310. 853.55 s [vector] concat: OK (0.01s)
  2311. 853.55 s [vector] +++ OK, passed 100 tests.
  2312. 853.55 s [vector] mempty: OK
  2313. 853.55 s [vector] +++ OK, passed 1 test.
  2314. 853.55 s [vector] mappend: OK
  2315. 853.55 s [vector] +++ OK, passed 100 tests.
  2316. 853.55 s [vector] mconcat: OK (0.01s)
  2317. 853.55 s [vector] +++ OK, passed 100 tests.
  2318. 853.55 s [vector] fmap: OK
  2319. 853.55 s [vector] +++ OK, passed 100 tests.
  2320. 853.55 s [vector] return: OK
  2321. 853.55 s [vector] +++ OK, passed 100 tests.
  2322. 853.55 s [vector] bind: OK (0.02s)
  2323. 853.55 s [vector] +++ OK, passed 100 tests.
  2324. 853.55 s [vector] mzip: OK
  2325. 853.55 s [vector] +++ OK, passed 100 tests.
  2326. 853.55 s [vector] munzip: OK
  2327. 853.55 s [vector] +++ OK, passed 100 tests.
  2328. 853.55 s [vector] applicative_pure: OK
  2329. 853.55 s [vector] +++ OK, passed 100 tests.
  2330. 853.55 s [vector] applicative_appl: OK (0.04s)
  2331. 853.55 s [vector] +++ OK, passed 100 tests.
  2332. 853.55 s [vector] alternative_empty: OK
  2333. 853.55 s [vector] +++ OK, passed 1 test.
  2334. 853.55 s [vector] alternative_or: OK
  2335. 853.55 s [vector] +++ OK, passed 100 tests.
  2336. 853.55 s [vector] sequence: OK (0.03s)
  2337. 853.55 s [vector] +++ OK, passed 100 tests.
  2338. 853.55 s [vector] sequence_: OK (0.01s)
  2339. 853.55 s [vector] +++ OK, passed 100 tests.
  2340. 853.55 s [vector] glength: OK
  2341. 853.55 s [vector] +++ OK, passed 100 tests.
  2342. 853.55 s [vector] sum: OK
  2343. 853.55 s [vector] +++ OK, passed 100 tests.
  2344. 853.55 s [vector] product: OK
  2345. 853.55 s [vector] +++ OK, passed 100 tests.
  2346. 853.55 s [vector] enumFromN: OK
  2347. 853.55 s [vector] +++ OK, passed 100 tests.
  2348. 853.55 s [vector] enumFromThenN: OK
  2349. 853.55 s [vector] +++ OK, passed 100 tests.
  2350. 853.55 s [vector] enumFromTo: OK
  2351. 853.55 s [vector] +++ OK, passed 100 tests.
  2352. 853.55 s [vector] enumFromThenTo: OK
  2353. 853.55 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2354. 853.55 s [vector] unstream
  2355. 853.55 s [vector] unstream == vunstream (exact): OK
  2356. 853.55 s [vector] +++ OK, passed 100 tests.
  2357. 853.55 s [vector] unstream == vunstream (unknown): OK
  2358. 853.55 s [vector] +++ OK, passed 100 tests.
  2359. 853.55 s [vector] unstreamR ~= vunstream (exact): OK
  2360. 853.55 s [vector] +++ OK, passed 100 tests.
  2361. 853.55 s [vector] unstreamR ~= vunstream (unknown): OK
  2362. 853.55 s [vector] +++ OK, passed 100 tests.
  2363. 853.55 s [vector] Tests.Vector.Unboxed
  2364. 853.55 s [vector] ()
  2365. 853.55 s [vector] fromList.toList == id: OK
  2366. 853.55 s [vector] +++ OK, passed 100 tests.
  2367. 853.55 s [vector] toList.fromList == id: OK
  2368. 853.55 s [vector] +++ OK, passed 100 tests.
  2369. 853.55 s [vector] unstream.stream == id: OK
  2370. 853.55 s [vector] +++ OK, passed 100 tests.
  2371. 853.55 s [vector] stream.unstream == id: OK
  2372. 853.55 s [vector] +++ OK, passed 100 tests.
  2373. 853.55 s [vector] eq: OK
  2374. 853.55 s [vector] +++ OK, passed 100 tests.
  2375. 853.55 s [vector] length: OK
  2376. 853.55 s [vector] +++ OK, passed 100 tests.
  2377. 853.55 s [vector] null: OK
  2378. 853.55 s [vector] +++ OK, passed 100 tests.
  2379. 853.55 s [vector] index: OK
  2380. 853.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2381. 853.55 s [vector] safeIndex: OK
  2382. 853.55 s [vector] +++ OK, passed 100 tests.
  2383. 853.55 s [vector] head: OK
  2384. 853.55 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2385. 853.55 s [vector] last: OK
  2386. 853.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2387. 853.55 s [vector] unsafeIndex: OK
  2388. 853.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2389. 853.55 s [vector] unsafeHead: OK
  2390. 853.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2391. 853.55 s [vector] unsafeLast: OK
  2392. 853.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2393. 853.55 s [vector] slice: OK
  2394. 853.55 s [vector] +++ OK, passed 100 tests.
  2395. 853.55 s [vector] init: OK
  2396. 853.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2397. 853.55 s [vector] tail: OK
  2398. 853.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2399. 853.55 s [vector] take: OK
  2400. 853.55 s [vector] +++ OK, passed 100 tests.
  2401. 853.55 s [vector] drop: OK
  2402. 853.55 s [vector] +++ OK, passed 100 tests.
  2403. 853.55 s [vector] splitAt: OK
  2404. 853.55 s [vector] +++ OK, passed 100 tests.
  2405. 853.55 s [vector] empty: OK
  2406. 853.55 s [vector] +++ OK, passed 1 test.
  2407. 853.55 s [vector] singleton: OK
  2408. 853.55 s [vector] +++ OK, passed 100 tests.
  2409. 853.55 s [vector] replicate: OK
  2410. 853.55 s [vector] +++ OK, passed 100 tests.
  2411. 853.55 s [vector] generate: OK
  2412. 853.55 s [vector] +++ OK, passed 100 tests.
  2413. 853.55 s [vector] iterateN: OK
  2414. 853.55 s [vector] +++ OK, passed 100 tests.
  2415. 853.55 s [vector] iterateNM: OK (0.11s)
  2416. 853.55 s [vector] +++ OK, passed 100 tests.
  2417. 853.55 s [vector] generateM: OK (0.01s)
  2418. 853.55 s [vector] +++ OK, passed 100 tests.
  2419. 853.55 s [vector] replicateM: OK
  2420. 853.55 s [vector] +++ OK, passed 100 tests.
  2421. 853.55 s [vector] create: OK
  2422. 853.55 s [vector] +++ OK, passed 100 tests.
  2423. 853.55 s [vector] createT: OK
  2424. 853.55 s [vector] +++ OK, passed 100 tests.
  2425. 853.55 s [vector] unfoldr: OK
  2426. 853.55 s [vector] +++ OK, passed 100 tests.
  2427. 853.55 s [vector] unfoldrN: OK
  2428. 853.55 s [vector] +++ OK, passed 100 tests.
  2429. 853.55 s [vector] unfoldrExactN: OK
  2430. 853.55 s [vector] +++ OK, passed 100 tests.
  2431. 853.55 s [vector] unfoldrM: OK
  2432. 853.55 s [vector] +++ OK, passed 100 tests.
  2433. 853.55 s [vector] unfoldrNM: OK
  2434. 853.55 s [vector] +++ OK, passed 100 tests.
  2435. 853.55 s [vector] unfoldrExactNM: OK (0.08s)
  2436. 853.55 s [vector] +++ OK, passed 100 tests.
  2437. 853.55 s [vector] constructN: OK
  2438. 853.55 s [vector] +++ OK, passed 100 tests.
  2439. 853.55 s [vector] constructrN: OK
  2440. 853.55 s [vector] +++ OK, passed 100 tests.
  2441. 853.55 s [vector] cons: OK
  2442. 853.55 s [vector] +++ OK, passed 100 tests.
  2443. 853.55 s [vector] snoc: OK
  2444. 853.56 s [vector] +++ OK, passed 100 tests.
  2445. 853.56 s [vector] append: OK
  2446. 853.56 s [vector] +++ OK, passed 100 tests.
  2447. 853.56 s [vector] concat: OK (0.01s)
  2448. 853.56 s [vector] +++ OK, passed 100 tests.
  2449. 853.56 s [vector] force: OK
  2450. 853.56 s [vector] +++ OK, passed 100 tests.
  2451. 853.56 s [vector] upd: OK
  2452. 853.56 s [vector] +++ OK, passed 100 tests.
  2453. 853.56 s [vector] accum: OK
  2454. 853.56 s [vector] +++ OK, passed 100 tests.
  2455. 853.56 s [vector] reverse: OK
  2456. 853.56 s [vector] +++ OK, passed 100 tests.
  2457. 853.56 s [vector] backpermute: OK
  2458. 853.56 s [vector] +++ OK, passed 100 tests.
  2459. 853.56 s [vector] map: OK
  2460. 853.56 s [vector] +++ OK, passed 100 tests.
  2461. 853.56 s [vector] imap: OK
  2462. 853.56 s [vector] +++ OK, passed 100 tests.
  2463. 853.56 s [vector] concatMap: OK
  2464. 853.56 s [vector] +++ OK, passed 100 tests.
  2465. 853.56 s [vector] mapM: OK
  2466. 853.56 s [vector] +++ OK, passed 100 tests.
  2467. 853.56 s [vector] mapM_: OK (0.01s)
  2468. 853.56 s [vector] +++ OK, passed 100 tests.
  2469. 853.56 s [vector] forM: OK
  2470. 853.56 s [vector] +++ OK, passed 100 tests.
  2471. 853.56 s [vector] forM_: OK
  2472. 853.56 s [vector] +++ OK, passed 100 tests.
  2473. 853.56 s [vector] imapM: OK
  2474. 853.56 s [vector] +++ OK, passed 100 tests.
  2475. 853.56 s [vector] imapM_: OK (0.01s)
  2476. 853.56 s [vector] +++ OK, passed 100 tests.
  2477. 853.56 s [vector] zipWith: OK
  2478. 853.56 s [vector] +++ OK, passed 100 tests.
  2479. 853.56 s [vector] zipWith3: OK
  2480. 853.56 s [vector] +++ OK, passed 100 tests.
  2481. 853.56 s [vector] izipWith: OK
  2482. 853.56 s [vector] +++ OK, passed 100 tests.
  2483. 853.56 s [vector] izipWith3: OK
  2484. 853.56 s [vector] +++ OK, passed 100 tests.
  2485. 853.56 s [vector] izipWithM: OK
  2486. 853.56 s [vector] +++ OK, passed 100 tests.
  2487. 853.56 s [vector] izipWithM_: OK
  2488. 853.56 s [vector] +++ OK, passed 100 tests.
  2489. 853.56 s [vector] zipWithM: OK
  2490. 853.56 s [vector] +++ OK, passed 100 tests.
  2491. 853.56 s [vector] zipWithM_: OK
  2492. 853.56 s [vector] +++ OK, passed 100 tests.
  2493. 853.56 s [vector] filter: OK
  2494. 853.56 s [vector] +++ OK, passed 100 tests.
  2495. 853.56 s [vector] ifilter: OK
  2496. 853.56 s [vector] +++ OK, passed 100 tests.
  2497. 853.56 s [vector] filterM: OK (0.02s)
  2498. 853.56 s [vector] +++ OK, passed 100 tests.
  2499. 853.56 s [vector] uniq: OK
  2500. 853.56 s [vector] +++ OK, passed 100 tests.
  2501. 853.56 s [vector] mapMaybe: OK
  2502. 853.56 s [vector] +++ OK, passed 100 tests.
  2503. 853.56 s [vector] imapMaybe: OK
  2504. 853.56 s [vector] +++ OK, passed 100 tests.
  2505. 853.56 s [vector] takeWhile: OK
  2506. 853.56 s [vector] +++ OK, passed 100 tests.
  2507. 853.56 s [vector] dropWhile: OK
  2508. 853.56 s [vector] +++ OK, passed 100 tests.
  2509. 853.56 s [vector] partition: OK
  2510. 853.56 s [vector] +++ OK, passed 100 tests.
  2511. 853.56 s [vector] partitionWith: OK
  2512. 853.56 s [vector] +++ OK, passed 100 tests.
  2513. 853.56 s [vector] span: OK
  2514. 853.56 s [vector] +++ OK, passed 100 tests.
  2515. 853.56 s [vector] break: OK
  2516. 853.56 s [vector] +++ OK, passed 100 tests.
  2517. 853.56 s [vector] spanR: OK
  2518. 853.56 s [vector] +++ OK, passed 100 tests.
  2519. 853.56 s [vector] breakR: OK
  2520. 853.56 s [vector] +++ OK, passed 100 tests.
  2521. 853.56 s [vector] groupBy: OK
  2522. 853.56 s [vector] +++ OK, passed 100 tests.
  2523. 853.56 s [vector] elem: OK
  2524. 853.56 s [vector] +++ OK, passed 100 tests.
  2525. 853.56 s [vector] notElem: OK
  2526. 853.56 s [vector] +++ OK, passed 100 tests.
  2527. 853.56 s [vector] find: OK
  2528. 853.56 s [vector] +++ OK, passed 100 tests.
  2529. 853.56 s [vector] findIndex: OK
  2530. 853.56 s [vector] +++ OK, passed 100 tests.
  2531. 853.56 s [vector] findIndexR: OK
  2532. 853.56 s [vector] +++ OK, passed 100 tests.
  2533. 853.56 s [vector] findIndices: OK
  2534. 853.56 s [vector] +++ OK, passed 100 tests.
  2535. 853.56 s [vector] elemIndex: OK
  2536. 853.56 s [vector] +++ OK, passed 100 tests.
  2537. 853.56 s [vector] elemIndices: OK
  2538. 853.56 s [vector] +++ OK, passed 100 tests.
  2539. 853.56 s [vector] foldl: OK
  2540. 853.56 s [vector] +++ OK, passed 100 tests.
  2541. 853.56 s [vector] foldl1: OK
  2542. 853.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2543. 853.56 s [vector] foldl': OK
  2544. 853.56 s [vector] +++ OK, passed 100 tests.
  2545. 853.56 s [vector] foldl1': OK
  2546. 853.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2547. 853.56 s [vector] foldr: OK
  2548. 853.56 s [vector] +++ OK, passed 100 tests.
  2549. 853.56 s [vector] foldr1: OK
  2550. 853.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2551. 853.56 s [vector] foldr': OK
  2552. 853.56 s [vector] +++ OK, passed 100 tests.
  2553. 853.56 s [vector] foldr1': OK
  2554. 853.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2555. 853.56 s [vector] ifoldl: OK
  2556. 853.56 s [vector] +++ OK, passed 100 tests.
  2557. 853.56 s [vector] ifoldl': OK
  2558. 853.56 s [vector] +++ OK, passed 100 tests.
  2559. 853.56 s [vector] ifoldr: OK
  2560. 853.56 s [vector] +++ OK, passed 100 tests.
  2561. 853.56 s [vector] ifoldr': OK
  2562. 853.56 s [vector] +++ OK, passed 100 tests.
  2563. 853.56 s [vector] ifoldM: OK
  2564. 853.56 s [vector] +++ OK, passed 100 tests.
  2565. 853.56 s [vector] ifoldM': OK
  2566. 853.56 s [vector] +++ OK, passed 100 tests.
  2567. 853.56 s [vector] ifoldM_: OK (0.01s)
  2568. 853.56 s [vector] +++ OK, passed 100 tests.
  2569. 853.56 s [vector] ifoldM'_: OK (0.01s)
  2570. 853.56 s [vector] +++ OK, passed 100 tests.
  2571. 853.56 s [vector] all: OK
  2572. 853.56 s [vector] +++ OK, passed 100 tests.
  2573. 853.56 s [vector] any: OK
  2574. 853.56 s [vector] +++ OK, passed 100 tests.
  2575. 853.56 s [vector] prescanl: OK
  2576. 853.56 s [vector] +++ OK, passed 100 tests.
  2577. 853.57 s [vector] prescanl': OK
  2578. 853.57 s [vector] +++ OK, passed 100 tests.
  2579. 853.57 s [vector] postscanl: OK
  2580. 853.57 s [vector] +++ OK, passed 100 tests.
  2581. 853.57 s [vector] postscanl': OK
  2582. 853.57 s [vector] +++ OK, passed 100 tests.
  2583. 853.57 s [vector] scanl: OK
  2584. 853.57 s [vector] +++ OK, passed 100 tests.
  2585. 853.57 s [vector] scanl': OK
  2586. 853.57 s [vector] +++ OK, passed 100 tests.
  2587. 853.57 s [vector] scanl1: OK
  2588. 853.57 s [vector] +++ OK, passed 100 tests.
  2589. 853.57 s [vector] scanl1': OK
  2590. 853.57 s [vector] +++ OK, passed 100 tests.
  2591. 853.57 s [vector] iscanl: OK
  2592. 853.57 s [vector] +++ OK, passed 100 tests.
  2593. 853.57 s [vector] iscanl': OK
  2594. 853.57 s [vector] +++ OK, passed 100 tests.
  2595. 853.57 s [vector] prescanr: OK
  2596. 853.57 s [vector] +++ OK, passed 100 tests.
  2597. 853.57 s [vector] prescanr': OK
  2598. 853.57 s [vector] +++ OK, passed 100 tests.
  2599. 853.57 s [vector] postscanr: OK
  2600. 853.57 s [vector] +++ OK, passed 100 tests.
  2601. 853.57 s [vector] postscanr': OK
  2602. 853.57 s [vector] +++ OK, passed 100 tests.
  2603. 853.57 s [vector] scanr: OK
  2604. 853.57 s [vector] +++ OK, passed 100 tests.
  2605. 853.57 s [vector] scanr': OK
  2606. 853.57 s [vector] +++ OK, passed 100 tests.
  2607. 853.57 s [vector] scanr1: OK
  2608. 853.57 s [vector] +++ OK, passed 100 tests.
  2609. 853.57 s [vector] scanr1': OK
  2610. 853.57 s [vector] +++ OK, passed 100 tests.
  2611. 853.57 s [vector] iscanr: OK
  2612. 853.57 s [vector] +++ OK, passed 100 tests.
  2613. 853.57 s [vector] iscanr': OK
  2614. 853.57 s [vector] +++ OK, passed 100 tests.
  2615. 853.57 s [vector] mut_read: OK
  2616. 853.57 s [vector] +++ OK, passed 100 tests; 10 discarded.
  2617. 853.57 s [vector] mut_write: OK
  2618. 853.57 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2619. 853.57 s [vector] mut_modify: OK
  2620. 853.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2621. 853.57 s [vector] mut_generate: OK
  2622. 853.57 s [vector] +++ OK, passed 100 tests.
  2623. 853.57 s [vector] mut_generateM: OK
  2624. 853.57 s [vector] +++ OK, passed 100 tests.
  2625. 853.57 s [vector] mut_mapM_: OK (0.01s)
  2626. 853.57 s [vector] +++ OK, passed 100 tests.
  2627. 853.57 s [vector] mut_imapM_: OK (0.01s)
  2628. 853.57 s [vector] +++ OK, passed 100 tests.
  2629. 853.57 s [vector] mut_forM_: OK
  2630. 853.57 s [vector] +++ OK, passed 100 tests.
  2631. 853.57 s [vector] mut_iforM_: OK (0.01s)
  2632. 853.57 s [vector] +++ OK, passed 100 tests.
  2633. 853.57 s [vector] mut_foldr: OK
  2634. 853.57 s [vector] +++ OK, passed 100 tests.
  2635. 853.57 s [vector] mut_foldr': OK
  2636. 853.57 s [vector] +++ OK, passed 100 tests.
  2637. 853.57 s [vector] mut_foldl: OK
  2638. 853.57 s [vector] +++ OK, passed 100 tests.
  2639. 853.57 s [vector] mut_foldl': OK
  2640. 853.57 s [vector] +++ OK, passed 100 tests.
  2641. 853.57 s [vector] mut_ifoldr: OK
  2642. 853.57 s [vector] +++ OK, passed 100 tests.
  2643. 853.57 s [vector] mut_ifoldr': OK
  2644. 853.57 s [vector] +++ OK, passed 100 tests.
  2645. 853.57 s [vector] mut_ifoldl: OK
  2646. 853.57 s [vector] +++ OK, passed 100 tests.
  2647. 853.57 s [vector] mut_ifoldl': OK
  2648. 853.57 s [vector] +++ OK, passed 100 tests.
  2649. 853.57 s [vector] mut_foldM: OK
  2650. 853.57 s [vector] +++ OK, passed 100 tests.
  2651. 853.57 s [vector] mut_foldM': OK
  2652. 853.57 s [vector] +++ OK, passed 100 tests.
  2653. 853.57 s [vector] mut_foldrM: OK
  2654. 853.57 s [vector] +++ OK, passed 100 tests.
  2655. 853.57 s [vector] mut_foldrM': OK
  2656. 853.57 s [vector] +++ OK, passed 100 tests.
  2657. 853.57 s [vector] mut_ifoldM: OK
  2658. 853.57 s [vector] +++ OK, passed 100 tests.
  2659. 853.57 s [vector] mut_ifoldM': OK
  2660. 853.57 s [vector] +++ OK, passed 100 tests.
  2661. 853.57 s [vector] mut_ifoldrM: OK
  2662. 853.57 s [vector] +++ OK, passed 100 tests.
  2663. 853.57 s [vector] mut_ifoldrM': OK
  2664. 853.57 s [vector] +++ OK, passed 100 tests.
  2665. 853.57 s [vector] compare: OK
  2666. 853.57 s [vector] +++ OK, passed 100 tests.
  2667. 853.57 s [vector] maximum: OK
  2668. 853.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2669. 853.57 s [vector] minimum: OK
  2670. 853.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2671. 853.57 s [vector] minIndex: OK
  2672. 853.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2673. 853.57 s [vector] maxIndex: OK
  2674. 853.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2675. 853.57 s [vector] maximumBy: OK
  2676. 853.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2677. 853.57 s [vector] minimumBy: OK
  2678. 853.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2679. 853.57 s [vector] maximumOn: OK
  2680. 853.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2681. 853.57 s [vector] minimumOn: OK
  2682. 853.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2683. 853.57 s [vector] maxIndexBy: OK
  2684. 853.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2685. 853.57 s [vector] minIndexBy: OK
  2686. 853.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2687. 853.57 s [vector] ListFirstMaxIndexWins: OK
  2688. 853.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2689. 853.57 s [vector] FalseListFirstMaxIndexWins: OK
  2690. 853.57 s [vector] +++ OK, failed as expected. (after 1 test):
  2691. 853.57 s [vector] Exception:
  2692. 853.57 s [vector] Prelude.foldr1: empty list
  2693. 853.57 s [vector] CallStack (from HasCallStack):
  2694. 853.57 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  2695. 853.57 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  2696. 853.58 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  2697. 853.58 s [vector] []
  2698. 853.58 s [vector] zip: OK
  2699. 853.58 s [vector] +++ OK, passed 100 tests.
  2700. 853.58 s [vector] zip3: OK
  2701. 853.58 s [vector] +++ OK, passed 100 tests.
  2702. 853.58 s [vector] unzip: OK
  2703. 853.58 s [vector] +++ OK, passed 100 tests.
  2704. 853.58 s [vector] unzip3: OK
  2705. 853.58 s [vector] +++ OK, passed 100 tests.
  2706. 853.58 s [vector] indexed: OK
  2707. 853.58 s [vector] +++ OK, passed 100 tests.
  2708. 853.58 s [vector] update: OK
  2709. 853.58 s [vector] +++ OK, passed 100 tests.
  2710. 853.58 s [vector] mempty: OK
  2711. 853.58 s [vector] +++ OK, passed 1 test.
  2712. 853.58 s [vector] mappend: OK
  2713. 853.58 s [vector] +++ OK, passed 100 tests.
  2714. 853.58 s [vector] mconcat: OK (0.01s)
  2715. 853.58 s [vector] +++ OK, passed 100 tests.
  2716. 853.58 s [vector] glength: OK
  2717. 853.58 s [vector] +++ OK, passed 100 tests.
  2718. 853.58 s [vector] (Bool)
  2719. 853.58 s [vector] fromList.toList == id: OK
  2720. 853.58 s [vector] +++ OK, passed 100 tests.
  2721. 853.58 s [vector] toList.fromList == id: OK
  2722. 853.58 s [vector] +++ OK, passed 100 tests.
  2723. 853.58 s [vector] unstream.stream == id: OK
  2724. 853.58 s [vector] +++ OK, passed 100 tests.
  2725. 853.58 s [vector] stream.unstream == id: OK
  2726. 853.58 s [vector] +++ OK, passed 100 tests.
  2727. 853.58 s [vector] eq: OK
  2728. 853.58 s [vector] +++ OK, passed 100 tests.
  2729. 853.58 s [vector] length: OK
  2730. 853.58 s [vector] +++ OK, passed 100 tests.
  2731. 853.58 s [vector] null: OK
  2732. 853.58 s [vector] +++ OK, passed 100 tests.
  2733. 853.58 s [vector] index: OK
  2734. 853.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2735. 853.58 s [vector] safeIndex: OK
  2736. 853.58 s [vector] +++ OK, passed 100 tests.
  2737. 853.58 s [vector] head: OK
  2738. 853.58 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2739. 853.58 s [vector] last: OK
  2740. 853.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2741. 853.58 s [vector] unsafeIndex: OK
  2742. 853.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2743. 853.58 s [vector] unsafeHead: OK
  2744. 853.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2745. 853.58 s [vector] unsafeLast: OK
  2746. 853.58 s [vector] +++ OK, passed 100 tests; 10 discarded.
  2747. 853.58 s [vector] slice: OK
  2748. 853.58 s [vector] +++ OK, passed 100 tests.
  2749. 853.58 s [vector] init: OK
  2750. 853.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2751. 853.58 s [vector] tail: OK
  2752. 853.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2753. 853.58 s [vector] take: OK
  2754. 853.58 s [vector] +++ OK, passed 100 tests.
  2755. 853.58 s [vector] drop: OK
  2756. 853.58 s [vector] +++ OK, passed 100 tests.
  2757. 853.58 s [vector] splitAt: OK
  2758. 853.58 s [vector] +++ OK, passed 100 tests.
  2759. 853.58 s [vector] empty: OK
  2760. 853.58 s [vector] +++ OK, passed 1 test.
  2761. 853.58 s [vector] singleton: OK
  2762. 853.58 s [vector] +++ OK, passed 100 tests.
  2763. 853.58 s [vector] replicate: OK
  2764. 853.58 s [vector] +++ OK, passed 100 tests.
  2765. 853.58 s [vector] generate: OK
  2766. 853.58 s [vector] +++ OK, passed 100 tests.
  2767. 853.58 s [vector] iterateN: OK
  2768. 853.58 s [vector] +++ OK, passed 100 tests.
  2769. 853.58 s [vector] iterateNM: OK (0.09s)
  2770. 853.58 s [vector] +++ OK, passed 100 tests.
  2771. 853.58 s [vector] generateM: OK (0.01s)
  2772. 853.58 s [vector] +++ OK, passed 100 tests.
  2773. 853.58 s [vector] replicateM: OK (0.02s)
  2774. 853.58 s [vector] +++ OK, passed 100 tests.
  2775. 853.58 s [vector] create: OK
  2776. 853.58 s [vector] +++ OK, passed 100 tests.
  2777. 853.58 s [vector] createT: OK
  2778. 853.58 s [vector] +++ OK, passed 100 tests.
  2779. 853.58 s [vector] unfoldr: OK
  2780. 853.58 s [vector] +++ OK, passed 100 tests.
  2781. 853.58 s [vector] unfoldrN: OK
  2782. 853.58 s [vector] +++ OK, passed 100 tests.
  2783. 853.58 s [vector] unfoldrExactN: OK
  2784. 853.58 s [vector] +++ OK, passed 100 tests.
  2785. 853.58 s [vector] unfoldrM: OK
  2786. 853.58 s [vector] +++ OK, passed 100 tests.
  2787. 853.58 s [vector] unfoldrNM: OK
  2788. 853.58 s [vector] +++ OK, passed 100 tests.
  2789. 853.58 s [vector] unfoldrExactNM: OK (0.02s)
  2790. 853.58 s [vector] +++ OK, passed 100 tests.
  2791. 853.58 s [vector] constructN: OK (0.02s)
  2792. 853.58 s [vector] +++ OK, passed 100 tests.
  2793. 853.58 s [vector] constructrN: OK
  2794. 853.58 s [vector] +++ OK, passed 100 tests.
  2795. 853.58 s [vector] cons: OK
  2796. 853.58 s [vector] +++ OK, passed 100 tests.
  2797. 853.58 s [vector] snoc: OK
  2798. 853.58 s [vector] +++ OK, passed 100 tests.
  2799. 853.58 s [vector] append: OK
  2800. 853.58 s [vector] +++ OK, passed 100 tests.
  2801. 853.58 s [vector] concat: OK (0.02s)
  2802. 853.58 s [vector] +++ OK, passed 100 tests.
  2803. 853.58 s [vector] force: OK
  2804. 853.58 s [vector] +++ OK, passed 100 tests.
  2805. 853.58 s [vector] upd: OK
  2806. 853.58 s [vector] +++ OK, passed 100 tests.
  2807. 853.58 s [vector] accum: OK
  2808. 853.58 s [vector] +++ OK, passed 100 tests.
  2809. 853.58 s [vector] reverse: OK
  2810. 853.58 s [vector] +++ OK, passed 100 tests.
  2811. 853.58 s [vector] backpermute: OK
  2812. 853.58 s [vector] +++ OK, passed 100 tests.
  2813. 853.58 s [vector] map: OK
  2814. 853.58 s [vector] +++ OK, passed 100 tests.
  2815. 853.58 s [vector] imap: OK
  2816. 853.58 s [vector] +++ OK, passed 100 tests.
  2817. 853.58 s [vector] concatMap: OK
  2818. 853.58 s [vector] +++ OK, passed 100 tests.
  2819. 853.58 s [vector] mapM: OK
  2820. 853.59 s [vector] +++ OK, passed 100 tests.
  2821. 853.59 s [vector] mapM_: OK (0.01s)
  2822. 853.59 s [vector] +++ OK, passed 100 tests.
  2823. 853.59 s [vector] forM: OK
  2824. 853.59 s [vector] +++ OK, passed 100 tests.
  2825. 853.59 s [vector] forM_: OK (0.01s)
  2826. 853.59 s [vector] +++ OK, passed 100 tests.
  2827. 853.59 s [vector] imapM: OK
  2828. 853.59 s [vector] +++ OK, passed 100 tests.
  2829. 853.59 s [vector] imapM_: OK
  2830. 853.59 s [vector] +++ OK, passed 100 tests.
  2831. 853.59 s [vector] zipWith: OK
  2832. 853.59 s [vector] +++ OK, passed 100 tests.
  2833. 853.59 s [vector] zipWith3: OK
  2834. 853.59 s [vector] +++ OK, passed 100 tests.
  2835. 853.59 s [vector] izipWith: OK
  2836. 853.59 s [vector] +++ OK, passed 100 tests.
  2837. 853.59 s [vector] izipWith3: OK
  2838. 853.59 s [vector] +++ OK, passed 100 tests.
  2839. 853.59 s [vector] izipWithM: OK
  2840. 853.59 s [vector] +++ OK, passed 100 tests.
  2841. 853.59 s [vector] izipWithM_: OK
  2842. 853.59 s [vector] +++ OK, passed 100 tests.
  2843. 853.59 s [vector] zipWithM: OK
  2844. 853.59 s [vector] +++ OK, passed 100 tests.
  2845. 853.59 s [vector] zipWithM_: OK
  2846. 853.59 s [vector] +++ OK, passed 100 tests.
  2847. 853.59 s [vector] filter: OK
  2848. 853.59 s [vector] +++ OK, passed 100 tests.
  2849. 853.59 s [vector] ifilter: OK
  2850. 853.59 s [vector] +++ OK, passed 100 tests.
  2851. 853.59 s [vector] filterM: OK
  2852. 853.59 s [vector] +++ OK, passed 100 tests.
  2853. 853.59 s [vector] uniq: OK
  2854. 853.59 s [vector] +++ OK, passed 100 tests.
  2855. 853.59 s [vector] mapMaybe: OK
  2856. 853.59 s [vector] +++ OK, passed 100 tests.
  2857. 853.59 s [vector] imapMaybe: OK
  2858. 853.59 s [vector] +++ OK, passed 100 tests.
  2859. 853.59 s [vector] takeWhile: OK
  2860. 853.59 s [vector] +++ OK, passed 100 tests.
  2861. 853.59 s [vector] dropWhile: OK
  2862. 853.59 s [vector] +++ OK, passed 100 tests.
  2863. 853.59 s [vector] partition: OK
  2864. 853.59 s [vector] +++ OK, passed 100 tests.
  2865. 853.59 s [vector] partitionWith: OK
  2866. 853.59 s [vector] +++ OK, passed 100 tests.
  2867. 853.59 s [vector] span: OK
  2868. 853.59 s [vector] +++ OK, passed 100 tests.
  2869. 853.59 s [vector] break: OK
  2870. 853.59 s [vector] +++ OK, passed 100 tests.
  2871. 853.59 s [vector] spanR: OK
  2872. 853.59 s [vector] +++ OK, passed 100 tests.
  2873. 853.59 s [vector] breakR: OK
  2874. 853.59 s [vector] +++ OK, passed 100 tests.
  2875. 853.59 s [vector] groupBy: OK
  2876. 853.59 s [vector] +++ OK, passed 100 tests.
  2877. 853.59 s [vector] elem: OK
  2878. 853.59 s [vector] +++ OK, passed 100 tests.
  2879. 853.59 s [vector] notElem: OK
  2880. 853.59 s [vector] +++ OK, passed 100 tests.
  2881. 853.59 s [vector] find: OK
  2882. 853.59 s [vector] +++ OK, passed 100 tests.
  2883. 853.59 s [vector] findIndex: OK
  2884. 853.59 s [vector] +++ OK, passed 100 tests.
  2885. 853.59 s [vector] findIndexR: OK
  2886. 853.59 s [vector] +++ OK, passed 100 tests.
  2887. 853.59 s [vector] findIndices: OK
  2888. 853.59 s [vector] +++ OK, passed 100 tests.
  2889. 853.59 s [vector] elemIndex: OK
  2890. 853.59 s [vector] +++ OK, passed 100 tests.
  2891. 853.59 s [vector] elemIndices: OK
  2892. 853.59 s [vector] +++ OK, passed 100 tests.
  2893. 853.59 s [vector] foldl: OK
  2894. 853.59 s [vector] +++ OK, passed 100 tests.
  2895. 853.59 s [vector] foldl1: OK
  2896. 853.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2897. 853.59 s [vector] foldl': OK
  2898. 853.59 s [vector] +++ OK, passed 100 tests.
  2899. 853.59 s [vector] foldl1': OK
  2900. 853.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2901. 853.59 s [vector] foldr: OK
  2902. 853.60 s [vector] +++ OK, passed 100 tests.
  2903. 853.60 s [vector] foldr1: OK
  2904. 853.60 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2905. 853.60 s [vector] foldr': OK
  2906. 853.60 s [vector] +++ OK, passed 100 tests.
  2907. 853.60 s [vector] foldr1': OK
  2908. 853.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2909. 853.60 s [vector] ifoldl: OK
  2910. 853.60 s [vector] +++ OK, passed 100 tests.
  2911. 853.60 s [vector] ifoldl': OK
  2912. 853.60 s [vector] +++ OK, passed 100 tests.
  2913. 853.60 s [vector] ifoldr: OK
  2914. 853.60 s [vector] +++ OK, passed 100 tests.
  2915. 853.60 s [vector] ifoldr': OK
  2916. 853.60 s [vector] +++ OK, passed 100 tests.
  2917. 853.60 s [vector] ifoldM: OK
  2918. 853.60 s [vector] +++ OK, passed 100 tests.
  2919. 853.60 s [vector] ifoldM': OK
  2920. 853.60 s [vector] +++ OK, passed 100 tests.
  2921. 853.60 s [vector] ifoldM_: OK (0.02s)
  2922. 853.60 s [vector] +++ OK, passed 100 tests.
  2923. 853.60 s [vector] ifoldM'_: OK (0.01s)
  2924. 853.60 s [vector] +++ OK, passed 100 tests.
  2925. 853.60 s [vector] all: OK
  2926. 853.60 s [vector] +++ OK, passed 100 tests.
  2927. 853.60 s [vector] any: OK
  2928. 853.60 s [vector] +++ OK, passed 100 tests.
  2929. 853.60 s [vector] prescanl: OK
  2930. 853.60 s [vector] +++ OK, passed 100 tests.
  2931. 853.60 s [vector] prescanl': OK
  2932. 853.60 s [vector] +++ OK, passed 100 tests.
  2933. 853.60 s [vector] postscanl: OK
  2934. 853.60 s [vector] +++ OK, passed 100 tests.
  2935. 853.60 s [vector] postscanl': OK
  2936. 853.60 s [vector] +++ OK, passed 100 tests.
  2937. 853.60 s [vector] scanl: OK
  2938. 853.60 s [vector] +++ OK, passed 100 tests.
  2939. 853.60 s [vector] scanl': OK
  2940. 853.60 s [vector] +++ OK, passed 100 tests.
  2941. 853.60 s [vector] scanl1: OK
  2942. 853.60 s [vector] +++ OK, passed 100 tests.
  2943. 853.60 s [vector] scanl1': OK
  2944. 853.60 s [vector] +++ OK, passed 100 tests.
  2945. 853.60 s [vector] iscanl: OK
  2946. 853.60 s [vector] +++ OK, passed 100 tests.
  2947. 853.60 s [vector] iscanl': OK
  2948. 853.60 s [vector] +++ OK, passed 100 tests.
  2949. 853.60 s [vector] prescanr: OK
  2950. 853.60 s [vector] +++ OK, passed 100 tests.
  2951. 853.60 s [vector] prescanr': OK
  2952. 853.60 s [vector] +++ OK, passed 100 tests.
  2953. 853.60 s [vector] postscanr: OK
  2954. 853.60 s [vector] +++ OK, passed 100 tests.
  2955. 853.60 s [vector] postscanr': OK
  2956. 853.60 s [vector] +++ OK, passed 100 tests.
  2957. 853.60 s [vector] scanr: OK
  2958. 853.60 s [vector] +++ OK, passed 100 tests.
  2959. 853.60 s [vector] scanr': OK
  2960. 853.60 s [vector] +++ OK, passed 100 tests.
  2961. 853.60 s [vector] scanr1: OK
  2962. 853.60 s [vector] +++ OK, passed 100 tests.
  2963. 853.60 s [vector] scanr1': OK
  2964. 853.60 s [vector] +++ OK, passed 100 tests.
  2965. 853.60 s [vector] iscanr: OK
  2966. 853.60 s [vector] +++ OK, passed 100 tests.
  2967. 853.60 s [vector] iscanr': OK
  2968. 853.60 s [vector] +++ OK, passed 100 tests.
  2969. 853.60 s [vector] mut_read: OK
  2970. 853.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2971. 853.60 s [vector] mut_write: OK
  2972. 853.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2973. 853.60 s [vector] mut_modify: OK
  2974. 853.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2975. 853.60 s [vector] mut_generate: OK
  2976. 853.60 s [vector] +++ OK, passed 100 tests.
  2977. 853.60 s [vector] mut_generateM: OK
  2978. 853.60 s [vector] +++ OK, passed 100 tests.
  2979. 853.60 s [vector] mut_mapM_: OK (0.01s)
  2980. 853.60 s [vector] +++ OK, passed 100 tests.
  2981. 853.60 s [vector] mut_imapM_: OK (0.01s)
  2982. 853.60 s [vector] +++ OK, passed 100 tests.
  2983. 853.60 s [vector] mut_forM_: OK (0.01s)
  2984. 853.60 s [vector] +++ OK, passed 100 tests.
  2985. 853.60 s [vector] mut_iforM_: OK (0.01s)
  2986. 853.60 s [vector] +++ OK, passed 100 tests.
  2987. 853.60 s [vector] mut_foldr: OK
  2988. 853.60 s [vector] +++ OK, passed 100 tests.
  2989. 853.60 s [vector] mut_foldr': OK
  2990. 853.60 s [vector] +++ OK, passed 100 tests.
  2991. 853.60 s [vector] mut_foldl: OK
  2992. 853.60 s [vector] +++ OK, passed 100 tests.
  2993. 853.60 s [vector] mut_foldl': OK
  2994. 853.60 s [vector] +++ OK, passed 100 tests.
  2995. 853.60 s [vector] mut_ifoldr: OK
  2996. 853.60 s [vector] +++ OK, passed 100 tests.
  2997. 853.60 s [vector] mut_ifoldr': OK
  2998. 853.60 s [vector] +++ OK, passed 100 tests.
  2999. 853.60 s [vector] mut_ifoldl: OK
  3000. 853.60 s [vector] +++ OK, passed 100 tests.
  3001. 853.60 s [vector] mut_ifoldl': OK
  3002. 853.60 s [vector] +++ OK, passed 100 tests.
  3003. 853.60 s [vector] mut_foldM: OK
  3004. 853.60 s [vector] +++ OK, passed 100 tests.
  3005. 853.60 s [vector] mut_foldM': OK
  3006. 853.60 s [vector] +++ OK, passed 100 tests.
  3007. 853.60 s [vector] mut_foldrM: OK
  3008. 853.60 s [vector] +++ OK, passed 100 tests.
  3009. 853.60 s [vector] mut_foldrM': OK
  3010. 853.60 s [vector] +++ OK, passed 100 tests.
  3011. 853.60 s [vector] mut_ifoldM: OK
  3012. 853.60 s [vector] +++ OK, passed 100 tests.
  3013. 853.60 s [vector] mut_ifoldM': OK
  3014. 853.60 s [vector] +++ OK, passed 100 tests.
  3015. 853.60 s [vector] mut_ifoldrM: OK
  3016. 853.60 s [vector] +++ OK, passed 100 tests.
  3017. 853.60 s [vector] mut_ifoldrM': OK
  3018. 853.60 s [vector] +++ OK, passed 100 tests.
  3019. 853.60 s [vector] compare: OK
  3020. 853.60 s [vector] +++ OK, passed 100 tests.
  3021. 853.60 s [vector] maximum: OK
  3022. 853.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3023. 853.60 s [vector] minimum: OK
  3024. 853.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3025. 853.60 s [vector] minIndex: OK
  3026. 853.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3027. 853.60 s [vector] maxIndex: OK
  3028. 853.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3029. 853.60 s [vector] maximumBy: OK
  3030. 853.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3031. 853.60 s [vector] minimumBy: OK
  3032. 853.60 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3033. 853.60 s [vector] maximumOn: OK
  3034. 853.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3035. 853.60 s [vector] minimumOn: OK
  3036. 853.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3037. 853.61 s [vector] maxIndexBy: OK
  3038. 853.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3039. 853.61 s [vector] minIndexBy: OK
  3040. 853.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3041. 853.61 s [vector] ListFirstMaxIndexWins: OK
  3042. 853.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3043. 853.61 s [vector] FalseListFirstMaxIndexWins: OK
  3044. 853.61 s [vector] +++ OK, failed as expected. (after 1 test):
  3045. 853.61 s [vector] Exception:
  3046. 853.61 s [vector] Prelude.foldr1: empty list
  3047. 853.61 s [vector] CallStack (from HasCallStack):
  3048. 853.61 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  3049. 853.61 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  3050. 853.61 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3051. 853.61 s [vector] []
  3052. 853.61 s [vector] zip: OK
  3053. 853.61 s [vector] +++ OK, passed 100 tests.
  3054. 853.61 s [vector] zip3: OK
  3055. 853.61 s [vector] +++ OK, passed 100 tests.
  3056. 853.61 s [vector] unzip: OK
  3057. 853.61 s [vector] +++ OK, passed 100 tests.
  3058. 853.61 s [vector] unzip3: OK
  3059. 853.61 s [vector] +++ OK, passed 100 tests.
  3060. 853.61 s [vector] indexed: OK
  3061. 853.61 s [vector] +++ OK, passed 100 tests.
  3062. 853.61 s [vector] update: OK
  3063. 853.61 s [vector] +++ OK, passed 100 tests.
  3064. 853.61 s [vector] mempty: OK
  3065. 853.61 s [vector] +++ OK, passed 1 test.
  3066. 853.61 s [vector] mappend: OK
  3067. 853.61 s [vector] +++ OK, passed 100 tests.
  3068. 853.61 s [vector] mconcat: OK (0.01s)
  3069. 853.61 s [vector] +++ OK, passed 100 tests.
  3070. 853.61 s [vector] glength: OK
  3071. 853.61 s [vector] +++ OK, passed 100 tests.
  3072. 853.61 s [vector] and: OK
  3073. 853.61 s [vector] +++ OK, passed 100 tests.
  3074. 853.61 s [vector] or: OK
  3075. 853.61 s [vector] +++ OK, passed 100 tests.
  3076. 853.61 s [vector] (Int)
  3077. 853.61 s [vector] fromList.toList == id: OK
  3078. 853.61 s [vector] +++ OK, passed 100 tests.
  3079. 853.61 s [vector] toList.fromList == id: OK
  3080. 853.61 s [vector] +++ OK, passed 100 tests.
  3081. 853.61 s [vector] unstream.stream == id: OK
  3082. 853.61 s [vector] +++ OK, passed 100 tests.
  3083. 853.61 s [vector] stream.unstream == id: OK
  3084. 853.61 s [vector] +++ OK, passed 100 tests.
  3085. 853.61 s [vector] eq: OK
  3086. 853.61 s [vector] +++ OK, passed 100 tests.
  3087. 853.61 s [vector] length: OK
  3088. 853.61 s [vector] +++ OK, passed 100 tests.
  3089. 853.61 s [vector] null: OK
  3090. 853.61 s [vector] +++ OK, passed 100 tests.
  3091. 853.61 s [vector] index: OK
  3092. 853.61 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3093. 853.61 s [vector] safeIndex: OK
  3094. 853.61 s [vector] +++ OK, passed 100 tests.
  3095. 853.61 s [vector] head: OK
  3096. 853.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3097. 853.61 s [vector] last: OK
  3098. 853.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3099. 853.61 s [vector] unsafeIndex: OK
  3100. 853.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3101. 853.61 s [vector] unsafeHead: OK
  3102. 853.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3103. 853.61 s [vector] unsafeLast: OK
  3104. 853.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3105. 853.61 s [vector] slice: OK
  3106. 853.61 s [vector] +++ OK, passed 100 tests.
  3107. 853.61 s [vector] init: OK
  3108. 853.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3109. 853.61 s [vector] tail: OK
  3110. 853.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3111. 853.61 s [vector] take: OK
  3112. 853.61 s [vector] +++ OK, passed 100 tests.
  3113. 853.61 s [vector] drop: OK
  3114. 853.61 s [vector] +++ OK, passed 100 tests.
  3115. 853.61 s [vector] splitAt: OK
  3116. 853.61 s [vector] +++ OK, passed 100 tests.
  3117. 853.61 s [vector] empty: OK
  3118. 853.61 s [vector] +++ OK, passed 1 test.
  3119. 853.61 s [vector] singleton: OK
  3120. 853.61 s [vector] +++ OK, passed 100 tests.
  3121. 853.61 s [vector] replicate: OK
  3122. 853.61 s [vector] +++ OK, passed 100 tests.
  3123. 853.61 s [vector] generate: OK
  3124. 853.61 s [vector] +++ OK, passed 100 tests.
  3125. 853.61 s [vector] iterateN: OK
  3126. 853.61 s [vector] +++ OK, passed 100 tests.
  3127. 853.61 s [vector] iterateNM: OK (0.04s)
  3128. 853.61 s [vector] +++ OK, passed 100 tests.
  3129. 853.61 s [vector] generateM: OK (0.01s)
  3130. 853.61 s [vector] +++ OK, passed 100 tests.
  3131. 853.61 s [vector] replicateM: OK
  3132. 853.61 s [vector] +++ OK, passed 100 tests.
  3133. 853.61 s [vector] create: OK
  3134. 853.61 s [vector] +++ OK, passed 100 tests.
  3135. 853.61 s [vector] createT: OK
  3136. 853.61 s [vector] +++ OK, passed 100 tests.
  3137. 853.61 s [vector] unfoldr: OK
  3138. 853.61 s [vector] +++ OK, passed 100 tests.
  3139. 853.61 s [vector] unfoldrN: OK
  3140. 853.61 s [vector] +++ OK, passed 100 tests.
  3141. 853.61 s [vector] unfoldrExactN: OK
  3142. 853.61 s [vector] +++ OK, passed 100 tests.
  3143. 853.61 s [vector] unfoldrM: OK
  3144. 853.61 s [vector] +++ OK, passed 100 tests.
  3145. 853.61 s [vector] unfoldrNM: OK
  3146. 853.61 s [vector] +++ OK, passed 100 tests.
  3147. 853.61 s [vector] unfoldrExactNM: OK (0.04s)
  3148. 853.61 s [vector] +++ OK, passed 100 tests.
  3149. 853.61 s [vector] constructN: OK
  3150. 853.61 s [vector] +++ OK, passed 100 tests.
  3151. 853.61 s [vector] constructrN: OK
  3152. 853.61 s [vector] +++ OK, passed 100 tests.
  3153. 853.61 s [vector] cons: OK
  3154. 853.61 s [vector] +++ OK, passed 100 tests.
  3155. 853.61 s [vector] snoc: OK
  3156. 853.61 s [vector] +++ OK, passed 100 tests.
  3157. 853.61 s [vector] append: OK
  3158. 853.61 s [vector] +++ OK, passed 100 tests.
  3159. 853.61 s [vector] concat: OK (0.02s)
  3160. 853.61 s [vector] +++ OK, passed 100 tests.
  3161. 853.61 s [vector] force: OK
  3162. 853.61 s [vector] +++ OK, passed 100 tests.
  3163. 853.61 s [vector] upd: OK
  3164. 853.61 s [vector] +++ OK, passed 100 tests.
  3165. 853.61 s [vector] accum: OK
  3166. 853.61 s [vector] +++ OK, passed 100 tests.
  3167. 853.61 s [vector] reverse: OK
  3168. 853.61 s [vector] +++ OK, passed 100 tests.
  3169. 853.61 s [vector] backpermute: OK
  3170. 853.61 s [vector] +++ OK, passed 100 tests.
  3171. 853.61 s [vector] map: OK
  3172. 853.61 s [vector] +++ OK, passed 100 tests.
  3173. 853.61 s [vector] imap: OK
  3174. 853.61 s [vector] +++ OK, passed 100 tests.
  3175. 853.61 s [vector] concatMap: OK
  3176. 853.61 s [vector] +++ OK, passed 100 tests.
  3177. 853.61 s [vector] mapM: OK
  3178. 853.61 s [vector] +++ OK, passed 100 tests.
  3179. 853.61 s [vector] mapM_: OK (0.02s)
  3180. 853.61 s [vector] +++ OK, passed 100 tests.
  3181. 853.61 s [vector] forM: OK
  3182. 853.61 s [vector] +++ OK, passed 100 tests.
  3183. 853.61 s [vector] forM_: OK (0.02s)
  3184. 853.61 s [vector] +++ OK, passed 100 tests.
  3185. 853.61 s [vector] imapM: OK
  3186. 853.61 s [vector] +++ OK, passed 100 tests.
  3187. 853.61 s [vector] imapM_: OK (0.02s)
  3188. 853.61 s [vector] +++ OK, passed 100 tests.
  3189. 853.61 s [vector] zipWith: OK
  3190. 853.61 s [vector] +++ OK, passed 100 tests.
  3191. 853.61 s [vector] zipWith3: OK
  3192. 853.61 s [vector] +++ OK, passed 100 tests.
  3193. 853.61 s [vector] izipWith: OK
  3194. 853.61 s [vector] +++ OK, passed 100 tests.
  3195. 853.61 s [vector] izipWith3: OK
  3196. 853.61 s [vector] +++ OK, passed 100 tests.
  3197. 853.61 s [vector] izipWithM: OK
  3198. 853.61 s [vector] +++ OK, passed 100 tests.
  3199. 853.61 s [vector] izipWithM_: OK (0.02s)
  3200. 853.61 s [vector] +++ OK, passed 100 tests.
  3201. 853.61 s [vector] zipWithM: OK
  3202. 853.61 s [vector] +++ OK, passed 100 tests.
  3203. 853.61 s [vector] zipWithM_: OK (0.01s)
  3204. 853.61 s [vector] +++ OK, passed 100 tests.
  3205. 853.61 s [vector] filter: OK
  3206. 853.61 s [vector] +++ OK, passed 100 tests.
  3207. 853.61 s [vector] ifilter: OK
  3208. 853.61 s [vector] +++ OK, passed 100 tests.
  3209. 853.61 s [vector] filterM: OK (0.02s)
  3210. 853.61 s [vector] +++ OK, passed 100 tests.
  3211. 853.61 s [vector] uniq: OK (0.01s)
  3212. 853.61 s [vector] +++ OK, passed 100 tests.
  3213. 853.61 s [vector] mapMaybe: OK
  3214. 853.61 s [vector] +++ OK, passed 100 tests.
  3215. 853.61 s [vector] imapMaybe: OK
  3216. 853.61 s [vector] +++ OK, passed 100 tests.
  3217. 853.61 s [vector] takeWhile: OK
  3218. 853.61 s [vector] +++ OK, passed 100 tests.
  3219. 853.61 s [vector] dropWhile: OK
  3220. 853.61 s [vector] +++ OK, passed 100 tests.
  3221. 853.61 s [vector] partition: OK
  3222. 853.61 s [vector] +++ OK, passed 100 tests.
  3223. 853.61 s [vector] partitionWith: OK
  3224. 853.61 s [vector] +++ OK, passed 100 tests.
  3225. 853.61 s [vector] span: OK
  3226. 853.61 s [vector] +++ OK, passed 100 tests.
  3227. 853.61 s [vector] break: OK
  3228. 853.61 s [vector] +++ OK, passed 100 tests.
  3229. 853.61 s [vector] spanR: OK
  3230. 853.61 s [vector] +++ OK, passed 100 tests.
  3231. 853.61 s [vector] breakR: OK
  3232. 853.61 s [vector] +++ OK, passed 100 tests.
  3233. 853.61 s [vector] groupBy: OK
  3234. 853.61 s [vector] +++ OK, passed 100 tests.
  3235. 853.61 s [vector] elem: OK
  3236. 853.62 s [vector] +++ OK, passed 100 tests.
  3237. 853.62 s [vector] notElem: OK
  3238. 853.62 s [vector] +++ OK, passed 100 tests.
  3239. 853.62 s [vector] find: OK
  3240. 853.62 s [vector] +++ OK, passed 100 tests.
  3241. 853.62 s [vector] findIndex: OK
  3242. 853.62 s [vector] +++ OK, passed 100 tests.
  3243. 853.62 s [vector] findIndexR: OK
  3244. 853.62 s [vector] +++ OK, passed 100 tests.
  3245. 853.62 s [vector] findIndices: OK
  3246. 853.62 s [vector] +++ OK, passed 100 tests.
  3247. 853.62 s [vector] elemIndex: OK
  3248. 853.62 s [vector] +++ OK, passed 100 tests.
  3249. 853.62 s [vector] elemIndices: OK
  3250. 853.62 s [vector] +++ OK, passed 100 tests.
  3251. 853.62 s [vector] foldl: OK
  3252. 853.62 s [vector] +++ OK, passed 100 tests.
  3253. 853.62 s [vector] foldl1: OK
  3254. 853.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3255. 853.62 s [vector] foldl': OK
  3256. 853.62 s [vector] +++ OK, passed 100 tests.
  3257. 853.62 s [vector] foldl1': OK
  3258. 853.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3259. 853.62 s [vector] foldr: OK
  3260. 853.62 s [vector] +++ OK, passed 100 tests.
  3261. 853.62 s [vector] foldr1: OK
  3262. 853.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3263. 853.62 s [vector] foldr': OK
  3264. 853.62 s [vector] +++ OK, passed 100 tests.
  3265. 853.62 s [vector] foldr1': OK
  3266. 853.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3267. 853.62 s [vector] ifoldl: OK
  3268. 853.62 s [vector] +++ OK, passed 100 tests.
  3269. 853.62 s [vector] ifoldl': OK
  3270. 853.62 s [vector] +++ OK, passed 100 tests.
  3271. 853.62 s [vector] ifoldr: OK
  3272. 853.62 s [vector] +++ OK, passed 100 tests.
  3273. 853.62 s [vector] ifoldr': OK
  3274. 853.62 s [vector] +++ OK, passed 100 tests.
  3275. 853.62 s [vector] ifoldM: OK
  3276. 853.62 s [vector] +++ OK, passed 100 tests.
  3277. 853.62 s [vector] ifoldM': OK
  3278. 853.62 s [vector] +++ OK, passed 100 tests.
  3279. 853.62 s [vector] ifoldM_: OK (0.02s)
  3280. 853.62 s [vector] +++ OK, passed 100 tests.
  3281. 853.62 s [vector] ifoldM'_: OK
  3282. 853.62 s [vector] +++ OK, passed 100 tests.
  3283. 853.62 s [vector] all: OK
  3284. 853.62 s [vector] +++ OK, passed 100 tests.
  3285. 853.62 s [vector] any: OK
  3286. 853.62 s [vector] +++ OK, passed 100 tests.
  3287. 853.62 s [vector] prescanl: OK
  3288. 853.62 s [vector] +++ OK, passed 100 tests.
  3289. 853.62 s [vector] prescanl': OK
  3290. 853.62 s [vector] +++ OK, passed 100 tests.
  3291. 853.62 s [vector] postscanl: OK
  3292. 853.62 s [vector] +++ OK, passed 100 tests.
  3293. 853.62 s [vector] postscanl': OK
  3294. 853.62 s [vector] +++ OK, passed 100 tests.
  3295. 853.62 s [vector] scanl: OK
  3296. 853.62 s [vector] +++ OK, passed 100 tests.
  3297. 853.62 s [vector] scanl': OK
  3298. 853.62 s [vector] +++ OK, passed 100 tests.
  3299. 853.62 s [vector] scanl1: OK
  3300. 853.62 s [vector] +++ OK, passed 100 tests.
  3301. 853.62 s [vector] scanl1': OK
  3302. 853.62 s [vector] +++ OK, passed 100 tests.
  3303. 853.62 s [vector] iscanl: OK
  3304. 853.62 s [vector] +++ OK, passed 100 tests.
  3305. 853.62 s [vector] iscanl': OK
  3306. 853.62 s [vector] +++ OK, passed 100 tests.
  3307. 853.62 s [vector] prescanr: OK
  3308. 853.62 s [vector] +++ OK, passed 100 tests.
  3309. 853.62 s [vector] prescanr': OK
  3310. 853.62 s [vector] +++ OK, passed 100 tests.
  3311. 853.62 s [vector] postscanr: OK
  3312. 853.62 s [vector] +++ OK, passed 100 tests.
  3313. 853.62 s [vector] postscanr': OK
  3314. 853.62 s [vector] +++ OK, passed 100 tests.
  3315. 853.62 s [vector] scanr: OK
  3316. 853.62 s [vector] +++ OK, passed 100 tests.
  3317. 853.62 s [vector] scanr': OK
  3318. 853.62 s [vector] +++ OK, passed 100 tests.
  3319. 853.62 s [vector] scanr1: OK
  3320. 853.62 s [vector] +++ OK, passed 100 tests.
  3321. 853.62 s [vector] scanr1': OK
  3322. 853.62 s [vector] +++ OK, passed 100 tests.
  3323. 853.62 s [vector] iscanr: OK
  3324. 853.62 s [vector] +++ OK, passed 100 tests.
  3325. 853.62 s [vector] iscanr': OK
  3326. 853.62 s [vector] +++ OK, passed 100 tests.
  3327. 853.62 s [vector] mut_read: OK
  3328. 853.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3329. 853.62 s [vector] mut_write: OK
  3330. 853.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3331. 853.62 s [vector] mut_modify: OK
  3332. 853.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3333. 853.62 s [vector] mut_generate: OK
  3334. 853.62 s [vector] +++ OK, passed 100 tests.
  3335. 853.62 s [vector] mut_generateM: OK (0.01s)
  3336. 853.62 s [vector] +++ OK, passed 100 tests.
  3337. 853.62 s [vector] mut_mapM_: OK (0.02s)
  3338. 853.62 s [vector] +++ OK, passed 100 tests.
  3339. 853.62 s [vector] mut_imapM_: OK (0.02s)
  3340. 853.62 s [vector] +++ OK, passed 100 tests.
  3341. 853.62 s [vector] mut_forM_: OK (0.02s)
  3342. 853.62 s [vector] +++ OK, passed 100 tests.
  3343. 853.62 s [vector] mut_iforM_: OK (0.02s)
  3344. 853.62 s [vector] +++ OK, passed 100 tests.
  3345. 853.62 s [vector] mut_foldr: OK
  3346. 853.62 s [vector] +++ OK, passed 100 tests.
  3347. 853.62 s [vector] mut_foldr': OK
  3348. 853.62 s [vector] +++ OK, passed 100 tests.
  3349. 853.62 s [vector] mut_foldl: OK
  3350. 853.62 s [vector] +++ OK, passed 100 tests.
  3351. 853.62 s [vector] mut_foldl': OK
  3352. 853.62 s [vector] +++ OK, passed 100 tests.
  3353. 853.62 s [vector] mut_ifoldr: OK
  3354. 853.62 s [vector] +++ OK, passed 100 tests.
  3355. 853.62 s [vector] mut_ifoldr': OK
  3356. 853.62 s [vector] +++ OK, passed 100 tests.
  3357. 853.62 s [vector] mut_ifoldl: OK
  3358. 853.62 s [vector] +++ OK, passed 100 tests.
  3359. 853.62 s [vector] mut_ifoldl': OK
  3360. 853.62 s [vector] +++ OK, passed 100 tests.
  3361. 853.62 s [vector] mut_foldM: OK
  3362. 853.62 s [vector] +++ OK, passed 100 tests.
  3363. 853.62 s [vector] mut_foldM': OK
  3364. 853.62 s [vector] +++ OK, passed 100 tests.
  3365. 853.62 s [vector] mut_foldrM: OK
  3366. 853.62 s [vector] +++ OK, passed 100 tests.
  3367. 853.62 s [vector] mut_foldrM': OK
  3368. 853.62 s [vector] +++ OK, passed 100 tests.
  3369. 853.62 s [vector] mut_ifoldM: OK
  3370. 853.62 s [vector] +++ OK, passed 100 tests.
  3371. 853.62 s [vector] mut_ifoldM': OK
  3372. 853.62 s [vector] +++ OK, passed 100 tests.
  3373. 853.62 s [vector] mut_ifoldrM: OK
  3374. 853.62 s [vector] +++ OK, passed 100 tests.
  3375. 853.62 s [vector] mut_ifoldrM': OK
  3376. 853.62 s [vector] +++ OK, passed 100 tests.
  3377. 853.62 s [vector] compare: OK
  3378. 853.62 s [vector] +++ OK, passed 100 tests.
  3379. 853.62 s [vector] maximum: OK
  3380. 853.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3381. 853.62 s [vector] minimum: OK
  3382. 853.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3383. 853.62 s [vector] minIndex: OK
  3384. 853.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3385. 853.62 s [vector] maxIndex: OK
  3386. 853.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3387. 853.62 s [vector] maximumBy: OK
  3388. 853.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3389. 853.62 s [vector] minimumBy: OK
  3390. 853.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3391. 853.62 s [vector] maximumOn: OK
  3392. 853.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3393. 853.62 s [vector] minimumOn: OK
  3394. 853.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3395. 853.62 s [vector] maxIndexBy: OK
  3396. 853.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3397. 853.62 s [vector] minIndexBy: OK
  3398. 853.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3399. 853.62 s [vector] ListFirstMaxIndexWins: OK
  3400. 853.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3401. 853.62 s [vector] FalseListFirstMaxIndexWins: OK
  3402. 853.62 s [vector] +++ OK, failed as expected. (after 1 test):
  3403. 853.62 s [vector] Exception:
  3404. 853.62 s [vector] Prelude.foldr1: empty list
  3405. 853.62 s [vector] CallStack (from HasCallStack):
  3406. 853.62 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  3407. 853.62 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  3408. 853.62 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3409. 853.62 s [vector] []
  3410. 853.62 s [vector] zip: OK
  3411. 853.62 s [vector] +++ OK, passed 100 tests.
  3412. 853.62 s [vector] zip3: OK
  3413. 853.62 s [vector] +++ OK, passed 100 tests.
  3414. 853.62 s [vector] unzip: OK
  3415. 853.62 s [vector] +++ OK, passed 100 tests.
  3416. 853.62 s [vector] unzip3: OK
  3417. 853.62 s [vector] +++ OK, passed 100 tests.
  3418. 853.62 s [vector] indexed: OK
  3419. 853.62 s [vector] +++ OK, passed 100 tests.
  3420. 853.62 s [vector] update: OK
  3421. 853.62 s [vector] +++ OK, passed 100 tests.
  3422. 853.62 s [vector] mempty: OK
  3423. 853.62 s [vector] +++ OK, passed 1 test.
  3424. 853.62 s [vector] mappend: OK
  3425. 853.62 s [vector] +++ OK, passed 100 tests.
  3426. 853.62 s [vector] mconcat: OK (0.02s)
  3427. 853.62 s [vector] +++ OK, passed 100 tests.
  3428. 853.62 s [vector] glength: OK
  3429. 853.62 s [vector] +++ OK, passed 100 tests.
  3430. 853.62 s [vector] sum: OK
  3431. 853.63 s [vector] +++ OK, passed 100 tests.
  3432. 853.63 s [vector] product: OK
  3433. 853.63 s [vector] +++ OK, passed 100 tests.
  3434. 853.63 s [vector] enumFromN: OK
  3435. 853.63 s [vector] +++ OK, passed 100 tests.
  3436. 853.63 s [vector] enumFromThenN: OK
  3437. 853.63 s [vector] +++ OK, passed 100 tests.
  3438. 853.63 s [vector] enumFromTo: OK
  3439. 853.63 s [vector] +++ OK, passed 100 tests.
  3440. 853.63 s [vector] enumFromThenTo: OK
  3441. 853.63 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3442. 853.63 s [vector] (Float)
  3443. 853.63 s [vector] fromList.toList == id: OK
  3444. 853.63 s [vector] +++ OK, passed 100 tests.
  3445. 853.63 s [vector] toList.fromList == id: OK
  3446. 853.63 s [vector] +++ OK, passed 100 tests.
  3447. 853.63 s [vector] unstream.stream == id: OK
  3448. 853.63 s [vector] +++ OK, passed 100 tests.
  3449. 853.63 s [vector] stream.unstream == id: OK
  3450. 853.63 s [vector] +++ OK, passed 100 tests.
  3451. 853.63 s [vector] eq: OK
  3452. 853.63 s [vector] +++ OK, passed 100 tests.
  3453. 853.63 s [vector] length: OK
  3454. 853.63 s [vector] +++ OK, passed 100 tests.
  3455. 853.63 s [vector] null: OK
  3456. 853.63 s [vector] +++ OK, passed 100 tests.
  3457. 853.63 s [vector] index: OK
  3458. 853.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3459. 853.63 s [vector] safeIndex: OK
  3460. 853.63 s [vector] +++ OK, passed 100 tests.
  3461. 853.63 s [vector] head: OK
  3462. 853.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3463. 853.63 s [vector] last: OK
  3464. 853.63 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3465. 853.63 s [vector] unsafeIndex: OK
  3466. 853.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3467. 853.63 s [vector] unsafeHead: OK
  3468. 853.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3469. 853.63 s [vector] unsafeLast: OK
  3470. 853.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3471. 853.63 s [vector] slice: OK
  3472. 853.63 s [vector] +++ OK, passed 100 tests.
  3473. 853.63 s [vector] init: OK
  3474. 853.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3475. 853.63 s [vector] tail: OK
  3476. 853.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3477. 853.63 s [vector] take: OK
  3478. 853.63 s [vector] +++ OK, passed 100 tests.
  3479. 853.63 s [vector] drop: OK
  3480. 853.63 s [vector] +++ OK, passed 100 tests.
  3481. 853.63 s [vector] splitAt: OK
  3482. 853.63 s [vector] +++ OK, passed 100 tests.
  3483. 853.63 s [vector] empty: OK
  3484. 853.63 s [vector] +++ OK, passed 1 test.
  3485. 853.63 s [vector] singleton: OK
  3486. 853.63 s [vector] +++ OK, passed 100 tests.
  3487. 853.63 s [vector] replicate: OK
  3488. 853.63 s [vector] +++ OK, passed 100 tests.
  3489. 853.63 s [vector] generate: OK
  3490. 853.63 s [vector] +++ OK, passed 100 tests.
  3491. 853.63 s [vector] iterateN: OK
  3492. 853.63 s [vector] +++ OK, passed 100 tests.
  3493. 853.63 s [vector] iterateNM: OK (0.05s)
  3494. 853.63 s [vector] +++ OK, passed 100 tests.
  3495. 853.63 s [vector] generateM: OK (0.04s)
  3496. 853.63 s [vector] +++ OK, passed 100 tests.
  3497. 853.63 s [vector] replicateM: OK
  3498. 853.63 s [vector] +++ OK, passed 100 tests.
  3499. 853.63 s [vector] create: OK
  3500. 853.63 s [vector] +++ OK, passed 100 tests.
  3501. 853.63 s [vector] createT: OK
  3502. 853.63 s [vector] +++ OK, passed 100 tests.
  3503. 853.63 s [vector] unfoldr: OK
  3504. 853.63 s [vector] +++ OK, passed 100 tests.
  3505. 853.63 s [vector] unfoldrN: OK
  3506. 853.63 s [vector] +++ OK, passed 100 tests.
  3507. 853.63 s [vector] unfoldrExactN: OK
  3508. 853.63 s [vector] +++ OK, passed 100 tests.
  3509. 853.63 s [vector] unfoldrM: OK
  3510. 853.63 s [vector] +++ OK, passed 100 tests.
  3511. 853.63 s [vector] unfoldrNM: OK
  3512. 853.63 s [vector] +++ OK, passed 100 tests.
  3513. 853.63 s [vector] unfoldrExactNM: OK (0.07s)
  3514. 853.63 s [vector] +++ OK, passed 100 tests.
  3515. 853.63 s [vector] constructN: OK (0.01s)
  3516. 853.63 s [vector] +++ OK, passed 100 tests.
  3517. 853.63 s [vector] constructrN: OK (0.01s)
  3518. 853.63 s [vector] +++ OK, passed 100 tests.
  3519. 853.63 s [vector] cons: OK
  3520. 853.63 s [vector] +++ OK, passed 100 tests.
  3521. 853.63 s [vector] snoc: OK
  3522. 853.63 s [vector] +++ OK, passed 100 tests.
  3523. 853.63 s [vector] append: OK
  3524. 853.63 s [vector] +++ OK, passed 100 tests.
  3525. 853.63 s [vector] concat: OK (0.02s)
  3526. 853.63 s [vector] +++ OK, passed 100 tests.
  3527. 853.63 s [vector] force: OK
  3528. 853.63 s [vector] +++ OK, passed 100 tests.
  3529. 853.63 s [vector] upd: OK
  3530. 853.63 s [vector] +++ OK, passed 100 tests.
  3531. 853.63 s [vector] accum: OK (0.01s)
  3532. 853.63 s [vector] +++ OK, passed 100 tests.
  3533. 853.63 s [vector] reverse: OK
  3534. 853.63 s [vector] +++ OK, passed 100 tests.
  3535. 853.63 s [vector] backpermute: OK
  3536. 853.63 s [vector] +++ OK, passed 100 tests.
  3537. 853.63 s [vector] map: OK
  3538. 853.63 s [vector] +++ OK, passed 100 tests.
  3539. 853.63 s [vector] imap: OK
  3540. 853.63 s [vector] +++ OK, passed 100 tests.
  3541. 853.63 s [vector] concatMap: OK
  3542. 853.63 s [vector] +++ OK, passed 100 tests.
  3543. 853.63 s [vector] mapM: OK
  3544. 853.63 s [vector] +++ OK, passed 100 tests.
  3545. 853.63 s [vector] mapM_: OK (0.04s)
  3546. 853.63 s [vector] +++ OK, passed 100 tests.
  3547. 853.63 s [vector] forM: OK
  3548. 853.63 s [vector] +++ OK, passed 100 tests.
  3549. 853.63 s [vector] forM_: OK (0.04s)
  3550. 853.63 s [vector] +++ OK, passed 100 tests.
  3551. 853.63 s [vector] imapM: OK
  3552. 853.63 s [vector] +++ OK, passed 100 tests.
  3553. 853.63 s [vector] imapM_: OK (0.04s)
  3554. 853.63 s [vector] +++ OK, passed 100 tests.
  3555. 853.63 s [vector] zipWith: OK
  3556. 853.63 s [vector] +++ OK, passed 100 tests.
  3557. 853.63 s [vector] zipWith3: OK
  3558. 853.63 s [vector] +++ OK, passed 100 tests.
  3559. 853.63 s [vector] izipWith: OK
  3560. 853.63 s [vector] +++ OK, passed 100 tests.
  3561. 853.63 s [vector] izipWith3: OK
  3562. 853.63 s [vector] +++ OK, passed 100 tests.
  3563. 853.63 s [vector] izipWithM: OK
  3564. 853.63 s [vector] +++ OK, passed 100 tests.
  3565. 853.63 s [vector] izipWithM_: OK (0.03s)
  3566. 853.63 s [vector] +++ OK, passed 100 tests.
  3567. 853.63 s [vector] zipWithM: OK
  3568. 853.63 s [vector] +++ OK, passed 100 tests.
  3569. 853.63 s [vector] zipWithM_: OK (0.03s)
  3570. 853.63 s [vector] +++ OK, passed 100 tests.
  3571. 853.63 s [vector] filter: OK
  3572. 853.63 s [vector] +++ OK, passed 100 tests.
  3573. 853.63 s [vector] ifilter: OK
  3574. 853.63 s [vector] +++ OK, passed 100 tests.
  3575. 853.63 s [vector] filterM: OK (0.05s)
  3576. 853.63 s [vector] +++ OK, passed 100 tests.
  3577. 853.63 s [vector] uniq: OK
  3578. 853.63 s [vector] +++ OK, passed 100 tests.
  3579. 853.63 s [vector] mapMaybe: OK
  3580. 853.63 s [vector] +++ OK, passed 100 tests.
  3581. 853.63 s [vector] imapMaybe: OK
  3582. 853.63 s [vector] +++ OK, passed 100 tests.
  3583. 853.63 s [vector] takeWhile: OK
  3584. 853.63 s [vector] +++ OK, passed 100 tests.
  3585. 853.63 s [vector] dropWhile: OK
  3586. 853.63 s [vector] +++ OK, passed 100 tests.
  3587. 853.63 s [vector] partition: OK
  3588. 853.63 s [vector] +++ OK, passed 100 tests.
  3589. 853.63 s [vector] partitionWith: OK
  3590. 853.63 s [vector] +++ OK, passed 100 tests.
  3591. 853.63 s [vector] span: OK
  3592. 853.63 s [vector] +++ OK, passed 100 tests.
  3593. 853.63 s [vector] break: OK
  3594. 853.63 s [vector] +++ OK, passed 100 tests.
  3595. 853.63 s [vector] spanR: OK
  3596. 853.63 s [vector] +++ OK, passed 100 tests.
  3597. 853.63 s [vector] breakR: OK
  3598. 853.63 s [vector] +++ OK, passed 100 tests.
  3599. 853.63 s [vector] groupBy: OK
  3600. 853.63 s [vector] +++ OK, passed 100 tests.
  3601. 853.63 s [vector] elem: OK
  3602. 853.63 s [vector] +++ OK, passed 100 tests.
  3603. 853.63 s [vector] notElem: OK
  3604. 853.63 s [vector] +++ OK, passed 100 tests.
  3605. 853.63 s [vector] find: OK
  3606. 853.63 s [vector] +++ OK, passed 100 tests.
  3607. 853.63 s [vector] findIndex: OK
  3608. 853.63 s [vector] +++ OK, passed 100 tests.
  3609. 853.63 s [vector] findIndexR: OK
  3610. 853.63 s [vector] +++ OK, passed 100 tests.
  3611. 853.63 s [vector] findIndices: OK
  3612. 853.63 s [vector] +++ OK, passed 100 tests.
  3613. 853.63 s [vector] elemIndex: OK
  3614. 853.63 s [vector] +++ OK, passed 100 tests.
  3615. 853.63 s [vector] elemIndices: OK
  3616. 853.63 s [vector] +++ OK, passed 100 tests.
  3617. 853.63 s [vector] foldl: OK
  3618. 853.63 s [vector] +++ OK, passed 100 tests.
  3619. 853.63 s [vector] foldl1: OK
  3620. 853.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3621. 853.63 s [vector] foldl': OK
  3622. 853.63 s [vector] +++ OK, passed 100 tests.
  3623. 853.63 s [vector] foldl1': OK
  3624. 853.63 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3625. 853.63 s [vector] foldr: OK
  3626. 853.63 s [vector] +++ OK, passed 100 tests.
  3627. 853.63 s [vector] foldr1: OK
  3628. 853.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3629. 853.63 s [vector] foldr': OK
  3630. 853.63 s [vector] +++ OK, passed 100 tests.
  3631. 853.63 s [vector] foldr1': OK (0.01s)
  3632. 853.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3633. 853.63 s [vector] ifoldl: OK (0.01s)
  3634. 853.63 s [vector] +++ OK, passed 100 tests.
  3635. 853.63 s [vector] ifoldl': OK (0.01s)
  3636. 853.63 s [vector] +++ OK, passed 100 tests.
  3637. 853.63 s [vector] ifoldr: OK (0.01s)
  3638. 853.63 s [vector] +++ OK, passed 100 tests.
  3639. 853.63 s [vector] ifoldr': OK (0.01s)
  3640. 853.63 s [vector] +++ OK, passed 100 tests.
  3641. 853.63 s [vector] ifoldM: OK
  3642. 853.63 s [vector] +++ OK, passed 100 tests.
  3643. 853.63 s [vector] ifoldM': OK (0.01s)
  3644. 853.63 s [vector] +++ OK, passed 100 tests.
  3645. 853.63 s [vector] ifoldM_: OK (0.03s)
  3646. 853.63 s [vector] +++ OK, passed 100 tests.
  3647. 853.63 s [vector] ifoldM'_: OK (0.03s)
  3648. 853.63 s [vector] +++ OK, passed 100 tests.
  3649. 853.63 s [vector] all: OK
  3650. 853.63 s [vector] +++ OK, passed 100 tests.
  3651. 853.63 s [vector] any: OK
  3652. 853.63 s [vector] +++ OK, passed 100 tests.
  3653. 853.63 s [vector] prescanl: OK
  3654. 853.63 s [vector] +++ OK, passed 100 tests.
  3655. 853.63 s [vector] prescanl': OK
  3656. 853.63 s [vector] +++ OK, passed 100 tests.
  3657. 853.63 s [vector] postscanl: OK
  3658. 853.63 s [vector] +++ OK, passed 100 tests.
  3659. 853.63 s [vector] postscanl': OK (0.01s)
  3660. 853.63 s [vector] +++ OK, passed 100 tests.
  3661. 853.63 s [vector] scanl: OK (0.01s)
  3662. 853.63 s [vector] +++ OK, passed 100 tests.
  3663. 853.63 s [vector] scanl': OK
  3664. 853.63 s [vector] +++ OK, passed 100 tests.
  3665. 853.63 s [vector] scanl1: OK
  3666. 853.63 s [vector] +++ OK, passed 100 tests.
  3667. 853.63 s [vector] scanl1': OK
  3668. 853.63 s [vector] +++ OK, passed 100 tests.
  3669. 853.63 s [vector] iscanl: OK
  3670. 853.63 s [vector] +++ OK, passed 100 tests.
  3671. 853.63 s [vector] iscanl': OK (0.01s)
  3672. 853.63 s [vector] +++ OK, passed 100 tests.
  3673. 853.63 s [vector] prescanr: OK
  3674. 853.63 s [vector] +++ OK, passed 100 tests.
  3675. 853.63 s [vector] prescanr': OK
  3676. 853.63 s [vector] +++ OK, passed 100 tests.
  3677. 853.63 s [vector] postscanr: OK
  3678. 853.63 s [vector] +++ OK, passed 100 tests.
  3679. 853.63 s [vector] postscanr': OK
  3680. 853.63 s [vector] +++ OK, passed 100 tests.
  3681. 853.63 s [vector] scanr: OK
  3682. 853.63 s [vector] +++ OK, passed 100 tests.
  3683. 853.63 s [vector] scanr': OK
  3684. 853.63 s [vector] +++ OK, passed 100 tests.
  3685. 853.63 s [vector] scanr1: OK
  3686. 853.63 s [vector] +++ OK, passed 100 tests.
  3687. 853.63 s [vector] scanr1': OK
  3688. 853.63 s [vector] +++ OK, passed 100 tests.
  3689. 853.63 s [vector] iscanr: OK
  3690. 853.64 s [vector] +++ OK, passed 100 tests.
  3691. 853.64 s [vector] iscanr': OK (0.01s)
  3692. 853.64 s [vector] +++ OK, passed 100 tests.
  3693. 853.64 s [vector] mut_read: OK
  3694. 853.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3695. 853.64 s [vector] mut_write: OK
  3696. 853.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3697. 853.64 s [vector] mut_modify: OK
  3698. 853.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3699. 853.64 s [vector] mut_generate: OK
  3700. 853.64 s [vector] +++ OK, passed 100 tests.
  3701. 853.64 s [vector] mut_generateM: OK (0.01s)
  3702. 853.64 s [vector] +++ OK, passed 100 tests.
  3703. 853.64 s [vector] mut_mapM_: OK (0.04s)
  3704. 853.64 s [vector] +++ OK, passed 100 tests.
  3705. 853.64 s [vector] mut_imapM_: OK (0.04s)
  3706. 853.64 s [vector] +++ OK, passed 100 tests.
  3707. 853.64 s [vector] mut_forM_: OK (0.04s)
  3708. 853.64 s [vector] +++ OK, passed 100 tests.
  3709. 853.64 s [vector] mut_iforM_: OK (0.04s)
  3710. 853.64 s [vector] +++ OK, passed 100 tests.
  3711. 853.64 s [vector] mut_foldr: OK
  3712. 853.64 s [vector] +++ OK, passed 100 tests.
  3713. 853.64 s [vector] mut_foldr': OK
  3714. 853.64 s [vector] +++ OK, passed 100 tests.
  3715. 853.64 s [vector] mut_foldl: OK
  3716. 853.64 s [vector] +++ OK, passed 100 tests.
  3717. 853.64 s [vector] mut_foldl': OK
  3718. 853.64 s [vector] +++ OK, passed 100 tests.
  3719. 853.64 s [vector] mut_ifoldr: OK (0.01s)
  3720. 853.64 s [vector] +++ OK, passed 100 tests.
  3721. 853.64 s [vector] mut_ifoldr': OK
  3722. 853.64 s [vector] +++ OK, passed 100 tests.
  3723. 853.64 s [vector] mut_ifoldl: OK (0.01s)
  3724. 853.64 s [vector] +++ OK, passed 100 tests.
  3725. 853.64 s [vector] mut_ifoldl': OK (0.01s)
  3726. 853.64 s [vector] +++ OK, passed 100 tests.
  3727. 853.64 s [vector] mut_foldM: OK (0.01s)
  3728. 853.64 s [vector] +++ OK, passed 100 tests.
  3729. 853.64 s [vector] mut_foldM': OK
  3730. 853.64 s [vector] +++ OK, passed 100 tests.
  3731. 853.64 s [vector] mut_foldrM: OK (0.01s)
  3732. 853.64 s [vector] +++ OK, passed 100 tests.
  3733. 853.64 s [vector] mut_foldrM': OK
  3734. 853.64 s [vector] +++ OK, passed 100 tests.
  3735. 853.64 s [vector] mut_ifoldM: OK
  3736. 853.64 s [vector] +++ OK, passed 100 tests.
  3737. 853.64 s [vector] mut_ifoldM': OK
  3738. 853.64 s [vector] +++ OK, passed 100 tests.
  3739. 853.64 s [vector] mut_ifoldrM: OK (0.01s)
  3740. 853.64 s [vector] +++ OK, passed 100 tests.
  3741. 853.64 s [vector] mut_ifoldrM': OK (0.01s)
  3742. 853.64 s [vector] +++ OK, passed 100 tests.
  3743. 853.64 s [vector] compare: OK
  3744. 853.64 s [vector] +++ OK, passed 100 tests.
  3745. 853.64 s [vector] maximum: OK
  3746. 853.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3747. 853.64 s [vector] minimum: OK
  3748. 853.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3749. 853.64 s [vector] minIndex: OK
  3750. 853.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3751. 853.64 s [vector] maxIndex: OK
  3752. 853.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3753. 853.64 s [vector] maximumBy: OK
  3754. 853.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3755. 853.64 s [vector] minimumBy: OK
  3756. 853.64 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3757. 853.64 s [vector] maximumOn: OK
  3758. 853.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3759. 853.64 s [vector] minimumOn: OK
  3760. 853.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3761. 853.64 s [vector] maxIndexBy: OK
  3762. 853.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3763. 853.64 s [vector] minIndexBy: OK
  3764. 853.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3765. 853.64 s [vector] ListFirstMaxIndexWins: OK
  3766. 853.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3767. 853.64 s [vector] FalseListFirstMaxIndexWins: OK
  3768. 853.64 s [vector] +++ OK, failed as expected. (after 1 test):
  3769. 853.64 s [vector] Exception:
  3770. 853.64 s [vector] Prelude.foldr1: empty list
  3771. 853.64 s [vector] CallStack (from HasCallStack):
  3772. 853.64 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  3773. 853.64 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  3774. 853.64 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3775. 853.64 s [vector] []
  3776. 853.64 s [vector] zip: OK
  3777. 853.64 s [vector] +++ OK, passed 100 tests.
  3778. 853.64 s [vector] zip3: OK
  3779. 853.64 s [vector] +++ OK, passed 100 tests.
  3780. 853.64 s [vector] unzip: OK
  3781. 853.64 s [vector] +++ OK, passed 100 tests.
  3782. 853.64 s [vector] unzip3: OK
  3783. 853.64 s [vector] +++ OK, passed 100 tests.
  3784. 853.64 s [vector] indexed: OK
  3785. 853.64 s [vector] +++ OK, passed 100 tests.
  3786. 853.64 s [vector] update: OK
  3787. 853.64 s [vector] +++ OK, passed 100 tests.
  3788. 853.64 s [vector] mempty: OK
  3789. 853.64 s [vector] +++ OK, passed 1 test.
  3790. 853.64 s [vector] mappend: OK
  3791. 853.64 s [vector] +++ OK, passed 100 tests.
  3792. 853.64 s [vector] mconcat: OK (0.03s)
  3793. 853.64 s [vector] +++ OK, passed 100 tests.
  3794. 853.64 s [vector] glength: OK
  3795. 853.64 s [vector] +++ OK, passed 100 tests.
  3796. 853.64 s [vector] sum: OK
  3797. 853.64 s [vector] +++ OK, passed 100 tests.
  3798. 853.64 s [vector] product: OK
  3799. 853.64 s [vector] +++ OK, passed 100 tests.
  3800. 853.64 s [vector] enumFromN: OK
  3801. 853.64 s [vector] +++ OK, passed 100 tests.
  3802. 853.64 s [vector] enumFromThenN: OK
  3803. 853.64 s [vector] +++ OK, passed 100 tests.
  3804. 853.64 s [vector] enumFromTo: OK
  3805. 853.64 s [vector] +++ OK, passed 100 tests.
  3806. 853.64 s [vector] enumFromThenTo: OK
  3807. 853.64 s [vector] +++ OK, passed 100 tests.
  3808. 853.64 s [vector] (Double)
  3809. 853.64 s [vector] fromList.toList == id: OK
  3810. 853.64 s [vector] +++ OK, passed 100 tests.
  3811. 853.64 s [vector] toList.fromList == id: OK
  3812. 853.64 s [vector] +++ OK, passed 100 tests.
  3813. 853.64 s [vector] unstream.stream == id: OK
  3814. 853.64 s [vector] +++ OK, passed 100 tests.
  3815. 853.64 s [vector] stream.unstream == id: OK
  3816. 853.64 s [vector] +++ OK, passed 100 tests.
  3817. 853.64 s [vector] eq: OK
  3818. 853.64 s [vector] +++ OK, passed 100 tests.
  3819. 853.64 s [vector] length: OK
  3820. 853.64 s [vector] +++ OK, passed 100 tests.
  3821. 853.64 s [vector] null: OK
  3822. 853.64 s [vector] +++ OK, passed 100 tests.
  3823. 853.64 s [vector] index: OK
  3824. 853.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3825. 853.64 s [vector] safeIndex: OK
  3826. 853.64 s [vector] +++ OK, passed 100 tests.
  3827. 853.64 s [vector] head: OK
  3828. 853.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3829. 853.64 s [vector] last: OK
  3830. 853.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3831. 853.64 s [vector] unsafeIndex: OK
  3832. 853.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3833. 853.64 s [vector] unsafeHead: OK
  3834. 853.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3835. 853.64 s [vector] unsafeLast: OK
  3836. 853.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3837. 853.64 s [vector] slice: OK
  3838. 853.64 s [vector] +++ OK, passed 100 tests.
  3839. 853.64 s [vector] init: OK
  3840. 853.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3841. 853.64 s [vector] tail: OK
  3842. 853.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3843. 853.64 s [vector] take: OK
  3844. 853.64 s [vector] +++ OK, passed 100 tests.
  3845. 853.64 s [vector] drop: OK
  3846. 853.64 s [vector] +++ OK, passed 100 tests.
  3847. 853.64 s [vector] splitAt: OK
  3848. 853.64 s [vector] +++ OK, passed 100 tests.
  3849. 853.64 s [vector] empty: OK
  3850. 853.64 s [vector] +++ OK, passed 1 test.
  3851. 853.64 s [vector] singleton: OK
  3852. 853.64 s [vector] +++ OK, passed 100 tests.
  3853. 853.64 s [vector] replicate: OK
  3854. 853.64 s [vector] +++ OK, passed 100 tests.
  3855. 853.64 s [vector] generate: OK
  3856. 853.65 s [vector] +++ OK, passed 100 tests.
  3857. 853.65 s [vector] iterateN: OK
  3858. 853.65 s [vector] +++ OK, passed 100 tests.
  3859. 853.65 s [vector] iterateNM: OK (0.03s)
  3860. 853.65 s [vector] +++ OK, passed 100 tests.
  3861. 853.65 s [vector] generateM: OK (0.04s)
  3862. 853.65 s [vector] +++ OK, passed 100 tests.
  3863. 853.65 s [vector] replicateM: OK
  3864. 853.65 s [vector] +++ OK, passed 100 tests.
  3865. 853.65 s [vector] create: OK
  3866. 853.65 s [vector] +++ OK, passed 100 tests.
  3867. 853.65 s [vector] createT: OK
  3868. 853.65 s [vector] +++ OK, passed 100 tests.
  3869. 853.65 s [vector] unfoldr: OK
  3870. 853.65 s [vector] +++ OK, passed 100 tests.
  3871. 853.65 s [vector] unfoldrN: OK
  3872. 853.65 s [vector] +++ OK, passed 100 tests.
  3873. 853.65 s [vector] unfoldrExactN: OK
  3874. 853.65 s [vector] +++ OK, passed 100 tests.
  3875. 853.65 s [vector] unfoldrM: OK
  3876. 853.65 s [vector] +++ OK, passed 100 tests.
  3877. 853.65 s [vector] unfoldrNM: OK (0.02s)
  3878. 853.65 s [vector] +++ OK, passed 100 tests.
  3879. 853.65 s [vector] unfoldrExactNM: OK (0.06s)
  3880. 853.65 s [vector] +++ OK, passed 100 tests.
  3881. 853.65 s [vector] constructN: OK (0.02s)
  3882. 853.65 s [vector] +++ OK, passed 100 tests.
  3883. 853.65 s [vector] constructrN: OK (0.02s)
  3884. 853.65 s [vector] +++ OK, passed 100 tests.
  3885. 853.65 s [vector] cons: OK
  3886. 853.65 s [vector] +++ OK, passed 100 tests.
  3887. 853.65 s [vector] snoc: OK
  3888. 853.65 s [vector] +++ OK, passed 100 tests.
  3889. 853.65 s [vector] append: OK
  3890. 853.65 s [vector] +++ OK, passed 100 tests.
  3891. 853.65 s [vector] concat: OK (0.02s)
  3892. 853.65 s [vector] +++ OK, passed 100 tests.
  3893. 853.65 s [vector] force: OK
  3894. 853.65 s [vector] +++ OK, passed 100 tests.
  3895. 853.65 s [vector] upd: OK
  3896. 853.65 s [vector] +++ OK, passed 100 tests.
  3897. 853.65 s [vector] accum: OK (0.02s)
  3898. 853.65 s [vector] +++ OK, passed 100 tests.
  3899. 853.65 s [vector] reverse: OK
  3900. 853.65 s [vector] +++ OK, passed 100 tests.
  3901. 853.65 s [vector] backpermute: OK
  3902. 853.65 s [vector] +++ OK, passed 100 tests.
  3903. 853.65 s [vector] map: OK
  3904. 853.65 s [vector] +++ OK, passed 100 tests.
  3905. 853.65 s [vector] imap: OK
  3906. 853.65 s [vector] +++ OK, passed 100 tests.
  3907. 853.65 s [vector] concatMap: OK (0.01s)
  3908. 853.65 s [vector] +++ OK, passed 100 tests.
  3909. 853.65 s [vector] mapM: OK (0.01s)
  3910. 853.65 s [vector] +++ OK, passed 100 tests.
  3911. 853.65 s [vector] mapM_: OK (0.05s)
  3912. 853.65 s [vector] +++ OK, passed 100 tests.
  3913. 853.65 s [vector] forM: OK
  3914. 853.65 s [vector] +++ OK, passed 100 tests.
  3915. 853.65 s [vector] forM_: OK (0.04s)
  3916. 853.65 s [vector] +++ OK, passed 100 tests.
  3917. 853.65 s [vector] imapM: OK (0.01s)
  3918. 853.65 s [vector] +++ OK, passed 100 tests.
  3919. 853.65 s [vector] imapM_: OK (0.05s)
  3920. 853.65 s [vector] +++ OK, passed 100 tests.
  3921. 853.65 s [vector] zipWith: OK (0.01s)
  3922. 853.65 s [vector] +++ OK, passed 100 tests.
  3923. 853.65 s [vector] zipWith3: OK (0.01s)
  3924. 853.65 s [vector] +++ OK, passed 100 tests.
  3925. 853.65 s [vector] izipWith: OK (0.01s)
  3926. 853.65 s [vector] +++ OK, passed 100 tests.
  3927. 853.65 s [vector] izipWith3: OK (0.01s)
  3928. 853.65 s [vector] +++ OK, passed 100 tests.
  3929. 853.65 s [vector] izipWithM: OK (0.01s)
  3930. 853.65 s [vector] +++ OK, passed 100 tests.
  3931. 853.65 s [vector] izipWithM_: OK (0.04s)
  3932. 853.65 s [vector] +++ OK, passed 100 tests.
  3933. 853.65 s [vector] zipWithM: OK (0.01s)
  3934. 853.65 s [vector] +++ OK, passed 100 tests.
  3935. 853.65 s [vector] zipWithM_: OK (0.03s)
  3936. 853.65 s [vector] +++ OK, passed 100 tests.
  3937. 853.65 s [vector] filter: OK
  3938. 853.65 s [vector] +++ OK, passed 100 tests.
  3939. 853.65 s [vector] ifilter: OK
  3940. 853.65 s [vector] +++ OK, passed 100 tests.
  3941. 853.65 s [vector] filterM: OK (0.06s)
  3942. 853.65 s [vector] +++ OK, passed 100 tests.
  3943. 853.65 s [vector] uniq: OK
  3944. 853.65 s [vector] +++ OK, passed 100 tests.
  3945. 853.65 s [vector] mapMaybe: OK
  3946. 853.65 s [vector] +++ OK, passed 100 tests.
  3947. 853.65 s [vector] imapMaybe: OK
  3948. 853.65 s [vector] +++ OK, passed 100 tests.
  3949. 853.65 s [vector] takeWhile: OK
  3950. 853.65 s [vector] +++ OK, passed 100 tests.
  3951. 853.65 s [vector] dropWhile: OK
  3952. 853.65 s [vector] +++ OK, passed 100 tests.
  3953. 853.65 s [vector] partition: OK
  3954. 853.65 s [vector] +++ OK, passed 100 tests.
  3955. 853.65 s [vector] partitionWith: OK
  3956. 853.65 s [vector] +++ OK, passed 100 tests.
  3957. 853.65 s [vector] span: OK
  3958. 853.65 s [vector] +++ OK, passed 100 tests.
  3959. 853.65 s [vector] break: OK
  3960. 853.65 s [vector] +++ OK, passed 100 tests.
  3961. 853.65 s [vector] spanR: OK
  3962. 853.65 s [vector] +++ OK, passed 100 tests.
  3963. 853.65 s [vector] breakR: OK
  3964. 853.65 s [vector] +++ OK, passed 100 tests.
  3965. 853.65 s [vector] groupBy: OK (0.01s)
  3966. 853.65 s [vector] +++ OK, passed 100 tests.
  3967. 853.65 s [vector] elem: OK
  3968. 853.65 s [vector] +++ OK, passed 100 tests.
  3969. 853.65 s [vector] notElem: OK
  3970. 853.65 s [vector] +++ OK, passed 100 tests.
  3971. 853.65 s [vector] find: OK
  3972. 853.65 s [vector] +++ OK, passed 100 tests.
  3973. 853.65 s [vector] findIndex: OK
  3974. 853.65 s [vector] +++ OK, passed 100 tests.
  3975. 853.65 s [vector] findIndexR: OK
  3976. 853.65 s [vector] +++ OK, passed 100 tests.
  3977. 853.65 s [vector] findIndices: OK
  3978. 853.65 s [vector] +++ OK, passed 100 tests.
  3979. 853.65 s [vector] elemIndex: OK
  3980. 853.65 s [vector] +++ OK, passed 100 tests.
  3981. 853.65 s [vector] elemIndices: OK
  3982. 853.65 s [vector] +++ OK, passed 100 tests.
  3983. 853.65 s [vector] foldl: OK (0.01s)
  3984. 853.65 s [vector] +++ OK, passed 100 tests.
  3985. 853.65 s [vector] foldl1: OK
  3986. 853.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3987. 853.65 s [vector] foldl': OK (0.02s)
  3988. 853.65 s [vector] +++ OK, passed 100 tests.
  3989. 853.65 s [vector] foldl1': OK (0.01s)
  3990. 853.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3991. 853.65 s [vector] foldr: OK (0.02s)
  3992. 853.65 s [vector] +++ OK, passed 100 tests.
  3993. 853.65 s [vector] foldr1: OK (0.02s)
  3994. 853.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3995. 853.65 s [vector] foldr': OK (0.01s)
  3996. 853.65 s [vector] +++ OK, passed 100 tests.
  3997. 853.65 s [vector] foldr1': OK (0.01s)
  3998. 853.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3999. 853.65 s [vector] ifoldl: OK (0.02s)
  4000. 853.65 s [vector] +++ OK, passed 100 tests.
  4001. 853.65 s [vector] ifoldl': OK (0.02s)
  4002. 853.65 s [vector] +++ OK, passed 100 tests.
  4003. 853.65 s [vector] ifoldr: OK (0.02s)
  4004. 853.65 s [vector] +++ OK, passed 100 tests.
  4005. 853.65 s [vector] ifoldr': OK (0.02s)
  4006. 853.65 s [vector] +++ OK, passed 100 tests.
  4007. 853.65 s [vector] ifoldM: OK (0.02s)
  4008. 853.65 s [vector] +++ OK, passed 100 tests.
  4009. 853.65 s [vector] ifoldM': OK (0.02s)
  4010. 853.65 s [vector] +++ OK, passed 100 tests.
  4011. 853.65 s [vector] ifoldM_: OK (0.04s)
  4012. 853.65 s [vector] +++ OK, passed 100 tests.
  4013. 853.65 s [vector] ifoldM'_: OK (0.04s)
  4014. 853.65 s [vector] +++ OK, passed 100 tests.
  4015. 853.65 s [vector] all: OK
  4016. 853.65 s [vector] +++ OK, passed 100 tests.
  4017. 853.65 s [vector] any: OK
  4018. 853.65 s [vector] +++ OK, passed 100 tests.
  4019. 853.65 s [vector] prescanl: OK (0.01s)
  4020. 853.65 s [vector] +++ OK, passed 100 tests.
  4021. 853.65 s [vector] prescanl': OK (0.01s)
  4022. 853.65 s [vector] +++ OK, passed 100 tests.
  4023. 853.65 s [vector] postscanl: OK (0.01s)
  4024. 853.65 s [vector] +++ OK, passed 100 tests.
  4025. 853.65 s [vector] postscanl': OK
  4026. 853.65 s [vector] +++ OK, passed 100 tests.
  4027. 853.65 s [vector] scanl: OK (0.01s)
  4028. 853.65 s [vector] +++ OK, passed 100 tests.
  4029. 853.65 s [vector] scanl': OK (0.01s)
  4030. 853.65 s [vector] +++ OK, passed 100 tests.
  4031. 853.65 s [vector] scanl1: OK (0.01s)
  4032. 853.65 s [vector] +++ OK, passed 100 tests.
  4033. 853.65 s [vector] scanl1': OK (0.01s)
  4034. 853.65 s [vector] +++ OK, passed 100 tests.
  4035. 853.65 s [vector] iscanl: OK (0.02s)
  4036. 853.65 s [vector] +++ OK, passed 100 tests.
  4037. 853.65 s [vector] iscanl': OK (0.01s)
  4038. 853.65 s [vector] +++ OK, passed 100 tests.
  4039. 853.65 s [vector] prescanr: OK (0.01s)
  4040. 853.65 s [vector] +++ OK, passed 100 tests.
  4041. 853.65 s [vector] prescanr': OK (0.01s)
  4042. 853.65 s [vector] +++ OK, passed 100 tests.
  4043. 853.65 s [vector] postscanr: OK (0.02s)
  4044. 853.65 s [vector] +++ OK, passed 100 tests.
  4045. 853.65 s [vector] postscanr': OK (0.02s)
  4046. 853.65 s [vector] +++ OK, passed 100 tests.
  4047. 853.65 s [vector] scanr: OK (0.02s)
  4048. 853.65 s [vector] +++ OK, passed 100 tests.
  4049. 853.65 s [vector] scanr': OK (0.02s)
  4050. 853.65 s [vector] +++ OK, passed 100 tests.
  4051. 853.65 s [vector] scanr1: OK (0.02s)
  4052. 853.65 s [vector] +++ OK, passed 100 tests.
  4053. 853.65 s [vector] scanr1': OK (0.02s)
  4054. 853.65 s [vector] +++ OK, passed 100 tests.
  4055. 853.65 s [vector] iscanr: OK (0.02s)
  4056. 853.65 s [vector] +++ OK, passed 100 tests.
  4057. 853.65 s [hedgehog] Phase: setupCompilerEnvironmentPhase
  4058. 853.65 s [vector] iscanr': OK (0.02s)
  4059. 853.65 s [vector] +++ OK, passed 100 tests.
  4060. 853.65 s [vector] mut_read: OK
  4061. 853.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4062. 853.65 s [vector] mut_write: OK
  4063. 853.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4064. 853.65 s [vector] mut_modify: OK
  4065. 853.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4066. 853.65 s [vector] mut_generate: OK
  4067. 853.65 s [vector] +++ OK, passed 100 tests.
  4068. 853.65 s [vector] mut_generateM: OK (0.02s)
  4069. 853.65 s [vector] +++ OK, passed 100 tests.
  4070. 853.65 s [vector] mut_mapM_: OK (0.05s)
  4071. 853.65 s [vector] +++ OK, passed 100 tests.
  4072. 853.65 s [vector] mut_imapM_: OK (0.05s)
  4073. 853.65 s [vector] +++ OK, passed 100 tests.
  4074. 853.65 s [vector] mut_forM_: OK (0.04s)
  4075. 853.65 s [vector] +++ OK, passed 100 tests.
  4076. 853.65 s [vector] mut_iforM_: OK (0.04s)
  4077. 853.65 s [vector] +++ OK, passed 100 tests.
  4078. 853.65 s [vector] mut_foldr: OK (0.02s)
  4079. 853.65 s [vector] +++ OK, passed 100 tests.
  4080. 853.65 s [vector] mut_foldr': OK (0.02s)
  4081. 853.65 s [vector] +++ OK, passed 100 tests.
  4082. 853.65 s [vector] mut_foldl: OK (0.02s)
  4083. 853.65 s [vector] +++ OK, passed 100 tests.
  4084. 853.65 s [vector] mut_foldl': OK (0.02s)
  4085. 853.65 s [vector] +++ OK, passed 100 tests.
  4086. 853.65 s [vector] mut_ifoldr: OK (0.02s)
  4087. 853.65 s [vector] +++ OK, passed 100 tests.
  4088. 853.65 s [vector] mut_ifoldr': OK (0.02s)
  4089. 853.65 s [vector] +++ OK, passed 100 tests.
  4090. 853.65 s [vector] mut_ifoldl: OK
  4091. 853.65 s [vector] +++ OK, passed 100 tests.
  4092. 853.65 s [vector] mut_ifoldl': OK (0.02s)
  4093. 853.65 s [vector] +++ OK, passed 100 tests.
  4094. 853.65 s [vector] mut_foldM: OK (0.01s)
  4095. 853.65 s [vector] +++ OK, passed 100 tests.
  4096. 853.65 s [vector] mut_foldM': OK (0.01s)
  4097. 853.65 s [vector] +++ OK, passed 100 tests.
  4098. 853.65 s [vector] mut_foldrM: OK (0.02s)
  4099. 853.65 s [vector] +++ OK, passed 100 tests.
  4100. 853.65 s [vector] mut_foldrM': OK (0.02s)
  4101. 853.65 s [vector] +++ OK, passed 100 tests.
  4102. 853.65 s [vector] mut_ifoldM: OK (0.02s)
  4103. 853.65 s [vector] +++ OK, passed 100 tests.
  4104. 853.65 s [vector] mut_ifoldM': OK (0.02s)
  4105. 853.65 s [vector] +++ OK, passed 100 tests.
  4106. 853.65 s [vector] mut_ifoldrM: OK (0.02s)
  4107. 853.65 s [vector] +++ OK, passed 100 tests.
  4108. 853.65 s [vector] mut_ifoldrM': OK (0.02s)
  4109. 853.65 s [vector] +++ OK, passed 100 tests.
  4110. 853.65 s [vector] compare: OK
  4111. 853.65 s [vector] +++ OK, passed 100 tests.
  4112. 853.65 s [vector] maximum: OK
  4113. 853.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4114. 853.65 s [vector] minimum: OK
  4115. 853.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4116. 853.65 s [vector] minIndex: OK
  4117. 853.65 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4118. 853.65 s [vector] maxIndex: OK
  4119. 853.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4120. 853.65 s [vector] maximumBy: OK
  4121. 853.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4122. 853.65 s [vector] minimumBy: OK
  4123. 853.65 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4124. 853.65 s [vector] maximumOn: OK
  4125. 853.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4126. 853.65 s [vector] minimumOn: OK
  4127. 853.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4128. 853.65 s [vector] maxIndexBy: OK
  4129. 853.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4130. 853.65 s [vector] minIndexBy: OK
  4131. 853.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4132. 853.65 s [vector] ListFirstMaxIndexWins: OK
  4133. 853.65 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4134. 853.65 s [vector] FalseListFirstMaxIndexWins: OK
  4135. 853.65 s [vector] +++ OK, failed as expected. (after 1 test):
  4136. 853.65 s [vector] Exception:
  4137. 853.65 s [vector] Prelude.foldr1: empty list
  4138. 853.65 s [vector] CallStack (from HasCallStack):
  4139. 853.65 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  4140. 853.65 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  4141. 853.65 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4142. 853.65 s [vector] []
  4143. 853.65 s [vector] zip: OK
  4144. 853.65 s [vector] +++ OK, passed 100 tests.
  4145. 853.65 s [vector] zip3: OK
  4146. 853.65 s [vector] +++ OK, passed 100 tests.
  4147. 853.65 s [vector] unzip: OK
  4148. 853.65 s [vector] +++ OK, passed 100 tests.
  4149. 853.65 s [vector] unzip3: OK
  4150. 853.65 s [vector] +++ OK, passed 100 tests.
  4151. 853.65 s [vector] indexed: OK
  4152. 853.65 s [vector] +++ OK, passed 100 tests.
  4153. 853.65 s [vector] update: OK
  4154. 853.65 s [vector] +++ OK, passed 100 tests.
  4155. 853.65 s [vector] mempty: OK
  4156. 853.65 s [vector] +++ OK, passed 1 test.
  4157. 853.65 s [vector] mappend: OK
  4158. 853.65 s [vector] +++ OK, passed 100 tests.
  4159. 853.65 s [vector] mconcat: OK (0.03s)
  4160. 853.65 s [vector] +++ OK, passed 100 tests.
  4161. 853.65 s [vector] glength: OK
  4162. 853.65 s [vector] +++ OK, passed 100 tests.
  4163. 853.65 s [vector] sum: OK
  4164. 853.65 s [vector] +++ OK, passed 100 tests.
  4165. 853.65 s [vector] product: OK
  4166. 853.65 s [vector] +++ OK, passed 100 tests.
  4167. 853.65 s [vector] enumFromN: OK
  4168. 853.65 s [vector] +++ OK, passed 100 tests.
  4169. 853.65 s [vector] enumFromThenN: OK
  4170. 853.65 s [vector] +++ OK, passed 100 tests.
  4171. 853.65 s [vector] enumFromTo: OK
  4172. 853.65 s [vector] +++ OK, passed 100 tests.
  4173. 853.65 s [vector] enumFromThenTo: OK
  4174. 853.65 s [vector] +++ OK, passed 100 tests; 9 discarded.
  4175. 853.65 s [vector] (Int,Bool)
  4176. 853.65 s [vector] fromList.toList == id: OK
  4177. 853.66 s [vector] +++ OK, passed 100 tests.
  4178. 853.66 s [vector] toList.fromList == id: OK
  4179. 853.66 s [vector] +++ OK, passed 100 tests.
  4180. 853.66 s [vector] unstream.stream == id: OK
  4181. 853.66 s [vector] +++ OK, passed 100 tests.
  4182. 853.66 s [vector] stream.unstream == id: OK
  4183. 853.66 s [vector] +++ OK, passed 100 tests.
  4184. 853.66 s [vector] eq: OK
  4185. 853.66 s [vector] +++ OK, passed 100 tests.
  4186. 853.66 s [vector] length: OK
  4187. 853.66 s [vector] +++ OK, passed 100 tests.
  4188. 853.66 s [vector] null: OK
  4189. 853.66 s [vector] +++ OK, passed 100 tests.
  4190. 853.66 s [vector] index: OK
  4191. 853.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4192. 853.66 s [vector] safeIndex: OK
  4193. 853.66 s [vector] +++ OK, passed 100 tests.
  4194. 853.66 s [vector] head: OK
  4195. 853.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4196. 853.66 s [vector] last: OK
  4197. 853.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4198. 853.66 s [vector] unsafeIndex: OK
  4199. 853.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4200. 853.66 s [vector] unsafeHead: OK
  4201. 853.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4202. 853.66 s [vector] unsafeLast: OK
  4203. 853.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4204. 853.66 s [vector] slice: OK
  4205. 853.66 s [vector] +++ OK, passed 100 tests.
  4206. 853.66 s [vector] init: OK
  4207. 853.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4208. 853.66 s [vector] tail: OK
  4209. 853.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4210. 853.66 s [vector] take: OK
  4211. 853.66 s [vector] +++ OK, passed 100 tests.
  4212. 853.66 s [vector] drop: OK
  4213. 853.66 s [vector] +++ OK, passed 100 tests.
  4214. 853.66 s [vector] splitAt: OK
  4215. 853.66 s [vector] +++ OK, passed 100 tests.
  4216. 853.66 s [vector] empty: OK
  4217. 853.66 s [vector] +++ OK, passed 1 test.
  4218. 853.66 s [vector] singleton: OK
  4219. 853.66 s [vector] +++ OK, passed 100 tests.
  4220. 853.66 s [vector] replicate: OK
  4221. 853.66 s [vector] +++ OK, passed 100 tests.
  4222. 853.66 s [vector] generate: OK
  4223. 853.66 s [vector] +++ OK, passed 100 tests.
  4224. 853.66 s [vector] iterateN: OK
  4225. 853.66 s [vector] +++ OK, passed 100 tests.
  4226. 853.66 s [vector] iterateNM: OK (0.02s)
  4227. 853.66 s [vector] +++ OK, passed 100 tests.
  4228. 853.66 s [vector] generateM: OK (0.04s)
  4229. 853.66 s [vector] +++ OK, passed 100 tests.
  4230. 853.66 s [vector] replicateM: OK (0.01s)
  4231. 853.66 s [vector] +++ OK, passed 100 tests.
  4232. 853.66 s [vector] create: OK
  4233. 853.66 s [vector] +++ OK, passed 100 tests.
  4234. 853.66 s [vector] createT: OK
  4235. 853.66 s [vector] +++ OK, passed 100 tests.
  4236. 853.66 s [vector] unfoldr: OK
  4237. 853.66 s [vector] +++ OK, passed 100 tests.
  4238. 853.66 s [vector] unfoldrN: OK
  4239. 853.66 s [vector] +++ OK, passed 100 tests.
  4240. 853.66 s [vector] unfoldrExactN: OK
  4241. 853.66 s [vector] +++ OK, passed 100 tests.
  4242. 853.66 s [vector] unfoldrM: OK
  4243. 853.66 s [vector] +++ OK, passed 100 tests.
  4244. 853.66 s [vector] unfoldrNM: OK
  4245. 853.66 s [vector] +++ OK, passed 100 tests.
  4246. 853.66 s [vector] unfoldrExactNM: OK (0.02s)
  4247. 853.66 s [vector] +++ OK, passed 100 tests.
  4248. 853.66 s [vector] constructN: OK
  4249. 853.66 s [vector] +++ OK, passed 100 tests.
  4250. 853.66 s [vector] constructrN: OK
  4251. 853.66 s [vector] +++ OK, passed 100 tests.
  4252. 853.66 s [vector] cons: OK
  4253. 853.66 s [vector] +++ OK, passed 100 tests.
  4254. 853.66 s [vector] snoc: OK
  4255. 853.66 s [vector] +++ OK, passed 100 tests.
  4256. 853.66 s [vector] append: OK
  4257. 853.66 s [vector] +++ OK, passed 100 tests.
  4258. 853.66 s [vector] concat: OK (0.04s)
  4259. 853.66 s [vector] +++ OK, passed 100 tests.
  4260. 853.66 s [vector] force: OK
  4261. 853.66 s [vector] +++ OK, passed 100 tests.
  4262. 853.66 s [vector] upd: OK
  4263. 853.66 s [vector] +++ OK, passed 100 tests.
  4264. 853.66 s [vector] accum: OK
  4265. 853.66 s [vector] +++ OK, passed 100 tests.
  4266. 853.66 s [vector] reverse: OK
  4267. 853.66 s [vector] +++ OK, passed 100 tests.
  4268. 853.66 s [vector] backpermute: OK
  4269. 853.66 s [hedgehog] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  4270. 853.66 s [vector] +++ OK, passed 100 tests.
  4271. 853.66 s [vector] map: OK
  4272. 853.66 s [vector] +++ OK, passed 100 tests.
  4273. 853.66 s [vector] imap: OK
  4274. 853.66 s [vector] +++ OK, passed 100 tests.
  4275. 853.66 s [vector] concatMap: OK
  4276. 853.66 s [vector] +++ OK, passed 100 tests.
  4277. 853.66 s [vector] mapM: OK
  4278. 853.66 s [vector] +++ OK, passed 100 tests.
  4279. 853.66 s [vector] mapM_: OK (0.03s)
  4280. 853.66 s [vector] +++ OK, passed 100 tests.
  4281. 853.66 s [vector] forM: OK
  4282. 853.66 s [vector] +++ OK, passed 100 tests.
  4283. 853.66 s [vector] forM_: OK (0.02s)
  4284. 853.66 s [vector] +++ OK, passed 100 tests.
  4285. 853.66 s [vector] imapM: OK
  4286. 853.66 s [vector] +++ OK, passed 100 tests.
  4287. 853.66 s [vector] imapM_: OK (0.03s)
  4288. 853.66 s [vector] +++ OK, passed 100 tests.
  4289. 853.66 s [vector] zipWith: OK
  4290. 853.66 s [vector] +++ OK, passed 100 tests.
  4291. 853.66 s [vector] zipWith3: OK
  4292. 853.66 s [vector] +++ OK, passed 100 tests.
  4293. 853.66 s [vector] izipWith: OK
  4294. 853.66 s [vector] +++ OK, passed 100 tests.
  4295. 853.66 s [vector] izipWith3: OK
  4296. 853.66 s [vector] +++ OK, passed 100 tests.
  4297. 853.66 s [vector] izipWithM: OK
  4298. 853.66 s [vector] +++ OK, passed 100 tests.
  4299. 853.66 s [vector] izipWithM_: OK (0.04s)
  4300. 853.66 s [vector] +++ OK, passed 100 tests.
  4301. 853.66 s [vector] zipWithM: OK
  4302. 853.66 s [vector] +++ OK, passed 100 tests.
  4303. 853.66 s [vector] zipWithM_: OK (0.02s)
  4304. 853.66 s [vector] +++ OK, passed 100 tests.
  4305. 853.66 s [vector] filter: OK
  4306. 853.66 s [vector] +++ OK, passed 100 tests.
  4307. 853.66 s [vector] ifilter: OK
  4308. 853.66 s [vector] +++ OK, passed 100 tests.
  4309. 853.66 s [vector] filterM: OK (0.04s)
  4310. 853.66 s [vector] +++ OK, passed 100 tests.
  4311. 853.66 s [vector] uniq: OK
  4312. 853.66 s [vector] +++ OK, passed 100 tests.
  4313. 853.66 s [vector] mapMaybe: OK
  4314. 853.66 s [vector] +++ OK, passed 100 tests.
  4315. 853.66 s [vector] imapMaybe: OK
  4316. 853.66 s [vector] +++ OK, passed 100 tests.
  4317. 853.66 s [vector] takeWhile: OK
  4318. 853.66 s [vector] +++ OK, passed 100 tests.
  4319. 853.66 s [vector] dropWhile: OK
  4320. 853.66 s [vector] +++ OK, passed 100 tests.
  4321. 853.66 s [vector] partition: OK
  4322. 853.66 s [vector] +++ OK, passed 100 tests.
  4323. 853.66 s [vector] partitionWith: OK
  4324. 853.66 s [vector] +++ OK, passed 100 tests.
  4325. 853.66 s [vector] span: OK
  4326. 853.66 s [vector] +++ OK, passed 100 tests.
  4327. 853.66 s [vector] break: OK
  4328. 853.66 s [vector] +++ OK, passed 100 tests.
  4329. 853.66 s [vector] spanR: OK
  4330. 853.66 s [vector] +++ OK, passed 100 tests.
  4331. 853.66 s [vector] breakR: OK
  4332. 853.66 s [vector] +++ OK, passed 100 tests.
  4333. 853.66 s [vector] groupBy: OK
  4334. 853.66 s [vector] +++ OK, passed 100 tests.
  4335. 853.66 s [vector] elem: OK
  4336. 853.66 s [vector] +++ OK, passed 100 tests.
  4337. 853.66 s [vector] notElem: OK
  4338. 853.66 s [vector] +++ OK, passed 100 tests.
  4339. 853.66 s [vector] find: OK
  4340. 853.66 s [vector] +++ OK, passed 100 tests.
  4341. 853.66 s [vector] findIndex: OK
  4342. 853.66 s [vector] +++ OK, passed 100 tests.
  4343. 853.66 s [vector] findIndexR: OK
  4344. 853.66 s [vector] +++ OK, passed 100 tests.
  4345. 853.66 s [vector] findIndices: OK
  4346. 853.66 s [vector] +++ OK, passed 100 tests.
  4347. 853.66 s [vector] elemIndex: OK
  4348. 853.66 s [vector] +++ OK, passed 100 tests.
  4349. 853.66 s [vector] elemIndices: OK
  4350. 853.66 s [vector] +++ OK, passed 100 tests.
  4351. 853.66 s [vector] foldl: OK
  4352. 853.66 s [vector] +++ OK, passed 100 tests.
  4353. 853.66 s [vector] foldl1: OK
  4354. 853.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4355. 853.66 s [vector] foldl': OK
  4356. 853.66 s [vector] +++ OK, passed 100 tests.
  4357. 853.66 s [vector] foldl1': OK
  4358. 853.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4359. 853.66 s [vector] foldr: OK
  4360. 853.66 s [vector] +++ OK, passed 100 tests.
  4361. 853.66 s [vector] foldr1: OK
  4362. 853.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4363. 853.66 s [vector] foldr': OK
  4364. 853.66 s [vector] +++ OK, passed 100 tests.
  4365. 853.66 s [vector] foldr1': OK
  4366. 853.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4367. 853.66 s [vector] ifoldl: OK
  4368. 853.66 s [vector] +++ OK, passed 100 tests.
  4369. 853.66 s [vector] ifoldl': OK
  4370. 853.66 s [vector] +++ OK, passed 100 tests.
  4371. 853.66 s [vector] ifoldr: OK
  4372. 853.66 s [vector] +++ OK, passed 100 tests.
  4373. 853.66 s [vector] ifoldr': OK
  4374. 853.66 s [vector] +++ OK, passed 100 tests.
  4375. 853.66 s [vector] ifoldM: OK
  4376. 853.66 s [vector] +++ OK, passed 100 tests.
  4377. 853.66 s [vector] ifoldM': OK
  4378. 853.66 s [vector] +++ OK, passed 100 tests.
  4379. 853.66 s [vector] ifoldM_: OK (0.03s)
  4380. 853.66 s [vector] +++ OK, passed 100 tests.
  4381. 853.66 s [vector] ifoldM'_: OK (0.04s)
  4382. 853.66 s [vector] +++ OK, passed 100 tests.
  4383. 853.66 s [vector] all: OK
  4384. 853.66 s [vector] +++ OK, passed 100 tests.
  4385. 853.66 s [vector] any: OK
  4386. 853.66 s [vector] +++ OK, passed 100 tests.
  4387. 853.66 s [vector] prescanl: OK
  4388. 853.66 s [vector] +++ OK, passed 100 tests.
  4389. 853.66 s [vector] prescanl': OK
  4390. 853.66 s [vector] +++ OK, passed 100 tests.
  4391. 853.66 s [vector] postscanl: OK
  4392. 853.66 s [vector] +++ OK, passed 100 tests.
  4393. 853.66 s [vector] postscanl': OK
  4394. 853.66 s [vector] +++ OK, passed 100 tests.
  4395. 853.66 s [vector] scanl: OK
  4396. 853.66 s [vector] +++ OK, passed 100 tests.
  4397. 853.66 s [vector] scanl': OK
  4398. 853.66 s [vector] +++ OK, passed 100 tests.
  4399. 853.66 s [vector] scanl1: OK
  4400. 853.66 s [vector] +++ OK, passed 100 tests.
  4401. 853.66 s [vector] scanl1': OK
  4402. 853.66 s [vector] +++ OK, passed 100 tests.
  4403. 853.66 s [vector] iscanl: OK
  4404. 853.66 s [vector] +++ OK, passed 100 tests.
  4405. 853.66 s [vector] iscanl': OK
  4406. 853.66 s [vector] +++ OK, passed 100 tests.
  4407. 853.66 s [vector] prescanr: OK
  4408. 853.66 s [vector] +++ OK, passed 100 tests.
  4409. 853.66 s [vector] prescanr': OK
  4410. 853.66 s [vector] +++ OK, passed 100 tests.
  4411. 853.66 s [vector] postscanr: OK
  4412. 853.66 s [vector] +++ OK, passed 100 tests.
  4413. 853.66 s [vector] postscanr': OK
  4414. 853.66 s [vector] +++ OK, passed 100 tests.
  4415. 853.66 s [vector] scanr: OK
  4416. 853.66 s [vector] +++ OK, passed 100 tests.
  4417. 853.66 s [vector] scanr': OK
  4418. 853.66 s [vector] +++ OK, passed 100 tests.
  4419. 853.66 s [vector] scanr1: OK
  4420. 853.66 s [vector] +++ OK, passed 100 tests.
  4421. 853.66 s [vector] scanr1': OK
  4422. 853.66 s [vector] +++ OK, passed 100 tests.
  4423. 853.66 s [vector] iscanr: OK
  4424. 853.66 s [vector] +++ OK, passed 100 tests.
  4425. 853.66 s [vector] iscanr': OK
  4426. 853.66 s [vector] +++ OK, passed 100 tests.
  4427. 853.66 s [vector] mut_read: OK
  4428. 853.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4429. 853.66 s [vector] mut_write: OK
  4430. 853.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4431. 853.66 s [vector] mut_modify: OK
  4432. 853.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4433. 853.66 s [vector] mut_generate: OK
  4434. 853.66 s [vector] +++ OK, passed 100 tests.
  4435. 853.66 s [vector] mut_generateM: OK (0.02s)
  4436. 853.66 s [vector] +++ OK, passed 100 tests.
  4437. 853.66 s [vector] mut_mapM_: OK (0.04s)
  4438. 853.66 s [vector] +++ OK, passed 100 tests.
  4439. 853.66 s [vector] mut_imapM_: OK (0.05s)
  4440. 853.66 s [vector] +++ OK, passed 100 tests.
  4441. 853.66 s [vector] mut_forM_: OK (0.04s)
  4442. 853.66 s [vector] +++ OK, passed 100 tests.
  4443. 853.66 s [vector] mut_iforM_: OK (0.03s)
  4444. 853.66 s [vector] +++ OK, passed 100 tests.
  4445. 853.66 s [vector] mut_foldr: OK
  4446. 853.66 s [vector] +++ OK, passed 100 tests.
  4447. 853.66 s [vector] mut_foldr': OK
  4448. 853.66 s [vector] +++ OK, passed 100 tests.
  4449. 853.66 s [vector] mut_foldl: OK
  4450. 853.66 s [vector] +++ OK, passed 100 tests.
  4451. 853.66 s [vector] mut_foldl': OK
  4452. 853.66 s [vector] +++ OK, passed 100 tests.
  4453. 853.66 s [vector] mut_ifoldr: OK
  4454. 853.66 s [vector] +++ OK, passed 100 tests.
  4455. 853.66 s [vector] mut_ifoldr': OK
  4456. 853.66 s [vector] +++ OK, passed 100 tests.
  4457. 853.66 s [vector] mut_ifoldl: OK
  4458. 853.66 s [vector] +++ OK, passed 100 tests.
  4459. 853.66 s [vector] mut_ifoldl': OK
  4460. 853.66 s [vector] +++ OK, passed 100 tests.
  4461. 853.66 s [vector] mut_foldM: OK
  4462. 853.66 s [vector] +++ OK, passed 100 tests.
  4463. 853.66 s [vector] mut_foldM': OK
  4464. 853.66 s [vector] +++ OK, passed 100 tests.
  4465. 853.66 s [vector] mut_foldrM: OK
  4466. 853.66 s [vector] +++ OK, passed 100 tests.
  4467. 853.66 s [vector] mut_foldrM': OK
  4468. 853.66 s [vector] +++ OK, passed 100 tests.
  4469. 853.66 s [vector] mut_ifoldM: OK
  4470. 853.66 s [vector] +++ OK, passed 100 tests.
  4471. 853.66 s [vector] mut_ifoldM': OK
  4472. 853.66 s [vector] +++ OK, passed 100 tests.
  4473. 853.66 s [vector] mut_ifoldrM: OK
  4474. 853.66 s [vector] +++ OK, passed 100 tests.
  4475. 853.66 s [vector] mut_ifoldrM': OK
  4476. 853.66 s [vector] +++ OK, passed 100 tests.
  4477. 853.66 s [vector] compare: OK
  4478. 853.66 s [vector] +++ OK, passed 100 tests.
  4479. 853.66 s [vector] maximum: OK
  4480. 853.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4481. 853.66 s [vector] minimum: OK
  4482. 853.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4483. 853.66 s [vector] minIndex: OK
  4484. 853.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4485. 853.66 s [vector] maxIndex: OK
  4486. 853.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4487. 853.66 s [vector] maximumBy: OK
  4488. 853.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4489. 853.66 s [vector] minimumBy: OK
  4490. 853.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4491. 853.66 s [vector] maximumOn: OK
  4492. 853.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4493. 853.66 s [vector] minimumOn: OK
  4494. 853.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4495. 853.66 s [vector] maxIndexBy: OK
  4496. 853.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4497. 853.66 s [vector] minIndexBy: OK
  4498. 853.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4499. 853.66 s [vector] ListFirstMaxIndexWins: OK
  4500. 853.66 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4501. 853.66 s [vector] FalseListFirstMaxIndexWins: OK
  4502. 853.66 s [vector] +++ OK, failed as expected. (after 1 test):
  4503. 853.66 s [vector] Exception:
  4504. 853.66 s [vector] Prelude.foldr1: empty list
  4505. 853.66 s [vector] CallStack (from HasCallStack):
  4506. 853.66 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  4507. 853.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  4508. 853.67 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4509. 853.67 s [vector] []
  4510. 853.67 s [vector] zip: OK
  4511. 853.67 s [vector] +++ OK, passed 100 tests.
  4512. 853.67 s [vector] zip3: OK
  4513. 853.67 s [vector] +++ OK, passed 100 tests.
  4514. 853.67 s [vector] unzip: OK
  4515. 853.67 s [vector] +++ OK, passed 100 tests.
  4516. 853.67 s [vector] unzip3: OK
  4517. 853.67 s [vector] +++ OK, passed 100 tests.
  4518. 853.67 s [vector] indexed: OK
  4519. 853.67 s [vector] +++ OK, passed 100 tests.
  4520. 853.67 s [vector] update: OK
  4521. 853.67 s [vector] +++ OK, passed 100 tests.
  4522. 853.67 s [vector] mempty: OK
  4523. 853.67 s [vector] +++ OK, passed 1 test.
  4524. 853.67 s [vector] mappend: OK
  4525. 853.67 s [vector] +++ OK, passed 100 tests.
  4526. 853.67 s [vector] mconcat: OK (0.05s)
  4527. 853.67 s [vector] +++ OK, passed 100 tests.
  4528. 853.67 s [vector] glength: OK
  4529. 853.67 s [vector] +++ OK, passed 100 tests.
  4530. 853.67 s [vector] (Int,Bool,Int)
  4531. 853.67 s [vector] fromList.toList == id: OK
  4532. 853.67 s [vector] +++ OK, passed 100 tests.
  4533. 853.67 s [vector] toList.fromList == id: OK
  4534. 853.67 s [vector] +++ OK, passed 100 tests.
  4535. 853.67 s [vector] unstream.stream == id: OK
  4536. 853.67 s [vector] +++ OK, passed 100 tests.
  4537. 853.67 s [vector] stream.unstream == id: OK
  4538. 853.67 s [vector] +++ OK, passed 100 tests.
  4539. 853.67 s [vector] eq: OK
  4540. 853.67 s [vector] +++ OK, passed 100 tests.
  4541. 853.67 s [vector] length: OK
  4542. 853.67 s [vector] +++ OK, passed 100 tests.
  4543. 853.67 s [vector] null: OK
  4544. 853.67 s [vector] +++ OK, passed 100 tests.
  4545. 853.67 s [vector] index: OK
  4546. 853.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4547. 853.67 s [vector] safeIndex: OK
  4548. 853.67 s [vector] +++ OK, passed 100 tests.
  4549. 853.67 s [vector] head: OK
  4550. 853.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4551. 853.67 s [vector] last: OK
  4552. 853.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4553. 853.67 s [vector] unsafeIndex: OK
  4554. 853.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4555. 853.67 s [vector] unsafeHead: OK
  4556. 853.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4557. 853.67 s [vector] unsafeLast: OK
  4558. 853.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4559. 853.67 s [vector] slice: OK
  4560. 853.67 s [vector] +++ OK, passed 100 tests.
  4561. 853.67 s [vector] init: OK
  4562. 853.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4563. 853.67 s [vector] tail: OK
  4564. 853.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4565. 853.67 s [vector] take: OK
  4566. 853.67 s [vector] +++ OK, passed 100 tests.
  4567. 853.67 s [vector] drop: OK
  4568. 853.67 s [vector] +++ OK, passed 100 tests.
  4569. 853.67 s [vector] splitAt: OK
  4570. 853.67 s [vector] +++ OK, passed 100 tests.
  4571. 853.67 s [vector] empty: OK
  4572. 853.67 s [vector] +++ OK, passed 1 test.
  4573. 853.67 s [vector] singleton: OK
  4574. 853.67 s [vector] +++ OK, passed 100 tests.
  4575. 853.67 s [vector] replicate: OK
  4576. 853.67 s [vector] +++ OK, passed 100 tests.
  4577. 853.67 s [vector] generate: OK
  4578. 853.67 s [vector] +++ OK, passed 100 tests.
  4579. 853.67 s [vector] iterateN: OK
  4580. 853.67 s [vector] +++ OK, passed 100 tests.
  4581. 853.67 s [vector] iterateNM: OK (0.04s)
  4582. 853.67 s [vector] +++ OK, passed 100 tests.
  4583. 853.67 s [vector] generateM: OK (0.01s)
  4584. 853.67 s [vector] +++ OK, passed 100 tests.
  4585. 853.67 s [vector] replicateM: OK (0.02s)
  4586. 853.67 s [vector] +++ OK, passed 100 tests.
  4587. 853.67 s [vector] create: OK
  4588. 853.67 s [vector] +++ OK, passed 100 tests.
  4589. 853.67 s [vector] createT: OK
  4590. 853.67 s [vector] +++ OK, passed 100 tests.
  4591. 853.67 s [vector] unfoldr: OK
  4592. 853.67 s [vector] +++ OK, passed 100 tests.
  4593. 853.67 s [vector] unfoldrN: OK
  4594. 853.67 s [vector] +++ OK, passed 100 tests.
  4595. 853.67 s [vector] unfoldrExactN: OK
  4596. 853.67 s [vector] +++ OK, passed 100 tests.
  4597. 853.67 s [vector] unfoldrM: OK
  4598. 853.67 s [vector] +++ OK, passed 100 tests.
  4599. 853.67 s [vector] unfoldrNM: OK
  4600. 853.67 s [vector] +++ OK, passed 100 tests.
  4601. 853.67 s [vector] unfoldrExactNM: OK (0.09s)
  4602. 853.67 s [vector] +++ OK, passed 100 tests.
  4603. 853.67 s [vector] constructN: OK
  4604. 853.67 s [vector] +++ OK, passed 100 tests.
  4605. 853.67 s [vector] constructrN: OK
  4606. 853.67 s [vector] +++ OK, passed 100 tests.
  4607. 853.67 s [vector] cons: OK
  4608. 853.67 s [vector] +++ OK, passed 100 tests.
  4609. 853.67 s [vector] snoc: OK
  4610. 853.67 s [vector] +++ OK, passed 100 tests.
  4611. 853.67 s [vector] append: OK
  4612. 853.67 s [vector] +++ OK, passed 100 tests.
  4613. 853.67 s [vector] concat: OK (0.05s)
  4614. 853.67 s [vector] +++ OK, passed 100 tests.
  4615. 853.67 s [vector] force: OK
  4616. 853.67 s [vector] +++ OK, passed 100 tests.
  4617. 853.67 s [vector] upd: OK
  4618. 853.67 s [vector] +++ OK, passed 100 tests.
  4619. 853.67 s [vector] accum: OK (0.01s)
  4620. 853.67 s [vector] +++ OK, passed 100 tests.
  4621. 853.67 s [vector] reverse: OK
  4622. 853.67 s [vector] +++ OK, passed 100 tests.
  4623. 853.67 s [vector] backpermute: OK
  4624. 853.67 s [vector] +++ OK, passed 100 tests.
  4625. 853.67 s [vector] map: OK
  4626. 853.67 s [vector] +++ OK, passed 100 tests.
  4627. 853.67 s [vector] imap: OK
  4628. 853.67 s [vector] +++ OK, passed 100 tests.
  4629. 853.67 s [vector] concatMap: OK
  4630. 853.67 s [vector] +++ OK, passed 100 tests.
  4631. 853.67 s [vector] mapM: OK
  4632. 853.67 s [vector] +++ OK, passed 100 tests.
  4633. 853.67 s [vector] mapM_: OK (0.04s)
  4634. 853.67 s [vector] +++ OK, passed 100 tests.
  4635. 853.67 s [vector] forM: OK
  4636. 853.67 s [vector] +++ OK, passed 100 tests.
  4637. 853.67 s [vector] forM_: OK (0.05s)
  4638. 853.67 s [vector] +++ OK, passed 100 tests.
  4639. 853.67 s [vector] imapM: OK
  4640. 853.67 s [vector] +++ OK, passed 100 tests.
  4641. 853.67 s [vector] imapM_: OK (0.05s)
  4642. 853.67 s [vector] +++ OK, passed 100 tests.
  4643. 853.67 s [vector] zipWith: OK
  4644. 853.67 s [vector] +++ OK, passed 100 tests.
  4645. 853.67 s [vector] zipWith3: OK
  4646. 853.67 s [vector] +++ OK, passed 100 tests.
  4647. 853.67 s [vector] izipWith: OK
  4648. 853.67 s [vector] +++ OK, passed 100 tests.
  4649. 853.67 s [vector] izipWith3: OK
  4650. 853.67 s [vector] +++ OK, passed 100 tests.
  4651. 853.67 s [vector] izipWithM: OK
  4652. 853.67 s [vector] +++ OK, passed 100 tests.
  4653. 853.67 s [vector] izipWithM_: OK (0.04s)
  4654. 853.67 s [vector] +++ OK, passed 100 tests.
  4655. 853.67 s [vector] zipWithM: OK
  4656. 853.67 s [vector] +++ OK, passed 100 tests.
  4657. 853.67 s [vector] zipWithM_: OK (0.04s)
  4658. 853.67 s [vector] +++ OK, passed 100 tests.
  4659. 853.67 s [vector] filter: OK
  4660. 853.67 s [vector] +++ OK, passed 100 tests.
  4661. 853.67 s [vector] ifilter: OK
  4662. 853.67 s [vector] +++ OK, passed 100 tests.
  4663. 853.67 s [vector] filterM: OK (0.05s)
  4664. 853.67 s [vector] +++ OK, passed 100 tests.
  4665. 853.67 s [vector] uniq: OK
  4666. 853.67 s [vector] +++ OK, passed 100 tests.
  4667. 853.67 s [vector] mapMaybe: OK
  4668. 853.67 s [vector] +++ OK, passed 100 tests.
  4669. 853.67 s [vector] imapMaybe: OK
  4670. 853.67 s [vector] +++ OK, passed 100 tests.
  4671. 853.67 s [vector] takeWhile: OK
  4672. 853.67 s [vector] +++ OK, passed 100 tests.
  4673. 853.67 s [vector] dropWhile: OK
  4674. 853.67 s [vector] +++ OK, passed 100 tests.
  4675. 853.67 s [vector] partition: OK
  4676. 853.67 s [vector] +++ OK, passed 100 tests.
  4677. 853.67 s [vector] partitionWith: OK
  4678. 853.67 s [vector] +++ OK, passed 100 tests.
  4679. 853.67 s [vector] span: OK
  4680. 853.67 s [vector] +++ OK, passed 100 tests.
  4681. 853.67 s [vector] break: OK
  4682. 853.67 s [vector] +++ OK, passed 100 tests.
  4683. 853.67 s [vector] spanR: OK
  4684. 853.67 s [vector] +++ OK, passed 100 tests.
  4685. 853.67 s [vector] breakR: OK
  4686. 853.67 s [vector] +++ OK, passed 100 tests.
  4687. 853.67 s [vector] groupBy: OK
  4688. 853.67 s [vector] +++ OK, passed 100 tests.
  4689. 853.67 s [vector] elem: OK
  4690. 853.67 s [vector] +++ OK, passed 100 tests.
  4691. 853.67 s [vector] notElem: OK
  4692. 853.67 s [vector] +++ OK, passed 100 tests.
  4693. 853.67 s [vector] find: OK
  4694. 853.67 s [vector] +++ OK, passed 100 tests.
  4695. 853.67 s [vector] findIndex: OK
  4696. 853.67 s [vector] +++ OK, passed 100 tests.
  4697. 853.67 s [vector] findIndexR: OK
  4698. 853.67 s [vector] +++ OK, passed 100 tests.
  4699. 853.67 s [vector] findIndices: OK
  4700. 853.67 s [vector] +++ OK, passed 100 tests.
  4701. 853.67 s [vector] elemIndex: OK
  4702. 853.67 s [vector] +++ OK, passed 100 tests.
  4703. 853.67 s [vector] elemIndices: OK
  4704. 853.67 s [vector] +++ OK, passed 100 tests.
  4705. 853.67 s [vector] foldl: OK
  4706. 853.67 s [vector] +++ OK, passed 100 tests.
  4707. 853.67 s [vector] foldl1: OK
  4708. 853.67 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4709. 853.67 s [vector] foldl': OK
  4710. 853.67 s [vector] +++ OK, passed 100 tests.
  4711. 853.67 s [vector] foldl1': OK
  4712. 853.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4713. 853.67 s [vector] foldr: OK
  4714. 853.67 s [vector] +++ OK, passed 100 tests.
  4715. 853.67 s [vector] foldr1: OK
  4716. 853.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4717. 853.67 s [vector] foldr': OK
  4718. 853.67 s [vector] +++ OK, passed 100 tests.
  4719. 853.67 s [vector] foldr1': OK
  4720. 853.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4721. 853.67 s [vector] ifoldl: OK
  4722. 853.67 s [vector] +++ OK, passed 100 tests.
  4723. 853.67 s [vector] ifoldl': OK
  4724. 853.67 s [vector] +++ OK, passed 100 tests.
  4725. 853.67 s [vector] ifoldr: OK (0.01s)
  4726. 853.67 s [vector] +++ OK, passed 100 tests.
  4727. 853.67 s [vector] ifoldr': OK
  4728. 853.67 s [vector] +++ OK, passed 100 tests.
  4729. 853.67 s [vector] ifoldM: OK
  4730. 853.67 s [vector] +++ OK, passed 100 tests.
  4731. 853.67 s [vector] ifoldM': OK
  4732. 853.67 s [vector] +++ OK, passed 100 tests.
  4733. 853.67 s [vector] ifoldM_: OK (0.05s)
  4734. 853.67 s [vector] +++ OK, passed 100 tests.
  4735. 853.67 s [vector] ifoldM'_: OK (0.05s)
  4736. 853.67 s [vector] +++ OK, passed 100 tests.
  4737. 853.67 s [vector] all: OK
  4738. 853.67 s [vector] +++ OK, passed 100 tests.
  4739. 853.67 s [vector] any: OK
  4740. 853.67 s [vector] +++ OK, passed 100 tests.
  4741. 853.67 s [vector] prescanl: OK
  4742. 853.67 s [vector] +++ OK, passed 100 tests.
  4743. 853.67 s [vector] prescanl': OK
  4744. 853.67 s [vector] +++ OK, passed 100 tests.
  4745. 853.67 s [vector] postscanl: OK
  4746. 853.67 s [vector] +++ OK, passed 100 tests.
  4747. 853.67 s [vector] postscanl': OK
  4748. 853.67 s [vector] +++ OK, passed 100 tests.
  4749. 853.67 s [vector] scanl: OK
  4750. 853.67 s [vector] +++ OK, passed 100 tests.
  4751. 853.67 s [vector] scanl': OK
  4752. 853.67 s [vector] +++ OK, passed 100 tests.
  4753. 853.67 s [vector] scanl1: OK
  4754. 853.67 s [vector] +++ OK, passed 100 tests.
  4755. 853.67 s [vector] scanl1': OK
  4756. 853.67 s [vector] +++ OK, passed 100 tests.
  4757. 853.67 s [vector] iscanl: OK (0.01s)
  4758. 853.67 s [vector] +++ OK, passed 100 tests.
  4759. 853.67 s [vector] iscanl': OK (0.01s)
  4760. 853.67 s [vector] +++ OK, passed 100 tests.
  4761. 853.67 s [vector] prescanr: OK
  4762. 853.67 s [vector] +++ OK, passed 100 tests.
  4763. 853.67 s [vector] prescanr': OK
  4764. 853.67 s [vector] +++ OK, passed 100 tests.
  4765. 853.67 s [vector] postscanr: OK
  4766. 853.67 s [vector] +++ OK, passed 100 tests.
  4767. 853.67 s [vector] postscanr': OK
  4768. 853.67 s [vector] +++ OK, passed 100 tests.
  4769. 853.67 s [vector] scanr: OK
  4770. 853.67 s [vector] +++ OK, passed 100 tests.
  4771. 853.67 s [vector] scanr': OK
  4772. 853.67 s [vector] +++ OK, passed 100 tests.
  4773. 853.67 s [vector] scanr1: OK
  4774. 853.67 s [vector] +++ OK, passed 100 tests.
  4775. 853.67 s [vector] scanr1': OK
  4776. 853.67 s [vector] +++ OK, passed 100 tests.
  4777. 853.67 s [vector] iscanr: OK
  4778. 853.67 s [vector] +++ OK, passed 100 tests.
  4779. 853.67 s [vector] iscanr': OK
  4780. 853.67 s [vector] +++ OK, passed 100 tests.
  4781. 853.67 s [vector] mut_read: OK
  4782. 853.67 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4783. 853.67 s [vector] mut_write: OK
  4784. 853.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4785. 853.67 s [vector] mut_modify: OK
  4786. 853.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4787. 853.67 s [vector] mut_generate: OK
  4788. 853.67 s [vector] +++ OK, passed 100 tests.
  4789. 853.67 s [vector] mut_generateM: OK (0.02s)
  4790. 853.67 s [vector] +++ OK, passed 100 tests.
  4791. 853.67 s [vector] mut_mapM_: OK (0.05s)
  4792. 853.67 s [vector] +++ OK, passed 100 tests.
  4793. 853.67 s [vector] mut_imapM_: OK (0.07s)
  4794. 853.67 s [vector] +++ OK, passed 100 tests.
  4795. 853.67 s [vector] mut_forM_: OK (0.04s)
  4796. 853.67 s [vector] +++ OK, passed 100 tests.
  4797. 853.67 s [vector] mut_iforM_: OK (0.04s)
  4798. 853.67 s [vector] +++ OK, passed 100 tests.
  4799. 853.67 s [vector] mut_foldr: OK
  4800. 853.67 s [vector] +++ OK, passed 100 tests.
  4801. 853.67 s [vector] mut_foldr': OK
  4802. 853.67 s [vector] +++ OK, passed 100 tests.
  4803. 853.67 s [vector] mut_foldl: OK
  4804. 853.67 s [vector] +++ OK, passed 100 tests.
  4805. 853.67 s [vector] mut_foldl': OK
  4806. 853.67 s [vector] +++ OK, passed 100 tests.
  4807. 853.67 s [vector] mut_ifoldr: OK (0.01s)
  4808. 853.67 s [vector] +++ OK, passed 100 tests.
  4809. 853.67 s [vector] mut_ifoldr': OK
  4810. 853.67 s [vector] +++ OK, passed 100 tests.
  4811. 853.67 s [vector] mut_ifoldl: OK
  4812. 853.67 s [vector] +++ OK, passed 100 tests.
  4813. 853.67 s [vector] mut_ifoldl': OK
  4814. 853.67 s [vector] +++ OK, passed 100 tests.
  4815. 853.67 s [vector] mut_foldM: OK
  4816. 853.67 s [vector] +++ OK, passed 100 tests.
  4817. 853.67 s [vector] mut_foldM': OK
  4818. 853.67 s [vector] +++ OK, passed 100 tests.
  4819. 853.67 s [vector] mut_foldrM: OK
  4820. 853.67 s [vector] +++ OK, passed 100 tests.
  4821. 853.67 s [vector] mut_foldrM': OK
  4822. 853.67 s [vector] +++ OK, passed 100 tests.
  4823. 853.67 s [vector] mut_ifoldM: OK
  4824. 853.67 s [vector] +++ OK, passed 100 tests.
  4825. 853.67 s [vector] mut_ifoldM': OK
  4826. 853.67 s [vector] +++ OK, passed 100 tests.
  4827. 853.67 s [vector] mut_ifoldrM: OK
  4828. 853.67 s [vector] +++ OK, passed 100 tests.
  4829. 853.67 s [vector] mut_ifoldrM': OK
  4830. 853.67 s [vector] +++ OK, passed 100 tests.
  4831. 853.67 s [vector] compare: OK
  4832. 853.67 s [vector] +++ OK, passed 100 tests.
  4833. 853.67 s [vector] maximum: OK
  4834. 853.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4835. 853.67 s [vector] minimum: OK
  4836. 853.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4837. 853.67 s [vector] minIndex: OK
  4838. 853.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4839. 853.68 s [vector] maxIndex: OK
  4840. 853.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4841. 853.68 s [vector] maximumBy: OK
  4842. 853.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4843. 853.68 s [vector] minimumBy: OK
  4844. 853.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4845. 853.68 s [vector] maximumOn: OK
  4846. 853.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4847. 853.68 s [vector] minimumOn: OK
  4848. 853.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4849. 853.68 s [vector] maxIndexBy: OK
  4850. 853.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4851. 853.68 s [vector] minIndexBy: OK
  4852. 853.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4853. 853.68 s [vector] ListFirstMaxIndexWins: OK
  4854. 853.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4855. 853.68 s [vector] FalseListFirstMaxIndexWins: OK
  4856. 853.68 s [vector] +++ OK, failed as expected. (after 1 test):
  4857. 853.68 s [vector] Exception:
  4858. 853.68 s [vector] Prelude.foldr1: empty list
  4859. 853.68 s [vector] CallStack (from HasCallStack):
  4860. 853.68 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  4861. 853.68 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  4862. 853.68 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4863. 853.68 s [vector] []
  4864. 853.68 s [vector] zip: OK
  4865. 853.68 s [vector] +++ OK, passed 100 tests.
  4866. 853.68 s [vector] zip3: OK
  4867. 853.68 s [vector] +++ OK, passed 100 tests.
  4868. 853.68 s [vector] unzip: OK
  4869. 853.68 s [vector] +++ OK, passed 100 tests.
  4870. 853.68 s [vector] unzip3: OK
  4871. 853.68 s [vector] +++ OK, passed 100 tests.
  4872. 853.68 s [vector] indexed: OK
  4873. 853.68 s [vector] +++ OK, passed 100 tests.
  4874. 853.68 s [vector] update: OK
  4875. 853.68 s [vector] +++ OK, passed 100 tests.
  4876. 853.68 s [vector] mempty: OK
  4877. 853.68 s [vector] +++ OK, passed 1 test.
  4878. 853.68 s [vector] mappend: OK
  4879. 853.68 s [vector] +++ OK, passed 100 tests.
  4880. 853.68 s [vector] mconcat: OK (0.06s)
  4881. 853.68 s [vector] +++ OK, passed 100 tests.
  4882. 853.68 s [vector] glength: OK
  4883. 853.68 s [vector] +++ OK, passed 100 tests.
  4884. 853.68 s [vector] unstream
  4885. 853.68 s [vector] unstream == vunstream (exact): OK
  4886. 853.68 s [vector] +++ OK, passed 100 tests.
  4887. 853.68 s [vector] unstream == vunstream (unknown): OK
  4888. 853.68 s [vector] +++ OK, passed 100 tests.
  4889. 853.68 s [vector] unstreamR ~= vunstream (exact): OK
  4890. 853.68 s [vector] +++ OK, passed 100 tests.
  4891. 853.68 s [vector] unstreamR ~= vunstream (unknown): OK
  4892. 853.68 s [vector] +++ OK, passed 100 tests.
  4893. 853.68 s [vector] Data.Vector.Storable.Vector Alignment
  4894. 853.68 s [vector] Aligned Double: OK
  4895. 853.68 s [vector] Aligned Int: OK
  4896. 853.68 s [vector] Regression tests
  4897. 853.68 s [vector] enumFromTo crash #188
  4898. 853.68 s [vector] Word8: OK
  4899. 853.68 s [vector] Word16: OK
  4900. 853.68 s [vector] Word32: OK
  4901. 853.68 s [vector] Word64: OK
  4902. 853.68 s [vector] Word: OK
  4903. 853.68 s [vector] Int8: OK
  4904. 853.68 s [vector] Int16: OK
  4905. 853.68 s [vector] Int32: OK
  4906. 853.68 s [vector] Int64: OK
  4907. 853.68 s [vector] Int: OK
  4908. 853.68 s [vector] Char: OK
  4909. 853.68 s [vector] Negative tests
  4910. 853.68 s [vector] slice out of bounds #257
  4911. 853.68 s [vector] Boxed
  4912. 853.68 s [vector] Negative ix: OK
  4913. 853.68 s [vector] Negative size: OK
  4914. 853.68 s [vector] Negative ix and size: OK
  4915. 853.68 s [vector] Too large ix: OK
  4916. 853.68 s [vector] Too large size: OK
  4917. 853.68 s [vector] Too large ix and size: OK
  4918. 853.68 s [vector] Overflow: OK
  4919. 853.68 s [vector] OutOfMemory: OK
  4920. 853.68 s [vector] Primitive
  4921. 853.68 s [vector] Negative ix: OK
  4922. 853.68 s [vector] Negative size: OK
  4923. 853.68 s [vector] Negative ix and size: OK
  4924. 853.68 s [vector] Too large ix: OK
  4925. 853.68 s [vector] Too large size: OK
  4926. 853.68 s [vector] Too large ix and size: OK
  4927. 853.68 s [vector] Overflow: OK
  4928. 853.68 s [vector] OutOfMemory: OK
  4929. 853.68 s [vector] Storable
  4930. 853.68 s [vector] Negative ix: OK
  4931. 853.68 s [vector] Negative size: OK
  4932. 853.68 s [vector] Negative ix and size: OK
  4933. 853.68 s [vector] Too large ix: OK
  4934. 853.68 s [vector] Too large size: OK
  4935. 853.68 s [vector] Too large ix and size: OK
  4936. 853.68 s [vector] Overflow: OK
  4937. 853.68 s [vector] OutOfMemory: OK
  4938. 853.68 s [vector] Unboxed
  4939. 853.68 s [vector] Negative ix: OK
  4940. 853.68 s [vector] Negative size: OK
  4941. 853.68 s [vector] Negative ix and size: OK
  4942. 853.68 s [vector] Too large ix: OK
  4943. 853.68 s [vector] Too large size: OK
  4944. 853.68 s [vector] Too large ix and size: OK
  4945. 853.68 s [vector] Overflow: OK
  4946. 853.68 s [vector] OutOfMemory: OK
  4947. 853.68 s [vector] take #282
  4948. 853.68 s [vector] Boxed: OK
  4949. 853.68 s [vector] Primitive: OK
  4950. 853.68 s [vector] Storable: OK
  4951. 853.68 s [vector] Unboxed: OK
  4952. 853.68 s [vector] Data.Vector
  4953. 853.68 s [vector] MonadFix: OK
  4954. 853.68 s [vector] toFromArray: OK
  4955. 853.68 s [vector] toFromArraySlice: OK
  4956. 853.68 s [vector] toFromArraySliceUnsafe: OK
  4957. 853.68 s [vector] toFromMutableArray: OK
  4958. 853.68 s [vector] Data.Vector.Mutable (Move): OK
  4959. 853.68 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4960. 853.68 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  4961. 853.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4962. 853.68 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  4963. 853.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4964. 853.68 s [vector] Data.Vector.Storable.Mutable (Move): OK
  4965. 853.68 s [vector] +++ OK, passed 100 tests; 24 discarded.
  4966. 853.68 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  4967. 853.68 s [vector] +++ OK, passed 1 test.
  4968. 853.68 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  4969. 853.68 s [vector] +++ OK, passed 1 test.
  4970. 853.68 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK (0.02s)
  4971. 853.68 s [vector] +++ OK, passed 100 tests.
  4972. 853.68 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  4973. 853.68 s [vector] +++ OK, passed 100 tests.
  4974. 853.68 s [vector]
  4975. 853.68 s [vector] All 2808 tests passed (17.40s)
  4976. 853.68 s [vector] Test suite vector-tests-O0: PASS
  4977. 853.68 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  4978. 853.68 s [vector] Test suite vector-tests-O2: RUNNING...
  4979. 853.75 s [vector] toplevel
  4980. 853.75 s [vector] Data.Vector.Fusion.Bundle
  4981. 853.75 s [vector] fromList.toList == id: OK (0.01s)
  4982. 853.75 s [vector] +++ OK, passed 100 tests.
  4983. 853.75 s [vector] toList.fromList == id: OK (0.02s)
  4984. 853.75 s [vector] +++ OK, passed 100 tests.
  4985. 853.76 s [vector] eq: OK (0.02s)
  4986. 853.76 s [vector] +++ OK, passed 100 tests.
  4987. 853.77 s [vector] length: OK
  4988. 853.77 s [vector] +++ OK, passed 100 tests.
  4989. 853.78 s [vector] null: OK
  4990. 853.78 s [vector] +++ OK, passed 100 tests.
  4991. 853.79 s [vector] empty: OK
  4992. 853.79 s [vector] +++ OK, passed 1 test.
  4993. 853.79 s [vector] singleton: OK
  4994. 853.81 s [vector] +++ OK, passed 100 tests.
  4995. 853.81 s [vector] replicate: OK
  4996. 853.81 s [vector] +++ OK, passed 100 tests.
  4997. 853.82 s [vector] cons: OK (0.01s)
  4998. 853.82 s [vector] +++ OK, passed 100 tests.
  4999. 853.83 s [vector] snoc: OK
  5000. 853.83 s [vector] +++ OK, passed 100 tests.
  5001. 853.83 s [vector] append: OK
  5002. 853.83 s [vector] +++ OK, passed 100 tests.
  5003. 853.83 s [vector] head: OK
  5004. 853.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5005. 853.83 s [vector] last: OK
  5006. 853.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5007. 853.83 s [vector] index: OK
  5008. 853.83 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5009. 853.83 s [vector] extract: OK
  5010. 853.83 s [vector] +++ OK, passed 100 tests.
  5011. 853.83 s [vector] init: OK
  5012. 853.83 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5013. 853.83 s [vector] tail: OK
  5014. 853.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5015. 853.83 s [vector] take: OK
  5016. 853.84 s [vector] +++ OK, passed 100 tests.
  5017. 853.84 s [vector] drop: OK
  5018. 853.84 s [vector] +++ OK, passed 100 tests.
  5019. 853.84 s [vector] map: OK
  5020. 853.88 s [vector] +++ OK, passed 100 tests.
  5021. 853.88 s [vector] zipWith: OK
  5022. 853.88 s [vector] +++ OK, passed 100 tests.
  5023. 853.88 s [vector] zipWith3: OK
  5024. 853.88 s [vector] +++ OK, passed 100 tests.
  5025. 853.88 s [vector] filter: OK
  5026. 853.88 s [vector] +++ OK, passed 100 tests.
  5027. 853.88 s [vector] takeWhile: OK
  5028. 853.88 s [vector] +++ OK, passed 100 tests.
  5029. 853.88 s [vector] dropWhile: OK
  5030. 853.88 s [vector] +++ OK, passed 100 tests.
  5031. 853.88 s [vector] elem: OK
  5032. 853.88 s [vector] +++ OK, passed 100 tests.
  5033. 853.88 s [vector] notElem: OK
  5034. 853.88 s [vector] +++ OK, passed 100 tests.
  5035. 853.88 s [vector] find: OK
  5036. 853.88 s [vector] +++ OK, passed 100 tests.
  5037. 853.88 s [vector] findIndex: OK
  5038. 853.88 s [vector] +++ OK, passed 100 tests.
  5039. 853.88 s [vector] foldl: OK
  5040. 853.88 s [vector] +++ OK, passed 100 tests.
  5041. 853.88 s [vector] foldl1: OK
  5042. 853.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5043. 853.88 s [vector] foldl': OK
  5044. 853.88 s [vector] +++ OK, passed 100 tests.
  5045. 853.88 s [vector] foldl1': OK
  5046. 853.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5047. 853.88 s [vector] foldr: OK
  5048. 853.88 s [vector] +++ OK, passed 100 tests.
  5049. 853.88 s [vector] foldr1: OK
  5050. 853.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5051. 853.88 s [vector] prescanl: OK
  5052. 853.88 s [vector] +++ OK, passed 100 tests.
  5053. 853.88 s [vector] prescanl': OK
  5054. 853.88 s [vector] +++ OK, passed 100 tests.
  5055. 853.88 s [vector] postscanl: OK
  5056. 853.88 s [vector] +++ OK, passed 100 tests.
  5057. 853.88 s [vector] postscanl': OK
  5058. 853.88 s [vector] +++ OK, passed 100 tests.
  5059. 853.88 s [vector] scanl: OK
  5060. 853.88 s [vector] +++ OK, passed 100 tests.
  5061. 853.88 s [vector] scanl': OK
  5062. 853.88 s [vector] +++ OK, passed 100 tests.
  5063. 853.88 s [vector] scanl1: OK
  5064. 853.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5065. 853.88 s [vector] scanl1': OK
  5066. 853.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5067. 853.89 s [vector] concatMap: OK
  5068. 853.89 s [vector] +++ OK, passed 100 tests.
  5069. 853.89 s [vector] unfoldr: OK
  5070. 853.89 s [vector] +++ OK, passed 100 tests.
  5071. 853.89 s [vector] and: OK
  5072. 853.89 s [vector] +++ OK, passed 100 tests.
  5073. 853.89 s [vector] or: OK
  5074. 853.89 s [vector] +++ OK, passed 100 tests.
  5075. 853.89 s [vector] Tests.Vector.Boxed
  5076. 853.89 s [vector] Bool
  5077. 853.89 s [vector] fromList.toList == id: OK
  5078. 853.89 s [vector] +++ OK, passed 100 tests.
  5079. 853.89 s [vector] toList.fromList == id: OK
  5080. 853.89 s [vector] +++ OK, passed 100 tests.
  5081. 853.89 s [vector] unstream.stream == id: OK
  5082. 853.89 s [vector] +++ OK, passed 100 tests.
  5083. 853.89 s [vector] stream.unstream == id: OK
  5084. 853.89 s [vector] +++ OK, passed 100 tests.
  5085. 853.89 s [vector] eq: OK
  5086. 853.89 s [vector] +++ OK, passed 100 tests.
  5087. 853.89 s [vector] length: OK
  5088. 853.89 s [vector] +++ OK, passed 100 tests.
  5089. 853.89 s [vector] null: OK
  5090. 853.89 s [vector] +++ OK, passed 100 tests.
  5091. 853.89 s [vector] index: OK
  5092. 853.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5093. 853.89 s [vector] safeIndex: OK
  5094. 853.89 s [vector] +++ OK, passed 100 tests.
  5095. 853.89 s [vector] head: OK
  5096. 853.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5097. 853.89 s [vector] last: OK
  5098. 853.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5099. 853.89 s [vector] unsafeIndex: OK
  5100. 853.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5101. 853.89 s [vector] unsafeHead: OK
  5102. 853.89 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5103. 853.89 s [vector] unsafeLast: OK
  5104. 853.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5105. 853.89 s [vector] slice: OK
  5106. 853.89 s [vector] +++ OK, passed 100 tests.
  5107. 853.89 s [vector] init: OK
  5108. 853.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5109. 853.89 s [vector] tail: OK
  5110. 853.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5111. 853.89 s [vector] take: OK
  5112. 853.89 s [vector] +++ OK, passed 100 tests.
  5113. 853.89 s [vector] drop: OK
  5114. 853.89 s [vector] +++ OK, passed 100 tests.
  5115. 853.89 s [vector] splitAt: OK
  5116. 853.89 s [vector] +++ OK, passed 100 tests.
  5117. 853.89 s [vector] empty: OK
  5118. 853.89 s [vector] +++ OK, passed 1 test.
  5119. 853.89 s [vector] singleton: OK
  5120. 853.89 s [vector] +++ OK, passed 100 tests.
  5121. 853.89 s [vector] replicate: OK
  5122. 853.89 s [vector] +++ OK, passed 100 tests.
  5123. 853.89 s [vector] generate: OK
  5124. 853.89 s [vector] +++ OK, passed 100 tests.
  5125. 853.89 s [vector] iterateN: OK
  5126. 853.89 s [vector] +++ OK, passed 100 tests.
  5127. 853.90 s [vector] iterateNM: OK
  5128. 853.91 s [vector] +++ OK, passed 100 tests.
  5129. 853.91 s [vector] generateM: OK (0.01s)
  5130. 853.91 s [vector] +++ OK, passed 100 tests.
  5131. 853.92 s [vector] replicateM: OK
  5132. 853.92 s [vector] +++ OK, passed 100 tests.
  5133. 853.92 s [vector] create: OK
  5134. 853.92 s [vector] +++ OK, passed 100 tests.
  5135. 853.92 s [vector] createT: OK
  5136. 853.92 s [vector] +++ OK, passed 100 tests.
  5137. 853.92 s [vector] unfoldr: OK
  5138. 853.92 s [vector] +++ OK, passed 100 tests.
  5139. 853.92 s [vector] unfoldrN: OK
  5140. 853.92 s [vector] +++ OK, passed 100 tests.
  5141. 853.92 s [vector] unfoldrExactN: OK
  5142. 853.92 s [vector] +++ OK, passed 100 tests.
  5143. 853.93 s [vector] unfoldrM: OK
  5144. 853.93 s [vector] +++ OK, passed 100 tests.
  5145. 853.93 s [vector] unfoldrNM: OK
  5146. 853.93 s [vector] +++ OK, passed 100 tests.
  5147. 853.95 s [vector] unfoldrExactNM: OK (0.02s)
  5148. 854.60 s [vector] +++ OK, passed 100 tests.
  5149. 854.60 s [vector] constructN: OK
  5150. 854.60 s [vector] +++ OK, passed 100 tests.
  5151. 854.60 s [vector] constructrN: OK
  5152. 854.60 s [vector] +++ OK, passed 100 tests.
  5153. 854.60 s [vector] cons: OK
  5154. 854.60 s [vector] +++ OK, passed 100 tests.
  5155. 854.60 s [vector] snoc: OK
  5156. 854.60 s [vector] +++ OK, passed 100 tests.
  5157. 854.60 s [vector] append: OK
  5158. 854.60 s [vector] +++ OK, passed 100 tests.
  5159. 854.60 s [vector] concat: OK (0.01s)
  5160. 854.60 s [vector] +++ OK, passed 100 tests.
  5161. 854.60 s [vector] force: OK
  5162. 854.60 s [vector] +++ OK, passed 100 tests.
  5163. 854.60 s [vector] upd: OK
  5164. 854.60 s [vector] +++ OK, passed 100 tests.
  5165. 854.60 s [vector] accum: OK
  5166. 854.60 s [vector] +++ OK, passed 100 tests.
  5167. 854.60 s [vector] reverse: OK
  5168. 854.60 s [vector] +++ OK, passed 100 tests.
  5169. 854.60 s [vector] backpermute: OK
  5170. 854.60 s [vector] +++ OK, passed 100 tests.
  5171. 854.60 s [vector] map: OK
  5172. 854.60 s [vector] +++ OK, passed 100 tests.
  5173. 854.60 s [vector] imap: OK
  5174. 854.60 s [vector] +++ OK, passed 100 tests.
  5175. 854.60 s [vector] concatMap: OK
  5176. 854.60 s [vector] +++ OK, passed 100 tests.
  5177. 854.60 s [vector] mapM: OK
  5178. 854.60 s [vector] +++ OK, passed 100 tests.
  5179. 854.60 s [vector] mapM_: OK
  5180. 854.60 s [vector] +++ OK, passed 100 tests.
  5181. 854.60 s [vector] forM: OK
  5182. 854.60 s [vector] +++ OK, passed 100 tests.
  5183. 854.60 s [vector] forM_: OK
  5184. 854.60 s [vector] +++ OK, passed 100 tests.
  5185. 854.60 s [vector] imapM: OK
  5186. 854.60 s [vector] +++ OK, passed 100 tests.
  5187. 854.60 s [vector] imapM_: OK (0.01s)
  5188. 854.60 s [vector] +++ OK, passed 100 tests.
  5189. 854.60 s [vector] zipWith: OK
  5190. 854.60 s [vector] +++ OK, passed 100 tests.
  5191. 854.60 s [vector] zipWith3: OK
  5192. 854.60 s [vector] +++ OK, passed 100 tests.
  5193. 854.60 s [vector] izipWith: OK
  5194. 854.60 s [vector] +++ OK, passed 100 tests.
  5195. 854.60 s [vector] izipWith3: OK
  5196. 854.60 s [vector] +++ OK, passed 100 tests.
  5197. 854.60 s [vector] izipWithM: OK
  5198. 854.60 s [vector] +++ OK, passed 100 tests.
  5199. 854.60 s [vector] izipWithM_: OK
  5200. 854.60 s [vector] +++ OK, passed 100 tests.
  5201. 854.60 s [vector] zipWithM: OK
  5202. 854.60 s [vector] +++ OK, passed 100 tests.
  5203. 854.60 s [hedgehog] Phase: unpackPhase
  5204. 854.60 s [vector] zipWithM_: OK
  5205. 854.60 s [vector] +++ OK, passed 100 tests.
  5206. 854.60 s [vector] filter: OK
  5207. 854.60 s [vector] +++ OK, passed 100 tests.
  5208. 854.61 s [vector] ifilter: OK
  5209. 854.61 s [hedgehog] unpacking source archive /nix/store/y6x6mm5qz6s835g6w7sj382w8cidq00s-hedgehog-1.5.tar.gz
  5210. 854.61 s [hedgehog] source root is hedgehog-1.5
  5211. 854.61 s [vector] +++ OK, passed 100 tests.
  5212. 854.61 s [hedgehog] setting SOURCE_DATE_EPOCH to timestamp 1721821132 of file "hedgehog-1.5/CHANGELOG.md"
  5213. 854.61 s [vector] filterM: OK (0.02s)
  5214. 854.61 s [vector] +++ OK, passed 100 tests.
  5215. 854.61 s [vector] uniq: OK
  5216. 854.61 s [vector] +++ OK, passed 100 tests.
  5217. 854.61 s [vector] mapMaybe: OK
  5218. 854.61 s [vector] +++ OK, passed 100 tests.
  5219. 854.61 s [vector] imapMaybe: OK
  5220. 854.61 s [vector] +++ OK, passed 100 tests.
  5221. 854.61 s [vector] takeWhile: OK
  5222. 854.61 s [vector] +++ OK, passed 100 tests.
  5223. 854.61 s [vector] dropWhile: OK
  5224. 854.61 s [vector] +++ OK, passed 100 tests.
  5225. 854.61 s [vector] partition: OK
  5226. 854.61 s [hedgehog] Phase: patchPhase
  5227. 854.61 s [vector] +++ OK, passed 100 tests.
  5228. 854.61 s [vector] partitionWith: OK
  5229. 854.61 s [vector] +++ OK, passed 100 tests.
  5230. 854.61 s [vector] span: OK
  5231. 854.61 s [vector] +++ OK, passed 100 tests.
  5232. 854.61 s [vector] break: OK
  5233. 854.61 s [vector] +++ OK, passed 100 tests.
  5234. 854.61 s [vector] spanR: OK
  5235. 854.61 s [vector] +++ OK, passed 100 tests.
  5236. 854.61 s [vector] breakR: OK
  5237. 854.61 s [vector] +++ OK, passed 100 tests.
  5238. 854.61 s [vector] groupBy: OK
  5239. 854.61 s [vector] +++ OK, passed 100 tests.
  5240. 854.61 s [vector] elem: OK
  5241. 854.61 s [vector] +++ OK, passed 100 tests.
  5242. 854.61 s [vector] notElem: OK
  5243. 854.61 s [vector] +++ OK, passed 100 tests.
  5244. 854.61 s [vector] find: OK
  5245. 854.61 s [vector] +++ OK, passed 100 tests.
  5246. 854.61 s [vector] findIndex: OK
  5247. 854.61 s [vector] +++ OK, passed 100 tests.
  5248. 854.61 s [vector] findIndexR: OK
  5249. 854.61 s [vector] +++ OK, passed 100 tests.
  5250. 854.61 s [vector] findIndices: OK
  5251. 854.61 s [vector] +++ OK, passed 100 tests.
  5252. 854.61 s [vector] elemIndex: OK
  5253. 854.61 s [vector] +++ OK, passed 100 tests.
  5254. 854.61 s [vector] elemIndices: OK
  5255. 854.61 s [vector] +++ OK, passed 100 tests.
  5256. 854.61 s [vector] foldl: OK
  5257. 854.61 s [vector] +++ OK, passed 100 tests.
  5258. 854.61 s [hedgehog] Replace Cabal file with edited version from mirror://hackage/hedgehog-1.5/revision/2.cabal.
  5259. 854.61 s [vector] foldl1: OK
  5260. 854.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5261. 854.61 s [vector] foldl': OK
  5262. 854.61 s [vector] +++ OK, passed 100 tests.
  5263. 854.61 s [vector] foldl1': OK
  5264. 854.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5265. 854.61 s [vector] foldr: OK
  5266. 854.61 s [vector] +++ OK, passed 100 tests.
  5267. 854.61 s [vector] foldr1: OK
  5268. 854.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5269. 854.61 s [vector] foldr': OK
  5270. 854.61 s [vector] +++ OK, passed 100 tests.
  5271. 854.61 s [vector] foldr1': OK
  5272. 854.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5273. 854.61 s [vector] ifoldl: OK
  5274. 854.61 s [vector] +++ OK, passed 100 tests.
  5275. 854.61 s [vector] ifoldl': OK
  5276. 854.61 s [vector] +++ OK, passed 100 tests.
  5277. 854.61 s [vector] ifoldr: OK
  5278. 854.61 s [vector] +++ OK, passed 100 tests.
  5279. 854.61 s [vector] ifoldr': OK
  5280. 854.61 s [vector] +++ OK, passed 100 tests.
  5281. 854.61 s [vector] ifoldM: OK
  5282. 854.61 s [vector] +++ OK, passed 100 tests.
  5283. 854.61 s [vector] ifoldM': OK
  5284. 854.61 s [hedgehog] Phase: compileBuildDriverPhase
  5285. 854.61 s [vector] +++ OK, passed 100 tests.
  5286. 854.61 s [hedgehog] setupCompileFlags: -package-db=/build/tmp.L0yQxm88Rh/setup-package.conf.d -threaded
  5287. 854.61 s [vector] ifoldM_: OK (0.01s)
  5288. 854.61 s [vector] +++ OK, passed 100 tests.
  5289. 854.61 s [vector] ifoldM'_: OK (0.01s)
  5290. 854.61 s [vector] +++ OK, passed 100 tests.
  5291. 854.61 s [vector] all: OK
  5292. 854.61 s [vector] +++ OK, passed 100 tests.
  5293. 854.61 s [vector] any: OK
  5294. 854.61 s [vector] +++ OK, passed 100 tests.
  5295. 854.61 s [vector] prescanl: OK
  5296. 854.61 s [vector] +++ OK, passed 100 tests.
  5297. 854.61 s [vector] prescanl': OK
  5298. 854.61 s [vector] +++ OK, passed 100 tests.
  5299. 854.61 s [vector] postscanl: OK
  5300. 854.61 s [vector] +++ OK, passed 100 tests.
  5301. 854.61 s [vector] postscanl': OK
  5302. 854.61 s [vector] +++ OK, passed 100 tests.
  5303. 854.61 s [vector] scanl: OK
  5304. 854.61 s [vector] +++ OK, passed 100 tests.
  5305. 854.61 s [vector] scanl': OK
  5306. 854.61 s [vector] +++ OK, passed 100 tests.
  5307. 854.61 s [vector] scanl1: OK
  5308. 854.61 s [vector] +++ OK, passed 100 tests.
  5309. 854.61 s [vector] scanl1': OK
  5310. 854.61 s [vector] +++ OK, passed 100 tests.
  5311. 854.61 s [vector] iscanl: OK
  5312. 854.61 s [vector] +++ OK, passed 100 tests.
  5313. 854.61 s [vector] iscanl': OK
  5314. 854.61 s [vector] +++ OK, passed 100 tests.
  5315. 854.61 s [vector] prescanr: OK
  5316. 854.61 s [vector] +++ OK, passed 100 tests.
  5317. 854.61 s [vector] prescanr': OK
  5318. 854.61 s [vector] +++ OK, passed 100 tests.
  5319. 854.61 s [vector] postscanr: OK
  5320. 854.61 s [vector] +++ OK, passed 100 tests.
  5321. 854.61 s [vector] postscanr': OK
  5322. 854.61 s [vector] +++ OK, passed 100 tests.
  5323. 854.61 s [vector] scanr: OK
  5324. 854.61 s [vector] +++ OK, passed 100 tests.
  5325. 854.61 s [vector] scanr': OK
  5326. 854.61 s [vector] +++ OK, passed 100 tests.
  5327. 854.61 s [vector] scanr1: OK
  5328. 854.61 s [vector] +++ OK, passed 100 tests.
  5329. 854.61 s [vector] scanr1': OK
  5330. 854.61 s [vector] +++ OK, passed 100 tests.
  5331. 854.61 s [vector] iscanr: OK
  5332. 854.61 s [vector] +++ OK, passed 100 tests.
  5333. 854.61 s [vector] iscanr': OK
  5334. 854.61 s [vector] +++ OK, passed 100 tests.
  5335. 854.61 s [vector] mut_read: OK
  5336. 854.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5337. 854.61 s [vector] mut_write: OK
  5338. 854.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5339. 854.61 s [vector] mut_modify: OK
  5340. 854.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5341. 854.61 s [vector] mut_generate: OK
  5342. 854.61 s [vector] +++ OK, passed 100 tests.
  5343. 854.61 s [vector] mut_generateM: OK
  5344. 854.61 s [vector] +++ OK, passed 100 tests.
  5345. 854.61 s [vector] mut_mapM_: OK
  5346. 854.61 s [vector] +++ OK, passed 100 tests.
  5347. 854.61 s [vector] mut_imapM_: OK (0.01s)
  5348. 854.61 s [vector] +++ OK, passed 100 tests.
  5349. 854.61 s [vector] mut_forM_: OK
  5350. 854.61 s [vector] +++ OK, passed 100 tests.
  5351. 854.61 s [vector] mut_iforM_: OK (0.01s)
  5352. 854.61 s [vector] +++ OK, passed 100 tests.
  5353. 854.61 s [vector] mut_foldr: OK
  5354. 854.61 s [vector] +++ OK, passed 100 tests.
  5355. 854.61 s [vector] mut_foldr': OK
  5356. 854.61 s [vector] +++ OK, passed 100 tests.
  5357. 854.61 s [vector] mut_foldl: OK
  5358. 854.61 s [vector] +++ OK, passed 100 tests.
  5359. 854.61 s [vector] mut_foldl': OK
  5360. 854.61 s [vector] +++ OK, passed 100 tests.
  5361. 854.61 s [vector] mut_ifoldr: OK
  5362. 854.61 s [vector] +++ OK, passed 100 tests.
  5363. 854.61 s [vector] mut_ifoldr': OK
  5364. 854.61 s [vector] +++ OK, passed 100 tests.
  5365. 854.61 s [hedgehog] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.L0yQxm88Rh/Main.o )
  5366. 854.61 s [vector] mut_ifoldl: OK
  5367. 854.61 s [vector] +++ OK, passed 100 tests.
  5368. 854.61 s [vector] mut_ifoldl': OK
  5369. 854.61 s [vector] +++ OK, passed 100 tests.
  5370. 854.61 s [vector] mut_foldM: OK
  5371. 854.61 s [vector] +++ OK, passed 100 tests.
  5372. 854.61 s [vector] mut_foldM': OK
  5373. 854.61 s [vector] +++ OK, passed 100 tests.
  5374. 854.61 s [vector] mut_foldrM: OK
  5375. 854.61 s [vector] +++ OK, passed 100 tests.
  5376. 854.61 s [vector] mut_foldrM': OK
  5377. 854.61 s [vector] +++ OK, passed 100 tests.
  5378. 854.61 s [vector] mut_ifoldM: OK
  5379. 854.61 s [vector] +++ OK, passed 100 tests.
  5380. 854.61 s [vector] mut_ifoldM': OK
  5381. 854.61 s [vector] +++ OK, passed 100 tests.
  5382. 854.61 s [vector] mut_ifoldrM: OK
  5383. 854.61 s [vector] +++ OK, passed 100 tests.
  5384. 854.61 s [vector] mut_ifoldrM': OK
  5385. 854.61 s [vector] +++ OK, passed 100 tests.
  5386. 854.61 s [vector] compare: OK
  5387. 854.61 s [vector] +++ OK, passed 100 tests.
  5388. 854.61 s [vector] maximum: OK
  5389. 854.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5390. 854.61 s [vector] minimum: OK
  5391. 854.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5392. 854.61 s [vector] minIndex: OK
  5393. 854.61 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5394. 854.61 s [vector] maxIndex: OK
  5395. 854.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5396. 854.61 s [vector] maximumBy: OK
  5397. 854.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5398. 854.61 s [vector] minimumBy: OK
  5399. 854.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5400. 854.61 s [vector] maximumOn: OK
  5401. 854.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5402. 854.61 s [vector] minimumOn: OK
  5403. 854.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5404. 854.61 s [vector] maxIndexBy: OK
  5405. 854.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5406. 854.61 s [vector] minIndexBy: OK
  5407. 854.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5408. 854.61 s [vector] ListFirstMaxIndexWins: OK
  5409. 854.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5410. 854.61 s [vector] FalseListFirstMaxIndexWins: OK
  5411. 854.61 s [vector] +++ OK, failed as expected. (after 1 test):
  5412. 854.61 s [vector] Exception:
  5413. 854.61 s [vector] Prelude.foldr1: empty list
  5414. 854.61 s [vector] CallStack (from HasCallStack):
  5415. 854.61 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  5416. 854.61 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  5417. 854.61 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5418. 854.61 s [vector] []
  5419. 854.61 s [vector] zip: OK
  5420. 854.61 s [vector] +++ OK, passed 100 tests.
  5421. 854.61 s [vector] zip3: OK
  5422. 854.61 s [vector] +++ OK, passed 100 tests.
  5423. 854.61 s [vector] unzip: OK
  5424. 854.61 s [vector] +++ OK, passed 100 tests.
  5425. 854.61 s [vector] unzip3: OK
  5426. 854.61 s [vector] +++ OK, passed 100 tests.
  5427. 854.61 s [vector] indexed: OK
  5428. 854.61 s [vector] +++ OK, passed 100 tests.
  5429. 854.61 s [vector] update: OK
  5430. 854.61 s [vector] +++ OK, passed 100 tests.
  5431. 854.61 s [vector] concat: OK
  5432. 854.61 s [vector] +++ OK, passed 100 tests.
  5433. 854.61 s [vector] mempty: OK
  5434. 854.61 s [vector] +++ OK, passed 1 test.
  5435. 854.61 s [vector] mappend: OK
  5436. 854.61 s [vector] +++ OK, passed 100 tests.
  5437. 854.61 s [vector] mconcat: OK
  5438. 854.61 s [vector] +++ OK, passed 100 tests.
  5439. 854.61 s [vector] fmap: OK
  5440. 854.61 s [vector] +++ OK, passed 100 tests.
  5441. 854.61 s [vector] return: OK
  5442. 854.61 s [vector] +++ OK, passed 100 tests.
  5443. 854.61 s [vector] bind: OK (0.01s)
  5444. 854.61 s [vector] +++ OK, passed 100 tests.
  5445. 854.61 s [vector] mzip: OK
  5446. 854.61 s [vector] +++ OK, passed 100 tests.
  5447. 854.61 s [vector] munzip: OK
  5448. 854.61 s [vector] +++ OK, passed 100 tests.
  5449. 854.61 s [vector] applicative_pure: OK
  5450. 854.61 s [vector] +++ OK, passed 100 tests.
  5451. 854.61 s [vector] applicative_appl: OK (0.01s)
  5452. 854.61 s [vector] +++ OK, passed 100 tests.
  5453. 854.61 s [vector] alternative_empty: OK
  5454. 854.61 s [vector] +++ OK, passed 1 test.
  5455. 854.61 s [vector] alternative_or: OK
  5456. 854.61 s [vector] +++ OK, passed 100 tests.
  5457. 854.61 s [vector] sequence: OK (0.04s)
  5458. 854.61 s [vector] +++ OK, passed 100 tests.
  5459. 854.61 s [vector] sequence_: OK
  5460. 854.61 s [vector] +++ OK, passed 100 tests.
  5461. 854.61 s [vector] glength: OK
  5462. 854.61 s [vector] +++ OK, passed 100 tests.
  5463. 854.61 s [vector] and: OK
  5464. 854.62 s [vector] +++ OK, passed 100 tests.
  5465. 854.62 s [vector] or: OK
  5466. 854.62 s [vector] +++ OK, passed 100 tests.
  5467. 854.62 s [vector] Int
  5468. 854.62 s [vector] fromList.toList == id: OK
  5469. 854.62 s [vector] +++ OK, passed 100 tests.
  5470. 854.62 s [vector] toList.fromList == id: OK
  5471. 854.62 s [vector] +++ OK, passed 100 tests.
  5472. 854.62 s [vector] unstream.stream == id: OK
  5473. 854.62 s [vector] +++ OK, passed 100 tests.
  5474. 854.62 s [vector] stream.unstream == id: OK
  5475. 854.62 s [vector] +++ OK, passed 100 tests.
  5476. 854.62 s [vector] eq: OK
  5477. 854.62 s [vector] +++ OK, passed 100 tests.
  5478. 854.62 s [vector] length: OK
  5479. 854.62 s [vector] +++ OK, passed 100 tests.
  5480. 854.62 s [vector] null: OK
  5481. 854.62 s [vector] +++ OK, passed 100 tests.
  5482. 854.62 s [vector] index: OK
  5483. 854.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5484. 854.62 s [vector] safeIndex: OK
  5485. 854.62 s [vector] +++ OK, passed 100 tests.
  5486. 854.62 s [vector] head: OK
  5487. 854.62 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5488. 854.62 s [vector] last: OK
  5489. 854.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5490. 854.62 s [vector] unsafeIndex: OK
  5491. 854.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5492. 854.62 s [vector] unsafeHead: OK
  5493. 854.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5494. 854.62 s [vector] unsafeLast: OK
  5495. 854.62 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5496. 854.62 s [vector] slice: OK
  5497. 854.62 s [vector] +++ OK, passed 100 tests.
  5498. 854.62 s [vector] init: OK
  5499. 854.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5500. 854.62 s [vector] tail: OK
  5501. 854.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5502. 854.62 s [vector] take: OK
  5503. 854.62 s [vector] +++ OK, passed 100 tests.
  5504. 854.62 s [vector] drop: OK
  5505. 854.62 s [vector] +++ OK, passed 100 tests.
  5506. 854.62 s [vector] splitAt: OK
  5507. 854.62 s [vector] +++ OK, passed 100 tests.
  5508. 854.62 s [vector] empty: OK
  5509. 854.62 s [vector] +++ OK, passed 1 test.
  5510. 854.62 s [vector] singleton: OK
  5511. 854.62 s [vector] +++ OK, passed 100 tests.
  5512. 854.62 s [vector] replicate: OK
  5513. 854.62 s [vector] +++ OK, passed 100 tests.
  5514. 854.62 s [vector] generate: OK
  5515. 854.62 s [vector] +++ OK, passed 100 tests.
  5516. 854.62 s [vector] iterateN: OK
  5517. 854.62 s [vector] +++ OK, passed 100 tests.
  5518. 854.62 s [vector] iterateNM: OK (0.02s)
  5519. 854.62 s [vector] +++ OK, passed 100 tests.
  5520. 854.62 s [hedgehog] [2 of 2] Linking Setup
  5521. 854.62 s [vector] generateM: OK (0.03s)
  5522. 854.62 s [vector] +++ OK, passed 100 tests.
  5523. 854.62 s [vector] replicateM: OK (0.02s)
  5524. 854.62 s [vector] +++ OK, passed 100 tests.
  5525. 854.62 s [vector] create: OK
  5526. 854.62 s [vector] +++ OK, passed 100 tests.
  5527. 854.62 s [vector] createT: OK
  5528. 854.62 s [vector] +++ OK, passed 100 tests.
  5529. 854.62 s [vector] unfoldr: OK
  5530. 854.62 s [vector] +++ OK, passed 100 tests.
  5531. 854.62 s [vector] unfoldrN: OK
  5532. 854.62 s [vector] +++ OK, passed 100 tests.
  5533. 854.62 s [vector] unfoldrExactN: OK
  5534. 854.62 s [vector] +++ OK, passed 100 tests.
  5535. 854.62 s [vector] unfoldrM: OK
  5536. 854.62 s [vector] +++ OK, passed 100 tests.
  5537. 854.62 s [vector] unfoldrNM: OK
  5538. 854.62 s [vector] +++ OK, passed 100 tests.
  5539. 854.62 s [vector] unfoldrExactNM: OK (0.02s)
  5540. 854.62 s [vector] +++ OK, passed 100 tests.
  5541. 854.62 s [vector] constructN: OK
  5542. 854.62 s [vector] +++ OK, passed 100 tests.
  5543. 854.62 s [vector] constructrN: OK
  5544. 854.62 s [vector] +++ OK, passed 100 tests.
  5545. 854.62 s [vector] cons: OK
  5546. 854.62 s [vector] +++ OK, passed 100 tests.
  5547. 854.62 s [vector] snoc: OK
  5548. 854.62 s [vector] +++ OK, passed 100 tests.
  5549. 854.62 s [vector] append: OK
  5550. 854.62 s [vector] +++ OK, passed 100 tests.
  5551. 854.62 s [vector] concat: OK (0.01s)
  5552. 854.62 s [vector] +++ OK, passed 100 tests.
  5553. 854.62 s [vector] force: OK
  5554. 854.62 s [vector] +++ OK, passed 100 tests.
  5555. 854.62 s [vector] upd: OK
  5556. 854.62 s [vector] +++ OK, passed 100 tests.
  5557. 854.62 s [vector] accum: OK
  5558. 854.62 s [vector] +++ OK, passed 100 tests.
  5559. 854.62 s [vector] reverse: OK
  5560. 854.62 s [vector] +++ OK, passed 100 tests.
  5561. 854.62 s [vector] backpermute: OK
  5562. 854.62 s [vector] +++ OK, passed 100 tests.
  5563. 854.62 s [vector] map: OK
  5564. 854.62 s [vector] +++ OK, passed 100 tests.
  5565. 854.62 s [vector] imap: OK
  5566. 854.62 s [vector] +++ OK, passed 100 tests.
  5567. 854.62 s [vector] concatMap: OK
  5568. 854.62 s [vector] +++ OK, passed 100 tests.
  5569. 854.62 s [vector] mapM: OK
  5570. 854.62 s [vector] +++ OK, passed 100 tests.
  5571. 854.62 s [vector] mapM_: OK (0.01s)
  5572. 854.62 s [vector] +++ OK, passed 100 tests.
  5573. 854.62 s [vector] forM: OK
  5574. 854.62 s [vector] +++ OK, passed 100 tests.
  5575. 854.62 s [vector] forM_: OK (0.02s)
  5576. 854.62 s [vector] +++ OK, passed 100 tests.
  5577. 854.62 s [vector] imapM: OK
  5578. 854.62 s [vector] +++ OK, passed 100 tests.
  5579. 854.62 s [vector] imapM_: OK (0.01s)
  5580. 854.62 s [vector] +++ OK, passed 100 tests.
  5581. 854.62 s [vector] zipWith: OK
  5582. 854.62 s [vector] +++ OK, passed 100 tests.
  5583. 854.62 s [vector] zipWith3: OK
  5584. 854.62 s [vector] +++ OK, passed 100 tests.
  5585. 854.62 s [vector] izipWith: OK
  5586. 854.62 s [vector] +++ OK, passed 100 tests.
  5587. 854.62 s [vector] izipWith3: OK
  5588. 854.62 s [vector] +++ OK, passed 100 tests.
  5589. 854.62 s [vector] izipWithM: OK
  5590. 854.62 s [vector] +++ OK, passed 100 tests.
  5591. 854.62 s [vector] izipWithM_: OK (0.01s)
  5592. 854.62 s [vector] +++ OK, passed 100 tests.
  5593. 854.62 s [vector] zipWithM: OK
  5594. 854.62 s [vector] +++ OK, passed 100 tests.
  5595. 854.62 s [vector] zipWithM_: OK (0.01s)
  5596. 854.62 s [vector] +++ OK, passed 100 tests.
  5597. 854.62 s [vector] filter: OK
  5598. 854.62 s [vector] +++ OK, passed 100 tests.
  5599. 854.62 s [vector] ifilter: OK
  5600. 854.62 s [vector] +++ OK, passed 100 tests.
  5601. 854.62 s [vector] filterM: OK (0.04s)
  5602. 854.62 s [vector] +++ OK, passed 100 tests.
  5603. 854.62 s [vector] uniq: OK
  5604. 854.62 s [vector] +++ OK, passed 100 tests.
  5605. 854.62 s [vector] mapMaybe: OK
  5606. 854.62 s [vector] +++ OK, passed 100 tests.
  5607. 854.62 s [vector] imapMaybe: OK
  5608. 854.62 s [vector] +++ OK, passed 100 tests.
  5609. 854.62 s [vector] takeWhile: OK
  5610. 854.62 s [vector] +++ OK, passed 100 tests.
  5611. 854.62 s [vector] dropWhile: OK
  5612. 854.62 s [vector] +++ OK, passed 100 tests.
  5613. 854.62 s [vector] partition: OK
  5614. 854.62 s [vector] +++ OK, passed 100 tests.
  5615. 854.62 s [vector] partitionWith: OK
  5616. 854.62 s [vector] +++ OK, passed 100 tests.
  5617. 854.62 s [vector] span: OK
  5618. 854.62 s [vector] +++ OK, passed 100 tests.
  5619. 854.62 s [vector] break: OK
  5620. 854.62 s [vector] +++ OK, passed 100 tests.
  5621. 854.62 s [vector] spanR: OK
  5622. 854.62 s [vector] +++ OK, passed 100 tests.
  5623. 854.62 s [vector] breakR: OK
  5624. 854.62 s [vector] +++ OK, passed 100 tests.
  5625. 854.62 s [vector] groupBy: OK
  5626. 854.62 s [vector] +++ OK, passed 100 tests.
  5627. 854.62 s [vector] elem: OK
  5628. 854.63 s [vector] +++ OK, passed 100 tests.
  5629. 854.63 s [vector] notElem: OK
  5630. 854.63 s [vector] +++ OK, passed 100 tests.
  5631. 854.63 s [vector] find: OK
  5632. 854.63 s [vector] +++ OK, passed 100 tests.
  5633. 854.63 s [vector] findIndex: OK
  5634. 854.63 s [vector] +++ OK, passed 100 tests.
  5635. 854.63 s [vector] findIndexR: OK
  5636. 854.63 s [vector] +++ OK, passed 100 tests.
  5637. 854.63 s [vector] findIndices: OK
  5638. 854.63 s [vector] +++ OK, passed 100 tests.
  5639. 854.63 s [vector] elemIndex: OK
  5640. 854.63 s [vector] +++ OK, passed 100 tests.
  5641. 854.63 s [vector] elemIndices: OK
  5642. 854.63 s [vector] +++ OK, passed 100 tests.
  5643. 854.63 s [vector] foldl: OK
  5644. 854.63 s [vector] +++ OK, passed 100 tests.
  5645. 854.63 s [vector] foldl1: OK
  5646. 854.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5647. 854.65 s [vector] foldl': OK
  5648. 854.65 s [vector] +++ OK, passed 100 tests.
  5649. 854.65 s [vector] foldl1': OK
  5650. 854.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5651. 854.65 s [vector] foldr: OK
  5652. 854.65 s [vector] +++ OK, passed 100 tests.
  5653. 854.65 s [vector] foldr1: OK
  5654. 854.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5655. 854.65 s [vector] foldr': OK
  5656. 854.65 s [vector] +++ OK, passed 100 tests.
  5657. 854.65 s [vector] foldr1': OK
  5658. 854.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5659. 854.67 s [vector] ifoldl: OK
  5660. 854.67 s [vector] +++ OK, passed 100 tests.
  5661. 854.67 s [vector] ifoldl': OK
  5662. 854.67 s [vector] +++ OK, passed 100 tests.
  5663. 854.67 s [vector] ifoldr: OK
  5664. 854.67 s [vector] +++ OK, passed 100 tests.
  5665. 854.67 s [vector] ifoldr': OK
  5666. 854.67 s [vector] +++ OK, passed 100 tests.
  5667. 854.67 s [vector] ifoldM: OK
  5668. 854.67 s [vector] +++ OK, passed 100 tests.
  5669. 854.67 s [vector] ifoldM': OK
  5670. 854.67 s [vector] +++ OK, passed 100 tests.
  5671. 854.69 s [vector] ifoldM_: OK (0.02s)
  5672. 854.70 s [vector] +++ OK, passed 100 tests.
  5673. 854.70 s [vector] ifoldM'_: OK (0.02s)
  5674. 854.70 s [vector] +++ OK, passed 100 tests.
  5675. 854.70 s [vector] all: OK
  5676. 854.70 s [vector] +++ OK, passed 100 tests.
  5677. 854.70 s [vector] any: OK
  5678. 854.70 s [vector] +++ OK, passed 100 tests.
  5679. 854.71 s [vector] prescanl: OK
  5680. 854.71 s [vector] +++ OK, passed 100 tests.
  5681. 854.71 s [vector] prescanl': OK
  5682. 854.71 s [vector] +++ OK, passed 100 tests.
  5683. 854.71 s [vector] postscanl: OK
  5684. 854.71 s [vector] +++ OK, passed 100 tests.
  5685. 854.72 s [vector] postscanl': OK (0.01s)
  5686. 854.72 s [vector] +++ OK, passed 100 tests.
  5687. 854.73 s [vector] scanl: OK
  5688. 854.73 s [vector] +++ OK, passed 100 tests.
  5689. 854.73 s [vector] scanl': OK
  5690. 854.73 s [vector] +++ OK, passed 100 tests.
  5691. 854.73 s [vector] scanl1: OK
  5692. 854.73 s [vector] +++ OK, passed 100 tests.
  5693. 854.74 s [vector] scanl1': OK
  5694. 854.74 s [vector] +++ OK, passed 100 tests.
  5695. 854.74 s [vector] iscanl: OK
  5696. 854.74 s [vector] +++ OK, passed 100 tests.
  5697. 854.74 s [vector] iscanl': OK
  5698. 854.74 s [vector] +++ OK, passed 100 tests.
  5699. 854.74 s [vector] prescanr: OK
  5700. 854.74 s [vector] +++ OK, passed 100 tests.
  5701. 854.74 s [vector] prescanr': OK
  5702. 854.75 s [vector] +++ OK, passed 100 tests.
  5703. 854.75 s [vector] postscanr: OK
  5704. 854.75 s [vector] +++ OK, passed 100 tests.
  5705. 854.75 s [vector] postscanr': OK
  5706. 854.75 s [vector] +++ OK, passed 100 tests.
  5707. 854.76 s [vector] scanr: OK
  5708. 854.76 s [vector] +++ OK, passed 100 tests.
  5709. 854.76 s [vector] scanr': OK
  5710. 854.76 s [vector] +++ OK, passed 100 tests.
  5711. 854.76 s [vector] scanr1: OK
  5712. 854.76 s [vector] +++ OK, passed 100 tests.
  5713. 854.77 s [vector] scanr1': OK
  5714. 854.77 s [vector] +++ OK, passed 100 tests.
  5715. 854.77 s [vector] iscanr: OK
  5716. 854.77 s [vector] +++ OK, passed 100 tests.
  5717. 854.77 s [vector] iscanr': OK
  5718. 854.77 s [vector] +++ OK, passed 100 tests.
  5719. 854.77 s [vector] mut_read: OK
  5720. 854.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5721. 854.77 s [vector] mut_write: OK
  5722. 854.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5723. 854.77 s [vector] mut_modify: OK
  5724. 854.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5725. 854.79 s [vector] mut_generate: OK
  5726. 854.79 s [vector] +++ OK, passed 100 tests.
  5727. 854.79 s [vector] mut_generateM: OK (0.01s)
  5728. 854.80 s [vector] +++ OK, passed 100 tests.
  5729. 854.81 s [vector] mut_mapM_: OK (0.02s)
  5730. 854.81 s [vector] +++ OK, passed 100 tests.
  5731. 854.83 s [vector] mut_imapM_: OK (0.02s)
  5732. 854.83 s [vector] +++ OK, passed 100 tests.
  5733. 854.85 s [vector] mut_forM_: OK (0.02s)
  5734. 854.85 s [vector] +++ OK, passed 100 tests.
  5735. 854.86 s [vector] mut_iforM_: OK (0.02s)
  5736. 854.86 s [vector] +++ OK, passed 100 tests.
  5737. 854.86 s [vector] mut_foldr: OK
  5738. 854.86 s [vector] +++ OK, passed 100 tests.
  5739. 854.86 s [vector] mut_foldr': OK
  5740. 854.87 s [vector] +++ OK, passed 100 tests.
  5741. 854.87 s [vector] mut_foldl: OK
  5742. 854.87 s [vector] +++ OK, passed 100 tests.
  5743. 854.87 s [vector] mut_foldl': OK
  5744. 854.87 s [vector] +++ OK, passed 100 tests.
  5745. 854.87 s [vector] mut_ifoldr: OK
  5746. 854.87 s [vector] +++ OK, passed 100 tests.
  5747. 854.88 s [vector] mut_ifoldr': OK
  5748. 854.88 s [vector] +++ OK, passed 100 tests.
  5749. 854.88 s [vector] mut_ifoldl: OK
  5750. 854.88 s [vector] +++ OK, passed 100 tests.
  5751. 854.88 s [vector] mut_ifoldl': OK
  5752. 854.89 s [vector] +++ OK, passed 100 tests.
  5753. 854.89 s [vector] mut_foldM: OK
  5754. 854.89 s [vector] +++ OK, passed 100 tests.
  5755. 854.89 s [vector] mut_foldM': OK
  5756. 854.89 s [vector] +++ OK, passed 100 tests.
  5757. 854.90 s [vector] mut_foldrM: OK
  5758. 854.90 s [vector] +++ OK, passed 100 tests.
  5759. 854.90 s [vector] mut_foldrM': OK
  5760. 854.90 s [vector] +++ OK, passed 100 tests.
  5761. 854.90 s [vector] mut_ifoldM: OK
  5762. 854.90 s [vector] +++ OK, passed 100 tests.
  5763. 854.90 s [vector] mut_ifoldM': OK
  5764. 854.91 s [vector] +++ OK, passed 100 tests.
  5765. 854.91 s [vector] mut_ifoldrM: OK
  5766. 854.91 s [vector] +++ OK, passed 100 tests.
  5767. 854.91 s [vector] mut_ifoldrM': OK
  5768. 854.91 s [vector] +++ OK, passed 100 tests.
  5769. 854.91 s [vector] compare: OK
  5770. 854.91 s [vector] +++ OK, passed 100 tests.
  5771. 854.91 s [vector] maximum: OK
  5772. 854.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5773. 854.91 s [vector] minimum: OK
  5774. 854.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5775. 854.91 s [vector] minIndex: OK
  5776. 854.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5777. 854.91 s [vector] maxIndex: OK
  5778. 854.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5779. 854.91 s [vector] maximumBy: OK
  5780. 854.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5781. 854.91 s [vector] minimumBy: OK
  5782. 854.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5783. 854.92 s [vector] maximumOn: OK
  5784. 854.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5785. 854.92 s [vector] minimumOn: OK
  5786. 854.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5787. 854.92 s [vector] maxIndexBy: OK
  5788. 854.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5789. 854.92 s [vector] minIndexBy: OK
  5790. 854.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5791. 854.92 s [vector] ListFirstMaxIndexWins: OK
  5792. 854.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5793. 854.92 s [vector] FalseListFirstMaxIndexWins: OK
  5794. 854.92 s [vector] +++ OK, failed as expected. (after 1 test):
  5795. 854.92 s [vector] Exception:
  5796. 854.92 s [vector] Prelude.foldr1: empty list
  5797. 854.92 s [vector] CallStack (from HasCallStack):
  5798. 854.92 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  5799. 854.92 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  5800. 854.92 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5801. 854.92 s [vector] []
  5802. 854.92 s [vector] zip: OK
  5803. 854.93 s [vector] +++ OK, passed 100 tests.
  5804. 854.93 s [vector] zip3: OK
  5805. 854.93 s [vector] +++ OK, passed 100 tests.
  5806. 854.93 s [vector] unzip: OK
  5807. 854.93 s [vector] +++ OK, passed 100 tests.
  5808. 854.93 s [vector] unzip3: OK
  5809. 854.93 s [vector] +++ OK, passed 100 tests.
  5810. 854.93 s [vector] indexed: OK
  5811. 854.93 s [vector] +++ OK, passed 100 tests.
  5812. 854.94 s [vector] update: OK
  5813. 854.94 s [vector] +++ OK, passed 100 tests.
  5814. 854.94 s [vector] concat: OK (0.01s)
  5815. 854.94 s [vector] +++ OK, passed 100 tests.
  5816. 854.94 s [vector] mempty: OK
  5817. 854.94 s [vector] +++ OK, passed 1 test.
  5818. 854.94 s [vector] mappend: OK
  5819. 854.94 s [vector] +++ OK, passed 100 tests.
  5820. 854.95 s [vector] mconcat: OK
  5821. 854.95 s [vector] +++ OK, passed 100 tests.
  5822. 854.95 s [vector] fmap: OK
  5823. 854.95 s [vector] +++ OK, passed 100 tests.
  5824. 854.95 s [vector] return: OK
  5825. 854.95 s [vector] +++ OK, passed 100 tests.
  5826. 854.97 s [vector] bind: OK (0.02s)
  5827. 854.97 s [vector] +++ OK, passed 100 tests.
  5828. 854.97 s [vector] mzip: OK
  5829. 854.97 s [vector] +++ OK, passed 100 tests.
  5830. 854.98 s [vector] munzip: OK
  5831. 854.98 s [vector] +++ OK, passed 100 tests.
  5832. 854.99 s [vector] applicative_pure: OK
  5833. 854.99 s [vector] +++ OK, passed 100 tests.
  5834. 855.01 s [vector] applicative_appl: OK (0.04s)
  5835. 855.01 s [vector] +++ OK, passed 100 tests.
  5836. 855.01 s [vector] alternative_empty: OK
  5837. 855.01 s [vector] +++ OK, passed 1 test.
  5838. 855.01 s [vector] alternative_or: OK
  5839. 855.01 s [vector] +++ OK, passed 100 tests.
  5840. 855.06 s [vector] sequence: OK (0.04s)
  5841. 855.06 s [vector] +++ OK, passed 100 tests.
  5842. 855.06 s [vector] sequence_: OK
  5843. 855.06 s [vector] +++ OK, passed 100 tests.
  5844. 855.06 s [vector] glength: OK
  5845. 855.07 s [vector] +++ OK, passed 100 tests.
  5846. 855.07 s [vector] sum: OK
  5847. 855.07 s [vector] +++ OK, passed 100 tests.
  5848. 855.07 s [vector] product: OK
  5849. 855.07 s [vector] +++ OK, passed 100 tests.
  5850. 855.07 s [vector] enumFromN: OK
  5851. 855.07 s [vector] +++ OK, passed 100 tests.
  5852. 855.07 s [vector] enumFromThenN: OK
  5853. 855.07 s [vector] +++ OK, passed 100 tests.
  5854. 855.07 s [vector] enumFromTo: OK
  5855. 855.07 s [vector] +++ OK, passed 100 tests.
  5856. 855.07 s [vector] enumFromThenTo: OK
  5857. 855.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5858. 855.07 s [vector] unstream
  5859. 855.07 s [vector] unstream == vunstream (exact): OK
  5860. 855.07 s [vector] +++ OK, passed 100 tests.
  5861. 855.07 s [vector] unstream == vunstream (unknown): OK
  5862. 855.07 s [vector] +++ OK, passed 100 tests.
  5863. 855.07 s [vector] unstreamR ~= vunstream (exact): OK
  5864. 855.07 s [vector] +++ OK, passed 100 tests.
  5865. 855.07 s [vector] unstreamR ~= vunstream (unknown): OK
  5866. 855.07 s [vector] +++ OK, passed 100 tests.
  5867. 855.07 s [vector] Tests.Vector.Primitive
  5868. 855.07 s [vector] Int
  5869. 855.07 s [vector] fromList.toList == id: OK
  5870. 855.07 s [vector] +++ OK, passed 100 tests.
  5871. 855.07 s [vector] toList.fromList == id: OK
  5872. 855.07 s [vector] +++ OK, passed 100 tests.
  5873. 855.07 s [vector] unstream.stream == id: OK
  5874. 855.07 s [vector] +++ OK, passed 100 tests.
  5875. 855.07 s [vector] stream.unstream == id: OK
  5876. 855.07 s [vector] +++ OK, passed 100 tests.
  5877. 855.07 s [vector] eq: OK
  5878. 855.07 s [vector] +++ OK, passed 100 tests.
  5879. 855.07 s [vector] length: OK
  5880. 855.07 s [vector] +++ OK, passed 100 tests.
  5881. 855.07 s [vector] null: OK
  5882. 855.07 s [vector] +++ OK, passed 100 tests.
  5883. 855.07 s [vector] index: OK
  5884. 855.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5885. 855.07 s [vector] safeIndex: OK
  5886. 855.07 s [vector] +++ OK, passed 100 tests.
  5887. 855.07 s [vector] head: OK
  5888. 855.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5889. 855.07 s [vector] last: OK
  5890. 855.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5891. 855.07 s [vector] unsafeIndex: OK
  5892. 855.07 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5893. 855.07 s [vector] unsafeHead: OK
  5894. 855.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5895. 855.08 s [vector] unsafeLast: OK
  5896. 855.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5897. 855.08 s [vector] slice: OK
  5898. 855.08 s [vector] +++ OK, passed 100 tests.
  5899. 855.08 s [vector] init: OK
  5900. 855.08 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5901. 855.08 s [vector] tail: OK
  5902. 855.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5903. 855.08 s [vector] take: OK
  5904. 855.08 s [vector] +++ OK, passed 100 tests.
  5905. 855.08 s [vector] drop: OK
  5906. 855.08 s [vector] +++ OK, passed 100 tests.
  5907. 855.08 s [vector] splitAt: OK
  5908. 855.08 s [vector] +++ OK, passed 100 tests.
  5909. 855.08 s [vector] empty: OK
  5910. 855.08 s [vector] +++ OK, passed 1 test.
  5911. 855.08 s [vector] singleton: OK
  5912. 855.08 s [vector] +++ OK, passed 100 tests.
  5913. 855.08 s [vector] replicate: OK
  5914. 855.08 s [vector] +++ OK, passed 100 tests.
  5915. 855.08 s [vector] generate: OK
  5916. 855.08 s [vector] +++ OK, passed 100 tests.
  5917. 855.09 s [vector] iterateN: OK
  5918. 855.09 s [vector] +++ OK, passed 100 tests.
  5919. 855.11 s [vector] iterateNM: OK (0.01s)
  5920. 855.11 s [vector] +++ OK, passed 100 tests.
  5921. 855.11 s [vector] generateM: OK (0.01s)
  5922. 855.11 s [vector] +++ OK, passed 100 tests.
  5923. 855.13 s [vector] replicateM: OK (0.02s)
  5924. 855.13 s [vector] +++ OK, passed 100 tests.
  5925. 855.13 s [vector] create: OK
  5926. 855.13 s [vector] +++ OK, passed 100 tests.
  5927. 855.13 s [vector] createT: OK
  5928. 855.13 s [vector] +++ OK, passed 100 tests.
  5929. 855.13 s [vector] unfoldr: OK
  5930. 855.13 s [vector] +++ OK, passed 100 tests.
  5931. 855.14 s [vector] unfoldrN: OK
  5932. 855.14 s [vector] +++ OK, passed 100 tests.
  5933. 855.14 s [vector] unfoldrExactN: OK
  5934. 855.14 s [vector] +++ OK, passed 100 tests.
  5935. 855.14 s [vector] unfoldrM: OK
  5936. 855.14 s [vector] +++ OK, passed 100 tests.
  5937. 855.15 s [vector] unfoldrNM: OK
  5938. 855.15 s [vector] +++ OK, passed 100 tests.
  5939. 855.16 s [vector] unfoldrExactNM: OK (0.01s)
  5940. 855.16 s [vector] +++ OK, passed 100 tests.
  5941. 855.16 s [vector] constructN: OK
  5942. 855.16 s [vector] +++ OK, passed 100 tests.
  5943. 855.16 s [vector] constructrN: OK
  5944. 855.16 s [vector] +++ OK, passed 100 tests.
  5945. 855.16 s [vector] cons: OK
  5946. 855.16 s [vector] +++ OK, passed 100 tests.
  5947. 855.16 s [vector] snoc: OK
  5948. 855.16 s [vector] +++ OK, passed 100 tests.
  5949. 855.16 s [vector] append: OK
  5950. 855.17 s [vector] +++ OK, passed 100 tests.
  5951. 855.18 s [vector] concat: OK (0.02s)
  5952. 855.18 s [vector] +++ OK, passed 100 tests.
  5953. 855.18 s [vector] force: OK
  5954. 855.18 s [vector] +++ OK, passed 100 tests.
  5955. 855.19 s [vector] upd: OK
  5956. 855.19 s [vector] +++ OK, passed 100 tests.
  5957. 855.19 s [vector] accum: OK
  5958. 855.19 s [vector] +++ OK, passed 100 tests.
  5959. 855.19 s [vector] reverse: OK
  5960. 855.19 s [vector] +++ OK, passed 100 tests.
  5961. 855.19 s [vector] backpermute: OK
  5962. 855.19 s [vector] +++ OK, passed 100 tests.
  5963. 855.19 s [vector] map: OK
  5964. 855.19 s [vector] +++ OK, passed 100 tests.
  5965. 855.20 s [vector] imap: OK
  5966. 855.20 s [vector] +++ OK, passed 100 tests.
  5967. 855.20 s [vector] concatMap: OK
  5968. 855.20 s [vector] +++ OK, passed 100 tests.
  5969. 855.20 s [vector] mapM: OK
  5970. 855.20 s [vector] +++ OK, passed 100 tests.
  5971. 855.22 s [vector] mapM_: OK
  5972. 855.22 s [vector] +++ OK, passed 100 tests.
  5973. 855.22 s [vector] forM: OK
  5974. 855.22 s [vector] +++ OK, passed 100 tests.
  5975. 855.24 s [vector] forM_: OK (0.02s)
  5976. 855.24 s [vector] +++ OK, passed 100 tests.
  5977. 855.24 s [vector] imapM: OK
  5978. 855.24 s [vector] +++ OK, passed 100 tests.
  5979. 855.26 s [vector] imapM_: OK (0.01s)
  5980. 855.26 s [vector] +++ OK, passed 100 tests.
  5981. 855.26 s [vector] zipWith: OK
  5982. 855.26 s [vector] +++ OK, passed 100 tests.
  5983. 855.26 s [vector] zipWith3: OK
  5984. 855.27 s [vector] +++ OK, passed 100 tests.
  5985. 855.27 s [vector] izipWith: OK
  5986. 855.27 s [vector] +++ OK, passed 100 tests.
  5987. 855.27 s [vector] izipWith3: OK
  5988. 855.27 s [vector] +++ OK, passed 100 tests.
  5989. 855.27 s [vector] izipWithM: OK
  5990. 855.27 s [vector] +++ OK, passed 100 tests.
  5991. 855.28 s [vector] izipWithM_: OK (0.01s)
  5992. 855.28 s [vector] +++ OK, passed 100 tests.
  5993. 855.29 s [vector] zipWithM: OK
  5994. 855.29 s [vector] +++ OK, passed 100 tests.
  5995. 855.30 s [vector] zipWithM_: OK (0.01s)
  5996. 855.30 s [vector] +++ OK, passed 100 tests.
  5997. 855.30 s [vector] filter: OK
  5998. 855.30 s [vector] +++ OK, passed 100 tests.
  5999. 855.30 s [vector] ifilter: OK
  6000. 855.30 s [vector] +++ OK, passed 100 tests.
  6001. 855.35 s [vector] filterM: OK (0.05s)
  6002. 855.35 s [vector] +++ OK, passed 100 tests.
  6003. 855.35 s [vector] uniq: OK
  6004. 855.35 s [vector] +++ OK, passed 100 tests.
  6005. 855.35 s [vector] mapMaybe: OK
  6006. 855.35 s [vector] +++ OK, passed 100 tests.
  6007. 855.35 s [vector] imapMaybe: OK
  6008. 855.35 s [vector] +++ OK, passed 100 tests.
  6009. 855.35 s [vector] takeWhile: OK
  6010. 855.35 s [vector] +++ OK, passed 100 tests.
  6011. 855.36 s [vector] dropWhile: OK
  6012. 855.36 s [vector] +++ OK, passed 100 tests.
  6013. 855.36 s [vector] partition: OK
  6014. 855.36 s [vector] +++ OK, passed 100 tests.
  6015. 855.36 s [vector] partitionWith: OK
  6016. 855.36 s [vector] +++ OK, passed 100 tests.
  6017. 855.36 s [vector] span: OK
  6018. 855.36 s [vector] +++ OK, passed 100 tests.
  6019. 855.36 s [vector] break: OK
  6020. 855.36 s [vector] +++ OK, passed 100 tests.
  6021. 855.36 s [vector] spanR: OK
  6022. 855.36 s [vector] +++ OK, passed 100 tests.
  6023. 855.36 s [vector] breakR: OK
  6024. 855.37 s [vector] +++ OK, passed 100 tests.
  6025. 855.37 s [vector] groupBy: OK
  6026. 855.37 s [vector] +++ OK, passed 100 tests.
  6027. 855.37 s [vector] elem: OK
  6028. 855.37 s [vector] +++ OK, passed 100 tests.
  6029. 855.37 s [vector] notElem: OK
  6030. 855.37 s [vector] +++ OK, passed 100 tests.
  6031. 855.37 s [vector] find: OK
  6032. 855.37 s [vector] +++ OK, passed 100 tests.
  6033. 855.37 s [vector] findIndex: OK
  6034. 855.37 s [vector] +++ OK, passed 100 tests.
  6035. 855.37 s [vector] findIndexR: OK
  6036. 855.37 s [vector] +++ OK, passed 100 tests.
  6037. 855.37 s [vector] findIndices: OK
  6038. 855.37 s [vector] +++ OK, passed 100 tests.
  6039. 855.37 s [vector] elemIndex: OK
  6040. 855.37 s [vector] +++ OK, passed 100 tests.
  6041. 855.37 s [vector] elemIndices: OK
  6042. 855.37 s [vector] +++ OK, passed 100 tests.
  6043. 855.38 s [vector] foldl: OK
  6044. 855.38 s [vector] +++ OK, passed 100 tests.
  6045. 855.38 s [vector] foldl1: OK
  6046. 855.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6047. 855.38 s [vector] foldl': OK
  6048. 855.38 s [vector] +++ OK, passed 100 tests.
  6049. 855.39 s [vector] foldl1': OK
  6050. 855.39 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6051. 855.39 s [vector] foldr: OK
  6052. 855.39 s [vector] +++ OK, passed 100 tests.
  6053. 855.39 s [vector] foldr1: OK
  6054. 855.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6055. 855.40 s [vector] foldr': OK
  6056. 855.40 s [vector] +++ OK, passed 100 tests.
  6057. 855.40 s [vector] foldr1': OK
  6058. 855.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6059. 855.40 s [vector] ifoldl: OK
  6060. 855.40 s [vector] +++ OK, passed 100 tests.
  6061. 855.40 s [vector] ifoldl': OK
  6062. 855.40 s [vector] +++ OK, passed 100 tests.
  6063. 855.40 s [vector] ifoldr: OK
  6064. 855.41 s [vector] +++ OK, passed 100 tests.
  6065. 855.41 s [vector] ifoldr': OK
  6066. 855.41 s [vector] +++ OK, passed 100 tests.
  6067. 855.41 s [vector] ifoldM: OK
  6068. 855.41 s [vector] +++ OK, passed 100 tests.
  6069. 855.42 s [vector] ifoldM': OK
  6070. 855.43 s [vector] +++ OK, passed 100 tests.
  6071. 855.45 s [vector] ifoldM_: OK (0.02s)
  6072. 855.45 s [vector] +++ OK, passed 100 tests.
  6073. 855.45 s [vector] ifoldM'_: OK (0.02s)
  6074. 855.45 s [vector] +++ OK, passed 100 tests.
  6075. 855.45 s [vector] all: OK
  6076. 855.45 s [vector] +++ OK, passed 100 tests.
  6077. 855.45 s [vector] any: OK
  6078. 855.45 s [vector] +++ OK, passed 100 tests.
  6079. 855.45 s [vector] prescanl: OK
  6080. 855.46 s [vector] +++ OK, passed 100 tests.
  6081. 855.46 s [vector] prescanl': OK
  6082. 855.46 s [vector] +++ OK, passed 100 tests.
  6083. 855.46 s [vector] postscanl: OK
  6084. 855.46 s [vector] +++ OK, passed 100 tests.
  6085. 855.47 s [vector] postscanl': OK
  6086. 855.47 s [vector] +++ OK, passed 100 tests.
  6087. 855.47 s [vector] scanl: OK
  6088. 855.47 s [vector] +++ OK, passed 100 tests.
  6089. 855.47 s [vector] scanl': OK
  6090. 855.47 s [vector] +++ OK, passed 100 tests.
  6091. 855.47 s [vector] scanl1: OK
  6092. 855.47 s [vector] +++ OK, passed 100 tests.
  6093. 855.48 s [vector] scanl1': OK
  6094. 855.48 s [vector] +++ OK, passed 100 tests.
  6095. 855.48 s [vector] iscanl: OK
  6096. 855.48 s [vector] +++ OK, passed 100 tests.
  6097. 855.48 s [vector] iscanl': OK
  6098. 855.49 s [vector] +++ OK, passed 100 tests.
  6099. 855.49 s [vector] prescanr: OK
  6100. 855.49 s [vector] +++ OK, passed 100 tests.
  6101. 855.49 s [vector] prescanr': OK
  6102. 855.49 s [vector] +++ OK, passed 100 tests.
  6103. 855.49 s [vector] postscanr: OK
  6104. 855.49 s [vector] +++ OK, passed 100 tests.
  6105. 855.50 s [vector] postscanr': OK
  6106. 855.50 s [vector] +++ OK, passed 100 tests.
  6107. 855.50 s [vector] scanr: OK
  6108. 855.50 s [vector] +++ OK, passed 100 tests.
  6109. 855.50 s [vector] scanr': OK
  6110. 855.50 s [vector] +++ OK, passed 100 tests.
  6111. 855.51 s [vector] scanr1: OK
  6112. 855.51 s [vector] +++ OK, passed 100 tests.
  6113. 855.51 s [vector] scanr1': OK
  6114. 855.51 s [vector] +++ OK, passed 100 tests.
  6115. 855.51 s [vector] iscanr: OK
  6116. 855.51 s [vector] +++ OK, passed 100 tests.
  6117. 855.52 s [vector] iscanr': OK
  6118. 855.52 s [vector] +++ OK, passed 100 tests.
  6119. 855.52 s [vector] mut_read: OK
  6120. 855.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6121. 855.52 s [vector] mut_write: OK
  6122. 855.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6123. 855.52 s [vector] mut_modify: OK
  6124. 855.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6125. 855.52 s [vector] mut_generate: OK
  6126. 855.52 s [vector] +++ OK, passed 100 tests.
  6127. 855.54 s [vector] mut_generateM: OK
  6128. 855.54 s [vector] +++ OK, passed 100 tests.
  6129. 855.55 s [vector] mut_mapM_: OK (0.02s)
  6130. 855.55 s [vector] +++ OK, passed 100 tests.
  6131. 855.57 s [vector] mut_imapM_: OK (0.02s)
  6132. 855.57 s [vector] +++ OK, passed 100 tests.
  6133. 855.60 s [vector] mut_forM_: OK (0.02s)
  6134. 855.60 s [vector] +++ OK, passed 100 tests.
  6135. 855.60 s [vector] mut_iforM_: OK (0.02s)
  6136. 855.60 s [vector] +++ OK, passed 100 tests.
  6137. 855.61 s [vector] mut_foldr: OK
  6138. 855.61 s [vector] +++ OK, passed 100 tests.
  6139. 855.61 s [vector] mut_foldr': OK
  6140. 855.61 s [vector] +++ OK, passed 100 tests.
  6141. 855.61 s [vector] mut_foldl: OK
  6142. 855.61 s [vector] +++ OK, passed 100 tests.
  6143. 855.61 s [vector] mut_foldl': OK
  6144. 855.61 s [vector] +++ OK, passed 100 tests.
  6145. 855.61 s [vector] mut_ifoldr: OK
  6146. 855.61 s [vector] +++ OK, passed 100 tests.
  6147. 855.62 s [vector] mut_ifoldr': OK
  6148. 855.62 s [vector] +++ OK, passed 100 tests.
  6149. 855.62 s [vector] mut_ifoldl: OK
  6150. 855.63 s [vector] +++ OK, passed 100 tests.
  6151. 855.63 s [vector] mut_ifoldl': OK
  6152. 855.63 s [vector] +++ OK, passed 100 tests.
  6153. 855.63 s [vector] mut_foldM: OK
  6154. 855.63 s [vector] +++ OK, passed 100 tests.
  6155. 855.63 s [vector] mut_foldM': OK
  6156. 855.63 s [vector] +++ OK, passed 100 tests.
  6157. 855.64 s [vector] mut_foldrM: OK
  6158. 855.64 s [vector] +++ OK, passed 100 tests.
  6159. 855.64 s [vector] mut_foldrM': OK
  6160. 855.64 s [vector] +++ OK, passed 100 tests.
  6161. 855.64 s [vector] mut_ifoldM: OK
  6162. 855.65 s [vector] +++ OK, passed 100 tests.
  6163. 855.65 s [vector] mut_ifoldM': OK
  6164. 855.65 s [vector] +++ OK, passed 100 tests.
  6165. 855.65 s [vector] mut_ifoldrM: OK
  6166. 855.65 s [vector] +++ OK, passed 100 tests.
  6167. 855.65 s [vector] mut_ifoldrM': OK
  6168. 855.65 s [vector] +++ OK, passed 100 tests.
  6169. 855.65 s [vector] compare: OK
  6170. 855.65 s [vector] +++ OK, passed 100 tests.
  6171. 855.65 s [vector] maximum: OK
  6172. 855.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6173. 855.65 s [vector] minimum: OK
  6174. 855.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6175. 855.65 s [vector] minIndex: OK
  6176. 855.66 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6177. 855.66 s [vector] maxIndex: OK
  6178. 855.66 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6179. 855.66 s [vector] maximumBy: OK
  6180. 855.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6181. 855.66 s [vector] minimumBy: OK
  6182. 855.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6183. 855.66 s [vector] maximumOn: OK
  6184. 855.66 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6185. 855.66 s [vector] minimumOn: OK
  6186. 855.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6187. 855.66 s [vector] maxIndexBy: OK
  6188. 855.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6189. 855.66 s [vector] minIndexBy: OK
  6190. 855.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6191. 855.66 s [vector] ListFirstMaxIndexWins: OK
  6192. 855.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6193. 855.66 s [vector] FalseListFirstMaxIndexWins: OK
  6194. 855.66 s [vector] +++ OK, failed as expected. (after 1 test):
  6195. 855.66 s [vector] Exception:
  6196. 855.66 s [vector] Prelude.foldr1: empty list
  6197. 855.66 s [vector] CallStack (from HasCallStack):
  6198. 855.66 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  6199. 855.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  6200. 855.66 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6201. 855.66 s [vector] []
  6202. 855.66 s [vector] mempty: OK
  6203. 855.66 s [vector] +++ OK, passed 1 test.
  6204. 855.68 s [vector] mappend: OK
  6205. 855.68 s [vector] +++ OK, passed 100 tests.
  6206. 855.68 s [vector] mconcat: OK (0.02s)
  6207. 855.68 s [vector] +++ OK, passed 100 tests.
  6208. 855.68 s [vector] glength: OK
  6209. 855.68 s [vector] +++ OK, passed 100 tests.
  6210. 855.68 s [vector] sum: OK
  6211. 855.68 s [vector] +++ OK, passed 100 tests.
  6212. 855.68 s [vector] product: OK
  6213. 855.68 s [vector] +++ OK, passed 100 tests.
  6214. 855.68 s [vector] enumFromN: OK
  6215. 855.68 s [vector] +++ OK, passed 100 tests.
  6216. 855.68 s [vector] enumFromThenN: OK
  6217. 855.68 s [vector] +++ OK, passed 100 tests.
  6218. 855.69 s [vector] enumFromTo: OK
  6219. 855.69 s [vector] +++ OK, passed 100 tests.
  6220. 855.69 s [vector] enumFromThenTo: OK
  6221. 855.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6222. 855.69 s [vector] Double
  6223. 855.69 s [vector] fromList.toList == id: OK
  6224. 855.69 s [vector] +++ OK, passed 100 tests.
  6225. 855.69 s [vector] toList.fromList == id: OK
  6226. 855.69 s [vector] +++ OK, passed 100 tests.
  6227. 855.69 s [vector] unstream.stream == id: OK
  6228. 855.69 s [vector] +++ OK, passed 100 tests.
  6229. 855.69 s [vector] stream.unstream == id: OK
  6230. 855.69 s [vector] +++ OK, passed 100 tests.
  6231. 855.69 s [vector] eq: OK
  6232. 855.69 s [vector] +++ OK, passed 100 tests.
  6233. 855.69 s [vector] length: OK
  6234. 855.69 s [vector] +++ OK, passed 100 tests.
  6235. 855.69 s [vector] null: OK
  6236. 855.69 s [vector] +++ OK, passed 100 tests.
  6237. 855.69 s [vector] index: OK
  6238. 855.69 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6239. 855.69 s [vector] safeIndex: OK
  6240. 855.69 s [vector] +++ OK, passed 100 tests.
  6241. 855.69 s [vector] head: OK
  6242. 855.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6243. 855.69 s [vector] last: OK
  6244. 855.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6245. 855.69 s [vector] unsafeIndex: OK
  6246. 855.69 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6247. 855.69 s [vector] unsafeHead: OK
  6248. 855.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6249. 855.69 s [vector] unsafeLast: OK
  6250. 855.69 s [vector] +++ OK, passed 100 tests; 25 discarded.
  6251. 855.69 s [vector] slice: OK
  6252. 855.69 s [vector] +++ OK, passed 100 tests.
  6253. 855.70 s [vector] init: OK
  6254. 855.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6255. 855.70 s [vector] tail: OK
  6256. 855.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6257. 855.70 s [vector] take: OK
  6258. 855.70 s [vector] +++ OK, passed 100 tests.
  6259. 855.70 s [vector] drop: OK
  6260. 855.70 s [vector] +++ OK, passed 100 tests.
  6261. 855.70 s [vector] splitAt: OK
  6262. 855.70 s [vector] +++ OK, passed 100 tests.
  6263. 855.70 s [vector] empty: OK
  6264. 855.70 s [vector] +++ OK, passed 1 test.
  6265. 855.70 s [vector] singleton: OK
  6266. 855.70 s [vector] +++ OK, passed 100 tests.
  6267. 855.70 s [vector] replicate: OK
  6268. 855.70 s [vector] +++ OK, passed 100 tests.
  6269. 855.70 s [vector] generate: OK
  6270. 855.70 s [vector] +++ OK, passed 100 tests.
  6271. 855.70 s [vector] iterateN: OK
  6272. 855.72 s [vector] +++ OK, passed 100 tests.
  6273. 855.76 s [vector] iterateNM: OK (0.04s)
  6274. 855.76 s [vector] +++ OK, passed 100 tests.
  6275. 855.77 s [vector] generateM: OK (0.02s)
  6276. 855.77 s [vector] +++ OK, passed 100 tests.
  6277. 855.77 s [vector] replicateM: OK
  6278. 855.77 s [vector] +++ OK, passed 100 tests.
  6279. 855.77 s [vector] create: OK
  6280. 855.77 s [vector] +++ OK, passed 100 tests.
  6281. 855.77 s [vector] createT: OK
  6282. 855.77 s [vector] +++ OK, passed 100 tests.
  6283. 855.77 s [vector] unfoldr: OK
  6284. 855.77 s [vector] +++ OK, passed 100 tests.
  6285. 855.77 s [vector] unfoldrN: OK
  6286. 855.77 s [vector] +++ OK, passed 100 tests.
  6287. 855.78 s [vector] unfoldrExactN: OK
  6288. 855.78 s [vector] +++ OK, passed 100 tests.
  6289. 855.78 s [vector] unfoldrM: OK
  6290. 855.78 s [vector] +++ OK, passed 100 tests.
  6291. 855.80 s [vector] unfoldrNM: OK
  6292. 855.80 s [vector] +++ OK, passed 100 tests.
  6293. 855.82 s [vector] unfoldrExactNM: OK (0.02s)
  6294. 855.82 s [vector] +++ OK, passed 100 tests.
  6295. 855.83 s [vector] constructN: OK (0.02s)
  6296. 855.83 s [vector] +++ OK, passed 100 tests.
  6297. 855.83 s [vector] constructrN: OK (0.02s)
  6298. 855.83 s [vector] +++ OK, passed 100 tests.
  6299. 855.83 s [vector] cons: OK
  6300. 855.83 s [vector] +++ OK, passed 100 tests.
  6301. 855.83 s [vector] snoc: OK
  6302. 855.83 s [vector] +++ OK, passed 100 tests.
  6303. 855.85 s [vector] append: OK
  6304. 855.85 s [vector] +++ OK, passed 100 tests.
  6305. 855.86 s [vector] concat: OK (0.02s)
  6306. 855.86 s [vector] +++ OK, passed 100 tests.
  6307. 855.86 s [vector] force: OK
  6308. 855.86 s [vector] +++ OK, passed 100 tests.
  6309. 855.86 s [vector] upd: OK
  6310. 855.87 s [vector] +++ OK, passed 100 tests.
  6311. 855.88 s [vector] accum: OK (0.02s)
  6312. 855.88 s [vector] +++ OK, passed 100 tests.
  6313. 855.88 s [vector] reverse: OK
  6314. 855.88 s [vector] +++ OK, passed 100 tests.
  6315. 855.88 s [vector] backpermute: OK
  6316. 855.88 s [vector] +++ OK, passed 100 tests.
  6317. 855.89 s [vector] map: OK
  6318. 855.89 s [vector] +++ OK, passed 100 tests.
  6319. 855.89 s [vector] imap: OK
  6320. 855.89 s [vector] +++ OK, passed 100 tests.
  6321. 855.90 s [vector] concatMap: OK
  6322. 855.91 s [vector] +++ OK, passed 100 tests.
  6323. 855.91 s [vector] mapM: OK
  6324. 855.91 s [vector] +++ OK, passed 100 tests.
  6325. 855.95 s [vector] mapM_: OK (0.04s)
  6326. 855.95 s [vector] +++ OK, passed 100 tests.
  6327. 855.98 s [vector] forM: OK
  6328. 855.98 s [vector] +++ OK, passed 100 tests.
  6329. 855.99 s [vector] forM_: OK (0.04s)
  6330. 855.99 s [vector] +++ OK, passed 100 tests.
  6331. 856.00 s [vector] imapM: OK
  6332. 856.01 s [vector] +++ OK, passed 100 tests.
  6333. 856.06 s [vector] imapM_: OK (0.04s)
  6334. 856.06 s [vector] +++ OK, passed 100 tests.
  6335. 856.06 s [vector] zipWith: OK (0.01s)
  6336. 856.06 s [vector] +++ OK, passed 100 tests.
  6337. 856.07 s [smallcheck] [4 of 6] Compiling Test.SmallCheck.Property ( Test/SmallCheck/Property.hs, dist/build/Test/SmallCheck/Property.p_o )
  6338. 856.08 s [vector] zipWith3: OK (0.01s)
  6339. 856.08 s [vector] +++ OK, passed 100 tests.
  6340. 856.09 s [vector] izipWith: OK (0.01s)
  6341. 856.09 s [vector] +++ OK, passed 100 tests.
  6342. 856.09 s [vector] izipWith3: OK (0.01s)
  6343. 856.09 s [vector] +++ OK, passed 100 tests.
  6344. 856.11 s [vector] izipWithM: OK
  6345. 856.11 s [vector] +++ OK, passed 100 tests.
  6346. 856.15 s [vector] izipWithM_: OK (0.04s)
  6347. 856.15 s [vector] +++ OK, passed 100 tests.
  6348. 856.15 s [vector] zipWithM: OK (0.01s)
  6349. 856.15 s [vector] +++ OK, passed 100 tests.
  6350. 856.18 s [vector] zipWithM_: OK (0.03s)
  6351. 856.18 s [vector] +++ OK, passed 100 tests.
  6352. 856.19 s [vector] filter: OK
  6353. 856.19 s [vector] +++ OK, passed 100 tests.
  6354. 856.19 s [vector] ifilter: OK
  6355. 856.19 s [vector] +++ OK, passed 100 tests.
  6356. 856.24 s [vector] filterM: OK (0.05s)
  6357. 856.24 s [vector] +++ OK, passed 100 tests.
  6358. 856.24 s [vector] uniq: OK
  6359. 856.24 s [vector] +++ OK, passed 100 tests.
  6360. 856.25 s [vector] mapMaybe: OK
  6361. 856.25 s [vector] +++ OK, passed 100 tests.
  6362. 856.26 s [vector] imapMaybe: OK
  6363. 856.26 s [vector] +++ OK, passed 100 tests.
  6364. 856.27 s [vector] takeWhile: OK
  6365. 856.27 s [vector] +++ OK, passed 100 tests.
  6366. 856.27 s [vector] dropWhile: OK
  6367. 856.27 s [vector] +++ OK, passed 100 tests.
  6368. 856.27 s [vector] partition: OK
  6369. 856.28 s [vector] +++ OK, passed 100 tests.
  6370. 856.28 s [vector] partitionWith: OK
  6371. 856.29 s [vector] +++ OK, passed 100 tests.
  6372. 856.29 s [vector] span: OK
  6373. 856.29 s [vector] +++ OK, passed 100 tests.
  6374. 856.29 s [vector] break: OK
  6375. 856.29 s [vector] +++ OK, passed 100 tests.
  6376. 856.29 s [vector] spanR: OK
  6377. 856.29 s [vector] +++ OK, passed 100 tests.
  6378. 856.29 s [vector] breakR: OK
  6379. 856.29 s [vector] +++ OK, passed 100 tests.
  6380. 856.30 s [hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  6381. 856.30 s [vector] groupBy: OK (0.01s)
  6382. 856.30 s [vector] +++ OK, passed 100 tests.
  6383. 856.30 s [vector] elem: OK
  6384. 856.30 s [vector] +++ OK, passed 100 tests.
  6385. 856.30 s [vector] notElem: OK
  6386. 856.30 s [vector] +++ OK, passed 100 tests.
  6387. 856.30 s [vector] find: OK
  6388. 856.31 s [vector] +++ OK, passed 100 tests.
  6389. 856.31 s [vector] findIndex: OK
  6390. 856.31 s [vector] +++ OK, passed 100 tests.
  6391. 856.31 s [vector] findIndexR: OK
  6392. 856.31 s [vector] +++ OK, passed 100 tests.
  6393. 856.31 s [hedgehog] Phase: configurePhase
  6394. 856.31 s [vector] findIndices: OK
  6395. 856.31 s [vector] +++ OK, passed 100 tests.
  6396. 856.31 s [vector] elemIndex: OK
  6397. 856.31 s [vector] +++ OK, passed 100 tests.
  6398. 856.31 s [vector] elemIndices: OK
  6399. 856.32 s [hedgehog] configureFlags: --verbose --prefix=/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc/share/doc/hedgehog-1.5 --with-gcc=gcc --package-db=/build/tmp.L0yQxm88Rh/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  6400. 856.33 s [vector] +++ OK, passed 100 tests.
  6401. 856.33 s [hedgehog] Using Parsec parser
  6402. 856.33 s [hedgehog] Configuring hedgehog-1.5...
  6403. 856.34 s [vector] foldl: OK (0.02s)
  6404. 856.34 s [vector] +++ OK, passed 100 tests.
  6405. 856.35 s [vector] foldl1: OK (0.02s)
  6406. 856.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6407. 856.37 s [vector] foldl': OK (0.01s)
  6408. 856.37 s [vector] +++ OK, passed 100 tests.
  6409. 856.39 s [vector] foldl1': OK (0.02s)
  6410. 856.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6411. 856.39 s [vector] foldr: OK (0.02s)
  6412. 856.39 s [vector] +++ OK, passed 100 tests.
  6413. 856.41 s [vector] foldr1: OK (0.01s)
  6414. 856.41 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6415. 856.43 s [vector] foldr': OK (0.02s)
  6416. 856.43 s [vector] +++ OK, passed 100 tests.
  6417. 856.45 s [vector] foldr1': OK (0.02s)
  6418. 856.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6419. 856.47 s [vector] ifoldl: OK (0.02s)
  6420. 856.47 s [vector] +++ OK, passed 100 tests.
  6421. 856.47 s [vector] ifoldl': OK (0.01s)
  6422. 856.47 s [vector] +++ OK, passed 100 tests.
  6423. 856.49 s [vector] ifoldr: OK (0.02s)
  6424. 856.49 s [vector] +++ OK, passed 100 tests.
  6425. 856.52 s [vector] ifoldr': OK (0.02s)
  6426. 856.52 s [vector] +++ OK, passed 100 tests.
  6427. 856.53 s [vector] ifoldM: OK (0.03s)
  6428. 856.53 s [vector] +++ OK, passed 100 tests.
  6429. 856.55 s [vector] ifoldM': OK (0.02s)
  6430. 856.55 s [vector] +++ OK, passed 100 tests.
  6431. 856.59 s [vector] ifoldM_: OK (0.04s)
  6432. 856.59 s [vector] +++ OK, passed 100 tests.
  6433. 856.63 s [vector] ifoldM'_: OK (0.04s)
  6434. 856.63 s [vector] +++ OK, passed 100 tests.
  6435. 856.63 s [vector] all: OK
  6436. 856.63 s [vector] +++ OK, passed 100 tests.
  6437. 856.63 s [vector] any: OK
  6438. 856.63 s [vector] +++ OK, passed 100 tests.
  6439. 856.63 s [smallcheck] [5 of 6] Compiling Test.SmallCheck.Drivers ( Test/SmallCheck/Drivers.hs, dist/build/Test/SmallCheck/Drivers.p_o )
  6440. 856.65 s [vector] prescanl: OK (0.02s)
  6441. 856.65 s [vector] +++ OK, passed 100 tests.
  6442. 856.67 s [vector] prescanl': OK (0.01s)
  6443. 856.67 s [vector] +++ OK, passed 100 tests.
  6444. 856.69 s [vector] postscanl: OK (0.02s)
  6445. 856.69 s [vector] +++ OK, passed 100 tests.
  6446. 856.71 s [vector] postscanl': OK (0.02s)
  6447. 856.71 s [vector] +++ OK, passed 100 tests.
  6448. 856.73 s [vector] scanl: OK (0.02s)
  6449. 856.73 s [vector] +++ OK, passed 100 tests.
  6450. 856.78 s [vector] scanl': OK (0.02s)
  6451. 856.78 s [vector] +++ OK, passed 100 tests.
  6452. 856.78 s [vector] scanl1: OK (0.02s)
  6453. 856.78 s [vector] +++ OK, passed 100 tests.
  6454. 856.78 s [vector] scanl1': OK (0.02s)
  6455. 856.78 s [vector] +++ OK, passed 100 tests.
  6456. 856.80 s [vector] iscanl: OK (0.02s)
  6457. 856.80 s [vector] +++ OK, passed 100 tests.
  6458. 856.82 s [vector] iscanl': OK (0.02s)
  6459. 856.82 s [vector] +++ OK, passed 100 tests.
  6460. 856.84 s [vector] prescanr: OK (0.02s)
  6461. 856.84 s [vector] +++ OK, passed 100 tests.
  6462. 856.85 s [vector] prescanr': OK (0.02s)
  6463. 856.85 s [vector] +++ OK, passed 100 tests.
  6464. 856.87 s [smallcheck] [6 of 6] Compiling Test.SmallCheck ( Test/SmallCheck.hs, dist/build/Test/SmallCheck.p_o )
  6465. 856.87 s [vector] postscanr: OK (0.02s)
  6466. 856.87 s [vector] +++ OK, passed 100 tests.
  6467. 856.87 s [vector] postscanr': OK (0.01s)
  6468. 856.87 s [vector] +++ OK, passed 100 tests.
  6469. 856.89 s [vector] scanr: OK (0.02s)
  6470. 856.89 s [vector] +++ OK, passed 100 tests.
  6471. 856.89 s [hedgehog] Dependency ansi-terminal >=0.6 && <1.2: using ansi-terminal-1.1.2
  6472. 856.89 s [hedgehog] Dependency async >=2.0 && <2.3: using async-2.2.5
  6473. 856.89 s [hedgehog] Dependency barbies >=1.0 && <2.2: using barbies-2.1.1.0
  6474. 856.89 s [hedgehog] Dependency base >=4.9 && <5: using base-4.19.0.0
  6475. 856.89 s [hedgehog] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.0.2
  6476. 856.89 s [hedgehog] Dependency concurrent-output >=1.7 && <1.11: using concurrent-output-1.10.21
  6477. 856.89 s [hedgehog] Dependency containers >=0.4 && <0.9: using containers-0.6.8
  6478. 856.89 s [hedgehog] Dependency deepseq >=1.1.0.0 && <1.6: using deepseq-1.5.0.0
  6479. 856.89 s [hedgehog] Dependency directory >=1.2 && <1.4: using directory-1.3.8.1
  6480. 856.89 s [hedgehog] Dependency erf >=2.0 && <2.1: using erf-2.0.0.0
  6481. 856.89 s [hedgehog] Dependency exceptions >=0.7 && <0.11: using exceptions-0.10.7
  6482. 856.89 s [hedgehog] Dependency lifted-async >=0.7 && <0.11: using lifted-async-0.10.2.7
  6483. 856.89 s [hedgehog] Dependency mmorph >=1.0 && <1.3: using mmorph-1.2.0
  6484. 856.89 s [hedgehog] Dependency monad-control >=1.0 && <1.1: using monad-control-1.0.3.1
  6485. 856.89 s [hedgehog] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  6486. 856.89 s [hedgehog] Dependency pretty-show >=1.6 && <1.11: using pretty-show-1.10
  6487. 856.89 s [hedgehog] Dependency primitive >=0.6 && <0.10: using primitive-0.9.1.0
  6488. 856.89 s [hedgehog] Dependency random >=1.1 && <1.4: using random-1.2.1.3
  6489. 856.89 s [hedgehog] Dependency resourcet >=1.1 && <1.4: using resourcet-1.3.0
  6490. 856.89 s [hedgehog] Dependency safe-exceptions >=0.1 && <0.2: using safe-exceptions-0.1.7.4
  6491. 856.89 s [hedgehog] Dependency stm >=2.4 && <2.6: using stm-2.5.2.1
  6492. 856.89 s [hedgehog] Dependency template-haskell >=2.10 && <2.24: using template-haskell-2.21.0.0
  6493. 856.89 s [hedgehog] Dependency text >=1.1 && <2.2: using text-2.1
  6494. 856.89 s [hedgehog] Dependency time >=1.4 && <1.15: using time-1.12.2
  6495. 856.89 s [hedgehog] Dependency transformers >=0.5 && <0.7: using transformers-0.6.1.0
  6496. 856.89 s [hedgehog] Dependency transformers-base >=0.4.5.1 && <0.5: using transformers-base-0.4.6
  6497. 856.89 s [hedgehog] Dependency wl-pprint-annotated >=0.0 && <0.2: using
  6498. 856.89 s [hedgehog] wl-pprint-annotated-0.1.0.1
  6499. 856.89 s [hedgehog] Dependency base >=3 && <5: using base-4.19.0.0
  6500. 856.89 s [hedgehog] Dependency containers >=0.4 && <0.9: using containers-0.6.8
  6501. 856.89 s [hedgehog] Dependency hedgehog: using hedgehog-1.5
  6502. 856.89 s [hedgehog] Dependency mmorph >=1.0 && <1.3: using mmorph-1.2.0
  6503. 856.89 s [hedgehog] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  6504. 856.89 s [hedgehog] Dependency pretty-show >=1.6 && <1.11: using pretty-show-1.10
  6505. 856.89 s [hedgehog] Dependency text >=1.1 && <2.2: using text-2.1
  6506. 856.89 s [hedgehog] Dependency transformers >=0.3 && <0.7: using transformers-0.6.1.0
  6507. 856.91 s [vector] scanr': OK (0.01s)
  6508. 856.91 s [vector] +++ OK, passed 100 tests.
  6509. 856.93 s [vector] scanr1: OK (0.01s)
  6510. 856.93 s [vector] +++ OK, passed 100 tests.
  6511. 856.93 s [vector] scanr1': OK (0.01s)
  6512. 856.93 s [vector] +++ OK, passed 100 tests.
  6513. 856.96 s [vector] iscanr: OK (0.01s)
  6514. 856.96 s [vector] +++ OK, passed 100 tests.
  6515. 856.96 s [vector] iscanr': OK (0.01s)
  6516. 856.96 s [vector] +++ OK, passed 100 tests.
  6517. 856.96 s [vector] mut_read: OK
  6518. 856.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6519. 856.96 s [vector] mut_write: OK
  6520. 856.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6521. 856.96 s [vector] mut_modify: OK
  6522. 856.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6523. 856.97 s [vector] mut_generate: OK
  6524. 856.97 s [vector] +++ OK, passed 100 tests.
  6525. 856.99 s [vector] mut_generateM: OK (0.01s)
  6526. 856.99 s [vector] +++ OK, passed 100 tests.
  6527. 857.01 s [vector] mut_mapM_: OK (0.03s)
  6528. 857.01 s [vector] +++ OK, passed 100 tests.
  6529. 857.05 s [vector] mut_imapM_: OK (0.04s)
  6530. 857.05 s [vector] +++ OK, passed 100 tests.
  6531. 857.09 s [vector] mut_forM_: OK (0.03s)
  6532. 857.09 s [vector] +++ OK, passed 100 tests.
  6533. 857.12 s [vector] mut_iforM_: OK (0.03s)
  6534. 857.12 s [vector] +++ OK, passed 100 tests.
  6535. 857.13 s [vector] mut_foldr: OK (0.01s)
  6536. 857.13 s [vector] +++ OK, passed 100 tests.
  6537. 857.15 s [vector] mut_foldr': OK (0.01s)
  6538. 857.15 s [vector] +++ OK, passed 100 tests.
  6539. 857.15 s [vector] mut_foldl: OK (0.02s)
  6540. 857.15 s [vector] +++ OK, passed 100 tests.
  6541. 857.18 s [vector] mut_foldl': OK (0.01s)
  6542. 857.18 s [vector] +++ OK, passed 100 tests.
  6543. 857.18 s [vector] mut_ifoldr: OK (0.01s)
  6544. 857.18 s [vector] +++ OK, passed 100 tests.
  6545. 857.20 s [vector] mut_ifoldr': OK
  6546. 857.21 s [vector] +++ OK, passed 100 tests.
  6547. 857.23 s [vector] mut_ifoldl: OK (0.02s)
  6548. 857.23 s [vector] +++ OK, passed 100 tests.
  6549. 857.23 s [vector] mut_ifoldl': OK (0.02s)
  6550. 857.23 s [vector] +++ OK, passed 100 tests.
  6551. 857.25 s [vector] mut_foldM: OK (0.01s)
  6552. 857.25 s [vector] +++ OK, passed 100 tests.
  6553. 857.27 s [hedgehog] Source component graph:
  6554. 857.27 s [hedgehog] component lib
  6555. 857.27 s [hedgehog] component test:test dependency lib
  6556. 857.27 s [hedgehog] Configured component graph:
  6557. 857.27 s [hedgehog] component hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  6558. 857.27 s [hedgehog] include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
  6559. 857.27 s [hedgehog] include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
  6560. 857.27 s [hedgehog] include barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
  6561. 857.27 s [hedgehog] include base-4.19.0.0-b960
  6562. 857.27 s [hedgehog] include bytestring-0.12.0.2-4690
  6563. 857.27 s [hedgehog] include concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
  6564. 857.27 s [hedgehog] include containers-0.6.8-4775
  6565. 857.27 s [hedgehog] include deepseq-1.5.0.0-412f
  6566. 857.27 s [hedgehog] include directory-1.3.8.1-6a8e
  6567. 857.27 s [hedgehog] include erf-2.0.0.0-BwyR9YGZlxuwpYm1ZK7E3
  6568. 857.27 s [hedgehog] include exceptions-0.10.7-d3e7
  6569. 857.27 s [hedgehog] include lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
  6570. 857.27 s [hedgehog] include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
  6571. 857.27 s [hedgehog] include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
  6572. 857.27 s [hedgehog] include mtl-2.3.1-63a4
  6573. 857.27 s [hedgehog] include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
  6574. 857.27 s [hedgehog] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  6575. 857.27 s [hedgehog] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  6576. 857.27 s [hedgehog] include resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
  6577. 857.27 s [hedgehog] include safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
  6578. 857.27 s [hedgehog] include stm-2.5.2.1-83fa
  6579. 857.27 s [hedgehog] include template-haskell-2.21.0.0-8831
  6580. 857.27 s [hedgehog] include text-2.1-c36a
  6581. 857.27 s [hedgehog] include time-1.12.2-d26d
  6582. 857.27 s [hedgehog] include transformers-0.6.1.0-c3ec
  6583. 857.27 s [hedgehog] include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
  6584. 857.27 s [hedgehog] include wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
  6585. 857.27 s [hedgehog] component hedgehog-1.5-9mlLd9RWgXOH2Dh5T2jzdt-test
  6586. 857.27 s [hedgehog] include base-4.19.0.0-b960
  6587. 857.27 s [hedgehog] include containers-0.6.8-4775
  6588. 857.27 s [hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  6589. 857.27 s [hedgehog] include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
  6590. 857.27 s [hedgehog] include mtl-2.3.1-63a4
  6591. 857.27 s [hedgehog] include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
  6592. 857.27 s [hedgehog] include text-2.1-c36a
  6593. 857.27 s [hedgehog] include transformers-0.6.1.0-c3ec
  6594. 857.27 s [hedgehog] Linked component graph:
  6595. 857.27 s [hedgehog] unit hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  6596. 857.27 s [hedgehog] include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
  6597. 857.27 s [hedgehog] include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
  6598. 857.27 s [hedgehog] include barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
  6599. 857.27 s [hedgehog] include base-4.19.0.0-b960
  6600. 857.27 s [hedgehog] include bytestring-0.12.0.2-4690
  6601. 857.27 s [hedgehog] include concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
  6602. 857.27 s [hedgehog] include containers-0.6.8-4775
  6603. 857.27 s [hedgehog] include deepseq-1.5.0.0-412f
  6604. 857.27 s [hedgehog] include directory-1.3.8.1-6a8e
  6605. 857.27 s [hedgehog] include erf-2.0.0.0-BwyR9YGZlxuwpYm1ZK7E3
  6606. 857.27 s [hedgehog] include exceptions-0.10.7-d3e7
  6607. 857.27 s [hedgehog] include lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
  6608. 857.27 s [hedgehog] include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
  6609. 857.27 s [hedgehog] include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
  6610. 857.27 s [hedgehog] include mtl-2.3.1-63a4
  6611. 857.27 s [hedgehog] include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
  6612. 857.27 s [hedgehog] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  6613. 857.27 s [hedgehog] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  6614. 857.27 s [hedgehog] include resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
  6615. 857.27 s [hedgehog] include safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
  6616. 857.27 s [hedgehog] include stm-2.5.2.1-83fa
  6617. 857.27 s [hedgehog] include template-haskell-2.21.0.0-8831
  6618. 857.27 s [hedgehog] include text-2.1-c36a
  6619. 857.27 s [hedgehog] include time-1.12.2-d26d
  6620. 857.27 s [hedgehog] include transformers-0.6.1.0-c3ec
  6621. 857.27 s [hedgehog] include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
  6622. 857.27 s [hedgehog] include wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
  6623. 857.27 s [hedgehog] Hedgehog=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog,Hedgehog.Gen=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Gen,Hedgehog.Internal.Barbie=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Barbie,Hedgehog.Internal.Config=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Config,Hedgehog.Internal.Discovery=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Discovery,Hedgehog.Internal.Distributive=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Distributive,Hedgehog.Internal.Exception=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Exception,Hedgehog.Internal.Gen=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Gen,Hedgehog.Internal.HTraversable=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.HTraversable,Hedgehog.Internal.Opaque=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Opaque,Hedgehog.Internal.Prelude=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Prelude,Hedgehog.Internal.Property=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Property,Hedgehog.Internal.Queue=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Queue,Hedgehog.Internal.Range=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Range,Hedgehog.Internal.Region=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Region,Hedgehog.Internal.Report=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Report,Hedgehog.Internal.Runner=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Runner,Hedgehog.Internal.Seed=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Seed,Hedgehog.Internal.Show=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Show,Hedgehog.Internal.Shrink=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Shrink,Hedgehog.Internal.Source=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Source,Hedgehog.Internal.State=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.State,Hedgehog.Internal.TH=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.TH,Hedgehog.Internal.Tree=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Tree,Hedgehog.Internal.Tripping=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Tripping,Hedgehog.Main=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Main,Hedgehog.Range=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Range
  6624. 857.27 s [hedgehog] unit hedgehog-1.5-9mlLd9RWgXOH2Dh5T2jzdt-test
  6625. 857.27 s [hedgehog] include base-4.19.0.0-b960
  6626. 857.27 s [hedgehog] include containers-0.6.8-4775
  6627. 857.27 s [hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  6628. 857.27 s [hedgehog] include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
  6629. 857.27 s [hedgehog] include mtl-2.3.1-63a4
  6630. 857.27 s [hedgehog] include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
  6631. 857.27 s [hedgehog] include text-2.1-c36a
  6632. 857.27 s [hedgehog] include transformers-0.6.1.0-c3ec
  6633. 857.27 s [hedgehog] Ready component graph:
  6634. 857.27 s [hedgehog] definite hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  6635. 857.27 s [hedgehog] depends ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
  6636. 857.27 s [hedgehog] depends async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
  6637. 857.27 s [hedgehog] depends barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
  6638. 857.27 s [hedgehog] depends base-4.19.0.0-b960
  6639. 857.27 s [hedgehog] depends bytestring-0.12.0.2-4690
  6640. 857.27 s [hedgehog] depends concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
  6641. 857.27 s [hedgehog] depends containers-0.6.8-4775
  6642. 857.27 s [hedgehog] depends deepseq-1.5.0.0-412f
  6643. 857.27 s [hedgehog] depends directory-1.3.8.1-6a8e
  6644. 857.27 s [hedgehog] depends erf-2.0.0.0-BwyR9YGZlxuwpYm1ZK7E3
  6645. 857.27 s [hedgehog] depends exceptions-0.10.7-d3e7
  6646. 857.27 s [hedgehog] depends lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
  6647. 857.27 s [hedgehog] depends mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
  6648. 857.27 s [hedgehog] depends monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
  6649. 857.27 s [hedgehog] depends mtl-2.3.1-63a4
  6650. 857.27 s [hedgehog] depends pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
  6651. 857.27 s [hedgehog] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  6652. 857.27 s [hedgehog] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  6653. 857.27 s [hedgehog] depends resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
  6654. 857.27 s [hedgehog] depends safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
  6655. 857.27 s [hedgehog] depends stm-2.5.2.1-83fa
  6656. 857.27 s [hedgehog] depends template-haskell-2.21.0.0-8831
  6657. 857.27 s [hedgehog] depends text-2.1-c36a
  6658. 857.27 s [hedgehog] depends time-1.12.2-d26d
  6659. 857.27 s [hedgehog] depends transformers-0.6.1.0-c3ec
  6660. 857.27 s [hedgehog] depends transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
  6661. 857.27 s [hedgehog] depends wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
  6662. 857.27 s [hedgehog] definite hedgehog-1.5-9mlLd9RWgXOH2Dh5T2jzdt-test
  6663. 857.27 s [hedgehog] depends base-4.19.0.0-b960
  6664. 857.27 s [hedgehog] depends containers-0.6.8-4775
  6665. 857.27 s [hedgehog] depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  6666. 857.27 s [hedgehog] depends mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
  6667. 857.27 s [hedgehog] depends mtl-2.3.1-63a4
  6668. 857.27 s [hedgehog] depends pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
  6669. 857.27 s [hedgehog] depends text-2.1-c36a
  6670. 857.27 s [hedgehog] depends transformers-0.6.1.0-c3ec
  6671. 857.27 s [hedgehog] Using Cabal-3.10.2.0 compiled by ghc-9.8
  6672. 857.27 s [hedgehog] Using compiler: ghc-9.8.1
  6673. 857.27 s [hedgehog] Using install prefix: /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
  6674. 857.27 s [hedgehog] Executables installed in:
  6675. 857.27 s [hedgehog] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/bin
  6676. 857.28 s [hedgehog] Libraries installed in:
  6677. 857.28 s [hedgehog] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  6678. 857.28 s [hedgehog] Dynamic Libraries installed in:
  6679. 857.28 s [hedgehog] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  6680. 857.28 s [vector] mut_foldM': OK (0.01s)
  6681. 857.28 s [vector] +++ OK, passed 100 tests.
  6682. 857.29 s [vector] mut_foldrM: OK (0.02s)
  6683. 857.29 s [vector] +++ OK, passed 100 tests.
  6684. 857.29 s [vector] mut_foldrM': OK (0.01s)
  6685. 857.29 s [vector] +++ OK, passed 100 tests.
  6686. 857.30 s [hedgehog] Private executables installed in:
  6687. 857.30 s [hedgehog] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/libexec/x86_64-linux-ghc-9.8.1/hedgehog-1.5
  6688. 857.30 s [hedgehog] Data files installed in:
  6689. 857.30 s [hedgehog] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/share/x86_64-linux-ghc-9.8.1/hedgehog-1.5
  6690. 857.30 s [hedgehog] Documentation installed in:
  6691. 857.30 s [hedgehog] /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc/share/doc/hedgehog-1.5
  6692. 857.30 s [hedgehog] Configuration files installed in:
  6693. 857.31 s [hedgehog] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/etc
  6694. 857.31 s [hedgehog] No alex found
  6695. 857.31 s [hedgehog] Using ar found on system at:
  6696. 857.31 s [hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  6697. 857.31 s [hedgehog] No c2hs found
  6698. 857.31 s [hedgehog] No cpphs found
  6699. 857.31 s [hedgehog] No doctest found
  6700. 857.31 s [hedgehog] Using gcc version 14.3.0 given by user at:
  6701. 857.31 s [hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  6702. 857.31 s [hedgehog] Using ghc version 9.8.1 found on system at:
  6703. 857.31 s [hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  6704. 857.31 s [hedgehog] Using ghc-pkg version 9.8.1 found on system at:
  6705. 857.31 s [hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  6706. 857.31 s [hedgehog] No ghcjs found
  6707. 857.31 s [hedgehog] No ghcjs-pkg found
  6708. 857.31 s [hedgehog] No greencard found
  6709. 857.31 s [hedgehog] Using haddock version 2.30.0 found on system at:
  6710. 857.31 s [hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  6711. 857.31 s [hedgehog] No happy found
  6712. 857.31 s [hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  6713. 857.31 s [hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  6714. 857.31 s [hedgehog] No hmake found
  6715. 857.31 s [hedgehog] Using hpc version 0.69 found on system at:
  6716. 857.31 s [hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  6717. 857.31 s [hedgehog] Using hsc2hs version 0.68.10 found on system at:
  6718. 857.31 s [hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  6719. 857.31 s [hedgehog] Using hscolour version 1.25 found on system at:
  6720. 857.31 s [hedgehog] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  6721. 857.31 s [hedgehog] No jhc found
  6722. 857.31 s [hedgehog] Using ld found on system at:
  6723. 857.31 s [hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  6724. 857.31 s [hedgehog] No pkg-config found
  6725. 857.31 s [hedgehog] Using runghc version 9.8.1 found on system at:
  6726. 857.31 s [hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  6727. 857.31 s [hedgehog] Using strip version 2.44 found on system at:
  6728. 857.31 s [hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  6729. 857.31 s [hedgehog] Using tar found on system at:
  6730. 857.31 s [hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  6731. 857.31 s [hedgehog] No uhc found
  6732. 857.31 s [vector] mut_ifoldM: OK (0.02s)
  6733. 857.31 s [vector] +++ OK, passed 100 tests.
  6734. 857.32 s [vector] mut_ifoldM': OK
  6735. 857.34 s [vector] +++ OK, passed 100 tests.
  6736. 857.34 s [vector] mut_ifoldrM: OK (0.01s)
  6737. 857.34 s [vector] +++ OK, passed 100 tests.
  6738. 857.35 s [vector] mut_ifoldrM': OK (0.02s)
  6739. 857.35 s [vector] +++ OK, passed 100 tests.
  6740. 857.35 s [vector] compare: OK
  6741. 857.35 s [vector] +++ OK, passed 100 tests.
  6742. 857.35 s [vector] maximum: OK
  6743. 857.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6744. 857.35 s [vector] minimum: OK
  6745. 857.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6746. 857.35 s [vector] minIndex: OK
  6747. 857.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6748. 857.35 s [vector] maxIndex: OK
  6749. 857.35 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6750. 857.35 s [vector] maximumBy: OK
  6751. 857.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6752. 857.36 s [vector] minimumBy: OK
  6753. 857.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6754. 857.36 s [vector] maximumOn: OK
  6755. 857.36 s [vector] +++ OK, passed 100 tests; 27 discarded.
  6756. 857.36 s [vector] minimumOn: OK
  6757. 857.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6758. 857.36 s [vector] maxIndexBy: OK
  6759. 857.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6760. 857.36 s [vector] minIndexBy: OK
  6761. 857.36 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6762. 857.36 s [vector] ListFirstMaxIndexWins: OK
  6763. 857.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6764. 857.36 s [vector] FalseListFirstMaxIndexWins: OK
  6765. 857.36 s [vector] +++ OK, failed as expected. (after 1 test):
  6766. 857.36 s [vector] Exception:
  6767. 857.36 s [vector] Prelude.foldr1: empty list
  6768. 857.36 s [vector] CallStack (from HasCallStack):
  6769. 857.36 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  6770. 857.36 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  6771. 857.36 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6772. 857.36 s [vector] []
  6773. 857.36 s [vector] mempty: OK
  6774. 857.36 s [vector] +++ OK, passed 1 test.
  6775. 857.36 s [vector] mappend: OK
  6776. 857.37 s [vector] +++ OK, passed 100 tests.
  6777. 857.39 s [vector] mconcat: OK (0.02s)
  6778. 857.39 s [vector] +++ OK, passed 100 tests.
  6779. 857.39 s [vector] glength: OK
  6780. 857.39 s [vector] +++ OK, passed 100 tests.
  6781. 857.39 s [vector] sum: OK
  6782. 857.39 s [vector] +++ OK, passed 100 tests.
  6783. 857.39 s [vector] product: OK
  6784. 857.39 s [vector] +++ OK, passed 100 tests.
  6785. 857.39 s [vector] enumFromN: OK
  6786. 857.39 s [vector] +++ OK, passed 100 tests.
  6787. 857.39 s [vector] enumFromThenN: OK
  6788. 857.39 s [vector] +++ OK, passed 100 tests.
  6789. 857.39 s [vector] enumFromTo: OK
  6790. 857.39 s [vector] +++ OK, passed 100 tests.
  6791. 857.39 s [vector] enumFromThenTo: OK
  6792. 857.39 s [vector] +++ OK, passed 100 tests; 1 discarded.
  6793. 857.39 s [vector] unstream
  6794. 857.39 s [vector] unstream == vunstream (exact): OK
  6795. 857.39 s [vector] +++ OK, passed 100 tests.
  6796. 857.39 s [vector] unstream == vunstream (unknown): OK
  6797. 857.39 s [vector] +++ OK, passed 100 tests.
  6798. 857.39 s [vector] unstreamR ~= vunstream (exact): OK
  6799. 857.39 s [vector] +++ OK, passed 100 tests.
  6800. 857.39 s [vector] unstreamR ~= vunstream (unknown): OK
  6801. 857.40 s [vector] +++ OK, passed 100 tests.
  6802. 857.40 s [vector] Tests.Vector.Storable
  6803. 857.40 s [vector] Data.Vector.Storable.Vector (Int)
  6804. 857.40 s [vector] fromList.toList == id: OK
  6805. 857.40 s [vector] +++ OK, passed 100 tests.
  6806. 857.40 s [vector] toList.fromList == id: OK
  6807. 857.40 s [vector] +++ OK, passed 100 tests.
  6808. 857.40 s [vector] unstream.stream == id: OK
  6809. 857.40 s [vector] +++ OK, passed 100 tests.
  6810. 857.40 s [vector] stream.unstream == id: OK
  6811. 857.40 s [vector] +++ OK, passed 100 tests.
  6812. 857.40 s [vector] eq: OK
  6813. 857.40 s [vector] +++ OK, passed 100 tests.
  6814. 857.40 s [vector] length: OK
  6815. 857.40 s [vector] +++ OK, passed 100 tests.
  6816. 857.40 s [vector] null: OK
  6817. 857.40 s [vector] +++ OK, passed 100 tests.
  6818. 857.40 s [vector] index: OK
  6819. 857.40 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6820. 857.40 s [vector] safeIndex: OK
  6821. 857.40 s [vector] +++ OK, passed 100 tests.
  6822. 857.40 s [vector] head: OK
  6823. 857.40 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6824. 857.40 s [vector] last: OK
  6825. 857.40 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6826. 857.40 s [vector] unsafeIndex: OK
  6827. 857.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6828. 857.40 s [vector] unsafeHead: OK
  6829. 857.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6830. 857.40 s [vector] unsafeLast: OK
  6831. 857.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6832. 857.40 s [vector] slice: OK
  6833. 857.40 s [vector] +++ OK, passed 100 tests.
  6834. 857.40 s [vector] init: OK
  6835. 857.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6836. 857.40 s [vector] tail: OK
  6837. 857.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6838. 857.41 s [vector] take: OK
  6839. 857.41 s [vector] +++ OK, passed 100 tests.
  6840. 857.41 s [vector] drop: OK
  6841. 857.41 s [vector] +++ OK, passed 100 tests.
  6842. 857.41 s [vector] splitAt: OK
  6843. 857.41 s [vector] +++ OK, passed 100 tests.
  6844. 857.41 s [vector] empty: OK
  6845. 857.41 s [vector] +++ OK, passed 1 test.
  6846. 857.41 s [vector] singleton: OK
  6847. 857.41 s [vector] +++ OK, passed 100 tests.
  6848. 857.41 s [vector] replicate: OK
  6849. 857.41 s [vector] +++ OK, passed 100 tests.
  6850. 857.41 s [vector] generate: OK
  6851. 857.41 s [vector] +++ OK, passed 100 tests.
  6852. 857.41 s [vector] iterateN: OK
  6853. 857.41 s [vector] +++ OK, passed 100 tests.
  6854. 857.43 s [vector] iterateNM: OK (0.01s)
  6855. 857.43 s [vector] +++ OK, passed 100 tests.
  6856. 857.45 s [vector] generateM: OK (0.02s)
  6857. 857.45 s [vector] +++ OK, passed 100 tests.
  6858. 857.45 s [vector] replicateM: OK
  6859. 857.45 s [vector] +++ OK, passed 100 tests.
  6860. 857.45 s [vector] create: OK
  6861. 857.46 s [vector] +++ OK, passed 100 tests.
  6862. 857.46 s [vector] createT: OK
  6863. 857.46 s [vector] +++ OK, passed 100 tests.
  6864. 857.46 s [vector] unfoldr: OK
  6865. 857.46 s [vector] +++ OK, passed 100 tests.
  6866. 857.46 s [vector] unfoldrN: OK
  6867. 857.46 s [vector] +++ OK, passed 100 tests.
  6868. 857.46 s [vector] unfoldrExactN: OK
  6869. 857.46 s [vector] +++ OK, passed 100 tests.
  6870. 857.46 s [vector] unfoldrM: OK
  6871. 857.46 s [vector] +++ OK, passed 100 tests.
  6872. 857.47 s [vector] unfoldrNM: OK
  6873. 857.47 s [vector] +++ OK, passed 100 tests.
  6874. 857.47 s [vector] unfoldrExactNM: OK
  6875. 857.48 s [vector] +++ OK, passed 100 tests.
  6876. 857.48 s [vector] constructN: OK
  6877. 857.48 s [vector] +++ OK, passed 100 tests.
  6878. 857.48 s [vector] constructrN: OK
  6879. 857.48 s [vector] +++ OK, passed 100 tests.
  6880. 857.48 s [vector] cons: OK
  6881. 857.48 s [vector] +++ OK, passed 100 tests.
  6882. 857.48 s [vector] snoc: OK
  6883. 857.48 s [vector] +++ OK, passed 100 tests.
  6884. 857.49 s [vector] append: OK
  6885. 857.49 s [vector] +++ OK, passed 100 tests.
  6886. 857.50 s [vector] concat: OK (0.02s)
  6887. 857.50 s [vector] +++ OK, passed 100 tests.
  6888. 857.50 s [vector] force: OK
  6889. 857.50 s [vector] +++ OK, passed 100 tests.
  6890. 857.50 s [vector] upd: OK
  6891. 857.51 s [vector] +++ OK, passed 100 tests.
  6892. 857.51 s [vector] accum: OK
  6893. 857.51 s [vector] +++ OK, passed 100 tests.
  6894. 857.51 s [vector] reverse: OK
  6895. 857.51 s [vector] +++ OK, passed 100 tests.
  6896. 857.51 s [vector] backpermute: OK
  6897. 857.51 s [vector] +++ OK, passed 100 tests.
  6898. 857.51 s [vector] map: OK
  6899. 857.51 s [vector] +++ OK, passed 100 tests.
  6900. 857.51 s [vector] imap: OK
  6901. 857.51 s [vector] +++ OK, passed 100 tests.
  6902. 857.52 s [vector] concatMap: OK
  6903. 857.52 s [vector] +++ OK, passed 100 tests.
  6904. 857.52 s [vector] mapM: OK
  6905. 857.53 s [vector] +++ OK, passed 100 tests.
  6906. 857.53 s [vector] mapM_: OK (0.02s)
  6907. 857.53 s [vector] +++ OK, passed 100 tests.
  6908. 857.55 s [vector] forM: OK
  6909. 857.55 s [vector] +++ OK, passed 100 tests.
  6910. 857.55 s [vector] forM_: OK (0.02s)
  6911. 857.55 s [vector] +++ OK, passed 100 tests.
  6912. 857.57 s [vector] imapM: OK
  6913. 857.57 s [vector] +++ OK, passed 100 tests.
  6914. 857.57 s [vector] imapM_: OK (0.01s)
  6915. 857.57 s [vector] +++ OK, passed 100 tests.
  6916. 857.57 s [vector] zipWith: OK
  6917. 857.58 s [vector] +++ OK, passed 100 tests.
  6918. 857.58 s [vector] zipWith3: OK
  6919. 857.58 s [vector] +++ OK, passed 100 tests.
  6920. 857.58 s [vector] izipWith: OK
  6921. 857.58 s [vector] +++ OK, passed 100 tests.
  6922. 857.58 s [vector] izipWith3: OK
  6923. 857.58 s [vector] +++ OK, passed 100 tests.
  6924. 857.59 s [hedgehog] Phase: buildPhase
  6925. 857.60 s [vector] izipWithM: OK
  6926. 857.60 s [vector] +++ OK, passed 100 tests.
  6927. 857.60 s [vector] izipWithM_: OK (0.01s)
  6928. 857.60 s [vector] +++ OK, passed 100 tests.
  6929. 857.61 s [vector] zipWithM: OK
  6930. 857.61 s [vector] +++ OK, passed 100 tests.
  6931. 857.61 s [vector] zipWithM_: OK (0.01s)
  6932. 857.61 s [vector] +++ OK, passed 100 tests.
  6933. 857.61 s [vector] filter: OK
  6934. 857.61 s [vector] +++ OK, passed 100 tests.
  6935. 857.61 s [vector] ifilter: OK
  6936. 857.61 s [vector] +++ OK, passed 100 tests.
  6937. 857.64 s [vector] filterM: OK (0.02s)
  6938. 857.64 s [vector] +++ OK, passed 100 tests.
  6939. 857.64 s [vector] uniq: OK
  6940. 857.65 s [vector] +++ OK, passed 100 tests.
  6941. 857.65 s [vector] mapMaybe: OK
  6942. 857.65 s [vector] +++ OK, passed 100 tests.
  6943. 857.65 s [vector] imapMaybe: OK
  6944. 857.65 s [vector] +++ OK, passed 100 tests.
  6945. 857.65 s [vector] takeWhile: OK
  6946. 857.65 s [vector] +++ OK, passed 100 tests.
  6947. 857.65 s [vector] dropWhile: OK
  6948. 857.65 s [vector] +++ OK, passed 100 tests.
  6949. 857.65 s [vector] partition: OK
  6950. 857.65 s [vector] +++ OK, passed 100 tests.
  6951. 857.65 s [vector] partitionWith: OK
  6952. 857.65 s [vector] +++ OK, passed 100 tests.
  6953. 857.65 s [vector] span: OK
  6954. 857.65 s [vector] +++ OK, passed 100 tests.
  6955. 857.65 s [vector] break: OK
  6956. 857.65 s [vector] +++ OK, passed 100 tests.
  6957. 857.65 s [vector] spanR: OK
  6958. 857.65 s [vector] +++ OK, passed 100 tests.
  6959. 857.65 s [vector] breakR: OK
  6960. 857.65 s [vector] +++ OK, passed 100 tests.
  6961. 857.65 s [vector] groupBy: OK
  6962. 857.65 s [vector] +++ OK, passed 100 tests.
  6963. 857.65 s [vector] elem: OK
  6964. 857.66 s [vector] +++ OK, passed 100 tests.
  6965. 857.66 s [vector] notElem: OK
  6966. 857.66 s [vector] +++ OK, passed 100 tests.
  6967. 857.66 s [vector] find: OK
  6968. 857.66 s [vector] +++ OK, passed 100 tests.
  6969. 857.66 s [vector] findIndex: OK
  6970. 857.66 s [vector] +++ OK, passed 100 tests.
  6971. 857.66 s [vector] findIndexR: OK
  6972. 857.66 s [vector] +++ OK, passed 100 tests.
  6973. 857.66 s [vector] findIndices: OK
  6974. 857.66 s [vector] +++ OK, passed 100 tests.
  6975. 857.66 s [vector] elemIndex: OK
  6976. 857.66 s [vector] +++ OK, passed 100 tests.
  6977. 857.66 s [vector] elemIndices: OK
  6978. 857.66 s [vector] +++ OK, passed 100 tests.
  6979. 857.66 s [vector] foldl: OK
  6980. 857.66 s [vector] +++ OK, passed 100 tests.
  6981. 857.66 s [vector] foldl1: OK
  6982. 857.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6983. 857.66 s [vector] foldl': OK
  6984. 857.67 s [vector] +++ OK, passed 100 tests.
  6985. 857.67 s [vector] foldl1': OK
  6986. 857.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6987. 857.67 s [vector] foldr: OK
  6988. 857.67 s [vector] +++ OK, passed 100 tests.
  6989. 857.67 s [vector] foldr1: OK
  6990. 857.67 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6991. 857.67 s [vector] foldr': OK
  6992. 857.68 s [vector] +++ OK, passed 100 tests.
  6993. 857.68 s [hedgehog] Preprocessing library for hedgehog-1.5..
  6994. 857.68 s [vector] foldr1': OK
  6995. 857.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6996. 857.68 s [vector] ifoldl: OK
  6997. 857.68 s [vector] +++ OK, passed 100 tests.
  6998. 857.69 s [vector] ifoldl': OK
  6999. 857.69 s [vector] +++ OK, passed 100 tests.
  7000. 857.69 s [hedgehog] Building library for hedgehog-1.5..
  7001. 857.69 s [vector] ifoldr: OK
  7002. 857.69 s [vector] +++ OK, passed 100 tests.
  7003. 857.69 s [vector] ifoldr': OK
  7004. 857.69 s [vector] +++ OK, passed 100 tests.
  7005. 857.69 s [vector] ifoldM: OK
  7006. 857.69 s [vector] +++ OK, passed 100 tests.
  7007. 857.71 s [vector] ifoldM': OK
  7008. 857.71 s [vector] +++ OK, passed 100 tests.
  7009. 857.71 s [vector] ifoldM_: OK (0.01s)
  7010. 857.71 s [vector] +++ OK, passed 100 tests.
  7011. 857.72 s [vector] ifoldM'_: OK (0.01s)
  7012. 857.72 s [vector] +++ OK, passed 100 tests.
  7013. 857.72 s [vector] all: OK
  7014. 857.72 s [vector] +++ OK, passed 100 tests.
  7015. 857.73 s [vector] any: OK
  7016. 857.73 s [vector] +++ OK, passed 100 tests.
  7017. 857.73 s [vector] prescanl: OK
  7018. 857.73 s [vector] +++ OK, passed 100 tests.
  7019. 857.73 s [vector] prescanl': OK
  7020. 857.74 s [vector] +++ OK, passed 100 tests.
  7021. 857.74 s [vector] postscanl: OK
  7022. 857.74 s [vector] +++ OK, passed 100 tests.
  7023. 857.74 s [vector] postscanl': OK
  7024. 857.74 s [vector] +++ OK, passed 100 tests.
  7025. 857.74 s [vector] scanl: OK
  7026. 857.74 s [vector] +++ OK, passed 100 tests.
  7027. 857.75 s [vector] scanl': OK
  7028. 857.75 s [vector] +++ OK, passed 100 tests.
  7029. 857.75 s [vector] scanl1: OK
  7030. 857.75 s [vector] +++ OK, passed 100 tests.
  7031. 857.75 s [vector] scanl1': OK
  7032. 857.75 s [vector] +++ OK, passed 100 tests.
  7033. 857.75 s [vector] iscanl: OK
  7034. 857.76 s [vector] +++ OK, passed 100 tests.
  7035. 857.76 s [vector] iscanl': OK
  7036. 857.76 s [vector] +++ OK, passed 100 tests.
  7037. 857.76 s [vector] prescanr: OK
  7038. 857.76 s [vector] +++ OK, passed 100 tests.
  7039. 857.76 s [vector] prescanr': OK
  7040. 857.76 s [vector] +++ OK, passed 100 tests.
  7041. 857.76 s [vector] postscanr: OK
  7042. 857.76 s [vector] +++ OK, passed 100 tests.
  7043. 857.77 s [vector] postscanr': OK
  7044. 857.77 s [vector] +++ OK, passed 100 tests.
  7045. 857.77 s [vector] scanr: OK
  7046. 857.77 s [vector] +++ OK, passed 100 tests.
  7047. 857.77 s [vector] scanr': OK
  7048. 857.77 s [vector] +++ OK, passed 100 tests.
  7049. 857.77 s [vector] scanr1: OK
  7050. 857.77 s [vector] +++ OK, passed 100 tests.
  7051. 857.78 s [vector] scanr1': OK
  7052. 857.78 s [vector] +++ OK, passed 100 tests.
  7053. 857.78 s [vector] iscanr: OK
  7054. 857.78 s [vector] +++ OK, passed 100 tests.
  7055. 857.78 s [vector] iscanr': OK
  7056. 857.78 s [vector] +++ OK, passed 100 tests.
  7057. 857.78 s [vector] mut_read: OK
  7058. 857.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7059. 857.78 s [vector] mut_write: OK
  7060. 857.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7061. 857.78 s [vector] mut_modify: OK
  7062. 857.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7063. 857.79 s [vector] mut_generate: OK
  7064. 857.79 s [vector] +++ OK, passed 100 tests.
  7065. 857.79 s [vector] mut_generateM: OK
  7066. 857.81 s [vector] +++ OK, passed 100 tests.
  7067. 857.81 s [vector] mut_mapM_: OK (0.01s)
  7068. 857.81 s [vector] +++ OK, passed 100 tests.
  7069. 857.83 s [vector] mut_imapM_: OK (0.01s)
  7070. 857.83 s [vector] +++ OK, passed 100 tests.
  7071. 857.85 s [vector] mut_forM_: OK (0.02s)
  7072. 857.85 s [vector] +++ OK, passed 100 tests.
  7073. 857.86 s [vector] mut_iforM_: OK (0.02s)
  7074. 857.86 s [vector] +++ OK, passed 100 tests.
  7075. 857.86 s [vector] mut_foldr: OK
  7076. 857.87 s [vector] +++ OK, passed 100 tests.
  7077. 857.87 s [vector] mut_foldr': OK
  7078. 857.87 s [vector] +++ OK, passed 100 tests.
  7079. 857.87 s [vector] mut_foldl: OK
  7080. 857.87 s [vector] +++ OK, passed 100 tests.
  7081. 857.87 s [vector] mut_foldl': OK
  7082. 857.87 s [vector] +++ OK, passed 100 tests.
  7083. 857.88 s [vector] mut_ifoldr: OK
  7084. 857.88 s [vector] +++ OK, passed 100 tests.
  7085. 857.88 s [vector] mut_ifoldr': OK
  7086. 857.88 s [vector] +++ OK, passed 100 tests.
  7087. 857.89 s [vector] mut_ifoldl: OK
  7088. 857.89 s [vector] +++ OK, passed 100 tests.
  7089. 857.89 s [vector] mut_ifoldl': OK
  7090. 857.89 s [vector] +++ OK, passed 100 tests.
  7091. 857.89 s [vector] mut_foldM: OK
  7092. 857.89 s [vector] +++ OK, passed 100 tests.
  7093. 857.89 s [vector] mut_foldM': OK
  7094. 857.89 s [vector] +++ OK, passed 100 tests.
  7095. 857.90 s [vector] mut_foldrM: OK
  7096. 857.90 s [vector] +++ OK, passed 100 tests.
  7097. 857.90 s [vector] mut_foldrM': OK
  7098. 857.90 s [vector] +++ OK, passed 100 tests.
  7099. 857.91 s [vector] mut_ifoldM: OK
  7100. 857.91 s [vector] +++ OK, passed 100 tests.
  7101. 857.91 s [vector] mut_ifoldM': OK
  7102. 857.91 s [vector] +++ OK, passed 100 tests.
  7103. 857.91 s [vector] mut_ifoldrM: OK
  7104. 857.91 s [vector] +++ OK, passed 100 tests.
  7105. 857.91 s [vector] mut_ifoldrM': OK
  7106. 857.91 s [vector] +++ OK, passed 100 tests.
  7107. 857.91 s [vector] compare: OK
  7108. 857.92 s [vector] +++ OK, passed 100 tests.
  7109. 857.92 s [vector] maximum: OK
  7110. 857.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7111. 857.92 s [vector] minimum: OK
  7112. 857.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7113. 857.92 s [vector] minIndex: OK
  7114. 857.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7115. 857.92 s [vector] maxIndex: OK
  7116. 857.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7117. 857.92 s [vector] maximumBy: OK
  7118. 857.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7119. 857.92 s [vector] minimumBy: OK
  7120. 857.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7121. 857.92 s [vector] maximumOn: OK
  7122. 857.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7123. 857.92 s [vector] minimumOn: OK
  7124. 857.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7125. 857.92 s [vector] maxIndexBy: OK
  7126. 857.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7127. 857.92 s [vector] minIndexBy: OK
  7128. 857.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7129. 857.92 s [vector] ListFirstMaxIndexWins: OK
  7130. 857.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7131. 857.92 s [vector] FalseListFirstMaxIndexWins: OK
  7132. 857.92 s [vector] +++ OK, failed as expected. (after 1 test):
  7133. 857.92 s [vector] Exception:
  7134. 857.92 s [vector] Prelude.foldr1: empty list
  7135. 857.92 s [vector] CallStack (from HasCallStack):
  7136. 857.92 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  7137. 857.92 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  7138. 857.92 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7139. 857.92 s [vector] []
  7140. 857.92 s [vector] mempty: OK
  7141. 857.92 s [vector] +++ OK, passed 1 test.
  7142. 857.92 s [vector] mappend: OK
  7143. 857.94 s [vector] +++ OK, passed 100 tests.
  7144. 857.94 s [vector] mconcat: OK (0.02s)
  7145. 857.94 s [vector] +++ OK, passed 100 tests.
  7146. 857.94 s [vector] glength: OK
  7147. 857.94 s [vector] +++ OK, passed 100 tests.
  7148. 857.94 s [vector] sum: OK
  7149. 857.94 s [vector] +++ OK, passed 100 tests.
  7150. 857.94 s [vector] product: OK
  7151. 857.94 s [vector] +++ OK, passed 100 tests.
  7152. 857.94 s [vector] enumFromN: OK
  7153. 857.94 s [vector] +++ OK, passed 100 tests.
  7154. 857.94 s [vector] enumFromThenN: OK
  7155. 857.94 s [vector] +++ OK, passed 100 tests.
  7156. 857.94 s [vector] enumFromTo: OK
  7157. 857.94 s [vector] +++ OK, passed 100 tests.
  7158. 857.94 s [vector] enumFromThenTo: OK
  7159. 857.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7160. 857.94 s [vector] Data.Vector.Storable.Vector (Double)
  7161. 857.94 s [vector] fromList.toList == id: OK
  7162. 857.94 s [vector] +++ OK, passed 100 tests.
  7163. 857.94 s [vector] toList.fromList == id: OK
  7164. 857.94 s [vector] +++ OK, passed 100 tests.
  7165. 857.94 s [vector] unstream.stream == id: OK
  7166. 857.94 s [vector] +++ OK, passed 100 tests.
  7167. 857.95 s [vector] stream.unstream == id: OK
  7168. 857.95 s [vector] +++ OK, passed 100 tests.
  7169. 857.95 s [vector] eq: OK
  7170. 857.95 s [vector] +++ OK, passed 100 tests.
  7171. 857.95 s [vector] length: OK
  7172. 857.95 s [vector] +++ OK, passed 100 tests.
  7173. 857.95 s [vector] null: OK
  7174. 857.95 s [vector] +++ OK, passed 100 tests.
  7175. 857.95 s [vector] index: OK
  7176. 857.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7177. 857.95 s [vector] safeIndex: OK
  7178. 857.95 s [vector] +++ OK, passed 100 tests.
  7179. 857.95 s [vector] head: OK
  7180. 857.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7181. 857.95 s [vector] last: OK
  7182. 857.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7183. 857.95 s [vector] unsafeIndex: OK
  7184. 857.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7185. 857.95 s [vector] unsafeHead: OK
  7186. 857.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7187. 857.95 s [vector] unsafeLast: OK
  7188. 857.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7189. 857.95 s [vector] slice: OK
  7190. 857.95 s [vector] +++ OK, passed 100 tests.
  7191. 857.95 s [vector] init: OK
  7192. 857.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7193. 857.95 s [vector] tail: OK
  7194. 857.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7195. 857.96 s [vector] take: OK
  7196. 857.96 s [vector] +++ OK, passed 100 tests.
  7197. 857.96 s [vector] drop: OK
  7198. 857.96 s [vector] +++ OK, passed 100 tests.
  7199. 857.96 s [vector] splitAt: OK
  7200. 857.96 s [vector] +++ OK, passed 100 tests.
  7201. 857.96 s [vector] empty: OK
  7202. 857.96 s [vector] +++ OK, passed 1 test.
  7203. 857.96 s [vector] singleton: OK
  7204. 857.96 s [vector] +++ OK, passed 100 tests.
  7205. 857.96 s [vector] replicate: OK
  7206. 857.96 s [vector] +++ OK, passed 100 tests.
  7207. 857.96 s [vector] generate: OK
  7208. 857.96 s [vector] +++ OK, passed 100 tests.
  7209. 857.96 s [vector] iterateN: OK
  7210. 857.97 s [vector] +++ OK, passed 100 tests.
  7211. 857.99 s [vector] iterateNM: OK (0.02s)
  7212. 857.99 s [vector] +++ OK, passed 100 tests.
  7213. 858.02 s [vector] generateM: OK (0.02s)
  7214. 858.02 s [vector] +++ OK, passed 100 tests.
  7215. 858.02 s [vector] replicateM: OK (0.01s)
  7216. 858.02 s [vector] +++ OK, passed 100 tests.
  7217. 858.02 s [vector] create: OK
  7218. 858.03 s [vector] +++ OK, passed 100 tests.
  7219. 858.03 s [vector] createT: OK
  7220. 858.03 s [vector] +++ OK, passed 100 tests.
  7221. 858.03 s [vector] unfoldr: OK
  7222. 858.03 s [vector] +++ OK, passed 100 tests.
  7223. 858.03 s [vector] unfoldrN: OK
  7224. 858.03 s [vector] +++ OK, passed 100 tests.
  7225. 858.03 s [vector] unfoldrExactN: OK
  7226. 858.03 s [vector] +++ OK, passed 100 tests.
  7227. 858.03 s [vector] unfoldrM: OK
  7228. 858.03 s [vector] +++ OK, passed 100 tests.
  7229. 858.05 s [vector] unfoldrNM: OK
  7230. 858.05 s [vector] +++ OK, passed 100 tests.
  7231. 858.05 s [vector] unfoldrExactNM: OK (0.01s)
  7232. 858.05 s [vector] +++ OK, passed 100 tests.
  7233. 858.07 s [vector] constructN: OK (0.02s)
  7234. 858.07 s [vector] +++ OK, passed 100 tests.
  7235. 858.08 s [vector] constructrN: OK (0.02s)
  7236. 858.08 s [vector] +++ OK, passed 100 tests.
  7237. 858.08 s [vector] cons: OK
  7238. 858.08 s [vector] +++ OK, passed 100 tests.
  7239. 858.08 s [vector] snoc: OK
  7240. 858.08 s [vector] +++ OK, passed 100 tests.
  7241. 858.09 s [vector] append: OK
  7242. 858.09 s [vector] +++ OK, passed 100 tests.
  7243. 858.11 s [vector] concat: OK (0.02s)
  7244. 858.11 s [vector] +++ OK, passed 100 tests.
  7245. 858.11 s [vector] force: OK
  7246. 858.11 s [vector] +++ OK, passed 100 tests.
  7247. 858.11 s [vector] upd: OK
  7248. 858.11 s [vector] +++ OK, passed 100 tests.
  7249. 858.12 s [vector] accum: OK (0.01s)
  7250. 858.12 s [vector] +++ OK, passed 100 tests.
  7251. 858.12 s [vector] reverse: OK
  7252. 858.13 s [vector] +++ OK, passed 100 tests.
  7253. 858.13 s [vector] backpermute: OK
  7254. 858.13 s [vector] +++ OK, passed 100 tests.
  7255. 858.13 s [vector] map: OK
  7256. 858.14 s [vector] +++ OK, passed 100 tests.
  7257. 858.15 s [vector] imap: OK
  7258. 858.15 s [vector] +++ OK, passed 100 tests.
  7259. 858.15 s [vector] concatMap: OK
  7260. 858.16 s [vector] +++ OK, passed 100 tests.
  7261. 858.16 s [vector] mapM: OK
  7262. 858.17 s [vector] +++ OK, passed 100 tests.
  7263. 858.24 s [hedgehog] [ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, dist/build/Hedgehog/Internal/Barbie.o, dist/build/Hedgehog/Internal/Barbie.dyn_o )
  7264. 858.24 s [vector] mapM_: OK (0.03s)
  7265. 858.24 s [vector] +++ OK, passed 100 tests.
  7266. 858.24 s [vector] forM: OK
  7267. 858.24 s [vector] +++ OK, passed 100 tests.
  7268. 858.26 s [vector] forM_: OK (0.03s)
  7269. 858.26 s [vector] +++ OK, passed 100 tests.
  7270. 858.26 s [vector] imapM: OK
  7271. 858.26 s [vector] +++ OK, passed 100 tests.
  7272. 858.29 s [vector] imapM_: OK (0.04s)
  7273. 858.29 s [vector] +++ OK, passed 100 tests.
  7274. 858.31 s [vector] zipWith: OK (0.01s)
  7275. 858.31 s [vector] +++ OK, passed 100 tests.
  7276. 858.33 s [vector] zipWith3: OK (0.01s)
  7277. 858.33 s [vector] +++ OK, passed 100 tests.
  7278. 858.33 s [vector] izipWith: OK (0.01s)
  7279. 858.33 s [vector] +++ OK, passed 100 tests.
  7280. 858.34 s [vector] izipWith3: OK (0.01s)
  7281. 858.35 s [vector] +++ OK, passed 100 tests.
  7282. 858.35 s [vector] izipWithM: OK
  7283. 858.35 s [vector] +++ OK, passed 100 tests.
  7284. 858.37 s [vector] izipWithM_: OK (0.03s)
  7285. 858.37 s [vector] +++ OK, passed 100 tests.
  7286. 858.39 s [vector] zipWithM: OK
  7287. 858.39 s [vector] +++ OK, passed 100 tests.
  7288. 858.41 s [vector] zipWithM_: OK (0.03s)
  7289. 858.41 s [vector] +++ OK, passed 100 tests.
  7290. 858.42 s [vector] filter: OK
  7291. 858.43 s [vector] +++ OK, passed 100 tests.
  7292. 858.44 s [vector] ifilter: OK
  7293. 858.44 s [vector] +++ OK, passed 100 tests.
  7294. 858.47 s [vector] filterM: OK (0.04s)
  7295. 858.47 s [vector] +++ OK, passed 100 tests.
  7296. 858.47 s [vector] uniq: OK
  7297. 858.47 s [smallcheck] Phase: checkPhase
  7298. 858.47 s [vector] +++ OK, passed 100 tests.
  7299. 858.49 s [vector] mapMaybe: OK
  7300. 858.49 s [vector] +++ OK, passed 100 tests.
  7301. 858.49 s [vector] imapMaybe: OK
  7302. 858.49 s [vector] +++ OK, passed 100 tests.
  7303. 858.49 s [vector] takeWhile: OK
  7304. 858.49 s [vector] +++ OK, passed 100 tests.
  7305. 858.49 s [vector] dropWhile: OK
  7306. 858.49 s [vector] +++ OK, passed 100 tests.
  7307. 858.57 s [smallcheck] Package has no test suites.
  7308. 858.57 s [smallcheck] Phase: haddockPhase
  7309. 858.57 s [vector] partition: OK
  7310. 858.57 s [vector] +++ OK, passed 100 tests.
  7311. 858.57 s [vector] partitionWith: OK
  7312. 858.57 s [vector] +++ OK, passed 100 tests.
  7313. 858.57 s [vector] span: OK
  7314. 858.57 s [vector] +++ OK, passed 100 tests.
  7315. 858.57 s [vector] break: OK
  7316. 858.57 s [vector] +++ OK, passed 100 tests.
  7317. 858.57 s [vector] spanR: OK
  7318. 858.57 s [vector] +++ OK, passed 100 tests.
  7319. 858.57 s [vector] breakR: OK
  7320. 858.57 s [vector] +++ OK, passed 100 tests.
  7321. 858.57 s [vector] groupBy: OK (0.01s)
  7322. 858.57 s [vector] +++ OK, passed 100 tests.
  7323. 858.57 s [vector] elem: OK
  7324. 858.57 s [vector] +++ OK, passed 100 tests.
  7325. 858.57 s [vector] notElem: OK
  7326. 858.58 s [vector] +++ OK, passed 100 tests.
  7327. 858.58 s [vector] find: OK
  7328. 858.58 s [vector] +++ OK, passed 100 tests.
  7329. 858.58 s [vector] findIndex: OK
  7330. 858.58 s [vector] +++ OK, passed 100 tests.
  7331. 858.58 s [vector] findIndexR: OK
  7332. 858.58 s [vector] +++ OK, passed 100 tests.
  7333. 858.58 s [vector] findIndices: OK
  7334. 858.58 s [vector] +++ OK, passed 100 tests.
  7335. 858.58 s [vector] elemIndex: OK
  7336. 858.58 s [vector] +++ OK, passed 100 tests.
  7337. 858.58 s [vector] elemIndices: OK
  7338. 858.58 s [vector] +++ OK, passed 100 tests.
  7339. 858.58 s [vector] foldl: OK (0.01s)
  7340. 858.58 s [vector] +++ OK, passed 100 tests.
  7341. 858.59 s [vector] foldl1: OK (0.02s)
  7342. 858.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7343. 858.59 s [vector] foldl': OK (0.01s)
  7344. 858.59 s [vector] +++ OK, passed 100 tests.
  7345. 858.61 s [vector] foldl1': OK (0.01s)
  7346. 858.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7347. 858.63 s [vector] foldr: OK (0.01s)
  7348. 858.63 s [vector] +++ OK, passed 100 tests.
  7349. 858.63 s [vector] foldr1: OK (0.01s)
  7350. 858.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7351. 858.65 s [vector] foldr': OK (0.01s)
  7352. 858.65 s [vector] +++ OK, passed 100 tests.
  7353. 858.67 s [hedgehog] [ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, dist/build/Hedgehog/Internal/Distributive.o, dist/build/Hedgehog/Internal/Distributive.dyn_o )
  7354. 858.67 s [vector] foldr1': OK (0.01s)
  7355. 858.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7356. 858.67 s [vector] ifoldl: OK (0.01s)
  7357. 858.67 s [vector] +++ OK, passed 100 tests.
  7358. 858.69 s [vector] ifoldl': OK (0.01s)
  7359. 858.69 s [vector] +++ OK, passed 100 tests.
  7360. 858.71 s [vector] ifoldr: OK (0.01s)
  7361. 858.71 s [vector] +++ OK, passed 100 tests.
  7362. 858.71 s [vector] ifoldr': OK (0.02s)
  7363. 858.71 s [vector] +++ OK, passed 100 tests.
  7364. 858.73 s [vector] ifoldM: OK (0.02s)
  7365. 858.73 s [vector] +++ OK, passed 100 tests.
  7366. 858.75 s [vector] ifoldM': OK (0.02s)
  7367. 858.75 s [vector] +++ OK, passed 100 tests.
  7368. 858.78 s [smallcheck] Preprocessing library for smallcheck-1.2.1.1..
  7369. 858.79 s [smallcheck] Running Haddock on library for smallcheck-1.2.1.1..
  7370. 858.82 s [vector] ifoldM_: OK (0.05s)
  7371. 858.82 s [vector] +++ OK, passed 100 tests.
  7372. 858.84 s [vector] ifoldM'_: OK (0.04s)
  7373. 858.84 s [vector] +++ OK, passed 100 tests.
  7374. 858.84 s [vector] all: OK
  7375. 858.84 s [vector] +++ OK, passed 100 tests.
  7376. 858.84 s [vector] any: OK
  7377. 858.85 s [smallcheck] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  7378. 858.85 s [vector] +++ OK, passed 100 tests.
  7379. 858.85 s [vector] prescanl: OK (0.01s)
  7380. 858.85 s [vector] +++ OK, passed 100 tests.
  7381. 858.88 s [vector] prescanl': OK (0.01s)
  7382. 858.88 s [vector] +++ OK, passed 100 tests.
  7383. 858.90 s [vector] postscanl: OK (0.02s)
  7384. 858.90 s [vector] +++ OK, passed 100 tests.
  7385. 858.92 s [vector] postscanl': OK (0.02s)
  7386. 858.92 s [vector] +++ OK, passed 100 tests.
  7387. 858.92 s [vector] scanl: OK (0.02s)
  7388. 858.92 s [vector] +++ OK, passed 100 tests.
  7389. 858.94 s [vector] scanl': OK (0.02s)
  7390. 858.94 s [vector] +++ OK, passed 100 tests.
  7391. 858.95 s [vector] scanl1: OK (0.02s)
  7392. 859.25 s [vector] +++ OK, passed 100 tests.
  7393. 859.25 s [vector] scanl1': OK (0.02s)
  7394. 859.25 s [vector] +++ OK, passed 100 tests.
  7395. 859.25 s [vector] iscanl: OK (0.02s)
  7396. 859.25 s [vector] +++ OK, passed 100 tests.
  7397. 859.25 s [vector] iscanl': OK (0.02s)
  7398. 859.25 s [vector] +++ OK, passed 100 tests.
  7399. 859.25 s [vector] prescanr: OK (0.01s)
  7400. 859.26 s [vector] +++ OK, passed 100 tests.
  7401. 859.26 s [vector] prescanr': OK (0.01s)
  7402. 859.26 s [vector] +++ OK, passed 100 tests.
  7403. 859.26 s [vector] postscanr: OK (0.01s)
  7404. 859.26 s [vector] +++ OK, passed 100 tests.
  7405. 859.26 s [vector] postscanr': OK (0.02s)
  7406. 859.26 s [vector] +++ OK, passed 100 tests.
  7407. 859.26 s [vector] scanr: OK (0.03s)
  7408. 859.26 s [vector] +++ OK, passed 100 tests.
  7409. 859.26 s [vector] scanr': OK (0.02s)
  7410. 859.26 s [vector] +++ OK, passed 100 tests.
  7411. 859.26 s [vector] scanr1: OK (0.01s)
  7412. 859.26 s [vector] +++ OK, passed 100 tests.
  7413. 859.26 s [vector] scanr1': OK (0.01s)
  7414. 859.26 s [vector] +++ OK, passed 100 tests.
  7415. 859.26 s [vector] iscanr: OK (0.02s)
  7416. 859.26 s [vector] +++ OK, passed 100 tests.
  7417. 859.26 s [vector] iscanr': OK (0.02s)
  7418. 859.26 s [vector] +++ OK, passed 100 tests.
  7419. 859.26 s [vector] mut_read: OK
  7420. 859.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7421. 859.26 s [vector] mut_write: OK
  7422. 859.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7423. 859.26 s [vector] mut_modify: OK
  7424. 859.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7425. 859.26 s [vector] mut_generate: OK
  7426. 859.26 s [smallcheck] [1 of 6] Compiling Test.SmallCheck.Property.Result ( Test/SmallCheck/Property/Result.hs, nothing )
  7427. 859.26 s [vector] +++ OK, passed 100 tests.
  7428. 859.26 s [vector] mut_generateM: OK (0.02s)
  7429. 859.26 s [vector] +++ OK, passed 100 tests.
  7430. 859.26 s [vector] mut_mapM_: OK (0.02s)
  7431. 859.26 s [vector] +++ OK, passed 100 tests.
  7432. 859.26 s [smallcheck] [2 of 6] Compiling Test.SmallCheck.SeriesMonad ( Test/SmallCheck/SeriesMonad.hs, nothing )
  7433. 859.26 s [vector] mut_imapM_: OK (0.03s)
  7434. 859.26 s [vector] +++ OK, passed 100 tests.
  7435. 859.28 s [vector] mut_forM_: OK (0.04s)
  7436. 859.28 s [vector] +++ OK, passed 100 tests.
  7437. 859.32 s [smallcheck] [3 of 6] Compiling Test.SmallCheck.Series ( Test/SmallCheck/Series.hs, nothing )
  7438. 859.33 s [vector] mut_iforM_: OK (0.02s)
  7439. 859.33 s [vector] +++ OK, passed 100 tests.
  7440. 859.34 s [vector] mut_foldr: OK (0.01s)
  7441. 859.34 s [vector] +++ OK, passed 100 tests.
  7442. 859.36 s [vector] mut_foldr': OK (0.02s)
  7443. 859.36 s [vector] +++ OK, passed 100 tests.
  7444. 859.37 s [vector] mut_foldl: OK (0.01s)
  7445. 859.37 s [vector] +++ OK, passed 100 tests.
  7446. 859.37 s [vector] mut_foldl': OK (0.01s)
  7447. 859.37 s [vector] +++ OK, passed 100 tests.
  7448. 859.39 s [vector] mut_ifoldr: OK (0.01s)
  7449. 859.39 s [vector] +++ OK, passed 100 tests.
  7450. 859.41 s [vector] mut_ifoldr': OK (0.02s)
  7451. 859.41 s [vector] +++ OK, passed 100 tests.
  7452. 859.43 s [vector] mut_ifoldl: OK (0.01s)
  7453. 859.43 s [vector] +++ OK, passed 100 tests.
  7454. 859.43 s [vector] mut_ifoldl': OK (0.01s)
  7455. 859.43 s [vector] +++ OK, passed 100 tests.
  7456. 859.45 s [vector] mut_foldM: OK (0.01s)
  7457. 859.45 s [vector] +++ OK, passed 100 tests.
  7458. 859.47 s [vector] mut_foldM': OK (0.02s)
  7459. 859.47 s [vector] +++ OK, passed 100 tests.
  7460. 859.47 s [vector] mut_foldrM: OK (0.02s)
  7461. 859.47 s [vector] +++ OK, passed 100 tests.
  7462. 859.50 s [vector] mut_foldrM': OK (0.02s)
  7463. 859.50 s [vector] +++ OK, passed 100 tests.
  7464. 859.51 s [vector] mut_ifoldM: OK (0.02s)
  7465. 859.51 s [vector] +++ OK, passed 100 tests.
  7466. 859.53 s [vector] mut_ifoldM': OK (0.02s)
  7467. 859.53 s [vector] +++ OK, passed 100 tests.
  7468. 859.55 s [vector] mut_ifoldrM: OK (0.02s)
  7469. 859.55 s [vector] +++ OK, passed 100 tests.
  7470. 859.56 s [hedgehog] [ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, dist/build/Hedgehog/Internal/Exception.o, dist/build/Hedgehog/Internal/Exception.dyn_o )
  7471. 859.56 s [hedgehog] [ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, dist/build/Hedgehog/Internal/HTraversable.o, dist/build/Hedgehog/Internal/HTraversable.dyn_o )
  7472. 859.56 s [hedgehog] [ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, dist/build/Hedgehog/Internal/Opaque.o, dist/build/Hedgehog/Internal/Opaque.dyn_o )
  7473. 859.56 s [hedgehog] [ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, dist/build/Hedgehog/Internal/Prelude.o, dist/build/Hedgehog/Internal/Prelude.dyn_o )
  7474. 859.56 s [hedgehog] [ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, dist/build/Hedgehog/Internal/Range.o, dist/build/Hedgehog/Internal/Range.dyn_o )
  7475. 859.56 s [vector] mut_ifoldrM': OK (0.02s)
  7476. 859.56 s [vector] +++ OK, passed 100 tests.
  7477. 859.56 s [vector] compare: OK
  7478. 859.56 s [vector] +++ OK, passed 100 tests.
  7479. 859.56 s [vector] maximum: OK
  7480. 859.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7481. 859.57 s [vector] minimum: OK
  7482. 859.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7483. 859.57 s [vector] minIndex: OK
  7484. 859.57 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7485. 859.57 s [vector] maxIndex: OK
  7486. 859.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7487. 859.57 s [vector] maximumBy: OK
  7488. 859.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7489. 859.57 s [vector] minimumBy: OK
  7490. 859.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7491. 859.58 s [vector] maximumOn: OK
  7492. 859.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7493. 859.58 s [vector] minimumOn: OK
  7494. 859.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7495. 859.58 s [vector] maxIndexBy: OK
  7496. 859.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7497. 859.58 s [vector] minIndexBy: OK
  7498. 859.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7499. 859.58 s [vector] ListFirstMaxIndexWins: OK
  7500. 859.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7501. 859.58 s [vector] FalseListFirstMaxIndexWins: OK
  7502. 859.58 s [vector] +++ OK, failed as expected. (after 1 test):
  7503. 859.58 s [vector] Exception:
  7504. 859.58 s [vector] Prelude.foldr1: empty list
  7505. 859.58 s [vector] CallStack (from HasCallStack):
  7506. 859.58 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  7507. 859.58 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  7508. 859.58 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7509. 859.58 s [vector] []
  7510. 859.58 s [vector] mempty: OK
  7511. 859.58 s [vector] +++ OK, passed 1 test.
  7512. 859.58 s [vector] mappend: OK
  7513. 859.60 s [vector] +++ OK, passed 100 tests.
  7514. 859.60 s [vector] mconcat: OK (0.02s)
  7515. 859.60 s [vector] +++ OK, passed 100 tests.
  7516. 859.61 s [vector] glength: OK
  7517. 859.61 s [vector] +++ OK, passed 100 tests.
  7518. 859.61 s [vector] sum: OK
  7519. 859.61 s [vector] +++ OK, passed 100 tests.
  7520. 859.61 s [vector] product: OK
  7521. 859.61 s [vector] +++ OK, passed 100 tests.
  7522. 859.61 s [vector] enumFromN: OK
  7523. 859.61 s [vector] +++ OK, passed 100 tests.
  7524. 859.61 s [vector] enumFromThenN: OK
  7525. 859.61 s [vector] +++ OK, passed 100 tests.
  7526. 859.61 s [vector] enumFromTo: OK
  7527. 859.61 s [vector] +++ OK, passed 100 tests.
  7528. 859.61 s [vector] enumFromThenTo: OK
  7529. 859.61 s [vector] +++ OK, passed 100 tests.
  7530. 859.61 s [vector] unstream
  7531. 859.61 s [vector] unstream == vunstream (exact): OK
  7532. 859.61 s [vector] +++ OK, passed 100 tests.
  7533. 859.61 s [vector] unstream == vunstream (unknown): OK
  7534. 859.61 s [vector] +++ OK, passed 100 tests.
  7535. 859.61 s [vector] unstreamR ~= vunstream (exact): OK
  7536. 859.61 s [vector] +++ OK, passed 100 tests.
  7537. 859.61 s [vector] unstreamR ~= vunstream (unknown): OK
  7538. 859.61 s [vector] +++ OK, passed 100 tests.
  7539. 859.61 s [vector] Tests.Vector.Strict
  7540. 859.61 s [vector] Bool
  7541. 859.61 s [vector] fromList.toList == id: OK
  7542. 859.61 s [vector] +++ OK, passed 100 tests.
  7543. 859.61 s [vector] toList.fromList == id: OK
  7544. 859.61 s [vector] +++ OK, passed 100 tests.
  7545. 859.61 s [vector] unstream.stream == id: OK
  7546. 859.61 s [vector] +++ OK, passed 100 tests.
  7547. 859.61 s [vector] stream.unstream == id: OK
  7548. 859.61 s [vector] +++ OK, passed 100 tests.
  7549. 859.61 s [vector] eq: OK
  7550. 859.61 s [vector] +++ OK, passed 100 tests.
  7551. 859.61 s [vector] length: OK
  7552. 859.61 s [vector] +++ OK, passed 100 tests.
  7553. 859.61 s [vector] null: OK
  7554. 859.61 s [vector] +++ OK, passed 100 tests.
  7555. 859.61 s [vector] index: OK
  7556. 859.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7557. 859.61 s [vector] safeIndex: OK
  7558. 859.62 s [vector] +++ OK, passed 100 tests.
  7559. 859.62 s [vector] head: OK
  7560. 859.62 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7561. 859.62 s [vector] last: OK
  7562. 859.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7563. 859.62 s [vector] unsafeIndex: OK
  7564. 859.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7565. 859.62 s [vector] unsafeHead: OK
  7566. 859.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7567. 859.62 s [vector] unsafeLast: OK
  7568. 859.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7569. 859.62 s [vector] slice: OK
  7570. 859.62 s [vector] +++ OK, passed 100 tests.
  7571. 859.62 s [vector] init: OK
  7572. 859.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7573. 859.62 s [vector] tail: OK
  7574. 859.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7575. 859.62 s [vector] take: OK
  7576. 859.62 s [vector] +++ OK, passed 100 tests.
  7577. 859.62 s [vector] drop: OK
  7578. 859.62 s [vector] +++ OK, passed 100 tests.
  7579. 859.62 s [vector] splitAt: OK
  7580. 859.62 s [vector] +++ OK, passed 100 tests.
  7581. 859.62 s [vector] empty: OK
  7582. 859.62 s [vector] +++ OK, passed 1 test.
  7583. 859.62 s [vector] singleton: OK
  7584. 859.62 s [vector] +++ OK, passed 100 tests.
  7585. 859.62 s [vector] replicate: OK
  7586. 859.62 s [vector] +++ OK, passed 100 tests.
  7587. 859.62 s [vector] generate: OK
  7588. 859.62 s [vector] +++ OK, passed 100 tests.
  7589. 859.64 s [vector] iterateN: OK
  7590. 859.64 s [vector] +++ OK, passed 100 tests.
  7591. 859.67 s [vector] iterateNM: OK (0.05s)
  7592. 859.67 s [vector] +++ OK, passed 100 tests.
  7593. 859.69 s [vector] generateM: OK (0.02s)
  7594. 859.69 s [vector] +++ OK, passed 100 tests.
  7595. 859.69 s [vector] replicateM: OK
  7596. 859.69 s [vector] +++ OK, passed 100 tests.
  7597. 859.69 s [vector] create: OK
  7598. 859.69 s [vector] +++ OK, passed 100 tests.
  7599. 859.69 s [vector] createT: OK
  7600. 859.69 s [vector] +++ OK, passed 100 tests.
  7601. 859.69 s [vector] unfoldr: OK
  7602. 859.69 s [vector] +++ OK, passed 100 tests.
  7603. 859.69 s [vector] unfoldrN: OK
  7604. 859.69 s [vector] +++ OK, passed 100 tests.
  7605. 859.69 s [vector] unfoldrExactN: OK
  7606. 859.69 s [vector] +++ OK, passed 100 tests.
  7607. 859.70 s [vector] unfoldrM: OK
  7608. 859.70 s [vector] +++ OK, passed 100 tests.
  7609. 859.72 s [vector] unfoldrNM: OK
  7610. 859.72 s [vector] +++ OK, passed 100 tests.
  7611. 859.72 s [hedgehog] [ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, dist/build/Hedgehog/Internal/Region.o, dist/build/Hedgehog/Internal/Region.dyn_o )
  7612. 859.72 s [hedgehog] [ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, dist/build/Hedgehog/Internal/Seed.o, dist/build/Hedgehog/Internal/Seed.dyn_o )
  7613. 859.72 s [vector] unfoldrExactNM: OK (0.02s)
  7614. 859.72 s [vector] +++ OK, passed 100 tests.
  7615. 859.72 s [vector] constructN: OK
  7616. 859.72 s [vector] +++ OK, passed 100 tests.
  7617. 859.72 s [vector] constructrN: OK
  7618. 859.72 s [vector] +++ OK, passed 100 tests.
  7619. 859.72 s [vector] cons: OK
  7620. 859.72 s [vector] +++ OK, passed 100 tests.
  7621. 859.72 s [vector] snoc: OK
  7622. 859.72 s [vector] +++ OK, passed 100 tests.
  7623. 859.72 s [vector] append: OK
  7624. 859.73 s [vector] +++ OK, passed 100 tests.
  7625. 859.73 s [vector] concat: OK
  7626. 859.73 s [vector] +++ OK, passed 100 tests.
  7627. 859.73 s [vector] force: OK
  7628. 859.73 s [vector] +++ OK, passed 100 tests.
  7629. 859.74 s [vector] upd: OK
  7630. 859.74 s [vector] +++ OK, passed 100 tests.
  7631. 859.74 s [vector] accum: OK
  7632. 859.74 s [vector] +++ OK, passed 100 tests.
  7633. 859.74 s [vector] reverse: OK
  7634. 859.74 s [vector] +++ OK, passed 100 tests.
  7635. 859.74 s [vector] backpermute: OK
  7636. 859.74 s [vector] +++ OK, passed 100 tests.
  7637. 859.74 s [vector] map: OK
  7638. 859.74 s [vector] +++ OK, passed 100 tests.
  7639. 859.74 s [vector] imap: OK
  7640. 859.74 s [vector] +++ OK, passed 100 tests.
  7641. 859.75 s [vector] concatMap: OK
  7642. 859.75 s [vector] +++ OK, passed 100 tests.
  7643. 859.75 s [vector] mapM: OK
  7644. 859.75 s [vector] +++ OK, passed 100 tests.
  7645. 859.75 s [vector] mapM_: OK
  7646. 859.75 s [vector] +++ OK, passed 100 tests.
  7647. 859.75 s [vector] forM: OK
  7648. 859.75 s [vector] +++ OK, passed 100 tests.
  7649. 859.76 s [vector] forM_: OK
  7650. 859.76 s [vector] +++ OK, passed 100 tests.
  7651. 859.76 s [vector] imapM: OK
  7652. 859.79 s [vector] +++ OK, passed 100 tests.
  7653. 859.79 s [vector] imapM_: OK (0.01s)
  7654. 859.79 s [vector] +++ OK, passed 100 tests.
  7655. 859.79 s [vector] zipWith: OK
  7656. 859.79 s [vector] +++ OK, passed 100 tests.
  7657. 859.79 s [vector] zipWith3: OK
  7658. 859.79 s [vector] +++ OK, passed 100 tests.
  7659. 859.79 s [vector] izipWith: OK
  7660. 859.79 s [vector] +++ OK, passed 100 tests.
  7661. 859.79 s [vector] izipWith3: OK
  7662. 859.79 s [vector] +++ OK, passed 100 tests.
  7663. 859.79 s [vector] izipWithM: OK
  7664. 859.80 s [vector] +++ OK, passed 100 tests.
  7665. 859.80 s [vector] izipWithM_: OK
  7666. 859.80 s [vector] +++ OK, passed 100 tests.
  7667. 859.80 s [vector] zipWithM: OK
  7668. 859.80 s [vector] +++ OK, passed 100 tests.
  7669. 859.80 s [vector] zipWithM_: OK
  7670. 859.80 s [vector] +++ OK, passed 100 tests.
  7671. 859.80 s [vector] filter: OK
  7672. 859.80 s [vector] +++ OK, passed 100 tests.
  7673. 859.80 s [vector] ifilter: OK
  7674. 859.81 s [vector] +++ OK, passed 100 tests.
  7675. 859.83 s [vector] filterM: OK (0.02s)
  7676. 859.83 s [vector] +++ OK, passed 100 tests.
  7677. 859.83 s [vector] uniq: OK
  7678. 859.83 s [vector] +++ OK, passed 100 tests.
  7679. 859.83 s [vector] mapMaybe: OK
  7680. 859.83 s [vector] +++ OK, passed 100 tests.
  7681. 859.83 s [vector] imapMaybe: OK
  7682. 859.83 s [vector] +++ OK, passed 100 tests.
  7683. 859.83 s [vector] takeWhile: OK
  7684. 859.83 s [vector] +++ OK, passed 100 tests.
  7685. 859.83 s [vector] dropWhile: OK
  7686. 859.83 s [vector] +++ OK, passed 100 tests.
  7687. 859.83 s [vector] partition: OK
  7688. 859.83 s [vector] +++ OK, passed 100 tests.
  7689. 859.83 s [vector] partitionWith: OK
  7690. 859.83 s [vector] +++ OK, passed 100 tests.
  7691. 859.83 s [vector] span: OK
  7692. 859.83 s [vector] +++ OK, passed 100 tests.
  7693. 859.83 s [vector] break: OK
  7694. 859.83 s [vector] +++ OK, passed 100 tests.
  7695. 859.83 s [vector] spanR: OK
  7696. 859.83 s [vector] +++ OK, passed 100 tests.
  7697. 859.84 s [vector] breakR: OK
  7698. 859.84 s [vector] +++ OK, passed 100 tests.
  7699. 859.84 s [vector] groupBy: OK
  7700. 859.84 s [vector] +++ OK, passed 100 tests.
  7701. 859.84 s [vector] elem: OK
  7702. 859.84 s [vector] +++ OK, passed 100 tests.
  7703. 859.84 s [vector] notElem: OK
  7704. 859.84 s [vector] +++ OK, passed 100 tests.
  7705. 859.84 s [vector] find: OK
  7706. 859.84 s [vector] +++ OK, passed 100 tests.
  7707. 859.84 s [vector] findIndex: OK
  7708. 859.84 s [vector] +++ OK, passed 100 tests.
  7709. 859.84 s [vector] findIndexR: OK
  7710. 859.84 s [vector] +++ OK, passed 100 tests.
  7711. 859.84 s [vector] findIndices: OK
  7712. 859.84 s [vector] +++ OK, passed 100 tests.
  7713. 859.84 s [vector] elemIndex: OK
  7714. 859.84 s [vector] +++ OK, passed 100 tests.
  7715. 859.84 s [vector] elemIndices: OK
  7716. 859.84 s [vector] +++ OK, passed 100 tests.
  7717. 859.84 s [vector] foldl: OK
  7718. 859.84 s [vector] +++ OK, passed 100 tests.
  7719. 859.84 s [vector] foldl1: OK
  7720. 859.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7721. 859.84 s [vector] foldl': OK
  7722. 859.84 s [vector] +++ OK, passed 100 tests.
  7723. 859.84 s [vector] foldl1': OK
  7724. 859.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7725. 859.84 s [vector] foldr: OK
  7726. 859.84 s [vector] +++ OK, passed 100 tests.
  7727. 859.84 s [vector] foldr1: OK
  7728. 859.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7729. 859.84 s [vector] foldr': OK
  7730. 859.84 s [vector] +++ OK, passed 100 tests.
  7731. 859.84 s [vector] foldr1': OK
  7732. 859.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7733. 859.85 s [vector] ifoldl: OK
  7734. 859.85 s [vector] +++ OK, passed 100 tests.
  7735. 859.85 s [vector] ifoldl': OK
  7736. 859.85 s [vector] +++ OK, passed 100 tests.
  7737. 859.85 s [vector] ifoldr: OK
  7738. 859.85 s [vector] +++ OK, passed 100 tests.
  7739. 859.85 s [vector] ifoldr': OK
  7740. 859.85 s [vector] +++ OK, passed 100 tests.
  7741. 859.85 s [vector] ifoldM: OK
  7742. 859.86 s [vector] +++ OK, passed 100 tests.
  7743. 859.86 s [vector] ifoldM': OK
  7744. 859.87 s [vector] +++ OK, passed 100 tests.
  7745. 859.87 s [vector] ifoldM_: OK
  7746. 859.87 s [vector] +++ OK, passed 100 tests.
  7747. 859.88 s [vector] ifoldM'_: OK (0.01s)
  7748. 859.88 s [vector] +++ OK, passed 100 tests.
  7749. 859.88 s [vector] all: OK
  7750. 859.88 s [vector] +++ OK, passed 100 tests.
  7751. 859.88 s [vector] any: OK
  7752. 859.88 s [vector] +++ OK, passed 100 tests.
  7753. 859.88 s [vector] prescanl: OK
  7754. 859.88 s [vector] +++ OK, passed 100 tests.
  7755. 859.88 s [vector] prescanl': OK
  7756. 859.88 s [vector] +++ OK, passed 100 tests.
  7757. 859.89 s [vector] postscanl: OK
  7758. 859.89 s [vector] +++ OK, passed 100 tests.
  7759. 859.89 s [vector] postscanl': OK
  7760. 859.89 s [vector] +++ OK, passed 100 tests.
  7761. 859.89 s [vector] scanl: OK
  7762. 859.89 s [vector] +++ OK, passed 100 tests.
  7763. 859.89 s [vector] scanl': OK
  7764. 859.89 s [vector] +++ OK, passed 100 tests.
  7765. 859.89 s [vector] scanl1: OK
  7766. 859.89 s [vector] +++ OK, passed 100 tests.
  7767. 859.89 s [vector] scanl1': OK
  7768. 859.89 s [vector] +++ OK, passed 100 tests.
  7769. 859.89 s [vector] iscanl: OK
  7770. 859.89 s [vector] +++ OK, passed 100 tests.
  7771. 859.89 s [vector] iscanl': OK
  7772. 859.90 s [vector] +++ OK, passed 100 tests.
  7773. 859.90 s [vector] prescanr: OK
  7774. 859.90 s [vector] +++ OK, passed 100 tests.
  7775. 859.90 s [vector] prescanr': OK
  7776. 859.90 s [vector] +++ OK, passed 100 tests.
  7777. 859.90 s [vector] postscanr: OK
  7778. 859.90 s [vector] +++ OK, passed 100 tests.
  7779. 859.90 s [vector] postscanr': OK
  7780. 859.90 s [vector] +++ OK, passed 100 tests.
  7781. 859.90 s [vector] scanr: OK
  7782. 859.90 s [vector] +++ OK, passed 100 tests.
  7783. 859.90 s [vector] scanr': OK
  7784. 859.90 s [vector] +++ OK, passed 100 tests.
  7785. 859.90 s [vector] scanr1: OK
  7786. 859.91 s [vector] +++ OK, passed 100 tests.
  7787. 859.91 s [vector] scanr1': OK
  7788. 859.91 s [vector] +++ OK, passed 100 tests.
  7789. 859.91 s [vector] iscanr: OK
  7790. 859.91 s [vector] +++ OK, passed 100 tests.
  7791. 859.91 s [vector] iscanr': OK
  7792. 859.91 s [vector] +++ OK, passed 100 tests.
  7793. 859.91 s [vector] mut_read: OK
  7794. 859.91 s [vector] +++ OK, passed 100 tests; 27 discarded.
  7795. 859.91 s [vector] mut_write: OK
  7796. 859.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7797. 859.91 s [vector] mut_modify: OK
  7798. 859.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7799. 859.91 s [vector] mut_generate: OK
  7800. 859.91 s [vector] +++ OK, passed 100 tests.
  7801. 859.93 s [vector] mut_generateM: OK
  7802. 859.93 s [vector] +++ OK, passed 100 tests.
  7803. 859.93 s [vector] mut_mapM_: OK (0.01s)
  7804. 859.93 s [vector] +++ OK, passed 100 tests.
  7805. 859.95 s [vector] mut_imapM_: OK (0.01s)
  7806. 859.95 s [vector] +++ OK, passed 100 tests.
  7807. 859.95 s [vector] mut_forM_: OK
  7808. 859.95 s [vector] +++ OK, passed 100 tests.
  7809. 859.96 s [vector] mut_iforM_: OK (0.01s)
  7810. 859.96 s [vector] +++ OK, passed 100 tests.
  7811. 859.96 s [vector] mut_foldr: OK
  7812. 859.96 s [vector] +++ OK, passed 100 tests.
  7813. 859.96 s [vector] mut_foldr': OK
  7814. 859.96 s [vector] +++ OK, passed 100 tests.
  7815. 859.96 s [vector] mut_foldl: OK
  7816. 859.97 s [vector] +++ OK, passed 100 tests.
  7817. 859.97 s [vector] mut_foldl': OK
  7818. 859.97 s [vector] +++ OK, passed 100 tests.
  7819. 859.97 s [vector] mut_ifoldr: OK
  7820. 859.97 s [vector] +++ OK, passed 100 tests.
  7821. 859.97 s [vector] mut_ifoldr': OK
  7822. 859.97 s [vector] +++ OK, passed 100 tests.
  7823. 859.97 s [vector] mut_ifoldl: OK
  7824. 859.97 s [vector] +++ OK, passed 100 tests.
  7825. 859.97 s [vector] mut_ifoldl': OK
  7826. 859.97 s [vector] +++ OK, passed 100 tests.
  7827. 859.97 s [vector] mut_foldM: OK
  7828. 859.97 s [vector] +++ OK, passed 100 tests.
  7829. 859.97 s [vector] mut_foldM': OK
  7830. 859.97 s [vector] +++ OK, passed 100 tests.
  7831. 859.98 s [vector] mut_foldrM: OK
  7832. 859.98 s [vector] +++ OK, passed 100 tests.
  7833. 859.98 s [vector] mut_foldrM': OK
  7834. 859.98 s [vector] +++ OK, passed 100 tests.
  7835. 859.98 s [vector] mut_ifoldM: OK
  7836. 859.98 s [vector] +++ OK, passed 100 tests.
  7837. 859.98 s [vector] mut_ifoldM': OK
  7838. 859.98 s [vector] +++ OK, passed 100 tests.
  7839. 859.98 s [vector] mut_ifoldrM: OK
  7840. 859.98 s [vector] +++ OK, passed 100 tests.
  7841. 859.99 s [vector] mut_ifoldrM': OK
  7842. 859.99 s [vector] +++ OK, passed 100 tests.
  7843. 859.99 s [vector] compare: OK
  7844. 859.99 s [vector] +++ OK, passed 100 tests.
  7845. 859.99 s [vector] maximum: OK
  7846. 859.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7847. 859.99 s [vector] minimum: OK
  7848. 859.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7849. 859.99 s [vector] minIndex: OK
  7850. 859.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7851. 859.99 s [vector] maxIndex: OK
  7852. 859.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7853. 859.99 s [vector] maximumBy: OK
  7854. 859.99 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7855. 859.99 s [vector] minimumBy: OK
  7856. 859.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7857. 859.99 s [vector] maximumOn: OK
  7858. 859.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7859. 859.99 s [vector] minimumOn: OK
  7860. 859.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7861. 859.99 s [vector] maxIndexBy: OK
  7862. 859.99 s [vector] +++ OK, passed 100 tests; 26 discarded.
  7863. 859.99 s [vector] minIndexBy: OK
  7864. 859.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7865. 859.99 s [vector] ListFirstMaxIndexWins: OK
  7866. 859.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7867. 859.99 s [vector] FalseListFirstMaxIndexWins: OK
  7868. 859.99 s [vector] +++ OK, failed as expected. (after 1 test):
  7869. 859.99 s [vector] Exception:
  7870. 859.99 s [vector] Prelude.foldr1: empty list
  7871. 859.99 s [vector] CallStack (from HasCallStack):
  7872. 859.99 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  7873. 859.99 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  7874. 859.99 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7875. 859.99 s [vector] []
  7876. 859.99 s [vector] zip: OK
  7877. 859.99 s [vector] +++ OK, passed 100 tests.
  7878. 859.99 s [vector] zip3: OK
  7879. 859.99 s [vector] +++ OK, passed 100 tests.
  7880. 859.99 s [vector] unzip: OK
  7881. 859.99 s [vector] +++ OK, passed 100 tests.
  7882. 859.99 s [vector] unzip3: OK
  7883. 860.00 s [vector] +++ OK, passed 100 tests.
  7884. 860.00 s [vector] indexed: OK
  7885. 860.00 s [vector] +++ OK, passed 100 tests.
  7886. 860.00 s [vector] update: OK
  7887. 860.00 s [vector] +++ OK, passed 100 tests.
  7888. 860.01 s [vector] concat: OK
  7889. 860.01 s [vector] +++ OK, passed 100 tests.
  7890. 860.01 s [vector] mempty: OK
  7891. 860.01 s [vector] +++ OK, passed 1 test.
  7892. 860.01 s [vector] mappend: OK
  7893. 860.01 s [vector] +++ OK, passed 100 tests.
  7894. 860.02 s [vector] mconcat: OK
  7895. 860.02 s [vector] +++ OK, passed 100 tests.
  7896. 860.02 s [vector] fmap: OK
  7897. 860.02 s [vector] +++ OK, passed 100 tests.
  7898. 860.03 s [vector] return: OK
  7899. 860.03 s [vector] +++ OK, passed 100 tests.
  7900. 860.03 s [vector] bind: OK (0.01s)
  7901. 860.03 s [vector] +++ OK, passed 100 tests.
  7902. 860.03 s [vector] mzip: OK
  7903. 860.03 s [vector] +++ OK, passed 100 tests.
  7904. 860.03 s [vector] munzip: OK
  7905. 860.03 s [vector] +++ OK, passed 100 tests.
  7906. 860.03 s [vector] applicative_pure: OK
  7907. 860.03 s [vector] +++ OK, passed 100 tests.
  7908. 860.05 s [vector] applicative_appl: OK (0.02s)
  7909. 860.05 s [vector] +++ OK, passed 100 tests.
  7910. 860.05 s [vector] alternative_empty: OK
  7911. 860.05 s [vector] +++ OK, passed 1 test.
  7912. 860.05 s [vector] alternative_or: OK
  7913. 860.05 s [vector] +++ OK, passed 100 tests.
  7914. 860.09 s [vector] sequence: OK (0.03s)
  7915. 860.09 s [vector] +++ OK, passed 100 tests.
  7916. 860.09 s [vector] sequence_: OK
  7917. 860.09 s [vector] +++ OK, passed 100 tests.
  7918. 860.09 s [vector] glength: OK
  7919. 860.09 s [vector] +++ OK, passed 100 tests.
  7920. 860.09 s [vector] and: OK
  7921. 860.09 s [vector] +++ OK, passed 100 tests.
  7922. 860.09 s [vector] or: OK
  7923. 860.09 s [vector] +++ OK, passed 100 tests.
  7924. 860.09 s [vector] Int
  7925. 860.09 s [vector] fromList.toList == id: OK
  7926. 860.09 s [vector] +++ OK, passed 100 tests.
  7927. 860.09 s [vector] toList.fromList == id: OK
  7928. 860.09 s [vector] +++ OK, passed 100 tests.
  7929. 860.09 s [vector] unstream.stream == id: OK
  7930. 860.09 s [vector] +++ OK, passed 100 tests.
  7931. 860.09 s [vector] stream.unstream == id: OK
  7932. 860.10 s [vector] +++ OK, passed 100 tests.
  7933. 860.10 s [vector] eq: OK
  7934. 860.10 s [vector] +++ OK, passed 100 tests.
  7935. 860.10 s [vector] length: OK
  7936. 860.10 s [vector] +++ OK, passed 100 tests.
  7937. 860.10 s [vector] null: OK
  7938. 860.10 s [vector] +++ OK, passed 100 tests.
  7939. 860.10 s [vector] index: OK
  7940. 860.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7941. 860.10 s [vector] safeIndex: OK
  7942. 860.10 s [vector] +++ OK, passed 100 tests.
  7943. 860.10 s [vector] head: OK
  7944. 860.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7945. 860.10 s [vector] last: OK
  7946. 860.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7947. 860.10 s [vector] unsafeIndex: OK
  7948. 860.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7949. 860.10 s [vector] unsafeHead: OK
  7950. 860.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7951. 860.10 s [vector] unsafeLast: OK
  7952. 860.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7953. 860.10 s [vector] slice: OK
  7954. 860.10 s [vector] +++ OK, passed 100 tests.
  7955. 860.10 s [vector] init: OK
  7956. 860.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7957. 860.10 s [vector] tail: OK
  7958. 860.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7959. 860.10 s [vector] take: OK
  7960. 860.10 s [vector] +++ OK, passed 100 tests.
  7961. 860.10 s [vector] drop: OK
  7962. 860.10 s [vector] +++ OK, passed 100 tests.
  7963. 860.10 s [vector] splitAt: OK
  7964. 860.10 s [vector] +++ OK, passed 100 tests.
  7965. 860.10 s [vector] empty: OK
  7966. 860.10 s [vector] +++ OK, passed 1 test.
  7967. 860.10 s [vector] singleton: OK
  7968. 860.10 s [vector] +++ OK, passed 100 tests.
  7969. 860.10 s [vector] replicate: OK
  7970. 860.10 s [vector] +++ OK, passed 100 tests.
  7971. 860.10 s [vector] generate: OK
  7972. 860.10 s [vector] +++ OK, passed 100 tests.
  7973. 860.11 s [vector] iterateN: OK
  7974. 860.11 s [vector] +++ OK, passed 100 tests.
  7975. 860.12 s [smallcheck] [4 of 6] Compiling Test.SmallCheck.Property ( Test/SmallCheck/Property.hs, nothing )
  7976. 860.13 s [vector] iterateNM: OK (0.02s)
  7977. 860.13 s [vector] +++ OK, passed 100 tests.
  7978. 860.17 s [vector] generateM: OK (0.04s)
  7979. 860.17 s [vector] +++ OK, passed 100 tests.
  7980. 860.18 s [vector] replicateM: OK (0.01s)
  7981. 860.18 s [vector] +++ OK, passed 100 tests.
  7982. 860.18 s [vector] create: OK
  7983. 860.18 s [vector] +++ OK, passed 100 tests.
  7984. 860.18 s [vector] createT: OK
  7985. 860.18 s [vector] +++ OK, passed 100 tests.
  7986. 860.18 s [vector] unfoldr: OK
  7987. 860.18 s [vector] +++ OK, passed 100 tests.
  7988. 860.18 s [vector] unfoldrN: OK
  7989. 860.18 s [vector] +++ OK, passed 100 tests.
  7990. 860.18 s [vector] unfoldrExactN: OK
  7991. 860.19 s [vector] +++ OK, passed 100 tests.
  7992. 860.19 s [vector] unfoldrM: OK
  7993. 860.19 s [vector] +++ OK, passed 100 tests.
  7994. 860.19 s [vector] unfoldrNM: OK
  7995. 860.19 s [vector] +++ OK, passed 100 tests.
  7996. 860.21 s [vector] unfoldrExactNM: OK (0.02s)
  7997. 860.21 s [vector] +++ OK, passed 100 tests.
  7998. 860.21 s [vector] constructN: OK
  7999. 860.22 s [vector] +++ OK, passed 100 tests.
  8000. 860.22 s [vector] constructrN: OK
  8001. 860.22 s [vector] +++ OK, passed 100 tests.
  8002. 860.22 s [vector] cons: OK
  8003. 860.22 s [vector] +++ OK, passed 100 tests.
  8004. 860.22 s [vector] snoc: OK
  8005. 860.22 s [vector] +++ OK, passed 100 tests.
  8006. 860.23 s [hedgehog] [10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, dist/build/Hedgehog/Internal/Show.o, dist/build/Hedgehog/Internal/Show.dyn_o )
  8007. 860.23 s [vector] append: OK
  8008. 860.23 s [vector] +++ OK, passed 100 tests.
  8009. 860.23 s [vector] concat: OK (0.01s)
  8010. 860.23 s [vector] +++ OK, passed 100 tests.
  8011. 860.23 s [vector] force: OK
  8012. 860.23 s [vector] +++ OK, passed 100 tests.
  8013. 860.24 s [vector] upd: OK
  8014. 860.24 s [vector] +++ OK, passed 100 tests.
  8015. 860.24 s [vector] accum: OK
  8016. 860.24 s [vector] +++ OK, passed 100 tests.
  8017. 860.24 s [vector] reverse: OK
  8018. 860.24 s [vector] +++ OK, passed 100 tests.
  8019. 860.24 s [vector] backpermute: OK
  8020. 860.24 s [vector] +++ OK, passed 100 tests.
  8021. 860.24 s [vector] map: OK
  8022. 860.24 s [vector] +++ OK, passed 100 tests.
  8023. 860.25 s [vector] imap: OK
  8024. 860.25 s [vector] +++ OK, passed 100 tests.
  8025. 860.25 s [vector] concatMap: OK
  8026. 860.25 s [vector] +++ OK, passed 100 tests.
  8027. 860.25 s [vector] mapM: OK
  8028. 860.25 s [vector] +++ OK, passed 100 tests.
  8029. 860.26 s [hedgehog] [11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, dist/build/Hedgehog/Internal/Shrink.o, dist/build/Hedgehog/Internal/Shrink.dyn_o )
  8030. 860.26 s [hedgehog] [12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, dist/build/Hedgehog/Internal/Source.o, dist/build/Hedgehog/Internal/Source.dyn_o )
  8031. 860.26 s [hedgehog] [13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, dist/build/Hedgehog/Internal/Tree.o, dist/build/Hedgehog/Internal/Tree.dyn_o )
  8032. 860.27 s [vector] mapM_: OK (0.02s)
  8033. 860.27 s [vector] +++ OK, passed 100 tests.
  8034. 860.27 s [vector] forM: OK
  8035. 860.27 s [vector] +++ OK, passed 100 tests.
  8036. 860.29 s [vector] forM_: OK (0.02s)
  8037. 860.29 s [vector] +++ OK, passed 100 tests.
  8038. 860.29 s [vector] imapM: OK
  8039. 860.29 s [vector] +++ OK, passed 100 tests.
  8040. 860.31 s [vector] imapM_: OK (0.02s)
  8041. 860.31 s [vector] +++ OK, passed 100 tests.
  8042. 860.31 s [vector] zipWith: OK
  8043. 860.31 s [vector] +++ OK, passed 100 tests.
  8044. 860.31 s [vector] zipWith3: OK
  8045. 860.31 s [vector] +++ OK, passed 100 tests.
  8046. 860.31 s [vector] izipWith: OK
  8047. 860.31 s [vector] +++ OK, passed 100 tests.
  8048. 860.31 s [vector] izipWith3: OK
  8049. 860.31 s [vector] +++ OK, passed 100 tests.
  8050. 860.33 s [vector] izipWithM: OK
  8051. 860.33 s [vector] +++ OK, passed 100 tests.
  8052. 860.33 s [vector] izipWithM_: OK (0.01s)
  8053. 860.33 s [vector] +++ OK, passed 100 tests.
  8054. 860.33 s [vector] zipWithM: OK
  8055. 860.33 s [vector] +++ OK, passed 100 tests.
  8056. 860.35 s [vector] zipWithM_: OK (0.01s)
  8057. 860.35 s [vector] +++ OK, passed 100 tests.
  8058. 860.35 s [vector] filter: OK
  8059. 860.35 s [vector] +++ OK, passed 100 tests.
  8060. 860.35 s [vector] ifilter: OK
  8061. 860.35 s [vector] +++ OK, passed 100 tests.
  8062. 860.36 s [smallcheck] [5 of 6] Compiling Test.SmallCheck.Drivers ( Test/SmallCheck/Drivers.hs, nothing )
  8063. 860.37 s [vector] filterM: OK (0.02s)
  8064. 860.37 s [vector] +++ OK, passed 100 tests.
  8065. 860.37 s [smallcheck] [6 of 6] Compiling Test.SmallCheck ( Test/SmallCheck.hs, nothing )
  8066. 860.37 s [vector] uniq: OK
  8067. 860.37 s [vector] +++ OK, passed 100 tests.
  8068. 860.37 s [vector] mapMaybe: OK
  8069. 860.38 s [smallcheck] Haddock coverage:
  8070. 860.38 s [smallcheck] Warning: 'Series' is ambiguous. It is defined
  8071. 860.38 s [smallcheck] * at Test/SmallCheck/SeriesMonad.hs:46:22
  8072. 860.38 s [smallcheck] * at Test/SmallCheck/SeriesMonad.hs:46:1
  8073. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8074. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8075. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/SeriesMonad.hs:46:1
  8076. 860.38 s [vector] +++ OK, passed 100 tests.
  8077. 860.38 s [vector] imapMaybe: OK
  8078. 860.38 s [vector] +++ OK, passed 100 tests.
  8079. 860.38 s [vector] takeWhile: OK
  8080. 860.38 s [vector] +++ OK, passed 100 tests.
  8081. 860.38 s [vector] dropWhile: OK
  8082. 860.38 s [smallcheck] Warning: 'NonEmpty' is ambiguous. It is defined
  8083. 860.38 s [smallcheck] * in ‘GHC.Base’
  8084. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:1121:22
  8085. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:1121:1
  8086. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8087. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8088. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/Series.hs:1121:1
  8089. 860.38 s [smallcheck] Warning: 'NonZero' is ambiguous. It is defined
  8090. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:1084:21
  8091. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:1084:1
  8092. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8093. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8094. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/Series.hs:1084:1
  8095. 860.38 s [smallcheck] Warning: 'NonNegative' is ambiguous. It is defined
  8096. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:1040:25
  8097. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:1040:1
  8098. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8099. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8100. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/Series.hs:1040:1
  8101. 860.38 s [smallcheck] Warning: 'Positive' is ambiguous. It is defined
  8102. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:996:22
  8103. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:996:1
  8104. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8105. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8106. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/Series.hs:996:1
  8107. 860.38 s [smallcheck] Warning: 'M' is ambiguous. It is defined
  8108. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:753:15
  8109. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:753:1
  8110. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8111. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8112. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/Series.hs:753:1
  8113. 860.38 s [smallcheck] Warning: 'N' is ambiguous. It is defined
  8114. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:712:15
  8115. 860.38 s [smallcheck] * at Test/SmallCheck/Series.hs:712:1
  8116. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8117. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8118. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/Series.hs:712:1
  8119. 860.38 s [vector] +++ OK, passed 100 tests.
  8120. 860.38 s [smallcheck] Warning: 'Series' is ambiguous. It is defined
  8121. 860.38 s [smallcheck] * at Test/SmallCheck/SeriesMonad.hs:46:22
  8122. 860.38 s [smallcheck] * at Test/SmallCheck/SeriesMonad.hs:46:1
  8123. 860.38 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8124. 860.38 s [smallcheck] by specifying the type/value namespace explicitly.
  8125. 860.38 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/SeriesMonad.hs:46:1
  8126. 860.38 s [vector] partition: OK
  8127. 860.38 s [vector] +++ OK, passed 100 tests.
  8128. 860.38 s [vector] partitionWith: OK
  8129. 860.38 s [vector] +++ OK, passed 100 tests.
  8130. 860.38 s [vector] span: OK
  8131. 860.38 s [vector] +++ OK, passed 100 tests.
  8132. 860.38 s [vector] break: OK
  8133. 860.38 s [vector] +++ OK, passed 100 tests.
  8134. 860.38 s [vector] spanR: OK
  8135. 860.38 s [vector] +++ OK, passed 100 tests.
  8136. 860.38 s [smallcheck] 100% ( 56 / 56) in 'Test.SmallCheck.Series'
  8137. 860.39 s [smallcheck] Warning: 'Series' is ambiguous. It is defined
  8138. 860.39 s [smallcheck] * at Test/SmallCheck/SeriesMonad.hs:46:22
  8139. 860.39 s [smallcheck] * at Test/SmallCheck/SeriesMonad.hs:46:1
  8140. 860.39 s [smallcheck] You may be able to disambiguate the identifier by qualifying it or
  8141. 860.39 s [smallcheck] by specifying the type/value namespace explicitly.
  8142. 860.39 s [smallcheck] Defaulting to the one defined at Test/SmallCheck/SeriesMonad.hs:46:1
  8143. 860.39 s [vector] breakR: OK
  8144. 860.39 s [vector] +++ OK, passed 100 tests.
  8145. 860.39 s [vector] groupBy: OK
  8146. 860.39 s [vector] +++ OK, passed 100 tests.
  8147. 860.39 s [vector] elem: OK
  8148. 860.39 s [vector] +++ OK, passed 100 tests.
  8149. 860.39 s [vector] notElem: OK
  8150. 860.39 s [vector] +++ OK, passed 100 tests.
  8151. 860.39 s [vector] find: OK
  8152. 860.39 s [vector] +++ OK, passed 100 tests.
  8153. 860.39 s [smallcheck] 100% ( 11 / 11) in 'Test.SmallCheck.Drivers'
  8154. 860.39 s [smallcheck] 100% ( 21 / 21) in 'Test.SmallCheck'
  8155. 860.39 s [vector] findIndex: OK
  8156. 860.39 s [vector] +++ OK, passed 100 tests.
  8157. 860.39 s [vector] findIndexR: OK
  8158. 860.40 s [vector] +++ OK, passed 100 tests.
  8159. 860.40 s [vector] findIndices: OK
  8160. 860.40 s [vector] +++ OK, passed 100 tests.
  8161. 860.40 s [vector] elemIndex: OK
  8162. 860.40 s [vector] +++ OK, passed 100 tests.
  8163. 860.40 s [vector] elemIndices: OK
  8164. 860.40 s [vector] +++ OK, passed 100 tests.
  8165. 860.40 s [vector] foldl: OK
  8166. 860.40 s [vector] +++ OK, passed 100 tests.
  8167. 860.40 s [vector] foldl1: OK
  8168. 860.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8169. 860.40 s [vector] foldl': OK
  8170. 860.41 s [vector] +++ OK, passed 100 tests.
  8171. 860.41 s [vector] foldl1': OK
  8172. 860.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8173. 860.41 s [vector] foldr: OK
  8174. 860.41 s [vector] +++ OK, passed 100 tests.
  8175. 860.41 s [vector] foldr1: OK
  8176. 860.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8177. 860.42 s [vector] foldr': OK
  8178. 860.42 s [vector] +++ OK, passed 100 tests.
  8179. 860.42 s [vector] foldr1': OK
  8180. 860.42 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8181. 860.42 s [vector] ifoldl: OK
  8182. 860.42 s [vector] +++ OK, passed 100 tests.
  8183. 860.43 s [vector] ifoldl': OK
  8184. 860.43 s [vector] +++ OK, passed 100 tests.
  8185. 860.43 s [vector] ifoldr: OK
  8186. 860.43 s [vector] +++ OK, passed 100 tests.
  8187. 860.43 s [vector] ifoldr': OK
  8188. 860.43 s [vector] +++ OK, passed 100 tests.
  8189. 860.43 s [vector] ifoldM: OK
  8190. 860.43 s [vector] +++ OK, passed 100 tests.
  8191. 860.45 s [vector] ifoldM': OK
  8192. 860.45 s [vector] +++ OK, passed 100 tests.
  8193. 860.45 s [vector] ifoldM_: OK (0.02s)
  8194. 860.46 s [vector] +++ OK, passed 100 tests.
  8195. 860.47 s [vector] ifoldM'_: OK (0.01s)
  8196. 860.47 s [vector] +++ OK, passed 100 tests.
  8197. 860.47 s [vector] all: OK
  8198. 860.47 s [vector] +++ OK, passed 100 tests.
  8199. 860.47 s [vector] any: OK
  8200. 860.47 s [vector] +++ OK, passed 100 tests.
  8201. 860.47 s [vector] prescanl: OK
  8202. 860.47 s [vector] +++ OK, passed 100 tests.
  8203. 860.48 s [vector] prescanl': OK
  8204. 860.48 s [vector] +++ OK, passed 100 tests.
  8205. 860.49 s [vector] postscanl: OK
  8206. 860.49 s [vector] +++ OK, passed 100 tests.
  8207. 860.49 s [vector] postscanl': OK
  8208. 860.49 s [vector] +++ OK, passed 100 tests.
  8209. 860.49 s [vector] scanl: OK
  8210. 860.49 s [vector] +++ OK, passed 100 tests.
  8211. 860.50 s [vector] scanl': OK
  8212. 860.50 s [vector] +++ OK, passed 100 tests.
  8213. 860.50 s [vector] scanl1: OK
  8214. 860.50 s [vector] +++ OK, passed 100 tests.
  8215. 860.50 s [vector] scanl1': OK
  8216. 860.50 s [vector] +++ OK, passed 100 tests.
  8217. 860.50 s [vector] iscanl: OK
  8218. 860.51 s [vector] +++ OK, passed 100 tests.
  8219. 860.51 s [vector] iscanl': OK
  8220. 860.51 s [vector] +++ OK, passed 100 tests.
  8221. 860.51 s [vector] prescanr: OK
  8222. 860.51 s [vector] +++ OK, passed 100 tests.
  8223. 860.51 s [vector] prescanr': OK
  8224. 860.51 s [vector] +++ OK, passed 100 tests.
  8225. 860.52 s [vector] postscanr: OK
  8226. 860.52 s [vector] +++ OK, passed 100 tests.
  8227. 860.52 s [vector] postscanr': OK
  8228. 860.52 s [vector] +++ OK, passed 100 tests.
  8229. 860.52 s [vector] scanr: OK
  8230. 860.52 s [vector] +++ OK, passed 100 tests.
  8231. 860.52 s [vector] scanr': OK
  8232. 860.52 s [vector] +++ OK, passed 100 tests.
  8233. 860.53 s [vector] scanr1: OK
  8234. 860.53 s [vector] +++ OK, passed 100 tests.
  8235. 860.53 s [vector] scanr1': OK
  8236. 860.53 s [vector] +++ OK, passed 100 tests.
  8237. 860.53 s [vector] iscanr: OK
  8238. 860.53 s [vector] +++ OK, passed 100 tests.
  8239. 860.53 s [vector] iscanr': OK
  8240. 860.54 s [vector] +++ OK, passed 100 tests.
  8241. 860.54 s [vector] mut_read: OK
  8242. 860.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8243. 860.54 s [vector] mut_write: OK
  8244. 860.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8245. 860.54 s [vector] mut_modify: OK
  8246. 860.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8247. 860.54 s [vector] mut_generate: OK
  8248. 860.54 s [vector] +++ OK, passed 100 tests.
  8249. 860.55 s [vector] mut_generateM: OK
  8250. 860.55 s [vector] +++ OK, passed 100 tests.
  8251. 860.57 s [vector] mut_mapM_: OK (0.01s)
  8252. 860.57 s [vector] +++ OK, passed 100 tests.
  8253. 860.59 s [vector] mut_imapM_: OK (0.01s)
  8254. 860.59 s [vector] +++ OK, passed 100 tests.
  8255. 860.59 s [vector] mut_forM_: OK (0.01s)
  8256. 860.59 s [vector] +++ OK, passed 100 tests.
  8257. 860.61 s [vector] mut_iforM_: OK (0.02s)
  8258. 860.61 s [vector] +++ OK, passed 100 tests.
  8259. 860.61 s [vector] mut_foldr: OK
  8260. 860.61 s [vector] +++ OK, passed 100 tests.
  8261. 860.61 s [vector] mut_foldr': OK
  8262. 860.61 s [vector] +++ OK, passed 100 tests.
  8263. 860.61 s [vector] mut_foldl: OK
  8264. 860.62 s [vector] +++ OK, passed 100 tests.
  8265. 860.62 s [vector] mut_foldl': OK
  8266. 860.62 s [vector] +++ OK, passed 100 tests.
  8267. 860.62 s [vector] mut_ifoldr: OK
  8268. 860.62 s [vector] +++ OK, passed 100 tests.
  8269. 860.62 s [vector] mut_ifoldr': OK
  8270. 860.63 s [vector] +++ OK, passed 100 tests.
  8271. 860.63 s [vector] mut_ifoldl: OK
  8272. 860.63 s [vector] +++ OK, passed 100 tests.
  8273. 860.63 s [vector] mut_ifoldl': OK
  8274. 860.63 s [vector] +++ OK, passed 100 tests.
  8275. 860.63 s [vector] mut_foldM: OK
  8276. 860.63 s [vector] +++ OK, passed 100 tests.
  8277. 860.64 s [vector] mut_foldM': OK
  8278. 860.64 s [vector] +++ OK, passed 100 tests.
  8279. 860.64 s [vector] mut_foldrM: OK
  8280. 860.65 s [vector] +++ OK, passed 100 tests.
  8281. 860.65 s [vector] mut_foldrM': OK
  8282. 860.65 s [vector] +++ OK, passed 100 tests.
  8283. 860.65 s [vector] mut_ifoldM: OK
  8284. 860.65 s [vector] +++ OK, passed 100 tests.
  8285. 860.65 s [vector] mut_ifoldM': OK
  8286. 860.65 s [vector] +++ OK, passed 100 tests.
  8287. 860.65 s [vector] mut_ifoldrM: OK
  8288. 860.65 s [vector] +++ OK, passed 100 tests.
  8289. 860.65 s [vector] mut_ifoldrM': OK
  8290. 860.65 s [vector] +++ OK, passed 100 tests.
  8291. 860.65 s [vector] compare: OK
  8292. 860.65 s [vector] +++ OK, passed 100 tests.
  8293. 860.65 s [vector] maximum: OK
  8294. 860.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8295. 860.65 s [vector] minimum: OK
  8296. 860.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8297. 860.66 s [vector] minIndex: OK
  8298. 860.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8299. 860.66 s [vector] maxIndex: OK
  8300. 860.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8301. 860.66 s [vector] maximumBy: OK
  8302. 860.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8303. 860.66 s [vector] minimumBy: OK
  8304. 860.66 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8305. 860.66 s [vector] maximumOn: OK
  8306. 860.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8307. 860.66 s [vector] minimumOn: OK
  8308. 860.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8309. 860.66 s [vector] maxIndexBy: OK
  8310. 860.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8311. 860.66 s [vector] minIndexBy: OK
  8312. 860.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8313. 860.66 s [vector] ListFirstMaxIndexWins: OK
  8314. 860.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8315. 860.66 s [vector] FalseListFirstMaxIndexWins: OK
  8316. 860.66 s [vector] +++ OK, failed as expected. (after 1 test):
  8317. 860.66 s [vector] Exception:
  8318. 860.66 s [vector] Prelude.foldr1: empty list
  8319. 860.66 s [vector] CallStack (from HasCallStack):
  8320. 860.66 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  8321. 860.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  8322. 860.66 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8323. 860.66 s [vector] []
  8324. 860.66 s [vector] zip: OK
  8325. 860.66 s [vector] +++ OK, passed 100 tests.
  8326. 860.66 s [vector] zip3: OK
  8327. 860.66 s [vector] +++ OK, passed 100 tests.
  8328. 860.66 s [vector] unzip: OK
  8329. 860.66 s [vector] +++ OK, passed 100 tests.
  8330. 860.66 s [vector] unzip3: OK
  8331. 860.66 s [vector] +++ OK, passed 100 tests.
  8332. 860.66 s [vector] indexed: OK
  8333. 860.66 s [vector] +++ OK, passed 100 tests.
  8334. 860.68 s [vector] update: OK
  8335. 860.68 s [vector] +++ OK, passed 100 tests.
  8336. 860.68 s [vector] concat: OK (0.01s)
  8337. 860.68 s [vector] +++ OK, passed 100 tests.
  8338. 860.68 s [vector] mempty: OK
  8339. 860.68 s [vector] +++ OK, passed 1 test.
  8340. 860.68 s [vector] mappend: OK
  8341. 860.69 s [vector] +++ OK, passed 100 tests.
  8342. 860.69 s [vector] mconcat: OK (0.01s)
  8343. 860.69 s [vector] +++ OK, passed 100 tests.
  8344. 860.69 s [vector] fmap: OK
  8345. 860.69 s [vector] +++ OK, passed 100 tests.
  8346. 860.69 s [vector] return: OK
  8347. 860.69 s [vector] +++ OK, passed 100 tests.
  8348. 860.71 s [vector] bind: OK (0.02s)
  8349. 860.71 s [vector] +++ OK, passed 100 tests.
  8350. 860.71 s [vector] mzip: OK
  8351. 860.71 s [vector] +++ OK, passed 100 tests.
  8352. 860.71 s [vector] munzip: OK
  8353. 860.71 s [vector] +++ OK, passed 100 tests.
  8354. 860.71 s [vector] applicative_pure: OK
  8355. 860.71 s [vector] +++ OK, passed 100 tests.
  8356. 860.74 s [vector] applicative_appl: OK (0.03s)
  8357. 860.74 s [vector] +++ OK, passed 100 tests.
  8358. 860.74 s [vector] alternative_empty: OK
  8359. 860.74 s [vector] +++ OK, passed 1 test.
  8360. 860.74 s [vector] alternative_or: OK
  8361. 860.74 s [vector] +++ OK, passed 100 tests.
  8362. 860.77 s [vector] sequence: OK (0.03s)
  8363. 860.77 s [vector] +++ OK, passed 100 tests.
  8364. 860.78 s [vector] sequence_: OK (0.01s)
  8365. 860.78 s [vector] +++ OK, passed 100 tests.
  8366. 860.78 s [vector] glength: OK
  8367. 860.78 s [vector] +++ OK, passed 100 tests.
  8368. 860.78 s [vector] sum: OK
  8369. 860.78 s [vector] +++ OK, passed 100 tests.
  8370. 860.78 s [vector] product: OK
  8371. 860.78 s [vector] +++ OK, passed 100 tests.
  8372. 860.78 s [vector] enumFromN: OK
  8373. 860.78 s [vector] +++ OK, passed 100 tests.
  8374. 860.78 s [vector] enumFromThenN: OK
  8375. 860.78 s [vector] +++ OK, passed 100 tests.
  8376. 860.78 s [vector] enumFromTo: OK
  8377. 860.78 s [vector] +++ OK, passed 100 tests.
  8378. 860.78 s [vector] enumFromThenTo: OK
  8379. 860.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8380. 860.78 s [vector] unstream
  8381. 860.78 s [vector] unstream == vunstream (exact): OK
  8382. 860.78 s [vector] +++ OK, passed 100 tests.
  8383. 860.78 s [vector] unstream == vunstream (unknown): OK
  8384. 860.78 s [vector] +++ OK, passed 100 tests.
  8385. 860.78 s [vector] unstreamR ~= vunstream (exact): OK
  8386. 860.78 s [vector] +++ OK, passed 100 tests.
  8387. 860.78 s [vector] unstreamR ~= vunstream (unknown): OK
  8388. 860.78 s [vector] +++ OK, passed 100 tests.
  8389. 860.78 s [vector] Tests.Vector.Unboxed
  8390. 860.78 s [vector] ()
  8391. 860.78 s [vector] fromList.toList == id: OK
  8392. 860.78 s [vector] +++ OK, passed 100 tests.
  8393. 860.78 s [vector] toList.fromList == id: OK
  8394. 860.78 s [vector] +++ OK, passed 100 tests.
  8395. 860.78 s [vector] unstream.stream == id: OK
  8396. 860.78 s [vector] +++ OK, passed 100 tests.
  8397. 860.79 s [vector] stream.unstream == id: OK
  8398. 860.79 s [vector] +++ OK, passed 100 tests.
  8399. 860.79 s [vector] eq: OK
  8400. 860.79 s [vector] +++ OK, passed 100 tests.
  8401. 860.79 s [vector] length: OK
  8402. 860.79 s [vector] +++ OK, passed 100 tests.
  8403. 860.79 s [vector] null: OK
  8404. 860.79 s [vector] +++ OK, passed 100 tests.
  8405. 860.79 s [vector] index: OK
  8406. 860.79 s [vector] +++ OK, passed 100 tests; 27 discarded.
  8407. 860.79 s [vector] safeIndex: OK
  8408. 860.79 s [vector] +++ OK, passed 100 tests.
  8409. 860.79 s [vector] head: OK
  8410. 860.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8411. 860.79 s [vector] last: OK
  8412. 860.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8413. 860.79 s [vector] unsafeIndex: OK
  8414. 860.79 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8415. 860.79 s [vector] unsafeHead: OK
  8416. 860.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8417. 860.79 s [vector] unsafeLast: OK
  8418. 860.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8419. 860.79 s [vector] slice: OK
  8420. 860.79 s [vector] +++ OK, passed 100 tests.
  8421. 860.79 s [vector] init: OK
  8422. 860.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8423. 860.79 s [vector] tail: OK
  8424. 860.79 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8425. 860.79 s [vector] take: OK
  8426. 860.79 s [vector] +++ OK, passed 100 tests.
  8427. 860.79 s [vector] drop: OK
  8428. 860.79 s [vector] +++ OK, passed 100 tests.
  8429. 860.79 s [vector] splitAt: OK
  8430. 860.79 s [vector] +++ OK, passed 100 tests.
  8431. 860.79 s [vector] empty: OK
  8432. 860.79 s [vector] +++ OK, passed 1 test.
  8433. 860.79 s [vector] singleton: OK
  8434. 860.79 s [vector] +++ OK, passed 100 tests.
  8435. 860.79 s [vector] replicate: OK
  8436. 860.79 s [vector] +++ OK, passed 100 tests.
  8437. 860.79 s [vector] generate: OK
  8438. 860.79 s [vector] +++ OK, passed 100 tests.
  8439. 860.80 s [smallcheck] Warning: Test.SmallCheck.Series: could not find link destinations for:
  8440. 860.80 s [smallcheck] - Test.SmallCheck.Series.GCoSerial
  8441. 860.80 s [smallcheck] - Test.SmallCheck.Series.GSerial
  8442. 860.81 s [vector] iterateN: OK
  8443. 860.81 s [vector] +++ OK, passed 100 tests.
  8444. 860.81 s [vector] iterateNM: OK (0.02s)
  8445. 860.81 s [vector] +++ OK, passed 100 tests.
  8446. 861.00 s [vector] generateM: OK (0.16s)
  8447. 861.00 s [vector] +++ OK, passed 100 tests.
  8448. 861.00 s [vector] replicateM: OK (0.02s)
  8449. 861.00 s [vector] +++ OK, passed 100 tests.
  8450. 861.00 s [vector] create: OK
  8451. 861.00 s [vector] +++ OK, passed 100 tests.
  8452. 861.00 s [vector] createT: OK
  8453. 861.00 s [vector] +++ OK, passed 100 tests.
  8454. 861.00 s [vector] unfoldr: OK
  8455. 861.00 s [vector] +++ OK, passed 100 tests.
  8456. 861.00 s [vector] unfoldrN: OK
  8457. 861.00 s [vector] +++ OK, passed 100 tests.
  8458. 861.00 s [vector] unfoldrExactN: OK
  8459. 861.00 s [vector] +++ OK, passed 100 tests.
  8460. 861.00 s [vector] unfoldrM: OK
  8461. 861.00 s [vector] +++ OK, passed 100 tests.
  8462. 861.01 s [vector] unfoldrNM: OK
  8463. 861.01 s [vector] +++ OK, passed 100 tests.
  8464. 861.02 s [vector] unfoldrExactNM: OK (0.02s)
  8465. 861.02 s [vector] +++ OK, passed 100 tests.
  8466. 861.02 s [vector] constructN: OK
  8467. 861.02 s [vector] +++ OK, passed 100 tests.
  8468. 861.02 s [vector] constructrN: OK
  8469. 861.02 s [vector] +++ OK, passed 100 tests.
  8470. 861.02 s [vector] cons: OK
  8471. 861.02 s [vector] +++ OK, passed 100 tests.
  8472. 861.02 s [vector] snoc: OK
  8473. 861.02 s [vector] +++ OK, passed 100 tests.
  8474. 861.02 s [vector] append: OK
  8475. 861.03 s [vector] +++ OK, passed 100 tests.
  8476. 861.04 s [vector] concat: OK (0.01s)
  8477. 861.04 s [vector] +++ OK, passed 100 tests.
  8478. 861.04 s [vector] force: OK
  8479. 861.04 s [vector] +++ OK, passed 100 tests.
  8480. 861.04 s [vector] upd: OK
  8481. 861.04 s [vector] +++ OK, passed 100 tests.
  8482. 861.04 s [vector] accum: OK
  8483. 861.04 s [vector] +++ OK, passed 100 tests.
  8484. 861.04 s [vector] reverse: OK
  8485. 861.04 s [vector] +++ OK, passed 100 tests.
  8486. 861.04 s [vector] backpermute: OK
  8487. 861.04 s [vector] +++ OK, passed 100 tests.
  8488. 861.04 s [vector] map: OK
  8489. 861.04 s [vector] +++ OK, passed 100 tests.
  8490. 861.04 s [vector] imap: OK
  8491. 861.04 s [vector] +++ OK, passed 100 tests.
  8492. 861.04 s [vector] concatMap: OK
  8493. 861.05 s [vector] +++ OK, passed 100 tests.
  8494. 861.05 s [vector] mapM: OK
  8495. 861.06 s [vector] +++ OK, passed 100 tests.
  8496. 861.06 s [vector] mapM_: OK
  8497. 861.06 s [vector] +++ OK, passed 100 tests.
  8498. 861.07 s [vector] forM: OK
  8499. 861.07 s [vector] +++ OK, passed 100 tests.
  8500. 861.07 s [vector] forM_: OK
  8501. 861.07 s [vector] +++ OK, passed 100 tests.
  8502. 861.07 s [vector] imapM: OK
  8503. 861.07 s [vector] +++ OK, passed 100 tests.
  8504. 861.08 s [vector] imapM_: OK
  8505. 861.08 s [vector] +++ OK, passed 100 tests.
  8506. 861.08 s [vector] zipWith: OK
  8507. 861.08 s [vector] +++ OK, passed 100 tests.
  8508. 861.08 s [vector] zipWith3: OK
  8509. 861.08 s [vector] +++ OK, passed 100 tests.
  8510. 861.08 s [vector] izipWith: OK
  8511. 861.08 s [vector] +++ OK, passed 100 tests.
  8512. 861.08 s [vector] izipWith3: OK
  8513. 861.08 s [vector] +++ OK, passed 100 tests.
  8514. 861.09 s [vector] izipWithM: OK
  8515. 861.09 s [vector] +++ OK, passed 100 tests.
  8516. 861.09 s [vector] izipWithM_: OK
  8517. 861.09 s [vector] +++ OK, passed 100 tests.
  8518. 861.09 s [vector] zipWithM: OK
  8519. 861.09 s [vector] +++ OK, passed 100 tests.
  8520. 861.10 s [vector] zipWithM_: OK
  8521. 861.10 s [vector] +++ OK, passed 100 tests.
  8522. 861.10 s [vector] filter: OK
  8523. 861.10 s [vector] +++ OK, passed 100 tests.
  8524. 861.10 s [vector] ifilter: OK
  8525. 861.12 s [vector] +++ OK, passed 100 tests.
  8526. 861.12 s [vector] filterM: OK (0.02s)
  8527. 861.12 s [vector] +++ OK, passed 100 tests.
  8528. 861.12 s [vector] uniq: OK
  8529. 861.12 s [vector] +++ OK, passed 100 tests.
  8530. 861.12 s [vector] mapMaybe: OK
  8531. 861.12 s [vector] +++ OK, passed 100 tests.
  8532. 861.12 s [vector] imapMaybe: OK
  8533. 861.12 s [vector] +++ OK, passed 100 tests.
  8534. 861.12 s [vector] takeWhile: OK
  8535. 861.12 s [vector] +++ OK, passed 100 tests.
  8536. 861.13 s [vector] dropWhile: OK
  8537. 861.13 s [vector] +++ OK, passed 100 tests.
  8538. 861.13 s [vector] partition: OK
  8539. 861.13 s [vector] +++ OK, passed 100 tests.
  8540. 861.13 s [vector] partitionWith: OK
  8541. 861.13 s [vector] +++ OK, passed 100 tests.
  8542. 861.13 s [vector] span: OK
  8543. 861.13 s [vector] +++ OK, passed 100 tests.
  8544. 861.14 s [vector] break: OK
  8545. 861.14 s [vector] +++ OK, passed 100 tests.
  8546. 861.14 s [vector] spanR: OK
  8547. 861.14 s [vector] +++ OK, passed 100 tests.
  8548. 861.14 s [vector] breakR: OK
  8549. 861.14 s [vector] +++ OK, passed 100 tests.
  8550. 861.14 s [vector] groupBy: OK
  8551. 861.14 s [vector] +++ OK, passed 100 tests.
  8552. 861.14 s [vector] elem: OK
  8553. 861.14 s [vector] +++ OK, passed 100 tests.
  8554. 861.14 s [vector] notElem: OK
  8555. 861.14 s [vector] +++ OK, passed 100 tests.
  8556. 861.14 s [vector] find: OK
  8557. 861.14 s [vector] +++ OK, passed 100 tests.
  8558. 861.14 s [vector] findIndex: OK
  8559. 861.14 s [vector] +++ OK, passed 100 tests.
  8560. 861.14 s [vector] findIndexR: OK
  8561. 861.14 s [vector] +++ OK, passed 100 tests.
  8562. 861.14 s [vector] findIndices: OK
  8563. 861.14 s [vector] +++ OK, passed 100 tests.
  8564. 861.14 s [vector] elemIndex: OK
  8565. 861.14 s [vector] +++ OK, passed 100 tests.
  8566. 861.14 s [vector] elemIndices: OK
  8567. 861.14 s [vector] +++ OK, passed 100 tests.
  8568. 861.14 s [vector] foldl: OK
  8569. 861.14 s [vector] +++ OK, passed 100 tests.
  8570. 861.14 s [vector] foldl1: OK
  8571. 861.14 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8572. 861.14 s [vector] foldl': OK
  8573. 861.14 s [vector] +++ OK, passed 100 tests.
  8574. 861.14 s [vector] foldl1': OK
  8575. 861.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8576. 861.14 s [vector] foldr: OK
  8577. 861.14 s [vector] +++ OK, passed 100 tests.
  8578. 861.14 s [vector] foldr1: OK
  8579. 861.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8580. 861.14 s [vector] foldr': OK
  8581. 861.14 s [vector] +++ OK, passed 100 tests.
  8582. 861.14 s [vector] foldr1': OK
  8583. 861.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8584. 861.14 s [vector] ifoldl: OK
  8585. 861.14 s [vector] +++ OK, passed 100 tests.
  8586. 861.14 s [vector] ifoldl': OK
  8587. 861.14 s [vector] +++ OK, passed 100 tests.
  8588. 861.14 s [vector] ifoldr: OK
  8589. 861.14 s [vector] +++ OK, passed 100 tests.
  8590. 861.14 s [vector] ifoldr': OK
  8591. 861.14 s [vector] +++ OK, passed 100 tests.
  8592. 861.15 s [vector] ifoldM: OK
  8593. 861.15 s [vector] +++ OK, passed 100 tests.
  8594. 861.15 s [vector] ifoldM': OK
  8595. 861.15 s [vector] +++ OK, passed 100 tests.
  8596. 861.15 s [vector] ifoldM_: OK
  8597. 861.15 s [vector] +++ OK, passed 100 tests.
  8598. 861.16 s [vector] ifoldM'_: OK
  8599. 861.16 s [vector] +++ OK, passed 100 tests.
  8600. 861.16 s [vector] all: OK
  8601. 861.16 s [vector] +++ OK, passed 100 tests.
  8602. 861.16 s [vector] any: OK
  8603. 861.16 s [vector] +++ OK, passed 100 tests.
  8604. 861.16 s [vector] prescanl: OK
  8605. 861.16 s [vector] +++ OK, passed 100 tests.
  8606. 861.16 s [vector] prescanl': OK
  8607. 861.16 s [vector] +++ OK, passed 100 tests.
  8608. 861.16 s [vector] postscanl: OK
  8609. 861.16 s [vector] +++ OK, passed 100 tests.
  8610. 861.16 s [vector] postscanl': OK
  8611. 861.17 s [vector] +++ OK, passed 100 tests.
  8612. 861.17 s [vector] scanl: OK
  8613. 861.17 s [vector] +++ OK, passed 100 tests.
  8614. 861.17 s [vector] scanl': OK
  8615. 861.17 s [vector] +++ OK, passed 100 tests.
  8616. 861.17 s [vector] scanl1: OK
  8617. 861.17 s [vector] +++ OK, passed 100 tests.
  8618. 861.17 s [vector] scanl1': OK
  8619. 861.17 s [vector] +++ OK, passed 100 tests.
  8620. 861.17 s [vector] iscanl: OK
  8621. 861.17 s [vector] +++ OK, passed 100 tests.
  8622. 861.17 s [vector] iscanl': OK
  8623. 861.17 s [vector] +++ OK, passed 100 tests.
  8624. 861.17 s [vector] prescanr: OK
  8625. 861.17 s [vector] +++ OK, passed 100 tests.
  8626. 861.17 s [vector] prescanr': OK
  8627. 861.17 s [vector] +++ OK, passed 100 tests.
  8628. 861.17 s [vector] postscanr: OK
  8629. 861.17 s [vector] +++ OK, passed 100 tests.
  8630. 861.17 s [vector] postscanr': OK
  8631. 861.17 s [vector] +++ OK, passed 100 tests.
  8632. 861.17 s [vector] scanr: OK
  8633. 861.17 s [vector] +++ OK, passed 100 tests.
  8634. 861.18 s [vector] scanr': OK
  8635. 861.18 s [vector] +++ OK, passed 100 tests.
  8636. 861.18 s [vector] scanr1: OK
  8637. 861.18 s [vector] +++ OK, passed 100 tests.
  8638. 861.18 s [vector] scanr1': OK
  8639. 861.18 s [vector] +++ OK, passed 100 tests.
  8640. 861.18 s [vector] iscanr: OK
  8641. 861.18 s [vector] +++ OK, passed 100 tests.
  8642. 861.18 s [vector] iscanr': OK
  8643. 861.18 s [vector] +++ OK, passed 100 tests.
  8644. 861.18 s [vector] mut_read: OK
  8645. 861.18 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8646. 861.18 s [vector] mut_write: OK
  8647. 861.18 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8648. 861.18 s [vector] mut_modify: OK
  8649. 861.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8650. 861.18 s [vector] mut_generate: OK
  8651. 861.19 s [vector] +++ OK, passed 100 tests.
  8652. 861.19 s [vector] mut_generateM: OK
  8653. 861.19 s [vector] +++ OK, passed 100 tests.
  8654. 861.19 s [vector] mut_mapM_: OK
  8655. 861.20 s [vector] +++ OK, passed 100 tests.
  8656. 861.21 s [vector] mut_imapM_: OK
  8657. 861.21 s [vector] +++ OK, passed 100 tests.
  8658. 861.21 s [vector] mut_forM_: OK
  8659. 861.21 s [vector] +++ OK, passed 100 tests.
  8660. 861.22 s [vector] mut_iforM_: OK
  8661. 861.22 s [vector] +++ OK, passed 100 tests.
  8662. 861.22 s [vector] mut_foldr: OK
  8663. 861.22 s [vector] +++ OK, passed 100 tests.
  8664. 861.22 s [vector] mut_foldr': OK
  8665. 861.22 s [vector] +++ OK, passed 100 tests.
  8666. 861.22 s [vector] mut_foldl: OK
  8667. 861.22 s [vector] +++ OK, passed 100 tests.
  8668. 861.22 s [vector] mut_foldl': OK
  8669. 861.22 s [vector] +++ OK, passed 100 tests.
  8670. 861.22 s [vector] mut_ifoldr: OK
  8671. 861.22 s [vector] +++ OK, passed 100 tests.
  8672. 861.22 s [vector] mut_ifoldr': OK
  8673. 861.22 s [vector] +++ OK, passed 100 tests.
  8674. 861.22 s [vector] mut_ifoldl: OK
  8675. 861.22 s [vector] +++ OK, passed 100 tests.
  8676. 861.22 s [vector] mut_ifoldl': OK
  8677. 861.22 s [vector] +++ OK, passed 100 tests.
  8678. 861.22 s [vector] mut_foldM: OK
  8679. 861.22 s [vector] +++ OK, passed 100 tests.
  8680. 861.22 s [vector] mut_foldM': OK
  8681. 861.22 s [vector] +++ OK, passed 100 tests.
  8682. 861.22 s [vector] mut_foldrM: OK
  8683. 861.22 s [vector] +++ OK, passed 100 tests.
  8684. 861.22 s [vector] mut_foldrM': OK
  8685. 861.22 s [vector] +++ OK, passed 100 tests.
  8686. 861.22 s [vector] mut_ifoldM: OK
  8687. 861.22 s [vector] +++ OK, passed 100 tests.
  8688. 861.22 s [vector] mut_ifoldM': OK
  8689. 861.22 s [vector] +++ OK, passed 100 tests.
  8690. 861.22 s [vector] mut_ifoldrM: OK
  8691. 861.22 s [vector] +++ OK, passed 100 tests.
  8692. 861.22 s [vector] mut_ifoldrM': OK
  8693. 861.22 s [vector] +++ OK, passed 100 tests.
  8694. 861.22 s [vector] compare: OK
  8695. 861.23 s [vector] +++ OK, passed 100 tests.
  8696. 861.23 s [vector] maximum: OK
  8697. 861.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8698. 861.23 s [vector] minimum: OK
  8699. 861.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8700. 861.23 s [vector] minIndex: OK
  8701. 861.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8702. 861.23 s [vector] maxIndex: OK
  8703. 861.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8704. 861.23 s [vector] maximumBy: OK
  8705. 861.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8706. 861.23 s [vector] minimumBy: OK
  8707. 861.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8708. 861.23 s [vector] maximumOn: OK
  8709. 861.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8710. 861.23 s [vector] minimumOn: OK
  8711. 861.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8712. 861.23 s [vector] maxIndexBy: OK
  8713. 861.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8714. 861.23 s [vector] minIndexBy: OK
  8715. 861.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8716. 861.23 s [vector] ListFirstMaxIndexWins: OK
  8717. 861.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8718. 861.23 s [vector] FalseListFirstMaxIndexWins: OK
  8719. 861.23 s [vector] +++ OK, failed as expected. (after 1 test):
  8720. 861.23 s [vector] Exception:
  8721. 861.23 s [vector] Prelude.foldr1: empty list
  8722. 861.23 s [vector] CallStack (from HasCallStack):
  8723. 861.23 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  8724. 861.23 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  8725. 861.23 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8726. 861.23 s [vector] []
  8727. 861.23 s [vector] zip: OK
  8728. 861.23 s [vector] +++ OK, passed 100 tests.
  8729. 861.23 s [vector] zip3: OK
  8730. 861.23 s [vector] +++ OK, passed 100 tests.
  8731. 861.23 s [vector] unzip: OK
  8732. 861.23 s [vector] +++ OK, passed 100 tests.
  8733. 861.23 s [vector] unzip3: OK
  8734. 861.23 s [vector] +++ OK, passed 100 tests.
  8735. 861.23 s [vector] indexed: OK
  8736. 861.23 s [vector] +++ OK, passed 100 tests.
  8737. 861.23 s [vector] update: OK
  8738. 861.23 s [vector] +++ OK, passed 100 tests.
  8739. 861.23 s [vector] mempty: OK
  8740. 861.23 s [vector] +++ OK, passed 1 test.
  8741. 861.24 s [vector] mappend: OK
  8742. 861.24 s [vector] +++ OK, passed 100 tests.
  8743. 861.24 s [vector] mconcat: OK
  8744. 861.24 s [vector] +++ OK, passed 100 tests.
  8745. 861.24 s [vector] glength: OK
  8746. 861.24 s [vector] +++ OK, passed 100 tests.
  8747. 861.24 s [vector] (Bool)
  8748. 861.24 s [vector] fromList.toList == id: OK
  8749. 861.25 s [vector] +++ OK, passed 100 tests.
  8750. 861.25 s [vector] toList.fromList == id: OK
  8751. 861.25 s [vector] +++ OK, passed 100 tests.
  8752. 861.25 s [vector] unstream.stream == id: OK
  8753. 861.25 s [vector] +++ OK, passed 100 tests.
  8754. 861.26 s [vector] stream.unstream == id: OK
  8755. 861.26 s [vector] +++ OK, passed 100 tests.
  8756. 861.26 s [vector] eq: OK
  8757. 861.26 s [vector] +++ OK, passed 100 tests.
  8758. 861.26 s [vector] length: OK
  8759. 861.26 s [vector] +++ OK, passed 100 tests.
  8760. 861.26 s [vector] null: OK
  8761. 861.26 s [vector] +++ OK, passed 100 tests.
  8762. 861.26 s [vector] index: OK
  8763. 861.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8764. 861.26 s [vector] safeIndex: OK
  8765. 861.26 s [vector] +++ OK, passed 100 tests.
  8766. 861.26 s [vector] head: OK
  8767. 861.26 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8768. 861.26 s [vector] last: OK
  8769. 861.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8770. 861.26 s [vector] unsafeIndex: OK
  8771. 861.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8772. 861.26 s [vector] unsafeHead: OK
  8773. 861.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8774. 861.26 s [vector] unsafeLast: OK
  8775. 861.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8776. 861.26 s [vector] slice: OK
  8777. 861.26 s [vector] +++ OK, passed 100 tests.
  8778. 861.26 s [vector] init: OK
  8779. 861.26 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8780. 861.26 s [vector] tail: OK
  8781. 861.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8782. 861.26 s [vector] take: OK
  8783. 861.26 s [vector] +++ OK, passed 100 tests.
  8784. 861.26 s [vector] drop: OK
  8785. 861.26 s [vector] +++ OK, passed 100 tests.
  8786. 861.26 s [vector] splitAt: OK
  8787. 861.26 s [vector] +++ OK, passed 100 tests.
  8788. 861.26 s [vector] empty: OK
  8789. 861.26 s [vector] +++ OK, passed 1 test.
  8790. 861.26 s [vector] singleton: OK
  8791. 861.26 s [vector] +++ OK, passed 100 tests.
  8792. 861.26 s [vector] replicate: OK
  8793. 861.26 s [vector] +++ OK, passed 100 tests.
  8794. 861.26 s [vector] generate: OK
  8795. 861.26 s [vector] +++ OK, passed 100 tests.
  8796. 861.27 s [vector] iterateN: OK
  8797. 861.27 s [vector] +++ OK, passed 100 tests.
  8798. 861.27 s [vector] iterateNM: OK (0.01s)
  8799. 861.27 s [vector] +++ OK, passed 100 tests.
  8800. 861.29 s [vector] generateM: OK
  8801. 861.29 s [vector] +++ OK, passed 100 tests.
  8802. 861.30 s [vector] replicateM: OK (0.02s)
  8803. 861.30 s [vector] +++ OK, passed 100 tests.
  8804. 861.30 s [vector] create: OK
  8805. 861.30 s [vector] +++ OK, passed 100 tests.
  8806. 861.30 s [vector] createT: OK
  8807. 861.30 s [vector] +++ OK, passed 100 tests.
  8808. 861.30 s [vector] unfoldr: OK
  8809. 861.30 s [vector] +++ OK, passed 100 tests.
  8810. 861.30 s [vector] unfoldrN: OK
  8811. 861.30 s [vector] +++ OK, passed 100 tests.
  8812. 861.30 s [vector] unfoldrExactN: OK
  8813. 861.30 s [vector] +++ OK, passed 100 tests.
  8814. 861.30 s [vector] unfoldrM: OK
  8815. 861.30 s [vector] +++ OK, passed 100 tests.
  8816. 861.31 s [vector] unfoldrNM: OK
  8817. 861.31 s [vector] +++ OK, passed 100 tests.
  8818. 861.33 s [vector] unfoldrExactNM: OK (0.02s)
  8819. 861.33 s [vector] +++ OK, passed 100 tests.
  8820. 861.33 s [vector] constructN: OK
  8821. 861.33 s [vector] +++ OK, passed 100 tests.
  8822. 861.33 s [vector] constructrN: OK
  8823. 861.33 s [vector] +++ OK, passed 100 tests.
  8824. 861.33 s [vector] cons: OK
  8825. 861.33 s [vector] +++ OK, passed 100 tests.
  8826. 861.33 s [vector] snoc: OK
  8827. 861.33 s [vector] +++ OK, passed 100 tests.
  8828. 861.34 s [vector] append: OK
  8829. 861.34 s [vector] +++ OK, passed 100 tests.
  8830. 861.35 s [vector] concat: OK (0.01s)
  8831. 861.35 s [vector] +++ OK, passed 100 tests.
  8832. 861.35 s [vector] force: OK
  8833. 861.35 s [vector] +++ OK, passed 100 tests.
  8834. 861.35 s [vector] upd: OK
  8835. 861.35 s [vector] +++ OK, passed 100 tests.
  8836. 861.35 s [vector] accum: OK
  8837. 861.35 s [vector] +++ OK, passed 100 tests.
  8838. 861.35 s [vector] reverse: OK
  8839. 861.35 s [vector] +++ OK, passed 100 tests.
  8840. 861.35 s [vector] backpermute: OK
  8841. 861.35 s [vector] +++ OK, passed 100 tests.
  8842. 861.36 s [vector] map: OK
  8843. 861.36 s [vector] +++ OK, passed 100 tests.
  8844. 861.36 s [vector] imap: OK
  8845. 861.36 s [vector] +++ OK, passed 100 tests.
  8846. 861.36 s [vector] concatMap: OK
  8847. 861.36 s [vector] +++ OK, passed 100 tests.
  8848. 861.36 s [vector] mapM: OK
  8849. 861.37 s [vector] +++ OK, passed 100 tests.
  8850. 861.37 s [vector] mapM_: OK (0.01s)
  8851. 861.37 s [vector] +++ OK, passed 100 tests.
  8852. 861.37 s [vector] forM: OK
  8853. 861.38 s [vector] +++ OK, passed 100 tests.
  8854. 861.38 s [vector] forM_: OK (0.01s)
  8855. 861.38 s [vector] +++ OK, passed 100 tests.
  8856. 861.38 s [vector] imapM: OK
  8857. 861.39 s [vector] +++ OK, passed 100 tests.
  8858. 861.40 s [vector] imapM_: OK
  8859. 861.40 s [vector] +++ OK, passed 100 tests.
  8860. 861.40 s [vector] zipWith: OK
  8861. 861.40 s [vector] +++ OK, passed 100 tests.
  8862. 861.40 s [vector] zipWith3: OK
  8863. 861.40 s [vector] +++ OK, passed 100 tests.
  8864. 861.40 s [vector] izipWith: OK
  8865. 861.40 s [vector] +++ OK, passed 100 tests.
  8866. 861.40 s [vector] izipWith3: OK
  8867. 861.40 s [vector] +++ OK, passed 100 tests.
  8868. 861.41 s [vector] izipWithM: OK
  8869. 861.41 s [vector] +++ OK, passed 100 tests.
  8870. 861.41 s [vector] izipWithM_: OK
  8871. 861.42 s [vector] +++ OK, passed 100 tests.
  8872. 861.42 s [vector] zipWithM: OK
  8873. 861.42 s [vector] +++ OK, passed 100 tests.
  8874. 861.43 s [vector] zipWithM_: OK
  8875. 861.43 s [vector] +++ OK, passed 100 tests.
  8876. 861.43 s [vector] filter: OK
  8877. 861.43 s [vector] +++ OK, passed 100 tests.
  8878. 861.43 s [vector] ifilter: OK
  8879. 861.43 s [vector] +++ OK, passed 100 tests.
  8880. 861.46 s [vector] filterM: OK (0.03s)
  8881. 861.46 s [vector] +++ OK, passed 100 tests.
  8882. 861.46 s [vector] uniq: OK
  8883. 861.47 s [vector] +++ OK, passed 100 tests.
  8884. 861.47 s [vector] mapMaybe: OK
  8885. 861.47 s [vector] +++ OK, passed 100 tests.
  8886. 861.47 s [vector] imapMaybe: OK
  8887. 861.47 s [vector] +++ OK, passed 100 tests.
  8888. 861.47 s [vector] takeWhile: OK
  8889. 861.47 s [vector] +++ OK, passed 100 tests.
  8890. 861.47 s [vector] dropWhile: OK
  8891. 861.47 s [vector] +++ OK, passed 100 tests.
  8892. 861.47 s [vector] partition: OK
  8893. 861.47 s [vector] +++ OK, passed 100 tests.
  8894. 861.47 s [vector] partitionWith: OK
  8895. 861.47 s [vector] +++ OK, passed 100 tests.
  8896. 861.47 s [vector] span: OK
  8897. 861.47 s [vector] +++ OK, passed 100 tests.
  8898. 861.47 s [vector] break: OK
  8899. 861.47 s [vector] +++ OK, passed 100 tests.
  8900. 861.47 s [vector] spanR: OK
  8901. 861.47 s [vector] +++ OK, passed 100 tests.
  8902. 861.47 s [vector] breakR: OK
  8903. 861.47 s [vector] +++ OK, passed 100 tests.
  8904. 861.47 s [vector] groupBy: OK
  8905. 861.47 s [vector] +++ OK, passed 100 tests.
  8906. 861.47 s [vector] elem: OK
  8907. 861.47 s [vector] +++ OK, passed 100 tests.
  8908. 861.47 s [vector] notElem: OK
  8909. 861.48 s [vector] +++ OK, passed 100 tests.
  8910. 861.48 s [vector] find: OK
  8911. 861.48 s [vector] +++ OK, passed 100 tests.
  8912. 861.48 s [vector] findIndex: OK
  8913. 861.48 s [vector] +++ OK, passed 100 tests.
  8914. 861.48 s [vector] findIndexR: OK
  8915. 861.48 s [vector] +++ OK, passed 100 tests.
  8916. 861.48 s [vector] findIndices: OK
  8917. 861.48 s [vector] +++ OK, passed 100 tests.
  8918. 861.48 s [vector] elemIndex: OK
  8919. 861.48 s [vector] +++ OK, passed 100 tests.
  8920. 861.48 s [vector] elemIndices: OK
  8921. 861.48 s [vector] +++ OK, passed 100 tests.
  8922. 861.48 s [vector] foldl: OK
  8923. 861.48 s [vector] +++ OK, passed 100 tests.
  8924. 861.49 s [vector] foldl1: OK
  8925. 861.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8926. 861.49 s [vector] foldl': OK
  8927. 861.49 s [vector] +++ OK, passed 100 tests.
  8928. 861.49 s [vector] foldl1': OK
  8929. 861.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8930. 861.49 s [vector] foldr: OK
  8931. 861.49 s [vector] +++ OK, passed 100 tests.
  8932. 861.49 s [vector] foldr1: OK
  8933. 861.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8934. 861.49 s [vector] foldr': OK
  8935. 861.49 s [vector] +++ OK, passed 100 tests.
  8936. 861.49 s [vector] foldr1': OK
  8937. 861.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8938. 861.49 s [vector] ifoldl: OK
  8939. 861.49 s [vector] +++ OK, passed 100 tests.
  8940. 861.49 s [vector] ifoldl': OK
  8941. 861.50 s [vector] +++ OK, passed 100 tests.
  8942. 861.50 s [vector] ifoldr: OK
  8943. 861.50 s [vector] +++ OK, passed 100 tests.
  8944. 861.50 s [vector] ifoldr': OK
  8945. 861.50 s [vector] +++ OK, passed 100 tests.
  8946. 861.50 s [vector] ifoldM: OK
  8947. 861.50 s [vector] +++ OK, passed 100 tests.
  8948. 861.50 s [vector] ifoldM': OK
  8949. 861.51 s [vector] +++ OK, passed 100 tests.
  8950. 861.52 s [vector] ifoldM_: OK (0.01s)
  8951. 861.52 s [vector] +++ OK, passed 100 tests.
  8952. 861.53 s [vector] ifoldM'_: OK (0.01s)
  8953. 861.53 s [vector] +++ OK, passed 100 tests.
  8954. 861.53 s [vector] all: OK
  8955. 861.53 s [vector] +++ OK, passed 100 tests.
  8956. 861.53 s [vector] any: OK
  8957. 861.53 s [vector] +++ OK, passed 100 tests.
  8958. 861.53 s [vector] prescanl: OK
  8959. 861.53 s [vector] +++ OK, passed 100 tests.
  8960. 861.53 s [vector] prescanl': OK
  8961. 861.53 s [vector] +++ OK, passed 100 tests.
  8962. 861.53 s [vector] postscanl: OK
  8963. 861.53 s [vector] +++ OK, passed 100 tests.
  8964. 861.54 s [vector] postscanl': OK
  8965. 861.54 s [vector] +++ OK, passed 100 tests.
  8966. 861.54 s [vector] scanl: OK
  8967. 861.54 s [vector] +++ OK, passed 100 tests.
  8968. 861.54 s [vector] scanl': OK
  8969. 861.54 s [vector] +++ OK, passed 100 tests.
  8970. 861.54 s [vector] scanl1: OK
  8971. 861.54 s [vector] +++ OK, passed 100 tests.
  8972. 861.54 s [vector] scanl1': OK
  8973. 861.54 s [vector] +++ OK, passed 100 tests.
  8974. 861.55 s [vector] iscanl: OK
  8975. 861.55 s [vector] +++ OK, passed 100 tests.
  8976. 861.55 s [vector] iscanl': OK
  8977. 861.55 s [vector] +++ OK, passed 100 tests.
  8978. 861.55 s [vector] prescanr: OK
  8979. 861.55 s [vector] +++ OK, passed 100 tests.
  8980. 861.55 s [vector] prescanr': OK
  8981. 861.55 s [vector] +++ OK, passed 100 tests.
  8982. 861.55 s [vector] postscanr: OK
  8983. 861.55 s [vector] +++ OK, passed 100 tests.
  8984. 861.55 s [vector] postscanr': OK
  8985. 861.56 s [vector] +++ OK, passed 100 tests.
  8986. 861.56 s [vector] scanr: OK
  8987. 861.56 s [vector] +++ OK, passed 100 tests.
  8988. 861.56 s [vector] scanr': OK
  8989. 861.56 s [vector] +++ OK, passed 100 tests.
  8990. 861.56 s [vector] scanr1: OK
  8991. 861.56 s [vector] +++ OK, passed 100 tests.
  8992. 861.56 s [vector] scanr1': OK
  8993. 861.56 s [vector] +++ OK, passed 100 tests.
  8994. 861.56 s [vector] iscanr: OK
  8995. 861.56 s [vector] +++ OK, passed 100 tests.
  8996. 861.56 s [vector] iscanr': OK
  8997. 861.57 s [vector] +++ OK, passed 100 tests.
  8998. 861.57 s [vector] mut_read: OK
  8999. 861.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9000. 861.57 s [vector] mut_write: OK
  9001. 861.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9002. 861.57 s [vector] mut_modify: OK
  9003. 861.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9004. 861.57 s [vector] mut_generate: OK
  9005. 861.57 s [vector] +++ OK, passed 100 tests.
  9006. 861.58 s [vector] mut_generateM: OK
  9007. 861.59 s [vector] +++ OK, passed 100 tests.
  9008. 861.59 s [vector] mut_mapM_: OK (0.01s)
  9009. 861.59 s [vector] +++ OK, passed 100 tests.
  9010. 861.60 s [vector] mut_imapM_: OK
  9011. 861.60 s [vector] +++ OK, passed 100 tests.
  9012. 861.61 s [vector] mut_forM_: OK
  9013. 861.61 s [vector] +++ OK, passed 100 tests.
  9014. 861.62 s [hedgehog] [14 of 27] Compiling Hedgehog.Main ( src/Hedgehog/Main.hs, dist/build/Hedgehog/Main.o, dist/build/Hedgehog/Main.dyn_o )
  9015. 861.62 s [hedgehog] [15 of 27] Compiling Hedgehog.Range ( src/Hedgehog/Range.hs, dist/build/Hedgehog/Range.o, dist/build/Hedgehog/Range.dyn_o )
  9016. 861.62 s [hedgehog] [16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, dist/build/Hedgehog/Internal/Gen.o, dist/build/Hedgehog/Internal/Gen.dyn_o )
  9017. 861.62 s [vector] mut_iforM_: OK (0.01s)
  9018. 861.62 s [vector] +++ OK, passed 100 tests.
  9019. 861.62 s [vector] mut_foldr: OK
  9020. 861.62 s [vector] +++ OK, passed 100 tests.
  9021. 861.62 s [vector] mut_foldr': OK
  9022. 861.62 s [vector] +++ OK, passed 100 tests.
  9023. 861.62 s [vector] mut_foldl: OK
  9024. 861.62 s [vector] +++ OK, passed 100 tests.
  9025. 861.62 s [vector] mut_foldl': OK
  9026. 861.63 s [vector] +++ OK, passed 100 tests.
  9027. 861.63 s [vector] mut_ifoldr: OK
  9028. 861.63 s [vector] +++ OK, passed 100 tests.
  9029. 861.63 s [vector] mut_ifoldr': OK
  9030. 861.63 s [vector] +++ OK, passed 100 tests.
  9031. 861.63 s [vector] mut_ifoldl: OK
  9032. 861.63 s [vector] +++ OK, passed 100 tests.
  9033. 861.63 s [vector] mut_ifoldl': OK
  9034. 861.63 s [vector] +++ OK, passed 100 tests.
  9035. 861.63 s [vector] mut_foldM: OK
  9036. 861.63 s [vector] +++ OK, passed 100 tests.
  9037. 861.63 s [vector] mut_foldM': OK
  9038. 861.63 s [vector] +++ OK, passed 100 tests.
  9039. 861.63 s [vector] mut_foldrM: OK
  9040. 861.64 s [vector] +++ OK, passed 100 tests.
  9041. 861.64 s [vector] mut_foldrM': OK
  9042. 861.64 s [vector] +++ OK, passed 100 tests.
  9043. 861.64 s [vector] mut_ifoldM: OK
  9044. 861.64 s [vector] +++ OK, passed 100 tests.
  9045. 861.64 s [vector] mut_ifoldM': OK
  9046. 861.64 s [vector] +++ OK, passed 100 tests.
  9047. 861.64 s [vector] mut_ifoldrM: OK
  9048. 861.64 s [vector] +++ OK, passed 100 tests.
  9049. 861.65 s [vector] mut_ifoldrM': OK
  9050. 861.65 s [vector] +++ OK, passed 100 tests.
  9051. 861.65 s [vector] compare: OK
  9052. 861.65 s [vector] +++ OK, passed 100 tests.
  9053. 861.65 s [vector] maximum: OK
  9054. 861.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9055. 861.65 s [vector] minimum: OK
  9056. 861.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9057. 861.65 s [vector] minIndex: OK
  9058. 861.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9059. 861.65 s [vector] maxIndex: OK
  9060. 861.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9061. 861.65 s [vector] maximumBy: OK
  9062. 861.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9063. 861.65 s [vector] minimumBy: OK
  9064. 861.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9065. 861.65 s [vector] maximumOn: OK
  9066. 861.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9067. 861.65 s [vector] minimumOn: OK
  9068. 861.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9069. 861.65 s [vector] maxIndexBy: OK
  9070. 861.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9071. 861.65 s [vector] minIndexBy: OK
  9072. 861.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9073. 861.65 s [vector] ListFirstMaxIndexWins: OK
  9074. 861.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9075. 861.65 s [vector] FalseListFirstMaxIndexWins: OK
  9076. 861.65 s [vector] +++ OK, failed as expected. (after 1 test):
  9077. 861.65 s [vector] Exception:
  9078. 861.65 s [vector] Prelude.foldr1: empty list
  9079. 861.65 s [vector] CallStack (from HasCallStack):
  9080. 861.65 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  9081. 861.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  9082. 861.66 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9083. 861.66 s [vector] []
  9084. 861.66 s [vector] zip: OK
  9085. 861.66 s [vector] +++ OK, passed 100 tests.
  9086. 861.66 s [vector] zip3: OK
  9087. 861.66 s [vector] +++ OK, passed 100 tests.
  9088. 861.66 s [vector] unzip: OK
  9089. 861.66 s [vector] +++ OK, passed 100 tests.
  9090. 861.66 s [vector] unzip3: OK
  9091. 861.66 s [vector] +++ OK, passed 100 tests.
  9092. 861.66 s [vector] indexed: OK
  9093. 861.66 s [vector] +++ OK, passed 100 tests.
  9094. 861.66 s [vector] update: OK
  9095. 861.66 s [vector] +++ OK, passed 100 tests.
  9096. 861.66 s [vector] mempty: OK
  9097. 861.66 s [vector] +++ OK, passed 1 test.
  9098. 861.66 s [vector] mappend: OK
  9099. 861.67 s [vector] +++ OK, passed 100 tests.
  9100. 861.68 s [vector] mconcat: OK (0.02s)
  9101. 861.68 s [vector] +++ OK, passed 100 tests.
  9102. 861.68 s [vector] glength: OK
  9103. 861.68 s [vector] +++ OK, passed 100 tests.
  9104. 861.68 s [vector] and: OK
  9105. 861.68 s [vector] +++ OK, passed 100 tests.
  9106. 861.68 s [vector] or: OK
  9107. 861.68 s [vector] +++ OK, passed 100 tests.
  9108. 861.68 s [vector] (Int)
  9109. 861.69 s [vector] fromList.toList == id: OK
  9110. 861.69 s [vector] +++ OK, passed 100 tests.
  9111. 861.69 s [vector] toList.fromList == id: OK
  9112. 861.69 s [vector] +++ OK, passed 100 tests.
  9113. 861.69 s [vector] unstream.stream == id: OK
  9114. 861.69 s [vector] +++ OK, passed 100 tests.
  9115. 861.69 s [vector] stream.unstream == id: OK
  9116. 861.69 s [vector] +++ OK, passed 100 tests.
  9117. 861.69 s [vector] eq: OK
  9118. 861.69 s [vector] +++ OK, passed 100 tests.
  9119. 861.69 s [vector] length: OK
  9120. 861.69 s [vector] +++ OK, passed 100 tests.
  9121. 861.69 s [vector] null: OK
  9122. 861.69 s [vector] +++ OK, passed 100 tests.
  9123. 861.69 s [vector] index: OK
  9124. 861.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9125. 861.69 s [vector] safeIndex: OK
  9126. 861.69 s [vector] +++ OK, passed 100 tests.
  9127. 861.69 s [vector] head: OK
  9128. 861.69 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9129. 861.69 s [vector] last: OK
  9130. 861.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9131. 861.69 s [vector] unsafeIndex: OK
  9132. 861.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9133. 861.69 s [vector] unsafeHead: OK
  9134. 861.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9135. 861.69 s [vector] unsafeLast: OK
  9136. 861.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9137. 861.69 s [vector] slice: OK
  9138. 861.69 s [vector] +++ OK, passed 100 tests.
  9139. 861.69 s [vector] init: OK
  9140. 861.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9141. 861.70 s [vector] tail: OK
  9142. 861.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9143. 861.70 s [vector] take: OK
  9144. 861.70 s [vector] +++ OK, passed 100 tests.
  9145. 861.70 s [vector] drop: OK
  9146. 861.70 s [vector] +++ OK, passed 100 tests.
  9147. 861.70 s [vector] splitAt: OK
  9148. 861.70 s [vector] +++ OK, passed 100 tests.
  9149. 861.70 s [vector] empty: OK
  9150. 861.70 s [vector] +++ OK, passed 1 test.
  9151. 861.70 s [vector] singleton: OK
  9152. 861.70 s [vector] +++ OK, passed 100 tests.
  9153. 861.70 s [vector] replicate: OK
  9154. 861.70 s [vector] +++ OK, passed 100 tests.
  9155. 861.70 s [vector] generate: OK
  9156. 861.70 s [vector] +++ OK, passed 100 tests.
  9157. 861.70 s [vector] iterateN: OK
  9158. 861.71 s [vector] +++ OK, passed 100 tests.
  9159. 861.71 s [vector] iterateNM: OK (0.01s)
  9160. 861.71 s [vector] +++ OK, passed 100 tests.
  9161. 861.73 s [vector] generateM: OK (0.02s)
  9162. 861.74 s [vector] +++ OK, passed 100 tests.
  9163. 861.74 s [vector] replicateM: OK
  9164. 861.74 s [vector] +++ OK, passed 100 tests.
  9165. 861.74 s [vector] create: OK
  9166. 861.74 s [vector] +++ OK, passed 100 tests.
  9167. 861.74 s [vector] createT: OK
  9168. 861.74 s [vector] +++ OK, passed 100 tests.
  9169. 861.74 s [vector] unfoldr: OK
  9170. 861.74 s [vector] +++ OK, passed 100 tests.
  9171. 861.74 s [vector] unfoldrN: OK
  9172. 861.74 s [vector] +++ OK, passed 100 tests.
  9173. 861.75 s [vector] unfoldrExactN: OK
  9174. 861.75 s [vector] +++ OK, passed 100 tests.
  9175. 861.75 s [vector] unfoldrM: OK
  9176. 861.75 s [vector] +++ OK, passed 100 tests.
  9177. 861.75 s [vector] unfoldrNM: OK
  9178. 861.75 s [vector] +++ OK, passed 100 tests.
  9179. 861.77 s [vector] unfoldrExactNM: OK (0.01s)
  9180. 861.77 s [vector] +++ OK, passed 100 tests.
  9181. 861.78 s [vector] constructN: OK (0.01s)
  9182. 861.78 s [vector] +++ OK, passed 100 tests.
  9183. 861.78 s [vector] constructrN: OK
  9184. 861.78 s [vector] +++ OK, passed 100 tests.
  9185. 861.78 s [vector] cons: OK
  9186. 861.78 s [vector] +++ OK, passed 100 tests.
  9187. 861.78 s [vector] snoc: OK
  9188. 861.78 s [vector] +++ OK, passed 100 tests.
  9189. 861.78 s [vector] append: OK
  9190. 861.79 s [vector] +++ OK, passed 100 tests.
  9191. 861.80 s [vector] concat: OK (0.02s)
  9192. 861.80 s [vector] +++ OK, passed 100 tests.
  9193. 861.81 s [vector] force: OK
  9194. 861.81 s [vector] +++ OK, passed 100 tests.
  9195. 861.81 s [vector] upd: OK
  9196. 861.81 s [vector] +++ OK, passed 100 tests.
  9197. 861.81 s [vector] accum: OK
  9198. 861.81 s [vector] +++ OK, passed 100 tests.
  9199. 861.81 s [vector] reverse: OK
  9200. 861.81 s [vector] +++ OK, passed 100 tests.
  9201. 861.81 s [vector] backpermute: OK
  9202. 861.81 s [vector] +++ OK, passed 100 tests.
  9203. 861.81 s [vector] map: OK
  9204. 861.81 s [vector] +++ OK, passed 100 tests.
  9205. 861.82 s [vector] imap: OK
  9206. 861.82 s [vector] +++ OK, passed 100 tests.
  9207. 861.82 s [vector] concatMap: OK
  9208. 861.82 s [vector] +++ OK, passed 100 tests.
  9209. 861.83 s [vector] mapM: OK
  9210. 861.83 s [vector] +++ OK, passed 100 tests.
  9211. 861.83 s [vector] mapM_: OK (0.01s)
  9212. 861.83 s [vector] +++ OK, passed 100 tests.
  9213. 861.84 s [vector] forM: OK
  9214. 861.85 s [vector] +++ OK, passed 100 tests.
  9215. 861.85 s [vector] forM_: OK (0.01s)
  9216. 861.85 s [vector] +++ OK, passed 100 tests.
  9217. 861.87 s [vector] imapM: OK
  9218. 861.87 s [vector] +++ OK, passed 100 tests.
  9219. 861.87 s [vector] imapM_: OK (0.01s)
  9220. 861.87 s [vector] +++ OK, passed 100 tests.
  9221. 861.87 s [vector] zipWith: OK
  9222. 861.87 s [vector] +++ OK, passed 100 tests.
  9223. 861.87 s [vector] zipWith3: OK
  9224. 861.87 s [vector] +++ OK, passed 100 tests.
  9225. 861.87 s [vector] izipWith: OK
  9226. 861.88 s [vector] +++ OK, passed 100 tests.
  9227. 861.88 s [vector] izipWith3: OK
  9228. 861.88 s [vector] +++ OK, passed 100 tests.
  9229. 861.88 s [vector] izipWithM: OK
  9230. 861.88 s [vector] +++ OK, passed 100 tests.
  9231. 861.89 s [vector] izipWithM_: OK (0.01s)
  9232. 861.89 s [vector] +++ OK, passed 100 tests.
  9233. 861.89 s [vector] zipWithM: OK
  9234. 861.91 s [vector] +++ OK, passed 100 tests.
  9235. 861.91 s [vector] zipWithM_: OK (0.01s)
  9236. 861.91 s [vector] +++ OK, passed 100 tests.
  9237. 861.91 s [vector] filter: OK
  9238. 861.91 s [vector] +++ OK, passed 100 tests.
  9239. 861.91 s [vector] ifilter: OK
  9240. 861.91 s [vector] +++ OK, passed 100 tests.
  9241. 861.93 s [vector] filterM: OK (0.02s)
  9242. 861.93 s [vector] +++ OK, passed 100 tests.
  9243. 861.94 s [vector] uniq: OK
  9244. 861.94 s [vector] +++ OK, passed 100 tests.
  9245. 861.94 s [vector] mapMaybe: OK
  9246. 861.94 s [vector] +++ OK, passed 100 tests.
  9247. 861.94 s [vector] imapMaybe: OK
  9248. 861.94 s [vector] +++ OK, passed 100 tests.
  9249. 861.94 s [vector] takeWhile: OK
  9250. 861.94 s [vector] +++ OK, passed 100 tests.
  9251. 861.94 s [vector] dropWhile: OK
  9252. 861.94 s [vector] +++ OK, passed 100 tests.
  9253. 861.94 s [vector] partition: OK
  9254. 861.95 s [vector] +++ OK, passed 100 tests.
  9255. 861.95 s [vector] partitionWith: OK
  9256. 861.95 s [vector] +++ OK, passed 100 tests.
  9257. 861.95 s [vector] span: OK
  9258. 861.95 s [vector] +++ OK, passed 100 tests.
  9259. 861.95 s [vector] break: OK
  9260. 861.96 s [vector] +++ OK, passed 100 tests.
  9261. 861.96 s [vector] spanR: OK
  9262. 861.96 s [vector] +++ OK, passed 100 tests.
  9263. 861.96 s [vector] breakR: OK
  9264. 861.96 s [vector] +++ OK, passed 100 tests.
  9265. 861.96 s [vector] groupBy: OK
  9266. 861.96 s [vector] +++ OK, passed 100 tests.
  9267. 861.96 s [vector] elem: OK
  9268. 861.96 s [vector] +++ OK, passed 100 tests.
  9269. 861.96 s [vector] notElem: OK
  9270. 861.96 s [vector] +++ OK, passed 100 tests.
  9271. 861.96 s [vector] find: OK
  9272. 861.96 s [vector] +++ OK, passed 100 tests.
  9273. 861.96 s [vector] findIndex: OK
  9274. 861.96 s [vector] +++ OK, passed 100 tests.
  9275. 861.96 s [vector] findIndexR: OK
  9276. 861.96 s [vector] +++ OK, passed 100 tests.
  9277. 861.96 s [vector] findIndices: OK
  9278. 861.96 s [vector] +++ OK, passed 100 tests.
  9279. 861.96 s [vector] elemIndex: OK
  9280. 861.96 s [vector] +++ OK, passed 100 tests.
  9281. 861.96 s [vector] elemIndices: OK
  9282. 861.96 s [vector] +++ OK, passed 100 tests.
  9283. 861.96 s [vector] foldl: OK
  9284. 861.96 s [vector] +++ OK, passed 100 tests.
  9285. 861.96 s [vector] foldl1: OK
  9286. 861.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9287. 861.97 s [vector] foldl': OK
  9288. 861.97 s [vector] +++ OK, passed 100 tests.
  9289. 861.97 s [vector] foldl1': OK
  9290. 861.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9291. 861.97 s [vector] foldr: OK
  9292. 861.97 s [vector] +++ OK, passed 100 tests.
  9293. 861.97 s [vector] foldr1: OK
  9294. 861.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9295. 861.98 s [vector] foldr': OK
  9296. 861.98 s [vector] +++ OK, passed 100 tests.
  9297. 861.98 s [vector] foldr1': OK
  9298. 861.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9299. 861.98 s [vector] ifoldl: OK
  9300. 861.98 s [vector] +++ OK, passed 100 tests.
  9301. 861.99 s [vector] ifoldl': OK
  9302. 861.99 s [vector] +++ OK, passed 100 tests.
  9303. 861.99 s [vector] ifoldr: OK
  9304. 861.99 s [vector] +++ OK, passed 100 tests.
  9305. 861.99 s [vector] ifoldr': OK
  9306. 861.99 s [vector] +++ OK, passed 100 tests.
  9307. 861.99 s [vector] ifoldM: OK
  9308. 861.99 s [vector] +++ OK, passed 100 tests.
  9309. 862.00 s [vector] ifoldM': OK
  9310. 862.01 s [vector] +++ OK, passed 100 tests.
  9311. 862.01 s [vector] ifoldM_: OK (0.02s)
  9312. 862.01 s [vector] +++ OK, passed 100 tests.
  9313. 862.03 s [vector] ifoldM'_: OK (0.01s)
  9314. 862.03 s [vector] +++ OK, passed 100 tests.
  9315. 862.03 s [vector] all: OK
  9316. 862.03 s [vector] +++ OK, passed 100 tests.
  9317. 862.03 s [vector] any: OK
  9318. 862.03 s [vector] +++ OK, passed 100 tests.
  9319. 862.03 s [vector] prescanl: OK
  9320. 862.03 s [vector] +++ OK, passed 100 tests.
  9321. 862.03 s [vector] prescanl': OK
  9322. 862.03 s [vector] +++ OK, passed 100 tests.
  9323. 862.03 s [vector] postscanl: OK
  9324. 862.04 s [vector] +++ OK, passed 100 tests.
  9325. 862.04 s [vector] postscanl': OK
  9326. 862.04 s [vector] +++ OK, passed 100 tests.
  9327. 862.04 s [vector] scanl: OK
  9328. 862.05 s [vector] +++ OK, passed 100 tests.
  9329. 862.05 s [vector] scanl': OK
  9330. 862.05 s [vector] +++ OK, passed 100 tests.
  9331. 862.05 s [vector] scanl1: OK
  9332. 862.05 s [vector] +++ OK, passed 100 tests.
  9333. 862.05 s [vector] scanl1': OK
  9334. 862.05 s [vector] +++ OK, passed 100 tests.
  9335. 862.05 s [vector] iscanl: OK
  9336. 862.05 s [vector] +++ OK, passed 100 tests.
  9337. 862.06 s [vector] iscanl': OK
  9338. 862.06 s [vector] +++ OK, passed 100 tests.
  9339. 862.06 s [vector] prescanr: OK
  9340. 862.06 s [vector] +++ OK, passed 100 tests.
  9341. 862.06 s [vector] prescanr': OK
  9342. 862.06 s [vector] +++ OK, passed 100 tests.
  9343. 862.06 s [vector] postscanr: OK
  9344. 862.07 s [vector] +++ OK, passed 100 tests.
  9345. 862.07 s [vector] postscanr': OK
  9346. 862.07 s [vector] +++ OK, passed 100 tests.
  9347. 862.07 s [vector] scanr: OK
  9348. 862.07 s [vector] +++ OK, passed 100 tests.
  9349. 862.07 s [vector] scanr': OK
  9350. 862.07 s [vector] +++ OK, passed 100 tests.
  9351. 862.08 s [vector] scanr1: OK
  9352. 862.08 s [vector] +++ OK, passed 100 tests.
  9353. 862.08 s [vector] scanr1': OK
  9354. 862.09 s [vector] +++ OK, passed 100 tests.
  9355. 862.09 s [vector] iscanr: OK
  9356. 862.09 s [vector] +++ OK, passed 100 tests.
  9357. 862.09 s [vector] iscanr': OK
  9358. 862.09 s [vector] +++ OK, passed 100 tests.
  9359. 862.09 s [vector] mut_read: OK
  9360. 862.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9361. 862.09 s [vector] mut_write: OK
  9362. 862.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9363. 862.09 s [vector] mut_modify: OK
  9364. 862.09 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9365. 862.09 s [vector] mut_generate: OK
  9366. 862.09 s [vector] +++ OK, passed 100 tests.
  9367. 862.10 s [vector] mut_generateM: OK
  9368. 862.11 s [vector] +++ OK, passed 100 tests.
  9369. 862.11 s [vector] mut_mapM_: OK (0.02s)
  9370. 862.11 s [vector] +++ OK, passed 100 tests.
  9371. 862.13 s [vector] mut_imapM_: OK (0.02s)
  9372. 862.13 s [vector] +++ OK, passed 100 tests.
  9373. 862.15 s [vector] mut_forM_: OK (0.01s)
  9374. 862.15 s [vector] +++ OK, passed 100 tests.
  9375. 862.16 s [vector] mut_iforM_: OK (0.02s)
  9376. 862.16 s [vector] +++ OK, passed 100 tests.
  9377. 862.16 s [vector] mut_foldr: OK
  9378. 862.16 s [vector] +++ OK, passed 100 tests.
  9379. 862.16 s [vector] mut_foldr': OK
  9380. 862.17 s [vector] +++ OK, passed 100 tests.
  9381. 862.17 s [vector] mut_foldl: OK
  9382. 862.17 s [vector] +++ OK, passed 100 tests.
  9383. 862.17 s [vector] mut_foldl': OK
  9384. 862.17 s [vector] +++ OK, passed 100 tests.
  9385. 862.18 s [vector] mut_ifoldr: OK
  9386. 862.18 s [vector] +++ OK, passed 100 tests.
  9387. 862.18 s [vector] mut_ifoldr': OK
  9388. 862.18 s [vector] +++ OK, passed 100 tests.
  9389. 862.18 s [vector] mut_ifoldl: OK
  9390. 862.18 s [vector] +++ OK, passed 100 tests.
  9391. 862.18 s [vector] mut_ifoldl': OK
  9392. 862.18 s [vector] +++ OK, passed 100 tests.
  9393. 862.19 s [vector] mut_foldM: OK
  9394. 862.19 s [vector] +++ OK, passed 100 tests.
  9395. 862.19 s [vector] mut_foldM': OK
  9396. 862.19 s [vector] +++ OK, passed 100 tests.
  9397. 862.19 s [vector] mut_foldrM: OK
  9398. 862.19 s [vector] +++ OK, passed 100 tests.
  9399. 862.19 s [vector] mut_foldrM': OK
  9400. 862.19 s [vector] +++ OK, passed 100 tests.
  9401. 862.20 s [vector] mut_ifoldM: OK
  9402. 862.20 s [vector] +++ OK, passed 100 tests.
  9403. 862.20 s [vector] mut_ifoldM': OK
  9404. 862.20 s [vector] +++ OK, passed 100 tests.
  9405. 862.20 s [vector] mut_ifoldrM: OK
  9406. 862.21 s [vector] +++ OK, passed 100 tests.
  9407. 862.21 s [vector] mut_ifoldrM': OK
  9408. 862.21 s [vector] +++ OK, passed 100 tests.
  9409. 862.21 s [vector] compare: OK
  9410. 862.21 s [vector] +++ OK, passed 100 tests.
  9411. 862.21 s [vector] maximum: OK
  9412. 862.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9413. 862.21 s [vector] minimum: OK
  9414. 862.21 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9415. 862.21 s [vector] minIndex: OK
  9416. 862.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9417. 862.21 s [vector] maxIndex: OK
  9418. 862.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9419. 862.21 s [vector] maximumBy: OK
  9420. 862.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9421. 862.21 s [vector] minimumBy: OK
  9422. 862.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9423. 862.21 s [vector] maximumOn: OK
  9424. 862.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9425. 862.21 s [vector] minimumOn: OK
  9426. 862.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9427. 862.21 s [vector] maxIndexBy: OK
  9428. 862.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9429. 862.21 s [vector] minIndexBy: OK
  9430. 862.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9431. 862.21 s [vector] ListFirstMaxIndexWins: OK
  9432. 862.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9433. 862.21 s [vector] FalseListFirstMaxIndexWins: OK
  9434. 862.21 s [vector] +++ OK, failed as expected. (after 1 test):
  9435. 862.21 s [vector] Exception:
  9436. 862.21 s [vector] Prelude.foldr1: empty list
  9437. 862.21 s [vector] CallStack (from HasCallStack):
  9438. 862.21 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  9439. 862.21 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  9440. 862.21 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9441. 862.21 s [vector] []
  9442. 862.21 s [vector] zip: OK
  9443. 862.22 s [vector] +++ OK, passed 100 tests.
  9444. 862.22 s [vector] zip3: OK
  9445. 862.22 s [vector] +++ OK, passed 100 tests.
  9446. 862.22 s [vector] unzip: OK
  9447. 862.22 s [vector] +++ OK, passed 100 tests.
  9448. 862.22 s [vector] unzip3: OK
  9449. 862.22 s [vector] +++ OK, passed 100 tests.
  9450. 862.22 s [vector] indexed: OK
  9451. 862.22 s [vector] +++ OK, passed 100 tests.
  9452. 862.22 s [vector] update: OK
  9453. 862.22 s [vector] +++ OK, passed 100 tests.
  9454. 862.22 s [vector] mempty: OK
  9455. 862.22 s [vector] +++ OK, passed 1 test.
  9456. 862.22 s [vector] mappend: OK
  9457. 862.23 s [vector] +++ OK, passed 100 tests.
  9458. 862.24 s [vector] mconcat: OK (0.02s)
  9459. 862.24 s [vector] +++ OK, passed 100 tests.
  9460. 862.24 s [vector] glength: OK
  9461. 862.24 s [vector] +++ OK, passed 100 tests.
  9462. 862.24 s [vector] sum: OK
  9463. 862.24 s [vector] +++ OK, passed 100 tests.
  9464. 862.24 s [vector] product: OK
  9465. 862.24 s [vector] +++ OK, passed 100 tests.
  9466. 862.25 s [vector] enumFromN: OK
  9467. 862.25 s [vector] +++ OK, passed 100 tests.
  9468. 862.25 s [vector] enumFromThenN: OK
  9469. 862.25 s [vector] +++ OK, passed 100 tests.
  9470. 862.25 s [vector] enumFromTo: OK
  9471. 862.25 s [vector] +++ OK, passed 100 tests.
  9472. 862.25 s [vector] enumFromThenTo: OK
  9473. 862.25 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9474. 862.25 s [vector] (Float)
  9475. 862.25 s [vector] fromList.toList == id: OK
  9476. 862.25 s [vector] +++ OK, passed 100 tests.
  9477. 862.25 s [vector] toList.fromList == id: OK
  9478. 862.25 s [vector] +++ OK, passed 100 tests.
  9479. 862.25 s [vector] unstream.stream == id: OK
  9480. 862.25 s [vector] +++ OK, passed 100 tests.
  9481. 862.25 s [vector] stream.unstream == id: OK
  9482. 862.25 s [vector] +++ OK, passed 100 tests.
  9483. 862.25 s [vector] eq: OK
  9484. 862.25 s [vector] +++ OK, passed 100 tests.
  9485. 862.25 s [vector] length: OK
  9486. 862.25 s [vector] +++ OK, passed 100 tests.
  9487. 862.25 s [vector] null: OK
  9488. 862.25 s [vector] +++ OK, passed 100 tests.
  9489. 862.25 s [vector] index: OK
  9490. 862.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9491. 862.25 s [vector] safeIndex: OK
  9492. 862.25 s [vector] +++ OK, passed 100 tests.
  9493. 862.25 s [vector] head: OK
  9494. 862.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9495. 862.25 s [vector] last: OK
  9496. 862.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9497. 862.26 s [vector] unsafeIndex: OK
  9498. 862.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9499. 862.26 s [vector] unsafeHead: OK
  9500. 862.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9501. 862.26 s [vector] unsafeLast: OK
  9502. 862.26 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9503. 862.26 s [vector] slice: OK
  9504. 862.26 s [vector] +++ OK, passed 100 tests.
  9505. 862.26 s [vector] init: OK
  9506. 862.26 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9507. 862.26 s [vector] tail: OK
  9508. 862.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9509. 862.26 s [vector] take: OK
  9510. 862.26 s [vector] +++ OK, passed 100 tests.
  9511. 862.26 s [vector] drop: OK
  9512. 862.26 s [vector] +++ OK, passed 100 tests.
  9513. 862.26 s [vector] splitAt: OK
  9514. 862.26 s [vector] +++ OK, passed 100 tests.
  9515. 862.26 s [vector] empty: OK
  9516. 862.26 s [vector] +++ OK, passed 1 test.
  9517. 862.26 s [vector] singleton: OK
  9518. 862.26 s [vector] +++ OK, passed 100 tests.
  9519. 862.27 s [vector] replicate: OK
  9520. 862.27 s [vector] +++ OK, passed 100 tests.
  9521. 862.27 s [vector] generate: OK
  9522. 862.27 s [vector] +++ OK, passed 100 tests.
  9523. 862.27 s [vector] iterateN: OK
  9524. 862.28 s [vector] +++ OK, passed 100 tests.
  9525. 862.29 s [vector] iterateNM: OK (0.02s)
  9526. 862.29 s [vector] +++ OK, passed 100 tests.
  9527. 862.31 s [vector] generateM: OK (0.02s)
  9528. 862.31 s [vector] +++ OK, passed 100 tests.
  9529. 862.32 s [vector] replicateM: OK (0.01s)
  9530. 862.32 s [vector] +++ OK, passed 100 tests.
  9531. 862.32 s [vector] create: OK
  9532. 862.32 s [vector] +++ OK, passed 100 tests.
  9533. 862.32 s [vector] createT: OK
  9534. 862.32 s [vector] +++ OK, passed 100 tests.
  9535. 862.32 s [vector] unfoldr: OK
  9536. 862.32 s [vector] +++ OK, passed 100 tests.
  9537. 862.32 s [vector] unfoldrN: OK
  9538. 862.32 s [vector] +++ OK, passed 100 tests.
  9539. 862.32 s [vector] unfoldrExactN: OK
  9540. 862.33 s [vector] +++ OK, passed 100 tests.
  9541. 862.33 s [vector] unfoldrM: OK
  9542. 862.33 s [vector] +++ OK, passed 100 tests.
  9543. 862.33 s [vector] unfoldrNM: OK
  9544. 862.33 s [vector] +++ OK, passed 100 tests.
  9545. 862.37 s [vector] unfoldrExactNM: OK (0.03s)
  9546. 862.37 s [vector] +++ OK, passed 100 tests.
  9547. 862.37 s [vector] constructN: OK (0.01s)
  9548. 862.37 s [vector] +++ OK, passed 100 tests.
  9549. 862.38 s [vector] constructrN: OK (0.01s)
  9550. 862.38 s [vector] +++ OK, passed 100 tests.
  9551. 862.38 s [vector] cons: OK
  9552. 862.38 s [vector] +++ OK, passed 100 tests.
  9553. 862.38 s [vector] snoc: OK
  9554. 862.38 s [vector] +++ OK, passed 100 tests.
  9555. 862.39 s [vector] append: OK
  9556. 862.39 s [vector] +++ OK, passed 100 tests.
  9557. 862.41 s [vector] concat: OK (0.02s)
  9558. 862.41 s [vector] +++ OK, passed 100 tests.
  9559. 862.41 s [vector] force: OK
  9560. 862.41 s [vector] +++ OK, passed 100 tests.
  9561. 862.42 s [vector] upd: OK
  9562. 862.42 s [vector] +++ OK, passed 100 tests.
  9563. 862.42 s [vector] accum: OK (0.01s)
  9564. 862.42 s [vector] +++ OK, passed 100 tests.
  9565. 862.42 s [vector] reverse: OK
  9566. 862.42 s [vector] +++ OK, passed 100 tests.
  9567. 862.43 s [vector] backpermute: OK
  9568. 862.43 s [vector] +++ OK, passed 100 tests.
  9569. 862.43 s [vector] map: OK
  9570. 862.43 s [vector] +++ OK, passed 100 tests.
  9571. 862.43 s [vector] imap: OK
  9572. 862.44 s [vector] +++ OK, passed 100 tests.
  9573. 862.45 s [vector] concatMap: OK
  9574. 862.45 s [vector] +++ OK, passed 100 tests.
  9575. 862.45 s [vector] mapM: OK
  9576. 862.45 s [vector] +++ OK, passed 100 tests.
  9577. 862.48 s [vector] mapM_: OK (0.03s)
  9578. 862.48 s [vector] +++ OK, passed 100 tests.
  9579. 862.48 s [vector] forM: OK
  9580. 862.58 s [vector] +++ OK, passed 100 tests.
  9581. 862.58 s [vector] forM_: OK (0.03s)
  9582. 862.58 s [vector] +++ OK, passed 100 tests.
  9583. 862.58 s [vector] imapM: OK
  9584. 862.58 s [vector] +++ OK, passed 100 tests.
  9585. 862.58 s [vector] imapM_: OK (0.03s)
  9586. 862.58 s [vector] +++ OK, passed 100 tests.
  9587. 862.58 s [vector] zipWith: OK
  9588. 862.58 s [vector] +++ OK, passed 100 tests.
  9589. 862.59 s [vector] zipWith3: OK
  9590. 862.59 s [vector] +++ OK, passed 100 tests.
  9591. 862.59 s [vector] izipWith: OK
  9592. 862.59 s [vector] +++ OK, passed 100 tests.
  9593. 862.59 s [vector] izipWith3: OK
  9594. 862.59 s [vector] +++ OK, passed 100 tests.
  9595. 862.59 s [vector] izipWithM: OK
  9596. 862.59 s [vector] +++ OK, passed 100 tests.
  9597. 862.62 s [vector] izipWithM_: OK (0.03s)
  9598. 862.62 s [vector] +++ OK, passed 100 tests.
  9599. 862.62 s [vector] zipWithM: OK
  9600. 862.62 s [vector] +++ OK, passed 100 tests.
  9601. 862.65 s [vector] zipWithM_: OK (0.03s)
  9602. 862.65 s [vector] +++ OK, passed 100 tests.
  9603. 862.65 s [vector] filter: OK
  9604. 862.66 s [vector] +++ OK, passed 100 tests.
  9605. 862.66 s [vector] ifilter: OK
  9606. 862.67 s [vector] +++ OK, passed 100 tests.
  9607. 862.70 s [vector] filterM: OK (0.04s)
  9608. 862.71 s [vector] +++ OK, passed 100 tests.
  9609. 862.71 s [vector] uniq: OK
  9610. 862.71 s [vector] +++ OK, passed 100 tests.
  9611. 862.71 s [vector] mapMaybe: OK
  9612. 862.71 s [vector] +++ OK, passed 100 tests.
  9613. 862.72 s [vector] imapMaybe: OK
  9614. 862.72 s [vector] +++ OK, passed 100 tests.
  9615. 862.72 s [vector] takeWhile: OK
  9616. 862.72 s [vector] +++ OK, passed 100 tests.
  9617. 862.72 s [vector] dropWhile: OK
  9618. 862.72 s [vector] +++ OK, passed 100 tests.
  9619. 862.73 s [vector] partition: OK
  9620. 862.73 s [vector] +++ OK, passed 100 tests.
  9621. 862.73 s [vector] partitionWith: OK
  9622. 862.73 s [vector] +++ OK, passed 100 tests.
  9623. 862.73 s [vector] span: OK
  9624. 862.73 s [vector] +++ OK, passed 100 tests.
  9625. 862.73 s [vector] break: OK
  9626. 862.73 s [vector] +++ OK, passed 100 tests.
  9627. 862.74 s [vector] spanR: OK
  9628. 862.74 s [vector] +++ OK, passed 100 tests.
  9629. 862.74 s [vector] breakR: OK
  9630. 862.74 s [vector] +++ OK, passed 100 tests.
  9631. 862.74 s [vector] groupBy: OK
  9632. 862.74 s [vector] +++ OK, passed 100 tests.
  9633. 862.74 s [vector] elem: OK
  9634. 862.74 s [vector] +++ OK, passed 100 tests.
  9635. 862.75 s [vector] notElem: OK
  9636. 862.75 s [vector] +++ OK, passed 100 tests.
  9637. 862.75 s [vector] find: OK
  9638. 862.75 s [vector] +++ OK, passed 100 tests.
  9639. 862.75 s [vector] findIndex: OK
  9640. 862.75 s [vector] +++ OK, passed 100 tests.
  9641. 862.75 s [vector] findIndexR: OK
  9642. 862.75 s [vector] +++ OK, passed 100 tests.
  9643. 862.75 s [vector] findIndices: OK
  9644. 862.75 s [vector] +++ OK, passed 100 tests.
  9645. 862.75 s [vector] elemIndex: OK
  9646. 862.75 s [vector] +++ OK, passed 100 tests.
  9647. 862.76 s [vector] elemIndices: OK
  9648. 862.76 s [vector] +++ OK, passed 100 tests.
  9649. 862.76 s [vector] foldl: OK
  9650. 862.77 s [vector] +++ OK, passed 100 tests.
  9651. 862.77 s [vector] foldl1: OK
  9652. 862.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9653. 862.79 s [vector] foldl': OK
  9654. 862.79 s [vector] +++ OK, passed 100 tests.
  9655. 862.79 s [vector] foldl1': OK
  9656. 862.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9657. 862.80 s [vector] foldr: OK
  9658. 862.81 s [vector] +++ OK, passed 100 tests.
  9659. 862.81 s [vector] foldr1: OK
  9660. 862.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9661. 862.82 s [vector] foldr': OK
  9662. 862.82 s [vector] +++ OK, passed 100 tests.
  9663. 862.82 s [vector] foldr1': OK
  9664. 862.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9665. 862.83 s [vector] ifoldl: OK
  9666. 862.83 s [vector] +++ OK, passed 100 tests.
  9667. 862.85 s [vector] ifoldl': OK (0.01s)
  9668. 862.85 s [vector] +++ OK, passed 100 tests.
  9669. 862.85 s [vector] ifoldr: OK
  9670. 862.85 s [vector] +++ OK, passed 100 tests.
  9671. 862.86 s [vector] ifoldr': OK
  9672. 862.87 s [vector] +++ OK, passed 100 tests.
  9673. 862.87 s [vector] ifoldM: OK (0.01s)
  9674. 862.87 s [vector] +++ OK, passed 100 tests.
  9675. 862.88 s [vector] ifoldM': OK
  9676. 862.88 s [vector] +++ OK, passed 100 tests.
  9677. 862.94 s [vector] ifoldM_: OK (0.02s)
  9678. 862.94 s [vector] +++ OK, passed 100 tests.
  9679. 862.94 s [vector] ifoldM'_: OK (0.03s)
  9680. 862.94 s [vector] +++ OK, passed 100 tests.
  9681. 862.94 s [vector] all: OK
  9682. 862.94 s [vector] +++ OK, passed 100 tests.
  9683. 862.95 s [vector] any: OK
  9684. 862.95 s [vector] +++ OK, passed 100 tests.
  9685. 862.95 s [vector] prescanl: OK
  9686. 862.96 s [vector] +++ OK, passed 100 tests.
  9687. 862.96 s [vector] prescanl': OK
  9688. 862.97 s [vector] +++ OK, passed 100 tests.
  9689. 862.97 s [vector] postscanl: OK
  9690. 862.97 s [vector] +++ OK, passed 100 tests.
  9691. 862.99 s [vector] postscanl': OK
  9692. 862.99 s [vector] +++ OK, passed 100 tests.
  9693. 862.99 s [vector] scanl: OK
  9694. 862.99 s [vector] +++ OK, passed 100 tests.
  9695. 862.99 s [vector] scanl': OK
  9696. 863.00 s [vector] +++ OK, passed 100 tests.
  9697. 863.03 s [vector] scanl1: OK
  9698. 863.03 s [vector] +++ OK, passed 100 tests.
  9699. 863.03 s [vector] scanl1': OK
  9700. 863.03 s [vector] +++ OK, passed 100 tests.
  9701. 863.03 s [vector] iscanl: OK
  9702. 863.03 s [vector] +++ OK, passed 100 tests.
  9703. 863.03 s [vector] iscanl': OK
  9704. 863.03 s [vector] +++ OK, passed 100 tests.
  9705. 863.05 s [vector] prescanr: OK
  9706. 863.05 s [vector] +++ OK, passed 100 tests.
  9707. 863.05 s [vector] prescanr': OK
  9708. 863.05 s [vector] +++ OK, passed 100 tests.
  9709. 863.07 s [vector] postscanr: OK (0.01s)
  9710. 863.07 s [vector] +++ OK, passed 100 tests.
  9711. 863.07 s [vector] postscanr': OK
  9712. 863.07 s [vector] +++ OK, passed 100 tests.
  9713. 863.09 s [vector] scanr: OK
  9714. 863.09 s [vector] +++ OK, passed 100 tests.
  9715. 863.09 s [vector] scanr': OK
  9716. 863.09 s [vector] +++ OK, passed 100 tests.
  9717. 863.10 s [vector] scanr1: OK
  9718. 863.10 s [vector] +++ OK, passed 100 tests.
  9719. 863.10 s [vector] scanr1': OK
  9720. 863.11 s [vector] +++ OK, passed 100 tests.
  9721. 863.12 s [vector] iscanr: OK (0.01s)
  9722. 863.12 s [vector] +++ OK, passed 100 tests.
  9723. 863.12 s [vector] iscanr': OK
  9724. 863.12 s [vector] +++ OK, passed 100 tests.
  9725. 863.12 s [vector] mut_read: OK
  9726. 863.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9727. 863.13 s [vector] mut_write: OK
  9728. 863.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9729. 863.13 s [vector] mut_modify: OK
  9730. 863.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9731. 863.13 s [vector] mut_generate: OK
  9732. 863.13 s [vector] +++ OK, passed 100 tests.
  9733. 863.15 s [vector] mut_generateM: OK (0.02s)
  9734. 863.15 s [vector] +++ OK, passed 100 tests.
  9735. 863.19 s [vector] mut_mapM_: OK (0.03s)
  9736. 863.19 s [vector] +++ OK, passed 100 tests.
  9737. 863.21 s [vector] mut_imapM_: OK (0.03s)
  9738. 863.21 s [vector] +++ OK, passed 100 tests.
  9739. 863.24 s [vector] mut_forM_: OK (0.03s)
  9740. 863.24 s [vector] +++ OK, passed 100 tests.
  9741. 863.27 s [vector] mut_iforM_: OK (0.03s)
  9742. 863.27 s [vector] +++ OK, passed 100 tests.
  9743. 863.28 s [vector] mut_foldr: OK
  9744. 863.29 s [vector] +++ OK, passed 100 tests.
  9745. 863.29 s [vector] mut_foldr': OK
  9746. 863.29 s [vector] +++ OK, passed 100 tests.
  9747. 863.30 s [vector] mut_foldl: OK
  9748. 863.30 s [vector] +++ OK, passed 100 tests.
  9749. 863.31 s [vector] mut_foldl': OK
  9750. 863.31 s [vector] +++ OK, passed 100 tests.
  9751. 863.31 s [vector] mut_ifoldr: OK
  9752. 863.31 s [vector] +++ OK, passed 100 tests.
  9753. 863.32 s [vector] mut_ifoldr': OK
  9754. 863.32 s [vector] +++ OK, passed 100 tests.
  9755. 863.33 s [vector] mut_ifoldl: OK
  9756. 863.33 s [vector] +++ OK, passed 100 tests.
  9757. 863.35 s [vector] mut_ifoldl': OK
  9758. 863.35 s [vector] +++ OK, passed 100 tests.
  9759. 863.35 s [vector] mut_foldM: OK
  9760. 863.35 s [vector] +++ OK, passed 100 tests.
  9761. 863.35 s [vector] mut_foldM': OK
  9762. 863.35 s [vector] +++ OK, passed 100 tests.
  9763. 863.37 s [vector] mut_foldrM: OK
  9764. 863.37 s [vector] +++ OK, passed 100 tests.
  9765. 863.37 s [vector] mut_foldrM': OK
  9766. 863.37 s [vector] +++ OK, passed 100 tests.
  9767. 863.38 s [vector] mut_ifoldM: OK
  9768. 863.39 s [vector] +++ OK, passed 100 tests.
  9769. 863.39 s [vector] mut_ifoldM': OK
  9770. 863.39 s [vector] +++ OK, passed 100 tests.
  9771. 863.41 s [vector] mut_ifoldrM: OK (0.01s)
  9772. 863.41 s [vector] +++ OK, passed 100 tests.
  9773. 863.41 s [vector] mut_ifoldrM': OK
  9774. 863.41 s [vector] +++ OK, passed 100 tests.
  9775. 863.41 s [vector] compare: OK
  9776. 863.41 s [vector] +++ OK, passed 100 tests.
  9777. 863.41 s [vector] maximum: OK
  9778. 863.41 s [vector] +++ OK, passed 100 tests; 26 discarded.
  9779. 863.41 s [vector] minimum: OK
  9780. 863.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9781. 863.41 s [vector] minIndex: OK
  9782. 863.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9783. 863.42 s [vector] maxIndex: OK
  9784. 863.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9785. 863.42 s [vector] maximumBy: OK
  9786. 863.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9787. 863.42 s [vector] minimumBy: OK
  9788. 863.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9789. 863.42 s [vector] maximumOn: OK
  9790. 863.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9791. 863.42 s [vector] minimumOn: OK
  9792. 863.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9793. 863.42 s [vector] maxIndexBy: OK
  9794. 863.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9795. 863.42 s [vector] minIndexBy: OK
  9796. 863.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9797. 863.42 s [vector] ListFirstMaxIndexWins: OK
  9798. 863.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9799. 863.42 s [vector] FalseListFirstMaxIndexWins: OK
  9800. 863.42 s [vector] +++ OK, failed as expected. (after 1 test):
  9801. 863.42 s [vector] Exception:
  9802. 863.42 s [vector] Prelude.foldr1: empty list
  9803. 863.42 s [vector] CallStack (from HasCallStack):
  9804. 863.42 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  9805. 863.42 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  9806. 863.42 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9807. 863.42 s [vector] []
  9808. 863.42 s [vector] zip: OK
  9809. 863.42 s [vector] +++ OK, passed 100 tests.
  9810. 863.42 s [vector] zip3: OK
  9811. 863.42 s [vector] +++ OK, passed 100 tests.
  9812. 863.42 s [vector] unzip: OK
  9813. 863.43 s [vector] +++ OK, passed 100 tests.
  9814. 863.43 s [vector] unzip3: OK
  9815. 863.43 s [vector] +++ OK, passed 100 tests.
  9816. 863.43 s [vector] indexed: OK
  9817. 863.43 s [vector] +++ OK, passed 100 tests.
  9818. 863.43 s [vector] update: OK
  9819. 863.43 s [vector] +++ OK, passed 100 tests.
  9820. 863.43 s [vector] mempty: OK
  9821. 863.43 s [vector] +++ OK, passed 1 test.
  9822. 863.43 s [vector] mappend: OK
  9823. 863.45 s [vector] +++ OK, passed 100 tests.
  9824. 863.46 s [vector] mconcat: OK (0.02s)
  9825. 863.46 s [vector] +++ OK, passed 100 tests.
  9826. 863.46 s [vector] glength: OK
  9827. 863.46 s [vector] +++ OK, passed 100 tests.
  9828. 863.46 s [vector] sum: OK
  9829. 863.46 s [vector] +++ OK, passed 100 tests.
  9830. 863.46 s [vector] product: OK
  9831. 863.46 s [vector] +++ OK, passed 100 tests.
  9832. 863.46 s [vector] enumFromN: OK
  9833. 863.46 s [vector] +++ OK, passed 100 tests.
  9834. 863.46 s [vector] enumFromThenN: OK
  9835. 863.46 s [vector] +++ OK, passed 100 tests.
  9836. 863.46 s [vector] enumFromTo: OK
  9837. 863.46 s [vector] +++ OK, passed 100 tests.
  9838. 863.46 s [vector] enumFromThenTo: OK
  9839. 863.46 s [vector] +++ OK, passed 100 tests; 2 discarded.
  9840. 863.46 s [vector] (Double)
  9841. 863.46 s [vector] fromList.toList == id: OK
  9842. 863.46 s [vector] +++ OK, passed 100 tests.
  9843. 863.46 s [vector] toList.fromList == id: OK
  9844. 863.46 s [vector] +++ OK, passed 100 tests.
  9845. 863.46 s [vector] unstream.stream == id: OK
  9846. 863.46 s [vector] +++ OK, passed 100 tests.
  9847. 863.46 s [vector] stream.unstream == id: OK
  9848. 863.46 s [vector] +++ OK, passed 100 tests.
  9849. 863.46 s [vector] eq: OK
  9850. 863.47 s [vector] +++ OK, passed 100 tests.
  9851. 863.47 s [vector] length: OK
  9852. 863.47 s [vector] +++ OK, passed 100 tests.
  9853. 863.47 s [vector] null: OK
  9854. 863.47 s [vector] +++ OK, passed 100 tests.
  9855. 863.47 s [vector] index: OK
  9856. 863.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9857. 863.47 s [vector] safeIndex: OK
  9858. 863.47 s [vector] +++ OK, passed 100 tests.
  9859. 863.47 s [vector] head: OK
  9860. 863.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9861. 863.47 s [vector] last: OK
  9862. 863.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9863. 863.47 s [vector] unsafeIndex: OK
  9864. 863.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9865. 863.47 s [vector] unsafeHead: OK
  9866. 863.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9867. 863.47 s [vector] unsafeLast: OK
  9868. 863.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9869. 863.47 s [vector] slice: OK
  9870. 863.47 s [vector] +++ OK, passed 100 tests.
  9871. 863.47 s [vector] init: OK
  9872. 863.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9873. 863.48 s [vector] tail: OK
  9874. 863.48 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9875. 863.48 s [vector] take: OK
  9876. 863.48 s [vector] +++ OK, passed 100 tests.
  9877. 863.48 s [vector] drop: OK
  9878. 863.48 s [vector] +++ OK, passed 100 tests.
  9879. 863.48 s [vector] splitAt: OK
  9880. 863.48 s [vector] +++ OK, passed 100 tests.
  9881. 863.48 s [vector] empty: OK
  9882. 863.48 s [vector] +++ OK, passed 1 test.
  9883. 863.48 s [vector] singleton: OK
  9884. 863.48 s [vector] +++ OK, passed 100 tests.
  9885. 863.48 s [vector] replicate: OK
  9886. 863.48 s [vector] +++ OK, passed 100 tests.
  9887. 863.48 s [vector] generate: OK
  9888. 863.48 s [vector] +++ OK, passed 100 tests.
  9889. 863.49 s [vector] iterateN: OK
  9890. 863.49 s [vector] +++ OK, passed 100 tests.
  9891. 863.53 s [vector] iterateNM: OK (0.03s)
  9892. 863.53 s [vector] +++ OK, passed 100 tests.
  9893. 863.55 s [vector] generateM: OK (0.04s)
  9894. 863.55 s [vector] +++ OK, passed 100 tests.
  9895. 863.56 s [vector] replicateM: OK
  9896. 863.56 s [vector] +++ OK, passed 100 tests.
  9897. 863.56 s [vector] create: OK
  9898. 863.56 s [vector] +++ OK, passed 100 tests.
  9899. 863.56 s [vector] createT: OK
  9900. 863.56 s [vector] +++ OK, passed 100 tests.
  9901. 863.56 s [vector] unfoldr: OK
  9902. 863.56 s [vector] +++ OK, passed 100 tests.
  9903. 863.56 s [vector] unfoldrN: OK
  9904. 863.56 s [vector] +++ OK, passed 100 tests.
  9905. 863.56 s [vector] unfoldrExactN: OK
  9906. 863.57 s [vector] +++ OK, passed 100 tests.
  9907. 863.57 s [vector] unfoldrM: OK
  9908. 863.57 s [vector] +++ OK, passed 100 tests.
  9909. 863.57 s [vector] unfoldrNM: OK
  9910. 863.57 s [vector] +++ OK, passed 100 tests.
  9911. 863.59 s [vector] unfoldrExactNM: OK (0.02s)
  9912. 863.59 s [vector] +++ OK, passed 100 tests.
  9913. 863.60 s [vector] constructN: OK (0.02s)
  9914. 863.60 s [vector] +++ OK, passed 100 tests.
  9915. 863.62 s [vector] constructrN: OK
  9916. 863.62 s [vector] +++ OK, passed 100 tests.
  9917. 863.62 s [vector] cons: OK
  9918. 863.62 s [vector] +++ OK, passed 100 tests.
  9919. 863.62 s [vector] snoc: OK
  9920. 863.62 s [smallcheck] Documentation created: dist/doc/html/smallcheck/,
  9921. 863.62 s [smallcheck] dist/doc/html/smallcheck/smallcheck.txt
  9922. 863.62 s [vector] +++ OK, passed 100 tests.
  9923. 863.62 s [vector] append: OK
  9924. 863.64 s [vector] +++ OK, passed 100 tests.
  9925. 863.65 s [vector] concat: OK (0.02s)
  9926. 863.65 s [vector] +++ OK, passed 100 tests.
  9927. 863.65 s [vector] force: OK
  9928. 863.65 s [vector] +++ OK, passed 100 tests.
  9929. 863.65 s [vector] upd: OK
  9930. 863.65 s [vector] +++ OK, passed 100 tests.
  9931. 863.66 s [hedgehog] [17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, dist/build/Hedgehog/Internal/Property.o, dist/build/Hedgehog/Internal/Property.dyn_o )
  9932. 863.66 s [vector] accum: OK (0.01s)
  9933. 863.66 s [vector] +++ OK, passed 100 tests.
  9934. 863.66 s [vector] reverse: OK
  9935. 863.66 s [vector] +++ OK, passed 100 tests.
  9936. 863.67 s [vector] backpermute: OK
  9937. 863.67 s [vector] +++ OK, passed 100 tests.
  9938. 863.68 s [vector] map: OK
  9939. 863.68 s [vector] +++ OK, passed 100 tests.
  9940. 863.68 s [vector] imap: OK
  9941. 863.69 s [vector] +++ OK, passed 100 tests.
  9942. 863.69 s [vector] concatMap: OK
  9943. 863.69 s [vector] +++ OK, passed 100 tests.
  9944. 863.70 s [smallcheck] Phase: installPhase
  9945. 863.71 s [vector] mapM: OK
  9946. 863.71 s [vector] +++ OK, passed 100 tests.
  9947. 863.74 s [vector] mapM_: OK (0.03s)
  9948. 863.74 s [smallcheck] Installing library in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  9949. 863.74 s [vector] +++ OK, passed 100 tests.
  9950. 863.75 s [vector] forM: OK (0.02s)
  9951. 863.75 s [vector] +++ OK, passed 100 tests.
  9952. 863.78 s [vector] forM_: OK (0.03s)
  9953. 863.78 s [vector] +++ OK, passed 100 tests.
  9954. 863.78 s [vector] imapM: OK
  9955. 863.79 s [vector] +++ OK, passed 100 tests.
  9956. 863.87 s [vector] imapM_: OK (0.04s)
  9957. 863.87 s [vector] +++ OK, passed 100 tests.
  9958. 863.88 s [hedgehog]
  9959. 863.88 s [hedgehog] src/Hedgehog/Internal/Property.hs:433:31: warning: [GHC-63394] [-Wx-partial]
  9960. 863.88 s [hedgehog] In the use of ‘head’
  9961. 863.88 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  9962. 863.88 s [hedgehog] "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."
  9963. 863.88 s [hedgehog] |
  9964. 863.88 s [hedgehog] 433 | groups = List.map (\l -> (head l, length l)) $ List.group sp
  9965. 863.88 s [hedgehog] | ^^^^
  9966. 863.89 s [vector] zipWith: OK (0.05s)
  9967. 863.89 s [vector] +++ OK, passed 100 tests.
  9968. 863.89 s [vector] zipWith3: OK
  9969. 863.89 s [vector] +++ OK, passed 100 tests.
  9970. 863.91 s [vector] izipWith: OK (0.01s)
  9971. 863.91 s [vector] +++ OK, passed 100 tests.
  9972. 863.93 s [vector] izipWith3: OK (0.01s)
  9973. 863.93 s [vector] +++ OK, passed 100 tests.
  9974. 863.93 s [vector] izipWithM: OK (0.01s)
  9975. 863.93 s [vector] +++ OK, passed 100 tests.
  9976. 863.97 s [vector] izipWithM_: OK (0.03s)
  9977. 863.97 s [vector] +++ OK, passed 100 tests.
  9978. 864.39 s [vector] zipWithM: OK
  9979. 864.39 s [vector] +++ OK, passed 100 tests.
  9980. 864.39 s [vector] zipWithM_: OK (0.03s)
  9981. 864.39 s [vector] +++ OK, passed 100 tests.
  9982. 864.39 s [vector] filter: OK
  9983. 864.39 s [vector] +++ OK, passed 100 tests.
  9984. 864.39 s [vector] ifilter: OK
  9985. 864.39 s [vector] +++ OK, passed 100 tests.
  9986. 864.39 s [vector] filterM: OK (0.04s)
  9987. 864.39 s [vector] +++ OK, passed 100 tests.
  9988. 864.39 s [vector] uniq: OK
  9989. 864.39 s [vector] +++ OK, passed 100 tests.
  9990. 864.39 s [vector] mapMaybe: OK
  9991. 864.39 s [vector] +++ OK, passed 100 tests.
  9992. 864.39 s [vector] imapMaybe: OK
  9993. 864.39 s [vector] +++ OK, passed 100 tests.
  9994. 864.39 s [vector] takeWhile: OK
  9995. 864.39 s [vector] +++ OK, passed 100 tests.
  9996. 864.39 s [vector] dropWhile: OK
  9997. 864.39 s [vector] +++ OK, passed 100 tests.
  9998. 864.39 s [vector] partition: OK
  9999. 864.39 s [vector] +++ OK, passed 100 tests.
  10000. 864.39 s [vector] partitionWith: OK
  10001. 864.39 s [vector] +++ OK, passed 100 tests.
  10002. 864.39 s [vector] span: OK
  10003. 864.39 s [vector] +++ OK, passed 100 tests.
  10004. 864.39 s [vector] break: OK
  10005. 864.39 s [vector] +++ OK, passed 100 tests.
  10006. 864.39 s [vector] spanR: OK
  10007. 864.39 s [vector] +++ OK, passed 100 tests.
  10008. 864.39 s [vector] breakR: OK
  10009. 864.39 s [vector] +++ OK, passed 100 tests.
  10010. 864.39 s [vector] groupBy: OK (0.01s)
  10011. 864.39 s [vector] +++ OK, passed 100 tests.
  10012. 864.39 s [vector] elem: OK
  10013. 864.39 s [vector] +++ OK, passed 100 tests.
  10014. 864.39 s [vector] notElem: OK
  10015. 864.39 s [vector] +++ OK, passed 100 tests.
  10016. 864.39 s [vector] find: OK
  10017. 864.39 s [vector] +++ OK, passed 100 tests.
  10018. 864.39 s [vector] findIndex: OK
  10019. 864.39 s [vector] +++ OK, passed 100 tests.
  10020. 864.39 s [vector] findIndexR: OK
  10021. 864.39 s [vector] +++ OK, passed 100 tests.
  10022. 864.39 s [vector] findIndices: OK
  10023. 864.39 s [vector] +++ OK, passed 100 tests.
  10024. 864.39 s [vector] elemIndex: OK
  10025. 864.39 s [vector] +++ OK, passed 100 tests.
  10026. 864.39 s [vector] elemIndices: OK
  10027. 864.39 s [vector] +++ OK, passed 100 tests.
  10028. 864.39 s [vector] foldl: OK (0.01s)
  10029. 864.39 s [vector] +++ OK, passed 100 tests.
  10030. 864.39 s [vector] foldl1: OK (0.01s)
  10031. 864.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10032. 864.39 s [vector] foldl': OK (0.01s)
  10033. 864.39 s [vector] +++ OK, passed 100 tests.
  10034. 864.39 s [vector] foldl1': OK (0.01s)
  10035. 864.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10036. 864.39 s [vector] foldr: OK (0.01s)
  10037. 864.39 s [vector] +++ OK, passed 100 tests.
  10038. 864.39 s [vector] foldr1: OK (0.01s)
  10039. 864.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10040. 864.39 s [vector] foldr': OK (0.01s)
  10041. 864.39 s [vector] +++ OK, passed 100 tests.
  10042. 864.39 s [vector] foldr1': OK (0.01s)
  10043. 864.39 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10044. 864.39 s [vector] ifoldl: OK (0.02s)
  10045. 864.39 s [vector] +++ OK, passed 100 tests.
  10046. 864.39 s [smallcheck] Phase: fixupPhase
  10047. 864.39 s [vector] ifoldl': OK
  10048. 864.39 s [vector] +++ OK, passed 100 tests.
  10049. 864.39 s [vector] ifoldr: OK (0.02s)
  10050. 864.39 s [vector] +++ OK, passed 100 tests.
  10051. 864.39 s [vector] ifoldr': OK (0.01s)
  10052. 864.39 s [vector] +++ OK, passed 100 tests.
  10053. 864.39 s [vector] ifoldM: OK (0.01s)
  10054. 864.39 s [vector] +++ OK, passed 100 tests.
  10055. 864.39 s [vector] ifoldM': OK (0.01s)
  10056. 864.39 s [vector] +++ OK, passed 100 tests.
  10057. 864.39 s [vector] ifoldM_: OK (0.04s)
  10058. 864.39 s [vector] +++ OK, passed 100 tests.
  10059. 864.40 s [vector] ifoldM'_: OK (0.04s)
  10060. 864.40 s [vector] +++ OK, passed 100 tests.
  10061. 864.40 s [vector] all: OK
  10062. 864.40 s [vector] +++ OK, passed 100 tests.
  10063. 864.41 s [vector] any: OK
  10064. 864.41 s [vector] +++ OK, passed 100 tests.
  10065. 864.43 s [smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1
  10066. 864.43 s [vector] prescanl: OK (0.01s)
  10067. 864.43 s [vector] +++ OK, passed 100 tests.
  10068. 864.43 s [vector] prescanl': OK (0.01s)
  10069. 864.43 s [vector] +++ OK, passed 100 tests.
  10070. 864.44 s [smallcheck] shrinking /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSsmallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk-ghc9.8.1.so
  10071. 864.45 s [smallcheck] checking for references to /build/ in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1...
  10072. 864.45 s [vector] postscanl: OK (0.02s)
  10073. 864.45 s [vector] +++ OK, passed 100 tests.
  10074. 864.46 s [vector] postscanl': OK (0.01s)
  10075. 864.46 s [vector] +++ OK, passed 100 tests.
  10076. 864.47 s [smallcheck] patching script interpreter paths in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1
  10077. 864.47 s [vector] scanl: OK (0.01s)
  10078. 864.47 s [vector] +++ OK, passed 100 tests.
  10079. 864.48 s [smallcheck] stripping (with command strip and flags -S -p) in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib
  10080. 864.49 s [vector] scanl': OK (0.02s)
  10081. 864.49 s [vector] +++ OK, passed 100 tests.
  10082. 864.51 s [vector] scanl1: OK (0.01s)
  10083. 864.51 s [vector] +++ OK, passed 100 tests.
  10084. 864.53 s [vector] scanl1': OK (0.01s)
  10085. 864.53 s [vector] +++ OK, passed 100 tests.
  10086. 864.53 s [vector] iscanl: OK (0.02s)
  10087. 864.53 s [vector] +++ OK, passed 100 tests.
  10088. 864.55 s [vector] iscanl': OK (0.02s)
  10089. 864.55 s [vector] +++ OK, passed 100 tests.
  10090. 864.57 s [vector] prescanr: OK
  10091. 864.58 s [vector] +++ OK, passed 100 tests.
  10092. 864.59 s [vector] prescanr': OK (0.02s)
  10093. 864.59 s [vector] +++ OK, passed 100 tests.
  10094. 864.59 s [vector] postscanr: OK (0.01s)
  10095. 864.59 s [vector] +++ OK, passed 100 tests.
  10096. 864.61 s [vector] postscanr': OK (0.01s)
  10097. 864.61 s [vector] +++ OK, passed 100 tests.
  10098. 864.62 s [vector] scanr: OK
  10099. 864.63 s [vector] +++ OK, passed 100 tests.
  10100. 864.65 s [vector] scanr': OK (0.01s)
  10101. 864.65 s [vector] +++ OK, passed 100 tests.
  10102. 864.65 s [vector] scanr1: OK (0.02s)
  10103. 864.65 s [vector] +++ OK, passed 100 tests.
  10104. 864.67 s [vector] scanr1': OK (0.02s)
  10105. 864.67 s [vector] +++ OK, passed 100 tests.
  10106. 864.68 s [smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc
  10107. 864.69 s [smallcheck] checking for references to /build/ in /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc...
  10108. 864.70 s [smallcheck] patching script interpreter paths in /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc
  10109. 864.70 s [vector] iscanr: OK (0.02s)
  10110. 864.70 s [vector] +++ OK, passed 100 tests.
  10111. 864.70 s [vector] iscanr': OK (0.02s)
  10112. 864.70 s [vector] +++ OK, passed 100 tests.
  10113. 864.70 s [vector] mut_read: OK
  10114. 864.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10115. 864.70 s [vector] mut_write: OK
  10116. 864.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10117. 864.70 s [vector] mut_modify: OK
  10118. 864.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10119. 864.71 s [vector] mut_generate: OK
  10120. 864.71 s [vector] +++ OK, passed 100 tests.
  10121. 864.97 s [smallcheck:post-build] Uploading to cachix cache "sellout": /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1 /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc
  10122. 866.06 s [smallcheck:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  10123. 866.06 s [smallcheck:post-build]
  10124. 866.43 s [smallcheck:post-build] Pushing /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1 (6.71 MiB)
  10125. 866.52 s [smallcheck:post-build] Pushing /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc (1.97 MiB)
  10126. 867.64 s [smallcheck:post-build]
  10127. 867.65 s [smallcheck:post-build] All done.
  10128. 867.76 s [smallcheck:post-build] Uploading to the NixCI cache: /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1 /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc
  10129. 868.23 s [smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  10130. 868.55 s [smallcheck:post-build] copying 2 paths...
  10131. 868.55 s [smallcheck:post-build] copying path '/nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc' to 'https://cache.nix-ci.com'...
  10132. 869.34 s [smallcheck:post-build] copying path '/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1' to 'https://cache.nix-ci.com'...
  10133. 872.09 s [smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  10134. 872.50 s [smallcheck:post-build] copying 1 paths...
  10135. 872.51 s [smallcheck:post-build] copying path '/nix/store/sxj3qqxf7awzli4lkwmrqhbzdwvrz3sp-smallcheck-1.2.1.1.drv' to 'https://cache.nix-ci.com'...
  10136. 872.94 s Progress: 29 of 48 built (2 building)
  10137. 872.99 s Building /nix/store/4wi66qphj36m7fxwhw032c9jj721fqpp-tasty-smallcheck-0.8.2.drv
  10138. 872.99 s [hedgehog] [18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, dist/build/Hedgehog/Internal/Tripping.o, dist/build/Hedgehog/Internal/Tripping.dyn_o )
  10139. 872.99 s [hedgehog] [19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, dist/build/Hedgehog/Internal/State.o, dist/build/Hedgehog/Internal/State.dyn_o )
  10140. 872.99 s [hedgehog] [20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, dist/build/Hedgehog/Internal/Discovery.o, dist/build/Hedgehog/Internal/Discovery.dyn_o )
  10141. 872.99 s [hedgehog] [21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, dist/build/Hedgehog/Internal/TH.o, dist/build/Hedgehog/Internal/TH.dyn_o )
  10142. 872.99 s [hedgehog] [22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, dist/build/Hedgehog/Internal/Config.o, dist/build/Hedgehog/Internal/Config.dyn_o )
  10143. 872.99 s [hedgehog] [23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, dist/build/Hedgehog/Internal/Report.o, dist/build/Hedgehog/Internal/Report.dyn_o )
  10144. 872.99 s [hedgehog]
  10145. 872.99 s [hedgehog] src/Hedgehog/Internal/Report.hs:1096:37: warning: [GHC-63394] [-Wx-partial]
  10146. 872.99 s [hedgehog] In the use of ‘head’
  10147. 872.99 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  10148. 872.99 s [hedgehog] "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."
  10149. 872.99 s [hedgehog] |
  10150. 872.99 s [hedgehog] 1096 | replicate fillErrorWidth (head parts)
  10151. 872.99 s [hedgehog] | ^^^^
  10152. 872.99 s [hedgehog]
  10153. 872.99 s [hedgehog] src/Hedgehog/Internal/Report.hs:1098:39: warning: [GHC-63394] [-Wx-partial]
  10154. 872.99 s [hedgehog] In the use of ‘head’
  10155. 872.99 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  10156. 872.99 s [hedgehog] "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."
  10157. 872.99 s [hedgehog] |
  10158. 872.99 s [hedgehog] 1098 | replicate fillSurplusWidth (head parts)
  10159. 872.99 s [hedgehog] | ^^^^
  10160. 872.99 s [hedgehog] [24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, dist/build/Hedgehog/Internal/Queue.o, dist/build/Hedgehog/Internal/Queue.dyn_o )
  10161. 873.00 s [hedgehog] [25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, dist/build/Hedgehog/Internal/Runner.o, dist/build/Hedgehog/Internal/Runner.dyn_o )
  10162. 873.00 s [hedgehog] [26 of 27] Compiling Hedgehog.Gen ( src/Hedgehog/Gen.hs, dist/build/Hedgehog/Gen.o, dist/build/Hedgehog/Gen.dyn_o )
  10163. 873.00 s [hedgehog] [27 of 27] Compiling Hedgehog ( src/Hedgehog.hs, dist/build/Hedgehog.o, dist/build/Hedgehog.dyn_o )
  10164. 873.00 s [hedgehog] [ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, dist/build/Hedgehog/Internal/Barbie.p_o )
  10165. 873.00 s [vector] mut_generateM: OK (0.02s)
  10166. 873.00 s [vector] +++ OK, passed 100 tests.
  10167. 873.00 s [vector] mut_mapM_: OK (0.04s)
  10168. 873.00 s [vector] +++ OK, passed 100 tests.
  10169. 873.00 s [vector] mut_imapM_: OK (0.04s)
  10170. 873.00 s [vector] +++ OK, passed 100 tests.
  10171. 873.00 s [vector] mut_forM_: OK (0.03s)
  10172. 873.00 s [vector] +++ OK, passed 100 tests.
  10173. 873.00 s [vector] mut_iforM_: OK (0.03s)
  10174. 873.00 s [vector] +++ OK, passed 100 tests.
  10175. 873.00 s [vector] mut_foldr: OK (0.01s)
  10176. 873.00 s [vector] +++ OK, passed 100 tests.
  10177. 873.00 s [vector] mut_foldr': OK (0.01s)
  10178. 873.00 s [vector] +++ OK, passed 100 tests.
  10179. 873.00 s [vector] mut_foldl: OK (0.01s)
  10180. 873.00 s [vector] +++ OK, passed 100 tests.
  10181. 873.00 s [vector] mut_foldl': OK (0.01s)
  10182. 873.00 s [vector] +++ OK, passed 100 tests.
  10183. 873.00 s [vector] mut_ifoldr: OK (0.02s)
  10184. 873.00 s [vector] +++ OK, passed 100 tests.
  10185. 873.00 s [vector] mut_ifoldr': OK (0.01s)
  10186. 873.00 s [vector] +++ OK, passed 100 tests.
  10187. 873.00 s [vector] mut_ifoldl: OK (0.02s)
  10188. 873.00 s [vector] +++ OK, passed 100 tests.
  10189. 873.00 s [vector] mut_ifoldl': OK
  10190. 873.00 s [vector] +++ OK, passed 100 tests.
  10191. 873.00 s [vector] mut_foldM: OK (0.01s)
  10192. 873.00 s [vector] +++ OK, passed 100 tests.
  10193. 873.00 s [vector] mut_foldM': OK (0.02s)
  10194. 873.00 s [vector] +++ OK, passed 100 tests.
  10195. 873.00 s [vector] mut_foldrM: OK (0.02s)
  10196. 873.00 s [vector] +++ OK, passed 100 tests.
  10197. 873.00 s [vector] mut_foldrM': OK (0.02s)
  10198. 873.00 s [vector] +++ OK, passed 100 tests.
  10199. 873.00 s [vector] mut_ifoldM: OK (0.02s)
  10200. 873.00 s [vector] +++ OK, passed 100 tests.
  10201. 873.00 s [vector] mut_ifoldM': OK (0.02s)
  10202. 873.00 s [vector] +++ OK, passed 100 tests.
  10203. 873.00 s [vector] mut_ifoldrM: OK (0.01s)
  10204. 873.00 s [vector] +++ OK, passed 100 tests.
  10205. 873.00 s [vector] mut_ifoldrM': OK (0.01s)
  10206. 873.00 s [vector] +++ OK, passed 100 tests.
  10207. 873.00 s [vector] compare: OK
  10208. 873.00 s [vector] +++ OK, passed 100 tests.
  10209. 873.00 s [vector] maximum: OK
  10210. 873.00 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10211. 873.00 s [vector] minimum: OK
  10212. 873.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10213. 873.00 s [vector] minIndex: OK
  10214. 873.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10215. 873.00 s [vector] maxIndex: OK
  10216. 873.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10217. 873.00 s [vector] maximumBy: OK
  10218. 873.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10219. 873.00 s [vector] minimumBy: OK
  10220. 873.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10221. 873.00 s [vector] maximumOn: OK
  10222. 873.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10223. 873.00 s [vector] minimumOn: OK
  10224. 873.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10225. 873.00 s [vector] maxIndexBy: OK
  10226. 873.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10227. 873.00 s [vector] minIndexBy: OK
  10228. 873.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10229. 873.00 s [vector] ListFirstMaxIndexWins: OK
  10230. 873.00 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10231. 873.00 s [vector] FalseListFirstMaxIndexWins: OK
  10232. 873.00 s [vector] +++ OK, failed as expected. (after 1 test):
  10233. 873.00 s [vector] Exception:
  10234. 873.00 s [vector] Prelude.foldr1: empty list
  10235. 873.00 s [vector] CallStack (from HasCallStack):
  10236. 873.00 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  10237. 873.00 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  10238. 873.00 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10239. 873.00 s [vector] []
  10240. 873.00 s [vector] zip: OK
  10241. 873.00 s [vector] +++ OK, passed 100 tests.
  10242. 873.00 s [vector] zip3: OK
  10243. 873.00 s [vector] +++ OK, passed 100 tests.
  10244. 873.00 s [vector] unzip: OK
  10245. 873.00 s [vector] +++ OK, passed 100 tests.
  10246. 873.00 s [vector] unzip3: OK
  10247. 873.00 s [vector] +++ OK, passed 100 tests.
  10248. 873.00 s [vector] indexed: OK
  10249. 873.00 s [vector] +++ OK, passed 100 tests.
  10250. 873.00 s [vector] update: OK
  10251. 873.00 s [vector] +++ OK, passed 100 tests.
  10252. 873.00 s [vector] mempty: OK
  10253. 873.00 s [vector] +++ OK, passed 1 test.
  10254. 873.00 s [vector] mappend: OK
  10255. 873.00 s [vector] +++ OK, passed 100 tests.
  10256. 873.00 s [vector] mconcat: OK (0.03s)
  10257. 873.00 s [vector] +++ OK, passed 100 tests.
  10258. 873.00 s [vector] glength: OK
  10259. 873.00 s [vector] +++ OK, passed 100 tests.
  10260. 873.00 s [vector] sum: OK
  10261. 873.00 s [vector] +++ OK, passed 100 tests.
  10262. 873.00 s [vector] product: OK
  10263. 873.00 s [vector] +++ OK, passed 100 tests.
  10264. 873.00 s [vector] enumFromN: OK
  10265. 873.00 s [vector] +++ OK, passed 100 tests.
  10266. 873.00 s [vector] enumFromThenN: OK
  10267. 873.00 s [vector] +++ OK, passed 100 tests.
  10268. 873.00 s [vector] enumFromTo: OK
  10269. 873.00 s [vector] +++ OK, passed 100 tests.
  10270. 873.00 s [vector] enumFromThenTo: OK
  10271. 873.00 s [vector] +++ OK, passed 100 tests; 6 discarded.
  10272. 873.00 s [vector] (Int,Bool)
  10273. 873.00 s [vector] fromList.toList == id: OK
  10274. 873.00 s [vector] +++ OK, passed 100 tests.
  10275. 873.00 s [vector] toList.fromList == id: OK
  10276. 873.00 s [vector] +++ OK, passed 100 tests.
  10277. 873.00 s [vector] unstream.stream == id: OK
  10278. 873.00 s [vector] +++ OK, passed 100 tests.
  10279. 873.00 s [vector] stream.unstream == id: OK
  10280. 873.00 s [vector] +++ OK, passed 100 tests.
  10281. 873.00 s [vector] eq: OK
  10282. 873.00 s [vector] +++ OK, passed 100 tests.
  10283. 873.00 s [vector] length: OK
  10284. 873.00 s [vector] +++ OK, passed 100 tests.
  10285. 873.00 s [vector] null: OK
  10286. 873.00 s [vector] +++ OK, passed 100 tests.
  10287. 873.00 s [vector] index: OK
  10288. 873.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10289. 873.00 s [vector] safeIndex: OK
  10290. 873.00 s [vector] +++ OK, passed 100 tests.
  10291. 873.00 s [vector] head: OK
  10292. 873.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10293. 873.00 s [vector] last: OK
  10294. 873.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10295. 873.00 s [vector] unsafeIndex: OK
  10296. 873.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10297. 873.00 s [vector] unsafeHead: OK
  10298. 873.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10299. 873.00 s [vector] unsafeLast: OK
  10300. 873.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10301. 873.00 s [vector] slice: OK
  10302. 873.00 s [vector] +++ OK, passed 100 tests.
  10303. 873.00 s [vector] init: OK
  10304. 873.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10305. 873.00 s [vector] tail: OK
  10306. 873.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10307. 873.00 s [vector] take: OK
  10308. 873.00 s [vector] +++ OK, passed 100 tests.
  10309. 873.00 s [vector] drop: OK
  10310. 873.00 s [vector] +++ OK, passed 100 tests.
  10311. 873.00 s [vector] splitAt: OK
  10312. 873.00 s [vector] +++ OK, passed 100 tests.
  10313. 873.00 s [vector] empty: OK
  10314. 873.00 s [vector] +++ OK, passed 1 test.
  10315. 873.00 s [vector] singleton: OK
  10316. 873.00 s [vector] +++ OK, passed 100 tests.
  10317. 873.00 s [vector] replicate: OK
  10318. 873.00 s [vector] +++ OK, passed 100 tests.
  10319. 873.00 s [vector] generate: OK
  10320. 873.00 s [vector] +++ OK, passed 100 tests.
  10321. 873.00 s [vector] iterateN: OK
  10322. 873.00 s [vector] +++ OK, passed 100 tests.
  10323. 873.00 s [vector] iterateNM: OK (0.02s)
  10324. 873.00 s [vector] +++ OK, passed 100 tests.
  10325. 873.00 s [vector] generateM: OK (0.03s)
  10326. 873.00 s [vector] +++ OK, passed 100 tests.
  10327. 873.00 s [vector] replicateM: OK (0.01s)
  10328. 873.00 s [vector] +++ OK, passed 100 tests.
  10329. 873.00 s [vector] create: OK
  10330. 873.00 s [vector] +++ OK, passed 100 tests.
  10331. 873.00 s [vector] createT: OK
  10332. 873.00 s [vector] +++ OK, passed 100 tests.
  10333. 873.00 s [vector] unfoldr: OK
  10334. 873.00 s [vector] +++ OK, passed 100 tests.
  10335. 873.00 s [vector] unfoldrN: OK
  10336. 873.00 s [vector] +++ OK, passed 100 tests.
  10337. 873.00 s [vector] unfoldrExactN: OK
  10338. 873.00 s [vector] +++ OK, passed 100 tests.
  10339. 873.00 s [vector] unfoldrM: OK
  10340. 873.00 s [vector] +++ OK, passed 100 tests.
  10341. 873.00 s [vector] unfoldrNM: OK
  10342. 873.00 s [vector] +++ OK, passed 100 tests.
  10343. 873.00 s [vector] unfoldrExactNM: OK (0.03s)
  10344. 873.00 s [vector] +++ OK, passed 100 tests.
  10345. 873.00 s [vector] constructN: OK
  10346. 873.00 s [vector] +++ OK, passed 100 tests.
  10347. 873.00 s [vector] constructrN: OK
  10348. 873.00 s [vector] +++ OK, passed 100 tests.
  10349. 873.00 s [vector] cons: OK
  10350. 873.00 s [vector] +++ OK, passed 100 tests.
  10351. 873.00 s [vector] snoc: OK
  10352. 873.00 s [vector] +++ OK, passed 100 tests.
  10353. 873.00 s [vector] append: OK
  10354. 873.00 s [vector] +++ OK, passed 100 tests.
  10355. 873.00 s [vector] concat: OK (0.04s)
  10356. 873.00 s [vector] +++ OK, passed 100 tests.
  10357. 873.00 s [vector] force: OK
  10358. 873.00 s [vector] +++ OK, passed 100 tests.
  10359. 873.00 s [vector] upd: OK
  10360. 873.00 s [vector] +++ OK, passed 100 tests.
  10361. 873.00 s [vector] accum: OK
  10362. 873.00 s [vector] +++ OK, passed 100 tests.
  10363. 873.00 s [vector] reverse: OK
  10364. 873.00 s [vector] +++ OK, passed 100 tests.
  10365. 873.00 s [vector] backpermute: OK
  10366. 873.00 s [vector] +++ OK, passed 100 tests.
  10367. 873.00 s [vector] map: OK
  10368. 873.00 s [vector] +++ OK, passed 100 tests.
  10369. 873.00 s [vector] imap: OK
  10370. 873.00 s [vector] +++ OK, passed 100 tests.
  10371. 873.00 s [vector] concatMap: OK
  10372. 873.00 s [vector] +++ OK, passed 100 tests.
  10373. 873.00 s [vector] mapM: OK
  10374. 873.00 s [vector] +++ OK, passed 100 tests.
  10375. 873.00 s [vector] mapM_: OK
  10376. 873.00 s [vector] +++ OK, passed 100 tests.
  10377. 873.00 s [vector] forM: OK
  10378. 873.00 s [vector] +++ OK, passed 100 tests.
  10379. 873.00 s [vector] forM_: OK (0.02s)
  10380. 873.00 s [vector] +++ OK, passed 100 tests.
  10381. 873.00 s [vector] imapM: OK
  10382. 873.00 s [vector] +++ OK, passed 100 tests.
  10383. 873.00 s [vector] imapM_: OK (0.03s)
  10384. 873.00 s [vector] +++ OK, passed 100 tests.
  10385. 873.00 s [vector] zipWith: OK
  10386. 873.00 s [vector] +++ OK, passed 100 tests.
  10387. 873.00 s [vector] zipWith3: OK
  10388. 873.00 s [vector] +++ OK, passed 100 tests.
  10389. 873.00 s [vector] izipWith: OK
  10390. 873.00 s [vector] +++ OK, passed 100 tests.
  10391. 873.00 s [vector] izipWith3: OK
  10392. 873.00 s [vector] +++ OK, passed 100 tests.
  10393. 873.00 s [vector] izipWithM: OK
  10394. 873.00 s [vector] +++ OK, passed 100 tests.
  10395. 873.00 s [vector] izipWithM_: OK (0.02s)
  10396. 873.00 s [vector] +++ OK, passed 100 tests.
  10397. 873.00 s [vector] zipWithM: OK
  10398. 873.00 s [vector] +++ OK, passed 100 tests.
  10399. 873.00 s [vector] zipWithM_: OK (0.02s)
  10400. 873.00 s [vector] +++ OK, passed 100 tests.
  10401. 873.00 s [vector] filter: OK
  10402. 873.00 s [vector] +++ OK, passed 100 tests.
  10403. 873.00 s [vector] ifilter: OK
  10404. 873.00 s [vector] +++ OK, passed 100 tests.
  10405. 873.00 s [vector] filterM: OK (0.03s)
  10406. 873.00 s [vector] +++ OK, passed 100 tests.
  10407. 873.00 s [vector] uniq: OK
  10408. 873.00 s [vector] +++ OK, passed 100 tests.
  10409. 873.00 s [vector] mapMaybe: OK
  10410. 873.00 s [vector] +++ OK, passed 100 tests.
  10411. 873.00 s [vector] imapMaybe: OK
  10412. 873.00 s [vector] +++ OK, passed 100 tests.
  10413. 873.00 s [vector] takeWhile: OK
  10414. 873.00 s [vector] +++ OK, passed 100 tests.
  10415. 873.00 s [vector] dropWhile: OK
  10416. 873.00 s [vector] +++ OK, passed 100 tests.
  10417. 873.00 s [vector] partition: OK
  10418. 873.00 s [vector] +++ OK, passed 100 tests.
  10419. 873.00 s [vector] partitionWith: OK
  10420. 873.00 s [vector] +++ OK, passed 100 tests.
  10421. 873.00 s [vector] span: OK
  10422. 873.00 s [vector] +++ OK, passed 100 tests.
  10423. 873.00 s [vector] break: OK
  10424. 873.00 s [vector] +++ OK, passed 100 tests.
  10425. 873.00 s [vector] spanR: OK
  10426. 873.00 s [vector] +++ OK, passed 100 tests.
  10427. 873.00 s [vector] breakR: OK
  10428. 873.00 s [vector] +++ OK, passed 100 tests.
  10429. 873.00 s [vector] groupBy: OK
  10430. 873.00 s [vector] +++ OK, passed 100 tests.
  10431. 873.00 s [vector] elem: OK
  10432. 873.00 s [vector] +++ OK, passed 100 tests.
  10433. 873.00 s [vector] notElem: OK
  10434. 873.00 s [vector] +++ OK, passed 100 tests.
  10435. 873.00 s [vector] find: OK
  10436. 873.00 s [vector] +++ OK, passed 100 tests.
  10437. 873.00 s [vector] findIndex: OK
  10438. 873.00 s [vector] +++ OK, passed 100 tests.
  10439. 873.00 s [vector] findIndexR: OK
  10440. 873.00 s [vector] +++ OK, passed 100 tests.
  10441. 873.00 s [vector] findIndices: OK
  10442. 873.01 s [vector] +++ OK, passed 100 tests.
  10443. 873.01 s [vector] elemIndex: OK
  10444. 873.01 s [vector] +++ OK, passed 100 tests.
  10445. 873.01 s [vector] elemIndices: OK
  10446. 873.01 s [vector] +++ OK, passed 100 tests.
  10447. 873.01 s [vector] foldl: OK
  10448. 873.01 s [vector] +++ OK, passed 100 tests.
  10449. 873.01 s [vector] foldl1: OK
  10450. 873.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10451. 873.01 s [vector] foldl': OK
  10452. 873.01 s [vector] +++ OK, passed 100 tests.
  10453. 873.01 s [vector] foldl1': OK
  10454. 873.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10455. 873.01 s [vector] foldr: OK
  10456. 873.01 s [vector] +++ OK, passed 100 tests.
  10457. 873.01 s [vector] foldr1: OK
  10458. 873.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10459. 873.01 s [vector] foldr': OK
  10460. 873.01 s [vector] +++ OK, passed 100 tests.
  10461. 873.01 s [vector] foldr1': OK
  10462. 873.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10463. 873.01 s [vector] ifoldl: OK
  10464. 873.01 s [vector] +++ OK, passed 100 tests.
  10465. 873.01 s [vector] ifoldl': OK
  10466. 873.01 s [vector] +++ OK, passed 100 tests.
  10467. 873.01 s [vector] ifoldr: OK
  10468. 873.01 s [vector] +++ OK, passed 100 tests.
  10469. 873.01 s [vector] ifoldr': OK
  10470. 873.01 s [vector] +++ OK, passed 100 tests.
  10471. 873.01 s [vector] ifoldM: OK
  10472. 873.01 s [vector] +++ OK, passed 100 tests.
  10473. 873.01 s [vector] ifoldM': OK
  10474. 873.01 s [vector] +++ OK, passed 100 tests.
  10475. 873.01 s [vector] ifoldM_: OK (0.03s)
  10476. 873.01 s [vector] +++ OK, passed 100 tests.
  10477. 873.01 s [vector] ifoldM'_: OK (0.03s)
  10478. 873.01 s [vector] +++ OK, passed 100 tests.
  10479. 873.01 s [vector] all: OK
  10480. 873.01 s [vector] +++ OK, passed 100 tests.
  10481. 873.01 s [vector] any: OK
  10482. 873.01 s [vector] +++ OK, passed 100 tests.
  10483. 873.01 s [vector] prescanl: OK
  10484. 873.01 s [vector] +++ OK, passed 100 tests.
  10485. 873.01 s [vector] prescanl': OK
  10486. 873.01 s [vector] +++ OK, passed 100 tests.
  10487. 873.01 s [vector] postscanl: OK
  10488. 873.01 s [vector] +++ OK, passed 100 tests.
  10489. 873.01 s [vector] postscanl': OK
  10490. 873.01 s [vector] +++ OK, passed 100 tests.
  10491. 873.01 s [vector] scanl: OK
  10492. 873.01 s [vector] +++ OK, passed 100 tests.
  10493. 873.01 s [vector] scanl': OK
  10494. 873.01 s [vector] +++ OK, passed 100 tests.
  10495. 873.01 s [vector] scanl1: OK
  10496. 873.01 s [vector] +++ OK, passed 100 tests.
  10497. 873.01 s [vector] scanl1': OK
  10498. 873.01 s [vector] +++ OK, passed 100 tests.
  10499. 873.01 s [vector] iscanl: OK
  10500. 873.01 s [vector] +++ OK, passed 100 tests.
  10501. 873.01 s [vector] iscanl': OK
  10502. 873.01 s [vector] +++ OK, passed 100 tests.
  10503. 873.01 s [vector] prescanr: OK
  10504. 873.01 s [vector] +++ OK, passed 100 tests.
  10505. 873.01 s [vector] prescanr': OK
  10506. 873.01 s [vector] +++ OK, passed 100 tests.
  10507. 873.01 s [vector] postscanr: OK
  10508. 873.01 s [vector] +++ OK, passed 100 tests.
  10509. 873.01 s [vector] postscanr': OK
  10510. 873.01 s [vector] +++ OK, passed 100 tests.
  10511. 873.01 s [vector] scanr: OK
  10512. 873.01 s [vector] +++ OK, passed 100 tests.
  10513. 873.01 s [vector] scanr': OK
  10514. 873.01 s [vector] +++ OK, passed 100 tests.
  10515. 873.01 s [vector] scanr1: OK
  10516. 873.01 s [vector] +++ OK, passed 100 tests.
  10517. 873.01 s [vector] scanr1': OK
  10518. 873.01 s [vector] +++ OK, passed 100 tests.
  10519. 873.01 s [vector] iscanr: OK
  10520. 873.01 s [vector] +++ OK, passed 100 tests.
  10521. 873.01 s [vector] iscanr': OK
  10522. 873.01 s [vector] +++ OK, passed 100 tests.
  10523. 873.01 s [vector] mut_read: OK
  10524. 873.01 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10525. 873.01 s [vector] mut_write: OK
  10526. 873.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10527. 873.01 s [vector] mut_modify: OK
  10528. 873.01 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10529. 873.01 s [vector] mut_generate: OK
  10530. 873.01 s [vector] +++ OK, passed 100 tests.
  10531. 873.01 s [vector] mut_generateM: OK (0.01s)
  10532. 873.01 s [vector] +++ OK, passed 100 tests.
  10533. 873.01 s [vector] mut_mapM_: OK (0.02s)
  10534. 873.01 s [vector] +++ OK, passed 100 tests.
  10535. 873.01 s [vector] mut_imapM_: OK (0.02s)
  10536. 873.01 s [vector] +++ OK, passed 100 tests.
  10537. 873.01 s [vector] mut_forM_: OK (0.03s)
  10538. 873.01 s [vector] +++ OK, passed 100 tests.
  10539. 873.01 s [vector] mut_iforM_: OK (0.03s)
  10540. 873.01 s [vector] +++ OK, passed 100 tests.
  10541. 873.01 s [vector] mut_foldr: OK
  10542. 873.01 s [vector] +++ OK, passed 100 tests.
  10543. 873.01 s [vector] mut_foldr': OK
  10544. 873.01 s [vector] +++ OK, passed 100 tests.
  10545. 873.01 s [vector] mut_foldl: OK
  10546. 873.01 s [vector] +++ OK, passed 100 tests.
  10547. 873.01 s [vector] mut_foldl': OK
  10548. 873.01 s [vector] +++ OK, passed 100 tests.
  10549. 873.01 s [vector] mut_ifoldr: OK
  10550. 873.01 s [vector] +++ OK, passed 100 tests.
  10551. 873.01 s [vector] mut_ifoldr': OK
  10552. 873.01 s [vector] +++ OK, passed 100 tests.
  10553. 873.01 s [vector] mut_ifoldl: OK
  10554. 873.01 s [vector] +++ OK, passed 100 tests.
  10555. 873.01 s [vector] mut_ifoldl': OK
  10556. 873.01 s [vector] +++ OK, passed 100 tests.
  10557. 873.01 s [vector] mut_foldM: OK
  10558. 873.01 s [vector] +++ OK, passed 100 tests.
  10559. 873.01 s [vector] mut_foldM': OK
  10560. 873.01 s [vector] +++ OK, passed 100 tests.
  10561. 873.01 s [vector] mut_foldrM: OK
  10562. 873.01 s [vector] +++ OK, passed 100 tests.
  10563. 873.01 s [vector] mut_foldrM': OK
  10564. 873.01 s [vector] +++ OK, passed 100 tests.
  10565. 873.01 s [vector] mut_ifoldM: OK
  10566. 873.01 s [vector] +++ OK, passed 100 tests.
  10567. 873.01 s [vector] mut_ifoldM': OK
  10568. 873.01 s [vector] +++ OK, passed 100 tests.
  10569. 873.01 s [vector] mut_ifoldrM: OK
  10570. 873.01 s [vector] +++ OK, passed 100 tests.
  10571. 873.01 s [vector] mut_ifoldrM': OK
  10572. 873.01 s [vector] +++ OK, passed 100 tests.
  10573. 873.01 s [vector] compare: OK
  10574. 873.01 s [vector] +++ OK, passed 100 tests.
  10575. 873.01 s [vector] maximum: OK
  10576. 873.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10577. 873.01 s [vector] minimum: OK
  10578. 873.01 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10579. 873.01 s [vector] minIndex: OK
  10580. 873.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10581. 873.01 s [vector] maxIndex: OK
  10582. 873.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10583. 873.01 s [vector] maximumBy: OK
  10584. 873.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10585. 873.01 s [vector] minimumBy: OK
  10586. 873.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10587. 873.01 s [vector] maximumOn: OK
  10588. 873.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10589. 873.01 s [vector] minimumOn: OK
  10590. 873.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10591. 873.01 s [vector] maxIndexBy: OK
  10592. 873.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10593. 873.01 s [vector] minIndexBy: OK
  10594. 873.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10595. 873.01 s [vector] ListFirstMaxIndexWins: OK
  10596. 873.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10597. 873.01 s [vector] FalseListFirstMaxIndexWins: OK
  10598. 873.01 s [vector] +++ OK, failed as expected. (after 1 test):
  10599. 873.01 s [vector] Exception:
  10600. 873.01 s [vector] Prelude.foldr1: empty list
  10601. 873.01 s [vector] CallStack (from HasCallStack):
  10602. 873.01 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  10603. 873.01 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  10604. 873.01 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10605. 873.01 s [vector] []
  10606. 873.01 s [vector] zip: OK
  10607. 873.01 s [vector] +++ OK, passed 100 tests.
  10608. 873.01 s [vector] zip3: OK
  10609. 873.01 s [vector] +++ OK, passed 100 tests.
  10610. 873.01 s [vector] unzip: OK
  10611. 873.01 s [vector] +++ OK, passed 100 tests.
  10612. 873.01 s [vector] unzip3: OK
  10613. 873.01 s [vector] +++ OK, passed 100 tests.
  10614. 873.01 s [vector] indexed: OK
  10615. 873.01 s [vector] +++ OK, passed 100 tests.
  10616. 873.01 s [vector] update: OK
  10617. 873.01 s [vector] +++ OK, passed 100 tests.
  10618. 873.01 s [vector] mempty: OK
  10619. 873.01 s [vector] +++ OK, passed 1 test.
  10620. 873.01 s [vector] mappend: OK
  10621. 873.01 s [vector] +++ OK, passed 100 tests.
  10622. 873.01 s [vector] mconcat: OK (0.04s)
  10623. 873.01 s [vector] +++ OK, passed 100 tests.
  10624. 873.01 s [vector] glength: OK
  10625. 873.01 s [vector] +++ OK, passed 100 tests.
  10626. 873.01 s [vector] (Int,Bool,Int)
  10627. 873.01 s [vector] fromList.toList == id: OK
  10628. 873.01 s [vector] +++ OK, passed 100 tests.
  10629. 873.01 s [vector] toList.fromList == id: OK
  10630. 873.01 s [vector] +++ OK, passed 100 tests.
  10631. 873.01 s [vector] unstream.stream == id: OK
  10632. 873.01 s [vector] +++ OK, passed 100 tests.
  10633. 873.01 s [vector] stream.unstream == id: OK
  10634. 873.01 s [vector] +++ OK, passed 100 tests.
  10635. 873.01 s [vector] eq: OK
  10636. 873.01 s [vector] +++ OK, passed 100 tests.
  10637. 873.01 s [vector] length: OK
  10638. 873.01 s [vector] +++ OK, passed 100 tests.
  10639. 873.01 s [vector] null: OK
  10640. 873.01 s [vector] +++ OK, passed 100 tests.
  10641. 873.01 s [vector] index: OK
  10642. 873.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10643. 873.01 s [vector] safeIndex: OK
  10644. 873.01 s [vector] +++ OK, passed 100 tests.
  10645. 873.01 s [vector] head: OK
  10646. 873.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10647. 873.01 s [vector] last: OK
  10648. 873.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10649. 873.01 s [vector] unsafeIndex: OK
  10650. 873.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10651. 873.01 s [vector] unsafeHead: OK
  10652. 873.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10653. 873.01 s [vector] unsafeLast: OK
  10654. 873.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10655. 873.01 s [vector] slice: OK
  10656. 873.01 s [vector] +++ OK, passed 100 tests.
  10657. 873.01 s [vector] init: OK
  10658. 873.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10659. 873.01 s [vector] tail: OK
  10660. 873.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10661. 873.01 s [vector] take: OK
  10662. 873.01 s [vector] +++ OK, passed 100 tests.
  10663. 873.01 s [vector] drop: OK
  10664. 873.01 s [vector] +++ OK, passed 100 tests.
  10665. 873.01 s [vector] splitAt: OK
  10666. 873.01 s [vector] +++ OK, passed 100 tests.
  10667. 873.01 s [vector] empty: OK
  10668. 873.01 s [vector] +++ OK, passed 1 test.
  10669. 873.01 s [vector] singleton: OK
  10670. 873.01 s [vector] +++ OK, passed 100 tests.
  10671. 873.01 s [vector] replicate: OK
  10672. 873.01 s [vector] +++ OK, passed 100 tests.
  10673. 873.01 s [vector] generate: OK
  10674. 873.01 s [vector] +++ OK, passed 100 tests.
  10675. 873.01 s [vector] iterateN: OK
  10676. 873.01 s [vector] +++ OK, passed 100 tests.
  10677. 873.01 s [vector] iterateNM: OK (0.02s)
  10678. 873.01 s [vector] +++ OK, passed 100 tests.
  10679. 873.01 s [vector] generateM: OK (0.03s)
  10680. 873.01 s [vector] +++ OK, passed 100 tests.
  10681. 873.01 s [vector] replicateM: OK (0.02s)
  10682. 873.01 s [vector] +++ OK, passed 100 tests.
  10683. 873.01 s [vector] create: OK
  10684. 873.01 s [vector] +++ OK, passed 100 tests.
  10685. 873.01 s [vector] createT: OK
  10686. 873.01 s [vector] +++ OK, passed 100 tests.
  10687. 873.01 s [vector] unfoldr: OK
  10688. 873.01 s [vector] +++ OK, passed 100 tests.
  10689. 873.01 s [vector] unfoldrN: OK
  10690. 873.01 s [vector] +++ OK, passed 100 tests.
  10691. 873.01 s [vector] unfoldrExactN: OK
  10692. 873.01 s [vector] +++ OK, passed 100 tests.
  10693. 873.01 s [vector] unfoldrM: OK
  10694. 873.01 s [vector] +++ OK, passed 100 tests.
  10695. 873.01 s [vector] unfoldrNM: OK
  10696. 873.01 s [vector] +++ OK, passed 100 tests.
  10697. 873.01 s [vector] unfoldrExactNM: OK (0.02s)
  10698. 873.01 s [vector] +++ OK, passed 100 tests.
  10699. 873.01 s [vector] constructN: OK
  10700. 873.01 s [vector] +++ OK, passed 100 tests.
  10701. 873.01 s [vector] constructrN: OK
  10702. 873.01 s [vector] +++ OK, passed 100 tests.
  10703. 873.01 s [vector] cons: OK
  10704. 873.01 s [vector] +++ OK, passed 100 tests.
  10705. 873.01 s [vector] snoc: OK
  10706. 873.01 s [vector] +++ OK, passed 100 tests.
  10707. 873.01 s [vector] append: OK
  10708. 873.01 s [vector] +++ OK, passed 100 tests.
  10709. 873.01 s [vector] concat: OK (0.05s)
  10710. 873.01 s [vector] +++ OK, passed 100 tests.
  10711. 873.01 s [vector] force: OK
  10712. 873.01 s [vector] +++ OK, passed 100 tests.
  10713. 873.01 s [vector] upd: OK
  10714. 873.01 s [vector] +++ OK, passed 100 tests.
  10715. 873.01 s [vector] accum: OK
  10716. 873.01 s [vector] +++ OK, passed 100 tests.
  10717. 873.01 s [vector] reverse: OK
  10718. 873.01 s [vector] +++ OK, passed 100 tests.
  10719. 873.01 s [vector] backpermute: OK
  10720. 873.01 s [vector] +++ OK, passed 100 tests.
  10721. 873.01 s [vector] map: OK
  10722. 873.01 s [vector] +++ OK, passed 100 tests.
  10723. 873.01 s [vector] imap: OK (0.01s)
  10724. 873.01 s [vector] +++ OK, passed 100 tests.
  10725. 873.01 s [vector] concatMap: OK
  10726. 873.01 s [vector] +++ OK, passed 100 tests.
  10727. 873.01 s [vector] mapM: OK
  10728. 873.01 s [vector] +++ OK, passed 100 tests.
  10729. 873.01 s [vector] mapM_: OK (0.04s)
  10730. 873.01 s [vector] +++ OK, passed 100 tests.
  10731. 873.01 s [vector] forM: OK
  10732. 873.01 s [vector] +++ OK, passed 100 tests.
  10733. 873.01 s [vector] forM_: OK (0.04s)
  10734. 873.01 s [vector] +++ OK, passed 100 tests.
  10735. 873.01 s [vector] imapM: OK
  10736. 873.01 s [vector] +++ OK, passed 100 tests.
  10737. 873.01 s [vector] imapM_: OK (0.04s)
  10738. 873.01 s [vector] +++ OK, passed 100 tests.
  10739. 873.01 s [vector] zipWith: OK
  10740. 873.01 s [vector] +++ OK, passed 100 tests.
  10741. 873.01 s [vector] zipWith3: OK
  10742. 873.01 s [vector] +++ OK, passed 100 tests.
  10743. 873.01 s [vector] izipWith: OK
  10744. 873.01 s [vector] +++ OK, passed 100 tests.
  10745. 873.01 s [vector] izipWith3: OK
  10746. 873.01 s [vector] +++ OK, passed 100 tests.
  10747. 873.01 s [vector] izipWithM: OK
  10748. 873.01 s [vector] +++ OK, passed 100 tests.
  10749. 873.01 s [vector] izipWithM_: OK (0.03s)
  10750. 873.01 s [vector] +++ OK, passed 100 tests.
  10751. 873.01 s [vector] zipWithM: OK
  10752. 873.01 s [vector] +++ OK, passed 100 tests.
  10753. 873.01 s [vector] zipWithM_: OK (0.03s)
  10754. 873.01 s [vector] +++ OK, passed 100 tests.
  10755. 873.01 s [vector] filter: OK
  10756. 873.01 s [vector] +++ OK, passed 100 tests.
  10757. 873.01 s [vector] ifilter: OK
  10758. 873.01 s [vector] +++ OK, passed 100 tests.
  10759. 873.01 s [vector] filterM: OK (0.06s)
  10760. 873.01 s [vector] +++ OK, passed 100 tests.
  10761. 873.01 s [vector] uniq: OK
  10762. 873.01 s [vector] +++ OK, passed 100 tests.
  10763. 873.01 s [vector] mapMaybe: OK
  10764. 873.01 s [vector] +++ OK, passed 100 tests.
  10765. 873.01 s [vector] imapMaybe: OK
  10766. 873.01 s [vector] +++ OK, passed 100 tests.
  10767. 873.01 s [vector] takeWhile: OK
  10768. 873.01 s [vector] +++ OK, passed 100 tests.
  10769. 873.01 s [vector] dropWhile: OK
  10770. 873.01 s [vector] +++ OK, passed 100 tests.
  10771. 873.01 s [vector] partition: OK
  10772. 873.01 s [vector] +++ OK, passed 100 tests.
  10773. 873.01 s [vector] partitionWith: OK
  10774. 873.01 s [vector] +++ OK, passed 100 tests.
  10775. 873.01 s [vector] span: OK
  10776. 873.01 s [vector] +++ OK, passed 100 tests.
  10777. 873.01 s [vector] break: OK
  10778. 873.01 s [vector] +++ OK, passed 100 tests.
  10779. 873.01 s [vector] spanR: OK
  10780. 873.01 s [vector] +++ OK, passed 100 tests.
  10781. 873.01 s [vector] breakR: OK
  10782. 873.01 s [vector] +++ OK, passed 100 tests.
  10783. 873.01 s [vector] groupBy: OK
  10784. 873.01 s [vector] +++ OK, passed 100 tests.
  10785. 873.01 s [vector] elem: OK
  10786. 873.01 s [vector] +++ OK, passed 100 tests.
  10787. 873.01 s [vector] notElem: OK
  10788. 873.01 s [vector] +++ OK, passed 100 tests.
  10789. 873.01 s [vector] find: OK
  10790. 873.01 s [vector] +++ OK, passed 100 tests.
  10791. 873.01 s [vector] findIndex: OK
  10792. 873.01 s [vector] +++ OK, passed 100 tests.
  10793. 873.01 s [vector] findIndexR: OK
  10794. 873.01 s [vector] +++ OK, passed 100 tests.
  10795. 873.01 s [vector] findIndices: OK
  10796. 873.01 s [vector] +++ OK, passed 100 tests.
  10797. 873.02 s [vector] elemIndex: OK
  10798. 873.02 s [vector] +++ OK, passed 100 tests.
  10799. 873.02 s [vector] elemIndices: OK
  10800. 873.02 s [vector] +++ OK, passed 100 tests.
  10801. 873.02 s [vector] foldl: OK
  10802. 873.02 s [vector] +++ OK, passed 100 tests.
  10803. 873.02 s [vector] foldl1: OK
  10804. 873.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10805. 873.02 s [vector] foldl': OK
  10806. 873.02 s [vector] +++ OK, passed 100 tests.
  10807. 873.02 s [vector] foldl1': OK
  10808. 873.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10809. 873.02 s [vector] foldr: OK
  10810. 873.02 s [vector] +++ OK, passed 100 tests.
  10811. 873.02 s [vector] foldr1: OK
  10812. 873.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10813. 873.02 s [vector] foldr': OK
  10814. 873.02 s [vector] +++ OK, passed 100 tests.
  10815. 873.02 s [vector] foldr1': OK
  10816. 873.02 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10817. 873.02 s [vector] ifoldl: OK
  10818. 873.02 s [vector] +++ OK, passed 100 tests.
  10819. 873.02 s [vector] ifoldl': OK
  10820. 873.02 s [vector] +++ OK, passed 100 tests.
  10821. 873.02 s [vector] ifoldr: OK
  10822. 873.02 s [vector] +++ OK, passed 100 tests.
  10823. 873.02 s [vector] ifoldr': OK
  10824. 873.02 s [vector] +++ OK, passed 100 tests.
  10825. 873.02 s [vector] ifoldM: OK
  10826. 873.02 s [vector] +++ OK, passed 100 tests.
  10827. 873.02 s [vector] ifoldM': OK
  10828. 873.02 s [vector] +++ OK, passed 100 tests.
  10829. 873.02 s [vector] ifoldM_: OK (0.04s)
  10830. 873.02 s [vector] +++ OK, passed 100 tests.
  10831. 873.02 s [vector] ifoldM'_: OK (0.04s)
  10832. 873.02 s [vector] +++ OK, passed 100 tests.
  10833. 873.02 s [vector] all: OK
  10834. 873.02 s [vector] +++ OK, passed 100 tests.
  10835. 873.02 s [vector] any: OK
  10836. 873.02 s [vector] +++ OK, passed 100 tests.
  10837. 873.02 s [vector] prescanl: OK
  10838. 873.02 s [vector] +++ OK, passed 100 tests.
  10839. 873.02 s [vector] prescanl': OK (0.01s)
  10840. 873.02 s [vector] +++ OK, passed 100 tests.
  10841. 873.02 s [vector] postscanl: OK
  10842. 873.02 s [vector] +++ OK, passed 100 tests.
  10843. 873.02 s [vector] postscanl': OK
  10844. 873.02 s [vector] +++ OK, passed 100 tests.
  10845. 873.02 s [vector] scanl: OK
  10846. 873.02 s [vector] +++ OK, passed 100 tests.
  10847. 873.02 s [vector] scanl': OK
  10848. 873.02 s [vector] +++ OK, passed 100 tests.
  10849. 873.02 s [vector] scanl1: OK
  10850. 873.02 s [vector] +++ OK, passed 100 tests.
  10851. 873.02 s [vector] scanl1': OK
  10852. 873.02 s [vector] +++ OK, passed 100 tests.
  10853. 873.02 s [vector] iscanl: OK
  10854. 873.02 s [vector] +++ OK, passed 100 tests.
  10855. 873.02 s [vector] iscanl': OK
  10856. 873.02 s [vector] +++ OK, passed 100 tests.
  10857. 873.02 s [vector] prescanr: OK
  10858. 873.02 s [vector] +++ OK, passed 100 tests.
  10859. 873.02 s [vector] prescanr': OK
  10860. 873.02 s [vector] +++ OK, passed 100 tests.
  10861. 873.02 s [vector] postscanr: OK
  10862. 873.02 s [vector] +++ OK, passed 100 tests.
  10863. 873.02 s [vector] postscanr': OK
  10864. 873.02 s [vector] +++ OK, passed 100 tests.
  10865. 873.02 s [vector] scanr: OK
  10866. 873.02 s [vector] +++ OK, passed 100 tests.
  10867. 873.02 s [vector] scanr': OK
  10868. 873.02 s [vector] +++ OK, passed 100 tests.
  10869. 873.02 s [vector] scanr1: OK
  10870. 873.02 s [vector] +++ OK, passed 100 tests.
  10871. 873.02 s [vector] scanr1': OK
  10872. 873.02 s [vector] +++ OK, passed 100 tests.
  10873. 873.02 s [vector] iscanr: OK
  10874. 873.02 s [vector] +++ OK, passed 100 tests.
  10875. 873.02 s [vector] iscanr': OK
  10876. 873.02 s [vector] +++ OK, passed 100 tests.
  10877. 873.02 s [vector] mut_read: OK
  10878. 873.02 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10879. 873.02 s [vector] mut_write: OK
  10880. 873.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10881. 873.02 s [vector] mut_modify: OK
  10882. 873.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10883. 873.02 s [vector] mut_generate: OK
  10884. 873.02 s [vector] +++ OK, passed 100 tests.
  10885. 873.02 s [vector] mut_generateM: OK (0.01s)
  10886. 873.02 s [vector] +++ OK, passed 100 tests.
  10887. 873.02 s [vector] mut_mapM_: OK (0.04s)
  10888. 873.02 s [vector] +++ OK, passed 100 tests.
  10889. 873.02 s [vector] mut_imapM_: OK (0.04s)
  10890. 873.02 s [vector] +++ OK, passed 100 tests.
  10891. 873.02 s [vector] mut_forM_: OK (0.04s)
  10892. 873.02 s [vector] +++ OK, passed 100 tests.
  10893. 873.02 s [vector] mut_iforM_: OK (0.04s)
  10894. 873.02 s [vector] +++ OK, passed 100 tests.
  10895. 873.02 s [vector] mut_foldr: OK
  10896. 873.02 s [vector] +++ OK, passed 100 tests.
  10897. 873.02 s [vector] mut_foldr': OK
  10898. 873.02 s [vector] +++ OK, passed 100 tests.
  10899. 873.02 s [vector] mut_foldl: OK
  10900. 873.02 s [vector] +++ OK, passed 100 tests.
  10901. 873.02 s [vector] mut_foldl': OK
  10902. 873.02 s [vector] +++ OK, passed 100 tests.
  10903. 873.02 s [vector] mut_ifoldr: OK
  10904. 873.02 s [vector] +++ OK, passed 100 tests.
  10905. 873.02 s [vector] mut_ifoldr': OK
  10906. 873.02 s [vector] +++ OK, passed 100 tests.
  10907. 873.02 s [vector] mut_ifoldl: OK
  10908. 873.02 s [vector] +++ OK, passed 100 tests.
  10909. 873.02 s [vector] mut_ifoldl': OK
  10910. 873.02 s [vector] +++ OK, passed 100 tests.
  10911. 873.02 s [vector] mut_foldM: OK
  10912. 873.02 s [vector] +++ OK, passed 100 tests.
  10913. 873.02 s [vector] mut_foldM': OK
  10914. 873.02 s [vector] +++ OK, passed 100 tests.
  10915. 873.02 s [vector] mut_foldrM: OK
  10916. 873.02 s [vector] +++ OK, passed 100 tests.
  10917. 873.02 s [vector] mut_foldrM': OK
  10918. 873.02 s [vector] +++ OK, passed 100 tests.
  10919. 873.02 s [vector] mut_ifoldM: OK
  10920. 873.02 s [vector] +++ OK, passed 100 tests.
  10921. 873.02 s [vector] mut_ifoldM': OK
  10922. 873.02 s [vector] +++ OK, passed 100 tests.
  10923. 873.02 s [vector] mut_ifoldrM: OK
  10924. 873.02 s [vector] +++ OK, passed 100 tests.
  10925. 873.02 s [vector] mut_ifoldrM': OK
  10926. 873.02 s [vector] +++ OK, passed 100 tests.
  10927. 873.02 s [vector] compare: OK
  10928. 873.02 s [vector] +++ OK, passed 100 tests.
  10929. 873.02 s [vector] maximum: OK
  10930. 873.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10931. 873.02 s [vector] minimum: OK
  10932. 873.02 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10933. 873.02 s [vector] minIndex: OK
  10934. 873.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10935. 873.02 s [vector] maxIndex: OK
  10936. 873.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10937. 873.02 s [vector] maximumBy: OK
  10938. 873.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10939. 873.02 s [vector] minimumBy: OK
  10940. 873.02 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10941. 873.02 s [vector] maximumOn: OK
  10942. 873.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10943. 873.02 s [vector] minimumOn: OK
  10944. 873.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10945. 873.02 s [vector] maxIndexBy: OK
  10946. 873.02 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10947. 873.02 s [vector] minIndexBy: OK
  10948. 873.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10949. 873.02 s [vector] ListFirstMaxIndexWins: OK
  10950. 873.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10951. 873.02 s [vector] FalseListFirstMaxIndexWins: OK
  10952. 873.02 s [vector] +++ OK, failed as expected. (after 1 test):
  10953. 873.02 s [vector] Exception:
  10954. 873.02 s [vector] Prelude.foldr1: empty list
  10955. 873.02 s [vector] CallStack (from HasCallStack):
  10956. 873.02 s [vector] error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
  10957. 873.02 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
  10958. 873.02 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10959. 873.02 s [vector] []
  10960. 873.02 s [vector] zip: OK
  10961. 873.02 s [vector] +++ OK, passed 100 tests.
  10962. 873.02 s [vector] zip3: OK
  10963. 873.02 s [vector] +++ OK, passed 100 tests.
  10964. 873.02 s [vector] unzip: OK
  10965. 873.02 s [vector] +++ OK, passed 100 tests.
  10966. 873.02 s [vector] unzip3: OK
  10967. 873.02 s [vector] +++ OK, passed 100 tests.
  10968. 873.02 s [vector] indexed: OK
  10969. 873.02 s [vector] +++ OK, passed 100 tests.
  10970. 873.02 s [vector] update: OK
  10971. 873.02 s [vector] +++ OK, passed 100 tests.
  10972. 873.02 s [vector] mempty: OK
  10973. 873.02 s [vector] +++ OK, passed 1 test.
  10974. 873.02 s [vector] mappend: OK
  10975. 873.02 s [vector] +++ OK, passed 100 tests.
  10976. 873.02 s [vector] mconcat: OK (0.03s)
  10977. 873.02 s [vector] +++ OK, passed 100 tests.
  10978. 873.02 s [vector] glength: OK
  10979. 873.02 s [vector] +++ OK, passed 100 tests.
  10980. 873.02 s [vector] unstream
  10981. 873.02 s [vector] unstream == vunstream (exact): OK
  10982. 873.02 s [vector] +++ OK, passed 100 tests.
  10983. 873.02 s [vector] unstream == vunstream (unknown): OK
  10984. 873.02 s [vector] +++ OK, passed 100 tests.
  10985. 873.02 s [vector] unstreamR ~= vunstream (exact): OK
  10986. 873.02 s [vector] +++ OK, passed 100 tests.
  10987. 873.02 s [vector] unstreamR ~= vunstream (unknown): OK
  10988. 873.02 s [vector] +++ OK, passed 100 tests.
  10989. 873.02 s [vector] Data.Vector.Storable.Vector Alignment
  10990. 873.02 s [vector] Aligned Double: OK
  10991. 873.02 s [vector] Aligned Int: OK
  10992. 873.02 s [vector] Regression tests
  10993. 873.02 s [vector] enumFromTo crash #188
  10994. 873.02 s [vector] Word8: OK
  10995. 873.02 s [vector] Word16: OK
  10996. 873.02 s [vector] Word32: OK
  10997. 873.02 s [vector] Word64: OK
  10998. 873.02 s [vector] Word: OK
  10999. 873.02 s [vector] Int8: OK
  11000. 873.02 s [vector] Int16: OK
  11001. 873.02 s [vector] Int32: OK
  11002. 873.02 s [vector] Int64: OK
  11003. 873.02 s [vector] Int: OK
  11004. 873.02 s [vector] Char: OK
  11005. 873.02 s [vector] Negative tests
  11006. 873.02 s [vector] slice out of bounds #257
  11007. 873.02 s [vector] Boxed
  11008. 873.02 s [vector] Negative ix: OK
  11009. 873.02 s [vector] Negative size: OK
  11010. 873.02 s [vector] Negative ix and size: OK
  11011. 873.02 s [vector] Too large ix: OK
  11012. 873.02 s [vector] Too large size: OK
  11013. 873.02 s [vector] Too large ix and size: OK
  11014. 873.02 s [vector] Overflow: OK
  11015. 873.02 s [vector] OutOfMemory: OK
  11016. 873.02 s [vector] Primitive
  11017. 873.02 s [vector] Negative ix: OK
  11018. 873.02 s [vector] Negative size: OK
  11019. 873.02 s [vector] Negative ix and size: OK
  11020. 873.02 s [vector] Too large ix: OK
  11021. 873.02 s [vector] Too large size: OK
  11022. 873.02 s [vector] Too large ix and size: OK
  11023. 873.02 s [vector] Overflow: OK
  11024. 873.02 s [vector] OutOfMemory: OK
  11025. 873.02 s [vector] Storable
  11026. 873.02 s [vector] Negative ix: OK
  11027. 873.02 s [vector] Negative size: OK
  11028. 873.02 s [vector] Negative ix and size: OK
  11029. 873.02 s [vector] Too large ix: OK
  11030. 873.02 s [vector] Too large size: OK
  11031. 873.02 s [vector] Too large ix and size: OK
  11032. 873.02 s [vector] Overflow: OK
  11033. 873.02 s [vector] OutOfMemory: OK
  11034. 873.02 s [vector] Unboxed
  11035. 873.02 s [vector] Negative ix: OK
  11036. 873.02 s [vector] Negative size: OK
  11037. 873.02 s [vector] Negative ix and size: OK
  11038. 873.02 s [vector] Too large ix: OK
  11039. 873.02 s [vector] Too large size: OK
  11040. 873.02 s [vector] Too large ix and size: OK
  11041. 873.02 s [vector] Overflow: OK
  11042. 873.02 s [vector] OutOfMemory: OK
  11043. 873.02 s [vector] take #282
  11044. 873.02 s [vector] Boxed: OK
  11045. 873.02 s [vector] Primitive: OK
  11046. 873.02 s [vector] Storable: OK
  11047. 873.02 s [vector] Unboxed: OK
  11048. 873.02 s [vector] Data.Vector
  11049. 873.02 s [vector] MonadFix: OK
  11050. 873.02 s [vector] toFromArray: OK
  11051. 873.02 s [vector] toFromArraySlice: OK
  11052. 873.02 s [vector] toFromArraySliceUnsafe: OK
  11053. 873.02 s [vector] toFromMutableArray: OK
  11054. 873.02 s [vector] Data.Vector.Mutable (Move): OK
  11055. 873.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11056. 873.02 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  11057. 873.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11058. 873.02 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  11059. 873.02 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11060. 873.02 s [vector] Data.Vector.Storable.Mutable (Move): OK
  11061. 873.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11062. 873.02 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  11063. 873.02 s [vector] +++ OK, passed 1 test.
  11064. 873.02 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  11065. 873.02 s [vector] +++ OK, passed 1 test.
  11066. 873.02 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  11067. 873.02 s [vector] +++ OK, passed 100 tests.
  11068. 873.02 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  11069. 873.02 s [vector] +++ OK, passed 100 tests.
  11070. 873.02 s [vector]
  11071. 873.02 s [vector] All 2808 tests passed (13.75s)
  11072. 873.02 s [vector] Test suite vector-tests-O2: PASS
  11073. 873.02 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  11074. 873.02 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  11075. 873.02 s [vector] checkPhase completed in 37 seconds
  11076. 873.02 s [vector] Phase: haddockPhase
  11077. 873.04 s [vector] Phase: installPhase
  11078. 873.11 s [vector] Installing library in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-KITycIPQp0R25115diGgzh
  11079. 873.12 s [tasty-smallcheck] Phase: setupCompilerEnvironmentPhase
  11080. 873.13 s [tasty-smallcheck] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  11081. 873.35 s [hedgehog] [ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, dist/build/Hedgehog/Internal/Distributive.p_o )
  11082. 873.43 s [tasty-smallcheck] Phase: unpackPhase
  11083. 873.45 s [tasty-smallcheck] unpacking source archive /nix/store/0x239pdac4vkzizdq057g48dka8hh4al-tasty-smallcheck-0.8.2.tar.gz
  11084. 873.46 s [tasty-smallcheck] source root is tasty-smallcheck-0.8.2
  11085. 873.55 s [tasty-smallcheck] setting SOURCE_DATE_EPOCH to timestamp 1608313170 of file "tasty-smallcheck-0.8.2/tasty-smallcheck.cabal"
  11086. 873.64 s [tasty-smallcheck] Phase: patchPhase
  11087. 873.65 s [tasty-smallcheck] Replace Cabal file with edited version from mirror://hackage/tasty-smallcheck-0.8.2/revision/1.cabal.
  11088. 873.66 s [tasty-smallcheck] Phase: compileBuildDriverPhase
  11089. 873.68 s [tasty-smallcheck] setupCompileFlags: -package-db=/build/tmp.SrVseikyg4/setup-package.conf.d -threaded
  11090. 873.72 s [tasty-smallcheck] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.SrVseikyg4/Main.o )
  11091. 873.81 s [tasty-smallcheck] [2 of 2] Linking Setup
  11092. 873.86 s [vector] Installing internal library benchmarks-O2 in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
  11093. 874.37 s [vector] Phase: fixupPhase
  11094. 874.41 s [hedgehog] [ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, dist/build/Hedgehog/Internal/Exception.p_o )
  11095. 874.60 s [hedgehog] [ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, dist/build/Hedgehog/Internal/HTraversable.p_o )
  11096. 874.60 s [hedgehog] [ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, dist/build/Hedgehog/Internal/Opaque.p_o )
  11097. 874.60 s [hedgehog] [ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, dist/build/Hedgehog/Internal/Prelude.p_o )
  11098. 874.60 s [hedgehog] [ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, dist/build/Hedgehog/Internal/Range.p_o )
  11099. 874.60 s [hedgehog] [ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, dist/build/Hedgehog/Internal/Region.p_o )
  11100. 874.60 s [hedgehog] [ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, dist/build/Hedgehog/Internal/Seed.p_o )
  11101. 874.60 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0
  11102. 874.60 s [vector] shrinking /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSvector-0.13.2.0-KITycIPQp0R25115diGgzh-ghc9.8.1.so
  11103. 874.60 s [vector] shrinking /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSvector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2-ghc9.8.1.so
  11104. 874.60 s [vector] checking for references to /build/ in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0...
  11105. 874.60 s [vector] patching script interpreter paths in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0
  11106. 874.60 s [vector] stripping (with command strip and flags -S -p) in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib
  11107. 874.60 s [hedgehog] [10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, dist/build/Hedgehog/Internal/Show.p_o )
  11108. 874.65 s [hedgehog] [11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, dist/build/Hedgehog/Internal/Shrink.p_o )
  11109. 874.65 s [hedgehog] [12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, dist/build/Hedgehog/Internal/Source.p_o )
  11110. 874.65 s [hedgehog] [13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, dist/build/Hedgehog/Internal/Tree.p_o )
  11111. 876.17 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0
  11112. 877.53 s [vector:post-build] Pushing 1 paths (93 are already present) using zstd to cache sellout ⏳
  11113. 877.53 s [vector:post-build]
  11114. 877.91 s [vector:post-build] Pushing /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0 (57.19 MiB)
  11115. 880.27 s [vector:post-build]
  11116. 880.27 s [vector:post-build] All done.
  11117. 880.45 s [vector:post-build] Uploading to the NixCI cache: /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0
  11118. 881.05 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  11119. 881.11 s [vector:post-build] copying 1 paths...
  11120. 881.11 s [vector:post-build] copying path '/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  11121. 897.82 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  11122. 898.09 s [vector:post-build] copying 1 paths...
  11123. 898.09 s [vector:post-build] copying path '/nix/store/z5i7y0hxmdcp07w36h4nfxc77vf4c7xf-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  11124. 898.40 s Progress: 30 of 48 built (2 building)
  11125. 898.40 s [hedgehog] [14 of 27] Compiling Hedgehog.Main ( src/Hedgehog/Main.hs, dist/build/Hedgehog/Main.p_o )
  11126. 898.40 s [hedgehog] [15 of 27] Compiling Hedgehog.Range ( src/Hedgehog/Range.hs, dist/build/Hedgehog/Range.p_o )
  11127. 898.40 s [hedgehog] [16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, dist/build/Hedgehog/Internal/Gen.p_o )
  11128. 898.40 s [hedgehog] [17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, dist/build/Hedgehog/Internal/Property.p_o )
  11129. 898.40 s [hedgehog]
  11130. 898.40 s [hedgehog] src/Hedgehog/Internal/Property.hs:433:31: warning: [GHC-63394] [-Wx-partial]
  11131. 898.40 s [hedgehog] In the use of ‘head’
  11132. 898.40 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  11133. 898.40 s [hedgehog] "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."
  11134. 898.40 s [hedgehog] |
  11135. 898.40 s [hedgehog] 433 | groups = List.map (\l -> (head l, length l)) $ List.group sp
  11136. 898.40 s [hedgehog] | ^^^^
  11137. 898.40 s [hedgehog] [18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, dist/build/Hedgehog/Internal/Tripping.p_o )
  11138. 898.40 s [hedgehog] [19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, dist/build/Hedgehog/Internal/State.p_o )
  11139. 898.40 s [hedgehog] [20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, dist/build/Hedgehog/Internal/Discovery.p_o )
  11140. 898.40 s [hedgehog] [21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, dist/build/Hedgehog/Internal/TH.p_o )
  11141. 898.40 s [hedgehog] [22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, dist/build/Hedgehog/Internal/Config.p_o )
  11142. 898.40 s [hedgehog] [23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, dist/build/Hedgehog/Internal/Report.p_o )
  11143. 898.40 s [hedgehog]
  11144. 898.40 s [hedgehog] src/Hedgehog/Internal/Report.hs:1096:37: warning: [GHC-63394] [-Wx-partial]
  11145. 898.40 s [hedgehog] In the use of ‘head’
  11146. 898.40 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  11147. 898.40 s [hedgehog] "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."
  11148. 898.40 s [hedgehog] |
  11149. 898.40 s [hedgehog] 1096 | replicate fillErrorWidth (head parts)
  11150. 898.40 s [hedgehog] | ^^^^
  11151. 898.40 s [hedgehog]
  11152. 898.40 s [hedgehog] src/Hedgehog/Internal/Report.hs:1098:39: warning: [GHC-63394] [-Wx-partial]
  11153. 898.40 s [hedgehog] In the use of ‘head’
  11154. 898.40 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  11155. 898.40 s [hedgehog] "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."
  11156. 898.40 s [hedgehog] |
  11157. 898.40 s [hedgehog] 1098 | replicate fillSurplusWidth (head parts)
  11158. 898.40 s [hedgehog] | ^^^^
  11159. 898.40 s [hedgehog] [24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, dist/build/Hedgehog/Internal/Queue.p_o )
  11160. 898.40 s [hedgehog] [25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, dist/build/Hedgehog/Internal/Runner.p_o )
  11161. 898.40 s [hedgehog] [26 of 27] Compiling Hedgehog.Gen ( src/Hedgehog/Gen.hs, dist/build/Hedgehog/Gen.p_o )
  11162. 898.40 s [hedgehog] [27 of 27] Compiling Hedgehog ( src/Hedgehog.hs, dist/build/Hedgehog.p_o )
  11163. 898.40 s [hedgehog] Preprocessing test suite 'test' for hedgehog-1.5..
  11164. 898.40 s [hedgehog] Building test suite 'test' for hedgehog-1.5..
  11165. 898.40 s [hedgehog] [1 of 9] Compiling Test.Hedgehog.Applicative ( test/Test/Hedgehog/Applicative.hs, dist/build/test/test-tmp/Test/Hedgehog/Applicative.o )
  11166. 898.40 s [hedgehog] [2 of 9] Compiling Test.Hedgehog.Confidence ( test/Test/Hedgehog/Confidence.hs, dist/build/test/test-tmp/Test/Hedgehog/Confidence.o )
  11167. 898.40 s [hedgehog] [3 of 9] Compiling Test.Hedgehog.Filter ( test/Test/Hedgehog/Filter.hs, dist/build/test/test-tmp/Test/Hedgehog/Filter.o )
  11168. 898.40 s [tasty-smallcheck] Phase: updateAutotoolsGnuConfigScriptsPhase
  11169. 898.40 s [tasty-smallcheck] Phase: configurePhase
  11170. 898.40 s [tasty-smallcheck] configureFlags: --verbose --prefix=/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc/share/doc/tasty-smallcheck-0.8.2 --with-gcc=gcc --package-db=/build/tmp.SrVseikyg4/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  11171. 898.40 s [tasty-smallcheck] Using Parsec parser
  11172. 898.40 s [tasty-smallcheck] Configuring tasty-smallcheck-0.8.2...
  11173. 898.40 s [tasty-smallcheck] Dependency base >=4.8 && <5: using base-4.19.0.0
  11174. 898.40 s [tasty-smallcheck] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  11175. 898.40 s [tasty-smallcheck] Dependency smallcheck >=1.0: using smallcheck-1.2.1.1
  11176. 898.40 s [tasty-smallcheck] Dependency tagged: using tagged-0.8.8
  11177. 898.40 s [tasty-smallcheck] Dependency tasty >=0.8: using tasty-1.5.3
  11178. 898.40 s [tasty-smallcheck] Source component graph: component lib
  11179. 898.40 s [tasty-smallcheck] Configured component graph:
  11180. 898.40 s [tasty-smallcheck] component tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  11181. 898.40 s [tasty-smallcheck] include base-4.19.0.0-b960
  11182. 898.40 s [tasty-smallcheck] include optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
  11183. 898.40 s [tasty-smallcheck] include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  11184. 898.40 s [tasty-smallcheck] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  11185. 898.40 s [tasty-smallcheck] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  11186. 898.40 s [tasty-smallcheck] Linked component graph:
  11187. 898.40 s [tasty-smallcheck] unit tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  11188. 898.40 s [tasty-smallcheck] include base-4.19.0.0-b960
  11189. 898.40 s [tasty-smallcheck] include optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
  11190. 898.40 s [tasty-smallcheck] include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  11191. 898.40 s [tasty-smallcheck] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  11192. 898.40 s [tasty-smallcheck] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  11193. 898.40 s [tasty-smallcheck] Test.Tasty.SmallCheck=tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU:Test.Tasty.SmallCheck
  11194. 898.40 s [tasty-smallcheck] Ready component graph:
  11195. 898.40 s [tasty-smallcheck] definite tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  11196. 898.40 s [tasty-smallcheck] depends base-4.19.0.0-b960
  11197. 898.40 s [tasty-smallcheck] depends optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
  11198. 898.40 s [tasty-smallcheck] depends smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  11199. 898.40 s [tasty-smallcheck] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  11200. 898.40 s [tasty-smallcheck] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  11201. 898.40 s [tasty-smallcheck] Using Cabal-3.10.2.0 compiled by ghc-9.8
  11202. 898.41 s [tasty-smallcheck] Using compiler: ghc-9.8.1
  11203. 898.41 s [tasty-smallcheck] Using install prefix:
  11204. 898.41 s [tasty-smallcheck] /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2
  11205. 898.41 s [tasty-smallcheck] Executables installed in:
  11206. 898.41 s [tasty-smallcheck] /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/bin
  11207. 898.41 s [tasty-smallcheck] Libraries installed in:
  11208. 898.41 s [tasty-smallcheck] /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  11209. 898.41 s [tasty-smallcheck] Dynamic Libraries installed in:
  11210. 898.41 s [tasty-smallcheck] /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  11211. 898.41 s [tasty-smallcheck] Private executables installed in:
  11212. 898.41 s [tasty-smallcheck] /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/libexec/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2
  11213. 898.41 s [tasty-smallcheck] Data files installed in:
  11214. 898.41 s [tasty-smallcheck] /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/share/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2
  11215. 898.41 s [tasty-smallcheck] Documentation installed in:
  11216. 898.41 s [tasty-smallcheck] /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc/share/doc/tasty-smallcheck-0.8.2
  11217. 898.41 s [tasty-smallcheck] Configuration files installed in:
  11218. 898.41 s [tasty-smallcheck] /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/etc
  11219. 898.41 s [tasty-smallcheck] No alex found
  11220. 898.41 s [tasty-smallcheck] Using ar found on system at:
  11221. 898.41 s [tasty-smallcheck] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  11222. 898.41 s [tasty-smallcheck] No c2hs found
  11223. 898.41 s [tasty-smallcheck] No cpphs found
  11224. 898.41 s [tasty-smallcheck] No doctest found
  11225. 898.41 s [hedgehog] [4 of 9] Compiling Test.Hedgehog.Maybe ( test/Test/Hedgehog/Maybe.hs, dist/build/test/test-tmp/Test/Hedgehog/Maybe.o )
  11226. 898.41 s [hedgehog] [5 of 9] Compiling Test.Hedgehog.Seed ( test/Test/Hedgehog/Seed.hs, dist/build/test/test-tmp/Test/Hedgehog/Seed.o )
  11227. 898.41 s [hedgehog] [6 of 9] Compiling Test.Hedgehog.Skip ( test/Test/Hedgehog/Skip.hs, dist/build/test/test-tmp/Test/Hedgehog/Skip.o )
  11228. 898.41 s [hedgehog] [7 of 9] Compiling Test.Hedgehog.Text ( test/Test/Hedgehog/Text.hs, dist/build/test/test-tmp/Test/Hedgehog/Text.o )
  11229. 898.41 s [hedgehog] [8 of 9] Compiling Test.Hedgehog.Zip ( test/Test/Hedgehog/Zip.hs, dist/build/test/test-tmp/Test/Hedgehog/Zip.o )
  11230. 898.41 s [hedgehog] [9 of 9] Compiling Main ( test/test.hs, dist/build/test/test-tmp/Main.o )
  11231. 898.41 s [hedgehog] [10 of 10] Linking dist/build/test/test
  11232. 898.41 s [hedgehog] buildPhase completed in 35 seconds
  11233. 898.41 s [hedgehog] Phase: checkPhase
  11234. 898.41 s [hedgehog] Running 1 test suites...
  11235. 898.41 s [hedgehog] Test suite test: RUNNING...
  11236. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Applicative ━━━
  11237. 898.41 s [hedgehog] ✓ prop_StateT_outside passed 100 tests.
  11238. 898.41 s [hedgehog] ✓ 1 succeeded.
  11239. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Confidence ━━━
  11240. 898.41 s [hedgehog] ✓ prop_with_confidence passed 300 tests.
  11241. 898.41 s [hedgehog] number == 1 32% ██████▍············· ✓ 20%
  11242. 898.41 s [hedgehog] ✓ prop_with_confidence_and_min_tests passed 1000 tests.
  11243. 898.41 s [hedgehog] number == 2 18% ███▋················ ✓ 10%
  11244. 898.41 s [hedgehog] ✓ 2 succeeded.
  11245. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Filter ━━━
  11246. 898.41 s [hedgehog] ✓ prop_filter_repetition passed 100 tests.
  11247. 898.41 s [hedgehog] ✓ prop_filter_even passed 100 tests.
  11248. 898.41 s [hedgehog] ✓ 2 succeeded.
  11249. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Maybe ━━━
  11250. 898.41 s [hedgehog] ✓ prop_mapMaybe passed 1 test.
  11251. 898.41 s [hedgehog] ✓ 1 succeeded.
  11252. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Seed ━━━
  11253. 898.41 s [hedgehog] ✓ prop_avoid_pathological_gamma_values passed 1 test.
  11254. 898.41 s [hedgehog] ✓ 1 succeeded.
  11255. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Skip ━━━
  11256. 898.41 s [hedgehog] ✓ prop_SkipNothing passed 1 test.
  11257. 898.41 s [hedgehog] ✓ prop_SkipToFailingTest passed 1 test.
  11258. 898.41 s [hedgehog] ✓ prop_SkipPastFailingTest passed 1 test.
  11259. 898.41 s [hedgehog] ✓ prop_SkipToNoShrink passed 1 test.
  11260. 898.41 s [hedgehog] ✓ prop_SkipToFailingShrink passed 1 test.
  11261. 898.41 s [hedgehog] ✓ prop_SkipToPassingShrink passed 1 test.
  11262. 898.41 s [hedgehog] ✓ prop_SkipToReportedShrink passed 1 test.
  11263. 898.41 s [hedgehog] ✓ prop_compressSkip passed 100 tests.
  11264. 898.41 s [hedgehog] ✓ prop_compressDecompressExamples passed 1 test.
  11265. 898.41 s [hedgehog] ✓ 9 succeeded.
  11266. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Text ━━━
  11267. 898.41 s [hedgehog] ✓ prop_show_append_size passed 100 tests.
  11268. 898.41 s [hedgehog] ✓ prop_tripping_append_size passed 100 tests.
  11269. 898.41 s [hedgehog] ✓ prop_show_append_seed passed 100 tests.
  11270. 898.41 s [hedgehog] ✓ prop_tripping_append_seed passed 100 tests.
  11271. 898.41 s [hedgehog] ✓ 4 succeeded.
  11272. 898.41 s [hedgehog] ━━━ Test.Hedgehog.Zip ━━━
  11273. 898.41 s [hedgehog] ✓ prop_gen_applicative passed 100 tests.
  11274. 898.41 s [hedgehog] ✓ 1 succeeded.
  11275. 898.41 s [hedgehog] Test suite test: PASS
  11276. 898.41 s [hedgehog] Test suite logged to: dist/test/hedgehog-1.5-test.log
  11277. 898.41 s [hedgehog] 1 of 1 test suites (1 of 1 test cases) passed.
  11278. 898.41 s [hedgehog] Phase: haddockPhase
  11279. 898.41 s [hedgehog] Preprocessing library for hedgehog-1.5..
  11280. 898.41 s [hedgehog] Running Haddock on library for hedgehog-1.5..
  11281. 898.41 s [hedgehog] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  11282. 898.41 s [hedgehog] [ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, nothing )
  11283. 898.41 s [hedgehog] [ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, /build/ghc1118_0/ghc_24.o, /build/ghc1118_0/ghc_24.dyn_o )
  11284. 898.41 s [hedgehog] [ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, /build/ghc1118_0/ghc_26.o, /build/ghc1118_0/ghc_26.dyn_o )
  11285. 898.41 s [hedgehog] [ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, nothing )
  11286. 898.41 s [hedgehog] [ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, nothing )
  11287. 898.41 s [hedgehog] [ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, /build/ghc1118_0/ghc_30.o, /build/ghc1118_0/ghc_30.dyn_o )
  11288. 898.41 s [hedgehog] [ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, /build/ghc1118_0/ghc_36.o, /build/ghc1118_0/ghc_36.dyn_o )
  11289. 898.41 s [hedgehog] [ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, /build/ghc1118_0/ghc_38.o, /build/ghc1118_0/ghc_38.dyn_o )
  11290. 898.41 s [hedgehog] [ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, /build/ghc1118_0/ghc_42.o, /build/ghc1118_0/ghc_42.dyn_o )
  11291. 898.41 s [hedgehog] [10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, /build/ghc1118_0/ghc_44.o, /build/ghc1118_0/ghc_44.dyn_o )
  11292. 898.41 s [tasty-smallcheck] Using gcc version 14.3.0 given by user at:
  11293. 898.41 s [tasty-smallcheck] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  11294. 898.41 s [tasty-smallcheck] Using ghc version 9.8.1 found on system at:
  11295. 898.41 s [tasty-smallcheck] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  11296. 898.41 s [tasty-smallcheck] Using ghc-pkg version 9.8.1 found on system at:
  11297. 898.41 s [tasty-smallcheck] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  11298. 898.41 s [tasty-smallcheck] No ghcjs found
  11299. 898.41 s [tasty-smallcheck] No ghcjs-pkg found
  11300. 898.41 s [tasty-smallcheck] No greencard found
  11301. 898.41 s [tasty-smallcheck] Using haddock version 2.30.0 found on system at:
  11302. 898.41 s [tasty-smallcheck] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  11303. 898.41 s [tasty-smallcheck] No happy found
  11304. 898.41 s [tasty-smallcheck] Using haskell-suite found on system at: haskell-suite-dummy-location
  11305. 898.41 s [tasty-smallcheck] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  11306. 898.41 s [tasty-smallcheck] No hmake found
  11307. 898.41 s [tasty-smallcheck] Using hpc version 0.69 found on system at:
  11308. 898.41 s [tasty-smallcheck] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  11309. 898.41 s [tasty-smallcheck] Using hsc2hs version 0.68.10 found on system at:
  11310. 898.41 s [tasty-smallcheck] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  11311. 898.41 s [tasty-smallcheck] Using hscolour version 1.25 found on system at:
  11312. 898.41 s [tasty-smallcheck] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  11313. 898.41 s [tasty-smallcheck] No jhc found
  11314. 898.41 s [tasty-smallcheck] Using ld found on system at:
  11315. 898.41 s [tasty-smallcheck] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  11316. 898.41 s [tasty-smallcheck] No pkg-config found
  11317. 898.41 s [tasty-smallcheck] Using runghc version 9.8.1 found on system at:
  11318. 898.41 s [tasty-smallcheck] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  11319. 898.41 s [tasty-smallcheck] Using strip version 2.44 found on system at:
  11320. 898.41 s [tasty-smallcheck] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  11321. 898.41 s [tasty-smallcheck] Using tar found on system at:
  11322. 898.41 s [tasty-smallcheck] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  11323. 898.41 s [tasty-smallcheck] No uhc found
  11324. 898.41 s [tasty-smallcheck] Phase: buildPhase
  11325. 898.41 s [tasty-smallcheck] Preprocessing library for tasty-smallcheck-0.8.2..
  11326. 898.41 s [tasty-smallcheck] Building library for tasty-smallcheck-0.8.2..
  11327. 898.41 s [tasty-smallcheck] [1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, dist/build/Test/Tasty/SmallCheck.o, dist/build/Test/Tasty/SmallCheck.dyn_o )
  11328. 898.41 s [tasty-smallcheck] [1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, dist/build/Test/Tasty/SmallCheck.p_o )
  11329. 898.41 s [tasty-smallcheck] Phase: checkPhase
  11330. 898.41 s [tasty-smallcheck] Package has no test suites.
  11331. 898.41 s [tasty-smallcheck] Phase: haddockPhase
  11332. 898.41 s [tasty-smallcheck] Preprocessing library for tasty-smallcheck-0.8.2..
  11333. 898.41 s [tasty-smallcheck] Running Haddock on library for tasty-smallcheck-0.8.2..
  11334. 898.41 s [tasty-smallcheck] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  11335. 898.41 s [tasty-smallcheck] [1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, nothing )
  11336. 898.41 s [tasty-smallcheck] Haddock coverage:
  11337. 898.41 s [tasty-smallcheck] Warning: 'SmallCheckDepth' is ambiguous. It is defined
  11338. 898.41 s [tasty-smallcheck] * at Test/Tasty/SmallCheck.hs:28:27
  11339. 898.41 s [tasty-smallcheck] * at Test/Tasty/SmallCheck.hs:28:1
  11340. 898.41 s [tasty-smallcheck] You may be able to disambiguate the identifier by qualifying it or
  11341. 898.41 s [tasty-smallcheck] by specifying the type/value namespace explicitly.
  11342. 898.41 s [tasty-smallcheck] Defaulting to the one defined at Test/Tasty/SmallCheck.hs:28:1
  11343. 898.41 s [tasty-smallcheck] Warning: 'Test' is out of scope.
  11344. 898.41 s [tasty-smallcheck] If you qualify the identifier, haddock can try to link it anyway.
  11345. 898.41 s [tasty-smallcheck] 100% ( 15 / 15) in 'Test.Tasty.SmallCheck'
  11346. 898.41 s [tasty-smallcheck] Documentation created: dist/doc/html/tasty-smallcheck/,
  11347. 898.41 s [tasty-smallcheck] dist/doc/html/tasty-smallcheck/tasty-smallcheck.txt
  11348. 898.41 s [tasty-smallcheck] Phase: installPhase
  11349. 898.41 s [tasty-smallcheck] Installing library in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  11350. 898.41 s [tasty-smallcheck] Phase: fixupPhase
  11351. 898.41 s [tasty-smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2
  11352. 898.41 s [tasty-smallcheck] shrinking /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU-ghc9.8.1.so
  11353. 898.41 s [tasty-smallcheck] checking for references to /build/ in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2...
  11354. 898.41 s [tasty-smallcheck] patching script interpreter paths in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2
  11355. 898.41 s [tasty-smallcheck] stripping (with command strip and flags -S -p) in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib
  11356. 898.41 s [tasty-smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc
  11357. 898.41 s [hedgehog] [11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, /build/ghc1118_0/ghc_46.o, /build/ghc1118_0/ghc_46.dyn_o )
  11358. 898.41 s [hedgehog] [12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, /build/ghc1118_0/ghc_48.o, /build/ghc1118_0/ghc_48.dyn_o )
  11359. 898.41 s [hedgehog] [13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, /build/ghc1118_0/ghc_50.o, /build/ghc1118_0/ghc_50.dyn_o )
  11360. 898.41 s [hedgehog] [14 of 27] Compiling Hedgehog.Main ( src/Hedgehog/Main.hs, nothing )
  11361. 898.41 s [hedgehog] [15 of 27] Compiling Hedgehog.Range ( src/Hedgehog/Range.hs, /build/ghc1118_0/ghc_52.o, /build/ghc1118_0/ghc_52.dyn_o )
  11362. 898.41 s [hedgehog] [16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, /build/ghc1118_0/ghc_28.o, /build/ghc1118_0/ghc_28.dyn_o )
  11363. 898.41 s [tasty-smallcheck] checking for references to /build/ in /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc...
  11364. 898.41 s [tasty-smallcheck] patching script interpreter paths in /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc
  11365. 898.45 s [tasty-smallcheck:post-build] Uploading to cachix cache "sellout": /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc
  11366. 898.97 s [tasty-smallcheck:post-build] Pushing 2 paths (89 are already present) using zstd to cache sellout ⏳
  11367. 898.97 s [tasty-smallcheck:post-build]
  11368. 899.32 s [tasty-smallcheck:post-build] Pushing /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 (358.59 KiB)
  11369. 899.42 s [tasty-smallcheck:post-build] Pushing /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc (273.11 KiB)
  11370. 900.52 s [tasty-smallcheck:post-build]
  11371. 900.52 s [tasty-smallcheck:post-build] All done.
  11372. 900.78 s [tasty-smallcheck:post-build] Uploading to the NixCI cache: /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc
  11373. 901.38 s [tasty-smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  11374. 901.66 s [tasty-smallcheck:post-build] copying 2 paths...
  11375. 901.66 s [tasty-smallcheck:post-build] copying path '/nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc' to 'https://cache.nix-ci.com'...
  11376. 902.03 s [tasty-smallcheck:post-build] copying path '/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2' to 'https://cache.nix-ci.com'...
  11377. 903.09 s [tasty-smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  11378. 903.39 s [tasty-smallcheck:post-build] copying 1 paths...
  11379. 903.47 s [tasty-smallcheck:post-build] copying path '/nix/store/4wi66qphj36m7fxwhw032c9jj721fqpp-tasty-smallcheck-0.8.2.drv' to 'https://cache.nix-ci.com'...
  11380. 903.83 s Progress: 31 of 47 built (1 building)
  11381. 903.89 s Building /nix/store/w3k022qgh9jnjzrax7zxd61gdyj6c7sc-integer-logarithms-1.0.4.drv
  11382. 903.89 s [hedgehog] [17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, /build/ghc1118_0/ghc_32.o, /build/ghc1118_0/ghc_32.dyn_o )
  11383. 903.89 s [hedgehog]
  11384. 903.89 s [hedgehog] src/Hedgehog/Internal/Property.hs:433:31: warning: [GHC-63394] [-Wx-partial]
  11385. 903.89 s [hedgehog] In the use of ‘head’
  11386. 903.89 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  11387. 903.89 s [hedgehog] "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."
  11388. 903.89 s [hedgehog] |
  11389. 903.89 s [hedgehog] 433 | groups = List.map (\l -> (head l, length l)) $ List.group sp
  11390. 903.89 s [hedgehog] | ^^^^
  11391. 903.89 s [hedgehog] [18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, nothing )
  11392. 903.89 s [hedgehog] [19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, nothing )
  11393. 903.89 s [hedgehog] [20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, /build/ghc1118_0/ghc_22.o, /build/ghc1118_0/ghc_22.dyn_o )
  11394. 903.89 s [hedgehog] [21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, nothing )
  11395. 903.89 s [hedgehog] [22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, /build/ghc1118_0/ghc_20.o, /build/ghc1118_0/ghc_20.dyn_o )
  11396. 903.89 s [hedgehog] [23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, /build/ghc1118_0/ghc_40.o, /build/ghc1118_0/ghc_40.dyn_o )
  11397. 903.89 s [hedgehog]
  11398. 903.89 s [hedgehog] src/Hedgehog/Internal/Report.hs:1096:37: warning: [GHC-63394] [-Wx-partial]
  11399. 903.89 s [hedgehog] In the use of ‘head’
  11400. 903.89 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  11401. 903.89 s [hedgehog] "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."
  11402. 903.89 s [hedgehog] |
  11403. 903.89 s [hedgehog] 1096 | replicate fillErrorWidth (head parts)
  11404. 903.89 s [hedgehog] | ^^^^
  11405. 903.89 s [hedgehog]
  11406. 903.89 s [hedgehog] src/Hedgehog/Internal/Report.hs:1098:39: warning: [GHC-63394] [-Wx-partial]
  11407. 903.89 s [hedgehog] In the use of ‘head’
  11408. 903.89 s [hedgehog] (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
  11409. 903.89 s [hedgehog] "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."
  11410. 903.89 s [hedgehog] |
  11411. 903.89 s [hedgehog] 1098 | replicate fillSurplusWidth (head parts)
  11412. 903.89 s [hedgehog] | ^^^^
  11413. 903.89 s [hedgehog] [24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, /build/ghc1118_0/ghc_34.o, /build/ghc1118_0/ghc_34.dyn_o )
  11414. 903.89 s [hedgehog] [25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, nothing )
  11415. 903.89 s [hedgehog] [26 of 27] Compiling Hedgehog.Gen ( src/Hedgehog/Gen.hs, nothing )
  11416. 903.89 s [hedgehog] [27 of 27] Compiling Hedgehog ( src/Hedgehog.hs, nothing )
  11417. 903.89 s [hedgehog] Haddock coverage:
  11418. 903.89 s [hedgehog] 75% ( 3 / 4) in 'Hedgehog.Internal.Barbie'
  11419. 903.89 s [hedgehog] Missing documentation for:
  11420. 903.89 s [hedgehog] Rec
  11421. 903.89 s [hedgehog] 0% ( 0 / 2) in 'Hedgehog.Internal.Distributive'
  11422. 903.89 s [hedgehog] Missing documentation for:
  11423. 903.89 s [hedgehog] Module header
  11424. 903.89 s [hedgehog] MonadTransDistributive (src/Hedgehog/Internal/Distributive.hs:31)
  11425. 903.89 s [hedgehog] 0% ( 0 / 3) in 'Hedgehog.Internal.Exception'
  11426. 903.89 s [hedgehog] Missing documentation for:
  11427. 903.89 s [hedgehog] Module header
  11428. 903.89 s [hedgehog] tryAll (src/Hedgehog/Internal/Exception.hs:14)
  11429. 903.89 s [hedgehog] tryEvaluate (src/Hedgehog/Internal/Exception.hs:23)
  11430. 903.89 s [hedgehog] 50% ( 1 / 2) in 'Hedgehog.Internal.HTraversable'
  11431. 903.89 s [hedgehog] Missing documentation for:
  11432. 903.89 s [hedgehog] Module header
  11433. 903.89 s [hedgehog] 50% ( 1 / 2) in 'Hedgehog.Internal.Opaque'
  11434. 903.89 s [hedgehog] Missing documentation for:
  11435. 903.89 s [hedgehog] Module header
  11436. 903.89 s [hedgehog] 97% (135 /139) in 'Hedgehog.Internal.Prelude'
  11437. 903.89 s [hedgehog] Missing documentation for:
  11438. 903.89 s [hedgehog] Bool
  11439. 903.89 s [hedgehog] Ordering
  11440. 903.89 s [hedgehog] even
  11441. 903.89 s [hedgehog] odd
  11442. 903.89 s [hedgehog] Warning: 'Size' is ambiguous. It is defined
  11443. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Range.hs:56:3
  11444. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Range.hs:55:1
  11445. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11446. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11447. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Range.hs:55:1
  11448. 903.89 s [hedgehog] Warning: 'Range' is ambiguous. It is defined
  11449. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Range.hs:81:3
  11450. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Range.hs:80:1
  11451. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11452. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11453. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Range.hs:80:1
  11454. 903.89 s [hedgehog] 96% ( 32 / 33) in 'Hedgehog.Internal.Range'
  11455. 903.89 s [hedgehog] Missing documentation for:
  11456. 903.89 s [hedgehog] Module header
  11457. 903.89 s [hedgehog] 0% ( 0 / 10) in 'Hedgehog.Internal.Region'
  11458. 903.89 s [hedgehog] Missing documentation for:
  11459. 903.89 s [hedgehog] Module header
  11460. 903.89 s [hedgehog] Region (src/Hedgehog/Internal/Region.hs:29)
  11461. 903.89 s [hedgehog] newEmptyRegion (src/Hedgehog/Internal/Region.hs:35)
  11462. 903.89 s [hedgehog] newOpenRegion (src/Hedgehog/Internal/Region.hs:41)
  11463. 903.89 s [hedgehog] openRegion (src/Hedgehog/Internal/Region.hs:48)
  11464. 903.89 s [hedgehog] setRegion (src/Hedgehog/Internal/Region.hs:64)
  11465. 903.89 s [hedgehog] displayRegions (src/Hedgehog/Internal/Region.hs:78)
  11466. 903.89 s [hedgehog] displayRegion (src/Hedgehog/Internal/Region.hs:87)
  11467. 903.89 s [hedgehog] moveToBottom (src/Hedgehog/Internal/Region.hs:91)
  11468. 903.89 s [hedgehog] finishRegion (src/Hedgehog/Internal/Region.hs:115)
  11469. 903.89 s [hedgehog] Warning: 'Seed' is ambiguous. It is defined
  11470. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Seed.hs:75:3
  11471. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Seed.hs:74:1
  11472. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11473. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11474. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Seed.hs:74:1
  11475. 903.89 s [hedgehog] 70% ( 12 / 17) in 'Hedgehog.Internal.Seed'
  11476. 903.89 s [hedgehog] Missing documentation for:
  11477. 903.89 s [hedgehog] mix64 (src/Hedgehog/Internal/Seed.hs:177)
  11478. 903.89 s [hedgehog] mix64variant13 (src/Hedgehog/Internal/Seed.hs:193)
  11479. 903.89 s [hedgehog] mix32 (src/Hedgehog/Internal/Seed.hs:185)
  11480. 903.89 s [hedgehog] mixGamma (src/Hedgehog/Internal/Seed.hs:201)
  11481. 903.89 s [hedgehog] global (src/Hedgehog/Internal/Seed.hs:97)
  11482. 903.89 s [hedgehog] 13% ( 2 / 15) in 'Hedgehog.Internal.Show'
  11483. 903.89 s [hedgehog] Missing documentation for:
  11484. 903.89 s [hedgehog] Module header
  11485. 903.89 s [hedgehog] ValueDiff (src/Hedgehog/Internal/Show.hs:30)
  11486. 903.89 s [hedgehog] LineDiff (src/Hedgehog/Internal/Show.hs:39)
  11487. 903.89 s [hedgehog] mkValue (src/Hedgehog/Internal/Show.hs:74)
  11488. 903.89 s [hedgehog] showPretty (src/Hedgehog/Internal/Show.hs:78)
  11489. 903.89 s [hedgehog] valueDiff (src/Hedgehog/Internal/Show.hs:93)
  11490. 903.89 s [hedgehog] lineDiff (src/Hedgehog/Internal/Show.hs:82)
  11491. 903.89 s [hedgehog] toLineDiff (src/Hedgehog/Internal/Show.hs:86)
  11492. 903.89 s [hedgehog] renderValue (src/Hedgehog/Internal/Show.hs:55)
  11493. 903.89 s [hedgehog] renderValueDiff (src/Hedgehog/Internal/Show.hs:59)
  11494. 903.89 s [hedgehog] renderLineDiff (src/Hedgehog/Internal/Show.hs:65)
  11495. 903.89 s [hedgehog] takeLeft (src/Hedgehog/Internal/Show.hs:127)
  11496. 903.89 s [hedgehog] takeRight (src/Hedgehog/Internal/Show.hs:142)
  11497. 903.89 s [hedgehog] Warning: 'k' is out of scope.
  11498. 903.89 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11499. 903.89 s [hedgehog] 85% ( 6 / 7) in 'Hedgehog.Internal.Shrink'
  11500. 903.89 s [hedgehog] Missing documentation for:
  11501. 903.89 s [hedgehog] Module header
  11502. 903.89 s [hedgehog] 50% ( 5 / 10) in 'Hedgehog.Internal.Source'
  11503. 903.89 s [hedgehog] Missing documentation for:
  11504. 903.89 s [hedgehog] Module header
  11505. 903.89 s [hedgehog] LineNo (src/Hedgehog/Internal/Source.hs:24)
  11506. 903.89 s [hedgehog] ColumnNo (src/Hedgehog/Internal/Source.hs:29)
  11507. 903.89 s [hedgehog] Span (src/Hedgehog/Internal/Source.hs:34)
  11508. 903.89 s [hedgehog] getCaller (src/Hedgehog/Internal/Source.hs:44)
  11509. 903.89 s [hedgehog] Warning: 'NodeT' is ambiguous. It is defined
  11510. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:131:3
  11511. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:130:1
  11512. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11513. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11514. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:130:1
  11515. 903.89 s [hedgehog] Warning: 'TreeT' is ambiguous. It is defined
  11516. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:105:3
  11517. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:104:1
  11518. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11519. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11520. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:104:1
  11521. 903.89 s [hedgehog] Warning: 'Node' is ambiguous. It is defined
  11522. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:125:1
  11523. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:116:1
  11524. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11525. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11526. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:116:1
  11527. 903.89 s [hedgehog] Warning: 'Tree' is ambiguous. It is defined
  11528. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:95:1
  11529. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:89:1
  11530. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11531. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11532. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:89:1
  11533. 903.89 s [hedgehog] 78% ( 22 / 28) in 'Hedgehog.Internal.Tree'
  11534. 903.89 s [hedgehog] Missing documentation for:
  11535. 903.89 s [hedgehog] Module header
  11536. 903.89 s [hedgehog] mapMaybe (src/Hedgehog/Internal/Tree.hs:257)
  11537. 903.89 s [hedgehog] mapMaybeMaybeT (src/Hedgehog/Internal/Tree.hs:277)
  11538. 903.89 s [hedgehog] consChild (src/Hedgehog/Internal/Tree.hs:325)
  11539. 903.89 s [hedgehog] mapMaybeT (src/Hedgehog/Internal/Tree.hs:314)
  11540. 903.89 s [hedgehog] interleave (src/Hedgehog/Internal/Tree.hs:388)
  11541. 903.89 s [hedgehog] 66% ( 2 / 3) in 'Hedgehog.Main'
  11542. 903.89 s [hedgehog] Missing documentation for:
  11543. 903.89 s [hedgehog] Module header
  11544. 903.89 s [hedgehog] 96% ( 25 / 26) in 'Hedgehog.Range'
  11545. 903.89 s [hedgehog] Missing documentation for:
  11546. 903.89 s [hedgehog] Module header
  11547. 903.89 s [hedgehog] Warning: 'GenT' is ambiguous. It is defined
  11548. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Gen.hs:257:3
  11549. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Gen.hs:256:1
  11550. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11551. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11552. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Gen.hs:256:1
  11553. 903.89 s [hedgehog] Warning: 'Size' is ambiguous. It is defined
  11554. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Range.hs:56:3
  11555. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Range.hs:55:1
  11556. 903.89 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11557. 903.89 s [hedgehog] by specifying the type/value namespace explicitly.
  11558. 903.89 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Range.hs:55:1
  11559. 903.89 s [hedgehog] Warning: 'Seed' is ambiguous. It is defined
  11560. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Seed.hs:75:3
  11561. 903.89 s [hedgehog] * at src/Hedgehog/Internal/Seed.hs:74:1
  11562. 903.90 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11563. 903.90 s [hedgehog] by specifying the type/value namespace explicitly.
  11564. 903.90 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Seed.hs:74:1
  11565. 903.90 s [hedgehog] Warning: 'list' is ambiguous. It is defined
  11566. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Gen.hs:1501:1
  11567. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Shrink.hs:79:1
  11568. 903.90 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11569. 903.90 s [hedgehog] by specifying the type/value namespace explicitly.
  11570. 903.90 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Shrink.hs:79:1
  11571. 903.90 s [hedgehog] Warning: 'filter' is ambiguous. It is defined
  11572. 903.90 s [hedgehog] * in ‘Data.List.NonEmpty’
  11573. 903.90 s [hedgehog] * in ‘Data.ByteString’
  11574. 903.90 s [hedgehog] * in ‘Data.Map.Internal’
  11575. 903.90 s [hedgehog] * in ‘Data.Sequence.Internal’
  11576. 903.90 s [hedgehog] * in ‘Data.Set.Internal’
  11577. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Gen.hs:1342:1
  11578. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:254:1
  11579. 903.90 s [hedgehog] * in ‘Data.Text’
  11580. 903.90 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11581. 903.90 s [hedgehog] by specifying the type/value namespace explicitly.
  11582. 903.90 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:254:1
  11583. 903.90 s [hedgehog] Warning: 'mapMaybeT' is ambiguous. It is defined
  11584. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Gen.hs:1420:1
  11585. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:314:1
  11586. 903.90 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11587. 903.90 s [hedgehog] by specifying the type/value namespace explicitly.
  11588. 903.90 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:314:1
  11589. 903.90 s [hedgehog] Warning: 'mfilter' is out of scope.
  11590. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11591. 903.90 s [hedgehog] Warning: 'mapMaybe' is ambiguous. It is defined
  11592. 903.90 s [hedgehog] * in ‘Data.Maybe’
  11593. 903.90 s [hedgehog] * in ‘Data.Map.Internal’
  11594. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Gen.hs:1359:1
  11595. 903.90 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:257:1
  11596. 903.90 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11597. 903.90 s [hedgehog] by specifying the type/value namespace explicitly.
  11598. 903.90 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:257:1
  11599. 903.90 s [hedgehog] Warning: 'a' is out of scope.
  11600. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11601. 903.90 s [hedgehog] Warning: 'b' is out of scope.
  11602. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11603. 903.90 s [hedgehog] Warning: 'n' is out of scope.
  11604. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11605. 903.90 s [hedgehog] Warning: 'withTests' is out of scope.
  11606. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11607. 903.90 s [hedgehog] Warning: 'property' is out of scope.
  11608. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11609. 903.90 s [hedgehog] 97% (124 /127) in 'Hedgehog.Internal.Gen'
  11610. 903.90 s [hedgehog] Missing documentation for:
  11611. 903.90 s [hedgehog] Module header
  11612. 903.90 s [hedgehog] Vec (src/Hedgehog/Internal/Gen.hs:1609)
  11613. 903.90 s [hedgehog] Nat (src/Hedgehog/Internal/Gen.hs:1605)
  11614. 903.90 s [hedgehog] Warning: 'OverloadedStrings' is out of scope.
  11615. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11616. 903.90 s [hedgehog] Warning: 'Class' is out of scope.
  11617. 903.90 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11618. 903.91 s [hedgehog] Warning: 'ShrinkPath' is ambiguous. It is defined
  11619. 903.91 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:397:3
  11620. 903.91 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:396:1
  11621. 903.91 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11622. 903.91 s [hedgehog] by specifying the type/value namespace explicitly.
  11623. 903.91 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:396:1
  11624. 903.91 s [hedgehog] Warning: 'r' is out of scope.
  11625. 903.91 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11626. 903.91 s [hedgehog] Warning: 'ExceptT' is ambiguous. It is defined
  11627. 903.91 s [hedgehog] * in ‘Control.Monad.Trans.Except’
  11628. 903.91 s [hedgehog] * in ‘Control.Monad.Trans.Except’
  11629. 903.91 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11630. 903.91 s [hedgehog] by specifying the type/value namespace explicitly.
  11631. 903.91 s [hedgehog] Defaulting to the one defined in ‘Control.Monad.Trans.Except’
  11632. 903.92 s [hedgehog] Warning: 'TestT' is ambiguous. It is defined
  11633. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:243:3
  11634. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:242:1
  11635. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11636. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11637. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:242:1
  11638. 903.92 s [hedgehog] Warning: 'PropertyT' is ambiguous. It is defined
  11639. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:208:3
  11640. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:207:1
  11641. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11642. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11643. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:207:1
  11644. 903.92 s [hedgehog] Warning: 'Property' is ambiguous. It is defined
  11645. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:199:3
  11646. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:198:1
  11647. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11648. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11649. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:198:1
  11650. 903.92 s [hedgehog] Warning: 'Confidence' is ambiguous. It is defined
  11651. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:274:3
  11652. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:273:1
  11653. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11654. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11655. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:273:1
  11656. 903.92 s [hedgehog] Warning: 'ShrinkRetries' is ambiguous. It is defined
  11657. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:546:3
  11658. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:545:1
  11659. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11660. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11661. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:545:1
  11662. 903.92 s [hedgehog] Warning: 'Label' is ambiguous. It is defined
  11663. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:593:5
  11664. 903.92 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:672:1
  11665. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11666. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11667. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:672:1
  11668. 903.92 s [hedgehog] Warning: 'ClassifierName' is out of scope.
  11669. 903.92 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11670. 903.92 s [hedgehog] 86% ( 87 /101) in 'Hedgehog.Internal.Property'
  11671. 903.92 s [hedgehog] Missing documentation for:
  11672. 903.92 s [hedgehog] Module header
  11673. 903.92 s [hedgehog] MonadTest (src/Hedgehog/Internal/Property.hs:766)
  11674. 903.92 s [hedgehog] coverPercentage (src/Hedgehog/Internal/Property.hs:1342)
  11675. 903.92 s [hedgehog] labelCovered (src/Hedgehog/Internal/Property.hs:1355)
  11676. 903.92 s [hedgehog] coverageFailures (src/Hedgehog/Internal/Property.hs:1364)
  11677. 903.92 s [hedgehog] journalCoverage (src/Hedgehog/Internal/Property.hs:1441)
  11678. 903.92 s [hedgehog] toCoverCount (src/Hedgehog/Internal/Property.hs:1317)
  11679. 903.92 s [hedgehog] TerminationCriteria (src/Hedgehog/Internal/Property.hs:576)
  11680. 903.92 s [hedgehog] verifiedTermination (src/Hedgehog/Internal/Property.hs:1228)
  11681. 903.92 s [hedgehog] mkTest (src/Hedgehog/Internal/Property.hs:826)
  11682. 903.92 s [hedgehog] mkTestT (src/Hedgehog/Internal/Property.hs:822)
  11683. 903.92 s [hedgehog] runTest (src/Hedgehog/Internal/Property.hs:834)
  11684. 903.92 s [hedgehog] runTestT (src/Hedgehog/Internal/Property.hs:830)
  11685. 903.92 s [hedgehog] wilsonBounds (src/Hedgehog/Internal/Property.hs:1403)
  11686. 903.92 s [hedgehog] 50% ( 1 / 2) in 'Hedgehog.Internal.Tripping'
  11687. 903.92 s [hedgehog] Missing documentation for:
  11688. 903.92 s [hedgehog] Module header
  11689. 903.92 s [hedgehog] Warning: 'Command' is ambiguous. It is defined
  11690. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:383:3
  11691. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:382:1
  11692. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11693. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11694. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/State.hs:382:1
  11695. 903.92 s [hedgehog] Warning: 'Action' is ambiguous. It is defined
  11696. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:415:3
  11697. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:414:1
  11698. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11699. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11700. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/State.hs:414:1
  11701. 903.92 s [hedgehog] Warning: 'Symbolic' is ambiguous. It is defined
  11702. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:108:3
  11703. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:107:1
  11704. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11705. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11706. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/State.hs:107:1
  11707. 903.92 s [hedgehog] Warning: 'Concrete' is ambiguous. It is defined
  11708. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:135:3
  11709. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:134:1
  11710. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11711. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11712. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/State.hs:134:1
  11713. 903.92 s [hedgehog] Warning: 'Var' is ambiguous. It is defined
  11714. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:177:3
  11715. 903.92 s [hedgehog] * at src/Hedgehog/Internal/State.hs:176:1
  11716. 903.92 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11717. 903.92 s [hedgehog] by specifying the type/value namespace explicitly.
  11718. 903.92 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/State.hs:176:1
  11719. 903.93 s [hedgehog] 96% ( 31 / 32) in 'Hedgehog.Internal.State'
  11720. 903.93 s [hedgehog] Missing documentation for:
  11721. 903.93 s [hedgehog] Module header
  11722. 903.93 s [hedgehog] 0% ( 0 / 7) in 'Hedgehog.Internal.Discovery'
  11723. 903.93 s [hedgehog] Missing documentation for:
  11724. 903.93 s [hedgehog] Module header
  11725. 903.93 s [hedgehog] PropertySource (src/Hedgehog/Internal/Discovery.hs:35)
  11726. 903.93 s [hedgehog] readProperties (src/Hedgehog/Internal/Discovery.hs:41)
  11727. 903.93 s [hedgehog] findProperties (src/Hedgehog/Internal/Discovery.hs:67)
  11728. 903.93 s [hedgehog] readDeclaration (src/Hedgehog/Internal/Discovery.hs:45)
  11729. 903.93 s [hedgehog] Pos (src/Hedgehog/Internal/Discovery.hs:209)
  11730. 903.93 s [hedgehog] Position (src/Hedgehog/Internal/Discovery.hs:202)
  11731. 903.93 s [hedgehog] Warning: 'prop_' is out of scope.
  11732. 903.93 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11733. 903.93 s [hedgehog] 25% ( 1 / 4) in 'Hedgehog.Internal.TH'
  11734. 903.93 s [hedgehog] Missing documentation for:
  11735. 903.93 s [hedgehog] Module header
  11736. 903.93 s [hedgehog] TExpQ (src/Hedgehog/Internal/TH.hs:30)
  11737. 903.93 s [hedgehog] discoverPrefix (src/Hedgehog/Internal/TH.hs:51)
  11738. 903.93 s [hedgehog] 29% ( 5 / 17) in 'Hedgehog.Internal.Config'
  11739. 903.93 s [hedgehog] Missing documentation for:
  11740. 903.93 s [hedgehog] Module header
  11741. 903.93 s [hedgehog] resolveColor (src/Hedgehog/Internal/Config.hs:191)
  11742. 903.93 s [hedgehog] resolveSeed (src/Hedgehog/Internal/Config.hs:198)
  11743. 903.93 s [hedgehog] resolveVerbosity (src/Hedgehog/Internal/Config.hs:205)
  11744. 903.93 s [hedgehog] resolveWorkers (src/Hedgehog/Internal/Config.hs:212)
  11745. 903.93 s [hedgehog] resolveSkip (src/Hedgehog/Internal/Config.hs:219)
  11746. 903.93 s [hedgehog] detectMark (src/Hedgehog/Internal/Config.hs:76)
  11747. 903.93 s [hedgehog] detectColor (src/Hedgehog/Internal/Config.hs:103)
  11748. 903.93 s [hedgehog] detectSeed (src/Hedgehog/Internal/Config.hs:137)
  11749. 903.93 s [hedgehog] detectVerbosity (src/Hedgehog/Internal/Config.hs:147)
  11750. 903.93 s [hedgehog] detectWorkers (src/Hedgehog/Internal/Config.hs:165)
  11751. 903.93 s [hedgehog] detectSkip (src/Hedgehog/Internal/Config.hs:175)
  11752. 903.93 s [hedgehog] 26% ( 7 / 26) in 'Hedgehog.Internal.Report'
  11753. 903.93 s [hedgehog] Missing documentation for:
  11754. 903.93 s [hedgehog] Module header
  11755. 903.93 s [hedgehog] FailureReport (src/Hedgehog/Internal/Report.hs:100)
  11756. 903.93 s [hedgehog] FailedAnnotation (src/Hedgehog/Internal/Report.hs:94)
  11757. 903.93 s [hedgehog] Style (src/Hedgehog/Internal/Report.hs:205)
  11758. 903.93 s [hedgehog] Markup (src/Hedgehog/Internal/Report.hs:211)
  11759. 903.93 s [hedgehog] Config (src/Hedgehog/Internal/Report.hs:1316)
  11760. 903.93 s [hedgehog] defaultConfig (src/Hedgehog/Internal/Report.hs:1335)
  11761. 903.93 s [hedgehog] Context (src/Hedgehog/Internal/Report.hs:573)
  11762. 903.93 s [hedgehog] Lines (src/Hedgehog/Internal/Report.hs:567)
  11763. 903.93 s [hedgehog] renderProgress (src/Hedgehog/Internal/Report.hs:1310)
  11764. 903.93 s [hedgehog] renderResult (src/Hedgehog/Internal/Report.hs:1314)
  11765. 903.93 s [hedgehog] renderResultWith (src/Hedgehog/Internal/Report.hs:1338)
  11766. 903.93 s [hedgehog] renderSummary (src/Hedgehog/Internal/Report.hs:1342)
  11767. 903.93 s [hedgehog] renderDoc (src/Hedgehog/Internal/Report.hs:1190)
  11768. 903.93 s [hedgehog] ppProgress (src/Hedgehog/Internal/Report.hs:800)
  11769. 903.93 s [hedgehog] ppResult (src/Hedgehog/Internal/Report.hs:823)
  11770. 903.93 s [hedgehog] ppResultWith (src/Hedgehog/Internal/Report.hs:826)
  11771. 903.93 s [hedgehog] ppSummary (src/Hedgehog/Internal/Report.hs:1148)
  11772. 903.93 s [hedgehog] mkFailure (src/Hedgehog/Internal/Report.hs:286)
  11773. 903.93 s [hedgehog] 12% ( 1 / 8) in 'Hedgehog.Internal.Queue'
  11774. 903.93 s [hedgehog] Missing documentation for:
  11775. 903.93 s [hedgehog] Module header
  11776. 903.93 s [hedgehog] TaskIndex (src/Hedgehog/Internal/Queue.hs:32)
  11777. 903.93 s [hedgehog] TasksRemaining (src/Hedgehog/Internal/Queue.hs:36)
  11778. 903.93 s [hedgehog] runTasks (src/Hedgehog/Internal/Queue.hs:59)
  11779. 903.93 s [hedgehog] finalizeTask (src/Hedgehog/Internal/Queue.hs:107)
  11780. 903.93 s [hedgehog] runActiveFinalizers (src/Hedgehog/Internal/Queue.hs:83)
  11781. 903.93 s [hedgehog] dequeueMVar (src/Hedgehog/Internal/Queue.hs:43)
  11782. 903.94 s [hedgehog] 64% ( 9 / 14) in 'Hedgehog.Internal.Runner'
  11783. 903.94 s [hedgehog] Missing documentation for:
  11784. 903.94 s [hedgehog] Module header
  11785. 903.94 s [hedgehog] recheckAt (src/Hedgehog/Internal/Runner.hs:442)
  11786. 903.94 s [hedgehog] checkReport (src/Hedgehog/Internal/Runner.hs:215)
  11787. 903.94 s [hedgehog] checkRegion (src/Hedgehog/Internal/Runner.hs:389)
  11788. 903.94 s [hedgehog] checkNamed (src/Hedgehog/Internal/Runner.hs:419)
  11789. 903.94 s [hedgehog] 98% ( 93 / 94) in 'Hedgehog.Gen'
  11790. 903.94 s [hedgehog] Missing documentation for:
  11791. 903.94 s [hedgehog] Module header
  11792. 903.94 s [hedgehog] Warning: 'Command' is ambiguous. It is defined
  11793. 903.94 s [hedgehog] * at src/Hedgehog/Internal/State.hs:383:3
  11794. 903.94 s [hedgehog] * at src/Hedgehog/Internal/State.hs:382:1
  11795. 903.94 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  11796. 903.94 s [hedgehog] by specifying the type/value namespace explicitly.
  11797. 903.94 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/State.hs:382:1
  11798. 903.94 s [hedgehog] Warning: 'DeriveGeneric' is out of scope.
  11799. 903.94 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11800. 903.94 s [hedgehog] Warning: 'DeriveAnyClass' is out of scope.
  11801. 903.94 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11802. 903.94 s [hedgehog] Warning: 'DerivingStrategies' is out of scope.
  11803. 903.94 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  11804. 903.94 s [hedgehog] 94% ( 93 / 98) in 'Hedgehog'
  11805. 903.94 s [hedgehog] Missing documentation for:
  11806. 903.94 s [hedgehog] recheckAt (src/Hedgehog/Internal/Runner.hs:442)
  11807. 903.94 s [hedgehog] discoverPrefix (src/Hedgehog/Internal/TH.hs:51)
  11808. 903.94 s [hedgehog] verifiedTermination (src/Hedgehog/Internal/Property.hs:1228)
  11809. 903.94 s [hedgehog] MonadTest (src/Hedgehog/Internal/Property.hs:766)
  11810. 903.94 s [hedgehog] Rec
  11811. 904.02 s [integer-logarithms] Phase: setupCompilerEnvironmentPhase
  11812. 904.02 s [integer-logarithms] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  11813. 904.35 s [integer-logarithms] Phase: unpackPhase
  11814. 904.35 s [integer-logarithms] unpacking source archive /nix/store/ph0i5ssdxwdx25fp5i1sbmq6177nxsr9-integer-logarithms-1.0.4.tar.gz
  11815. 904.36 s [integer-logarithms] source root is integer-logarithms-1.0.4
  11816. 904.37 s [integer-logarithms] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "integer-logarithms-1.0.4/test-suite/Test.hs"
  11817. 904.39 s [integer-logarithms] Phase: patchPhase
  11818. 904.40 s [integer-logarithms] Phase: compileBuildDriverPhase
  11819. 904.41 s [integer-logarithms] setupCompileFlags: -package-db=/build/tmp.rxLKaW9j2u/setup-package.conf.d -threaded
  11820. 904.43 s [hedgehog] Warning: Hedgehog.Internal.Barbie: could not find link destinations for:
  11821. 904.43 s [hedgehog] - Barbies.Generics.Constraints.P
  11822. 904.43 s [hedgehog] - Barbies.Generics.Constraints.GAllRec
  11823. 904.43 s [hedgehog] Warning: Hedgehog.Internal.Distributive: could not find link destinations for:
  11824. 904.43 s [hedgehog] - Hedgehog.Internal.Distributive.R:TransformerfMaybeTm
  11825. 904.43 s [hedgehog] - Hedgehog.Internal.Distributive.R:TransformerfIdentityTm
  11826. 904.43 s [hedgehog] - Hedgehog.Internal.Tree.R:TransformerfTreeTm
  11827. 904.43 s [hedgehog] - Hedgehog.Internal.Gen.D:R:TransformertGenTm
  11828. 904.43 s [hedgehog] - Hedgehog.Internal.Property.D:R:TransformertTestTm
  11829. 904.43 s [hedgehog] - Hedgehog.Internal.Property.D:R:TransformertPropertyTm
  11830. 904.47 s [integer-logarithms] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.rxLKaW9j2u/Main.o )
  11831. 904.55 s [integer-logarithms] [2 of 2] Linking Setup
  11832. 904.91 s [hedgehog] Warning: Hedgehog.Internal.Prelude: could not find link destinations for:
  11833. 904.91 s [hedgehog] - GHC.Prim.~#
  11834. 904.91 s [hedgehog] - Data.Functor.Utils.StateT
  11835. 904.91 s [hedgehog] - Data.Functor.Utils.Max
  11836. 904.91 s [hedgehog] - Data.Functor.Utils.Min
  11837. 904.91 s [hedgehog] - Data.Functor.Utils.StateL
  11838. 904.91 s [hedgehog] - Data.Functor.Utils.StateR
  11839. 904.91 s [hedgehog] - GHC.Generics.SingKind
  11840. 904.91 s [hedgehog] - GHC.Generics.DemoteRep
  11841. 904.91 s [hedgehog] - GHC.Generics.fromSing
  11842. 904.91 s [hedgehog] - GHC.Generics.SingI
  11843. 904.91 s [hedgehog] - GHC.Generics.sing
  11844. 904.91 s [hedgehog] - GHC.Generics.Sing
  11845. 904.91 s [hedgehog] - GHC.Generics.D:R:UReckWordp0
  11846. 904.91 s [hedgehog] - GHC.Generics.D:R:UReckIntp0
  11847. 904.91 s [hedgehog] - GHC.Generics.D:R:UReckFloatp0
  11848. 904.91 s [hedgehog] - GHC.Generics.D:R:UReckDoublep0
  11849. 904.91 s [hedgehog] - GHC.Generics.D:R:UReckCharp0
  11850. 904.91 s [hedgehog] - GHC.Generics.Rep1_Either
  11851. 904.91 s [hedgehog] - GHC.Generics.Rep1_Maybe
  11852. 904.91 s [hedgehog] - GHC.Generics.Rep_Ordering
  11853. 904.91 s [hedgehog] - GHC.Generics.Rep_Bool
  11854. 904.91 s [hedgehog] - GHC.Generics.Rep_Either
  11855. 904.91 s [hedgehog] - GHC.Generics.Rep_Maybe
  11856. 904.91 s [hedgehog] - GHC.Generics.Rep_R:UReckWordp
  11857. 904.91 s [hedgehog] - GHC.Generics.Rep1_R:UReckWordp
  11858. 904.91 s [hedgehog] - GHC.Generics.Rep_R:UReckIntp
  11859. 904.91 s [hedgehog] - GHC.Generics.Rep1_R:UReckIntp
  11860. 904.91 s [hedgehog] - GHC.Generics.Rep1_R:UReckFloatp
  11861. 904.91 s [hedgehog] - GHC.Generics.Rep_R:UReckDoublep
  11862. 904.91 s [hedgehog] - GHC.Generics.Rep1_R:UReckDoublep
  11863. 904.91 s [hedgehog] - GHC.Generics.Rep_R:UReckCharp
  11864. 904.91 s [hedgehog] - GHC.Generics.Rep1_R:UReckCharp
  11865. 904.91 s [hedgehog] - GHC.IOPort.IOPort
  11866. 904.92 s [hedgehog] - Data.Foldable1.JoinWith
  11867. 904.92 s [hedgehog] - Data.Foldable1.FromMaybe
  11868. 904.92 s [hedgehog] - Data.Foldable1.NonEmptyDList
  11869. 904.92 s [hedgehog] - Data.ByteString.Builder.RealFloat.FormatMode
  11870. 904.92 s [hedgehog] - Data.Text.Internal.Encoding.PartialUtf8CodePoint
  11871. 904.92 s [hedgehog] - Text.ParserCombinators.ReadP.P
  11872. 904.92 s [hedgehog] - GHC.Generics.D:R:SingBoola0
  11873. 904.92 s [hedgehog] - GHC.Generics.STrue
  11874. 904.92 s [hedgehog] - GHC.Generics.D:R:DemoteRepBool
  11875. 904.92 s [hedgehog] - GHC.Generics.SFalse
  11876. 904.92 s [hedgehog] - GHC.Generics.Rep_R:UReckFloatp
  11877. 904.92 s [hedgehog] - GHC.Generics.D:R:SingMaybeb0
  11878. 904.92 s [hedgehog] - GHC.Generics.SNothing
  11879. 904.92 s [hedgehog] - GHC.Generics.SJust
  11880. 904.92 s [hedgehog] - GHC.Generics.D:R:DemoteRepMaybe
  11881. 904.92 s [hedgehog] - System.Console.Regions.LineUpdate
  11882. 904.92 s [hedgehog] - Control.Monad.Trans.Control.D:R:StMIOa
  11883. 904.92 s [hedgehog] - Control.Monad.Trans.Control.D:R:StMMaybea
  11884. 904.92 s [hedgehog] - Control.Monad.Primitive.D:R:PrimStateIO
  11885. 904.92 s [hedgehog] - Data.Set.Internal.MergeSet
  11886. 904.92 s [hedgehog] - Text.Printf.UPrintf
  11887. 904.92 s [hedgehog] - Text.Printf.hspr
  11888. 904.92 s [hedgehog] - Text.Printf.spr
  11889. 904.92 s [hedgehog] - GHC.IOPort.IOPortException
  11890. 904.92 s [hedgehog] - Data.Graph.SetM
  11891. 904.92 s [hedgehog] Warning: Hedgehog.Internal.Region: could not find link destinations for:
  11892. 904.92 s [hedgehog] - Hedgehog.Internal.Region.Body
  11893. 904.92 s [hedgehog] Warning: Hedgehog.Internal.Source: could not find link destinations for:
  11894. 904.92 s [hedgehog] - GHC.IsList.D:R:ItemCallStack
  11895. 904.93 s [hedgehog] Warning: Hedgehog.Internal.Tree: could not find link destinations for:
  11896. 904.93 s [hedgehog] - Hedgehog.Internal.Tree.D:R:PrimStateTreeT
  11897. 904.93 s [hedgehog] - Hedgehog.Internal.Tree.R:TransformerfTreeTm
  11898. 904.94 s [hedgehog] Warning: Hedgehog.Internal.Gen: could not find link destinations for:
  11899. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:PrimStateGenT
  11900. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:TransformertGenTm
  11901. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseWriterT
  11902. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseWriterT0
  11903. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseStateT
  11904. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseStateT0
  11905. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseReaderT
  11906. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseExceptT
  11907. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseMaybeT
  11908. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseIdentityT
  11909. 904.94 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseGenT
  11910. 904.96 s [hedgehog] Warning: Hedgehog.Internal.Property: could not find link destinations for:
  11911. 904.96 s [hedgehog] - Hedgehog.Internal.Property.D:R:StTTestTa
  11912. 904.96 s [hedgehog] - Hedgehog.Internal.Property.D:R:PrimStateTestT
  11913. 904.96 s [hedgehog] - Hedgehog.Internal.Property.D:R:TransformertTestTm
  11914. 904.96 s [hedgehog] - Hedgehog.Internal.Property.D:R:PrimStatePropertyT
  11915. 904.96 s [hedgehog] - Hedgehog.Internal.Property.D:R:TransformertPropertyTm
  11916. 904.97 s [hedgehog] Warning: Hedgehog.Internal.State: could not find link destinations for:
  11917. 904.97 s [hedgehog] - Hedgehog.Internal.State.Context
  11918. 905.00 s [hedgehog] Warning: Hedgehog: could not find link destinations for:
  11919. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:PrimStateGenT
  11920. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:TransformertGenTm
  11921. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseWriterT
  11922. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseWriterT0
  11923. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseStateT
  11924. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseStateT0
  11925. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseReaderT
  11926. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseExceptT
  11927. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseMaybeT
  11928. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseIdentityT
  11929. 905.00 s [hedgehog] - Hedgehog.Internal.Gen.D:R:GenBaseGenT
  11930. 905.00 s [hedgehog] - Hedgehog.Internal.Property.D:R:StTTestTa
  11931. 905.00 s [hedgehog] - Hedgehog.Internal.Property.D:R:PrimStateTestT
  11932. 905.00 s [hedgehog] - Hedgehog.Internal.Property.D:R:TransformertTestTm
  11933. 905.00 s [hedgehog] - Hedgehog.Internal.Property.D:R:PrimStatePropertyT
  11934. 905.00 s [hedgehog] - Hedgehog.Internal.Property.D:R:TransformertPropertyTm
  11935. 905.00 s [hedgehog] - Barbies.Generics.Constraints.P
  11936. 905.00 s [hedgehog] - Barbies.Generics.Constraints.GAllRec
  11937. 906.07 s [integer-logarithms] Phase: updateAutotoolsGnuConfigScriptsPhase
  11938. 906.08 s [integer-logarithms] Phase: configurePhase
  11939. 906.09 s [integer-logarithms] configureFlags: --verbose --prefix=/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc/share/doc/integer-logarithms-1.0.4 --with-gcc=gcc --package-db=/build/tmp.rxLKaW9j2u/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  11940. 906.10 s [integer-logarithms] Using Parsec parser
  11941. 906.10 s [integer-logarithms] Configuring integer-logarithms-1.0.4...
  11942. 906.57 s [integer-logarithms] Flags chosen: check-bounds=False, integer-gmp=True
  11943. 906.57 s [integer-logarithms] Dependency array >=0.5.3.0 && <0.6: using array-0.5.6.0
  11944. 906.57 s [integer-logarithms] Dependency base >=4.15 && <4.22: using base-4.19.0.0
  11945. 906.57 s [integer-logarithms] Dependency ghc-bignum >=1.0 && <1.4: using ghc-bignum-1.3
  11946. 906.57 s [integer-logarithms] Dependency ghc-prim <0.14: using ghc-prim-0.11.0
  11947. 906.57 s [integer-logarithms] Dependency QuickCheck >=2.14.1 && <2.16: using QuickCheck-2.14.3
  11948. 906.57 s [integer-logarithms] Dependency base: using base-4.19.0.0
  11949. 906.57 s [integer-logarithms] Dependency integer-logarithms: using integer-logarithms-1.0.4
  11950. 906.57 s [integer-logarithms] Dependency smallcheck >=1.2 && <1.3: using smallcheck-1.2.1.1
  11951. 906.57 s [integer-logarithms] Dependency tasty >=1.4 && <1.6: using tasty-1.5.3
  11952. 906.57 s [integer-logarithms] Dependency tasty-hunit >=0.10 && <0.11: using tasty-hunit-0.10.2
  11953. 906.57 s [integer-logarithms] Dependency tasty-quickcheck >=0.10 && <0.12: using tasty-quickcheck-0.11
  11954. 906.57 s [integer-logarithms] Dependency tasty-smallcheck >=0.8 && <0.9: using tasty-smallcheck-0.8.2
  11955. 907.57 s [integer-logarithms] Source component graph:
  11956. 907.57 s [integer-logarithms] component lib
  11957. 907.57 s [integer-logarithms] component test:spec dependency lib
  11958. 907.57 s [integer-logarithms] Configured component graph:
  11959. 907.57 s [integer-logarithms] component integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  11960. 907.57 s [integer-logarithms] include array-0.5.6.0-dc89
  11961. 907.57 s [integer-logarithms] include base-4.19.0.0-b960
  11962. 907.57 s [integer-logarithms] include ghc-bignum-1.3-5487
  11963. 907.57 s [integer-logarithms] include ghc-prim-0.11.0-a69e
  11964. 907.57 s [integer-logarithms] component integer-logarithms-1.0.4-2pEGdHlgDPS9e1U8YHMnQI-spec
  11965. 907.57 s [integer-logarithms] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  11966. 907.57 s [integer-logarithms] include base-4.19.0.0-b960
  11967. 907.57 s [integer-logarithms] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  11968. 907.57 s [integer-logarithms] include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  11969. 907.57 s [integer-logarithms] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  11970. 907.57 s [integer-logarithms] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  11971. 907.57 s [integer-logarithms] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  11972. 907.57 s [integer-logarithms] include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  11973. 907.57 s [integer-logarithms] Linked component graph:
  11974. 907.57 s [integer-logarithms] unit integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  11975. 907.57 s [integer-logarithms] include array-0.5.6.0-dc89
  11976. 907.57 s [integer-logarithms] include base-4.19.0.0-b960
  11977. 907.57 s [integer-logarithms] include ghc-bignum-1.3-5487
  11978. 907.57 s [integer-logarithms] include ghc-prim-0.11.0-a69e
  11979. 907.57 s [integer-logarithms] GHC.Integer.Logarithms.Compat=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:GHC.Integer.Logarithms.Compat,Math.NumberTheory.Logarithms=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:Math.NumberTheory.Logarithms,Math.NumberTheory.Powers.Integer=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:Math.NumberTheory.Powers.Integer,Math.NumberTheory.Powers.Natural=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:Math.NumberTheory.Powers.Natural
  11980. 907.57 s [integer-logarithms] unit integer-logarithms-1.0.4-2pEGdHlgDPS9e1U8YHMnQI-spec
  11981. 907.57 s [integer-logarithms] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  11982. 907.57 s [integer-logarithms] include base-4.19.0.0-b960
  11983. 907.57 s [integer-logarithms] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  11984. 907.57 s [integer-logarithms] include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  11985. 907.57 s [integer-logarithms] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  11986. 907.57 s [integer-logarithms] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  11987. 907.57 s [integer-logarithms] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  11988. 907.57 s [integer-logarithms] include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  11989. 907.57 s [integer-logarithms] Ready component graph:
  11990. 907.57 s [integer-logarithms] definite integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  11991. 907.57 s [integer-logarithms] depends array-0.5.6.0-dc89
  11992. 907.57 s [integer-logarithms] depends base-4.19.0.0-b960
  11993. 907.57 s [integer-logarithms] depends ghc-bignum-1.3-5487
  11994. 907.57 s [integer-logarithms] depends ghc-prim-0.11.0-a69e
  11995. 907.57 s [integer-logarithms] definite integer-logarithms-1.0.4-2pEGdHlgDPS9e1U8YHMnQI-spec
  11996. 907.57 s [integer-logarithms] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  11997. 907.57 s [integer-logarithms] depends base-4.19.0.0-b960
  11998. 907.57 s [integer-logarithms] depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  11999. 907.57 s [integer-logarithms] depends smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  12000. 907.57 s [integer-logarithms] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  12001. 907.57 s [integer-logarithms] depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  12002. 907.57 s [integer-logarithms] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  12003. 907.57 s [integer-logarithms] depends tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  12004. 907.57 s [integer-logarithms] Using Cabal-3.10.2.0 compiled by ghc-9.8
  12005. 907.57 s [integer-logarithms] Using compiler: ghc-9.8.1
  12006. 907.57 s [integer-logarithms] Using install prefix:
  12007. 907.57 s [integer-logarithms] /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
  12008. 907.58 s [integer-logarithms] Executables installed in:
  12009. 907.58 s [integer-logarithms] /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/bin
  12010. 907.58 s [integer-logarithms] Libraries installed in:
  12011. 907.58 s [integer-logarithms] /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  12012. 907.58 s [integer-logarithms] Dynamic Libraries installed in:
  12013. 907.58 s [integer-logarithms] /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  12014. 907.58 s [integer-logarithms] Private executables installed in:
  12015. 907.58 s [integer-logarithms] /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/libexec/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4
  12016. 907.58 s [integer-logarithms] Data files installed in:
  12017. 907.58 s [integer-logarithms] /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/share/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4
  12018. 907.58 s [integer-logarithms] Documentation installed in:
  12019. 907.58 s [integer-logarithms] /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc/share/doc/integer-logarithms-1.0.4
  12020. 907.58 s [integer-logarithms] Configuration files installed in:
  12021. 907.58 s [integer-logarithms] /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/etc
  12022. 907.58 s [integer-logarithms] No alex found
  12023. 907.58 s [integer-logarithms] Using ar found on system at:
  12024. 907.58 s [integer-logarithms] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  12025. 907.58 s [integer-logarithms] No c2hs found
  12026. 907.58 s [integer-logarithms] No cpphs found
  12027. 907.58 s [integer-logarithms] No doctest found
  12028. 907.58 s [integer-logarithms] Using gcc version 14.3.0 given by user at:
  12029. 907.58 s [integer-logarithms] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  12030. 907.58 s [integer-logarithms] Using ghc version 9.8.1 found on system at:
  12031. 907.58 s [integer-logarithms] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  12032. 907.58 s [integer-logarithms] Using ghc-pkg version 9.8.1 found on system at:
  12033. 907.58 s [integer-logarithms] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  12034. 907.58 s [integer-logarithms] No ghcjs found
  12035. 907.58 s [integer-logarithms] No ghcjs-pkg found
  12036. 907.58 s [integer-logarithms] No greencard found
  12037. 907.58 s [integer-logarithms] Using haddock version 2.30.0 found on system at:
  12038. 907.58 s [integer-logarithms] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  12039. 907.58 s [integer-logarithms] No happy found
  12040. 907.58 s [integer-logarithms] Using haskell-suite found on system at: haskell-suite-dummy-location
  12041. 907.58 s [integer-logarithms] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  12042. 907.58 s [integer-logarithms] No hmake found
  12043. 907.58 s [integer-logarithms] Using hpc version 0.69 found on system at:
  12044. 907.58 s [integer-logarithms] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  12045. 907.58 s [integer-logarithms] Using hsc2hs version 0.68.10 found on system at:
  12046. 907.58 s [integer-logarithms] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  12047. 907.58 s [integer-logarithms] Using hscolour version 1.25 found on system at:
  12048. 907.58 s [integer-logarithms] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  12049. 907.58 s [integer-logarithms] No jhc found
  12050. 907.58 s [integer-logarithms] Using ld found on system at:
  12051. 907.58 s [integer-logarithms] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  12052. 907.58 s [integer-logarithms] No pkg-config found
  12053. 907.58 s [integer-logarithms] Using runghc version 9.8.1 found on system at:
  12054. 907.58 s [integer-logarithms] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  12055. 907.58 s [integer-logarithms] Using strip version 2.44 found on system at:
  12056. 907.58 s [integer-logarithms] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  12057. 907.58 s [integer-logarithms] Using tar found on system at:
  12058. 907.58 s [integer-logarithms] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  12059. 907.58 s [integer-logarithms] No uhc found
  12060. 907.84 s [integer-logarithms] Phase: buildPhase
  12061. 907.92 s [integer-logarithms] Preprocessing library for integer-logarithms-1.0.4..
  12062. 907.92 s [integer-logarithms] Building library for integer-logarithms-1.0.4..
  12063. 908.09 s [integer-logarithms] [1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, dist/build/GHC/Integer/Logarithms/Compat.o, dist/build/GHC/Integer/Logarithms/Compat.dyn_o )
  12064. 908.20 s [integer-logarithms] [2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, dist/build/Math/NumberTheory/Logarithms.o, dist/build/Math/NumberTheory/Logarithms.dyn_o )
  12065. 909.56 s [integer-logarithms] [3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, dist/build/Math/NumberTheory/Powers/Integer.o, dist/build/Math/NumberTheory/Powers/Integer.dyn_o )
  12066. 909.72 s [integer-logarithms] [4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, dist/build/Math/NumberTheory/Powers/Natural.o, dist/build/Math/NumberTheory/Powers/Natural.dyn_o )
  12067. 909.93 s [integer-logarithms] [1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, dist/build/GHC/Integer/Logarithms/Compat.p_o )
  12068. 910.13 s [integer-logarithms] [2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, dist/build/Math/NumberTheory/Logarithms.p_o )
  12069. 911.16 s [integer-logarithms] [3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, dist/build/Math/NumberTheory/Powers/Integer.p_o )
  12070. 911.16 s [integer-logarithms] [4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, dist/build/Math/NumberTheory/Powers/Natural.p_o )
  12071. 911.97 s [hedgehog] Documentation created: dist/doc/html/hedgehog/,
  12072. 911.97 s [hedgehog] dist/doc/html/hedgehog/hedgehog.txt
  12073. 912.06 s [hedgehog] Preprocessing test suite 'test' for hedgehog-1.5..
  12074. 912.07 s [hedgehog] Phase: installPhase
  12075. 912.20 s [hedgehog] Installing library in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12076. 912.20 s [integer-logarithms] Preprocessing test suite 'spec' for integer-logarithms-1.0.4..
  12077. 912.21 s [integer-logarithms] Building test suite 'spec' for integer-logarithms-1.0.4..
  12078. 912.32 s [integer-logarithms] [1 of 4] Compiling Math.NumberTheory.TestUtils ( test-suite/Math/NumberTheory/TestUtils.hs, dist/build/spec/spec-tmp/Math/NumberTheory/TestUtils.o )
  12079. 912.90 s [integer-logarithms] [2 of 4] Compiling Orphans ( test-suite/Orphans.hs, dist/build/spec/spec-tmp/Orphans.o )
  12080. 912.90 s [integer-logarithms] [3 of 4] Compiling Math.NumberTheory.LogarithmsTests ( test-suite/Math/NumberTheory/LogarithmsTests.hs, dist/build/spec/spec-tmp/Math/NumberTheory/LogarithmsTests.o )
  12081. 913.59 s [integer-logarithms] [4 of 4] Compiling Main ( test-suite/Test.hs, dist/build/spec/spec-tmp/Main.o )
  12082. 913.59 s [hedgehog] Phase: fixupPhase
  12083. 913.64 s [hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
  12084. 913.64 s [hedgehog] shrinking /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHShedgehog-1.5-1B99eT9THHr5ZSpEl39tYK-ghc9.8.1.so
  12085. 913.68 s [hedgehog] checking for references to /build/ in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5...
  12086. 913.72 s [hedgehog] patching script interpreter paths in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
  12087. 913.73 s [hedgehog] stripping (with command strip and flags -S -p) in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib
  12088. 913.97 s [integer-logarithms] [5 of 5] Linking dist/build/spec/spec
  12089. 914.42 s [hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc
  12090. 914.44 s [hedgehog] checking for references to /build/ in /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc...
  12091. 914.47 s [hedgehog] patching script interpreter paths in /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc
  12092. 914.91 s [hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
  12093. 916.27 s [hedgehog:post-build] Pushing 2 paths (128 are already present) using zstd to cache sellout ⏳
  12094. 916.27 s [hedgehog:post-build]
  12095. 916.63 s [hedgehog:post-build] Pushing /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc (18.24 MiB)
  12096. 916.73 s [hedgehog:post-build] Pushing /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5 (23.40 MiB)
  12097. 918.63 s [hedgehog:post-build]
  12098. 918.63 s [hedgehog:post-build] All done.
  12099. 918.86 s [hedgehog:post-build] Uploading to the NixCI cache: /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
  12100. 919.48 s [hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12101. 919.57 s [hedgehog:post-build] copying 2 paths...
  12102. 919.57 s [hedgehog:post-build] copying path '/nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc' to 'https://cache.nix-ci.com'...
  12103. 922.28 s [hedgehog:post-build] copying path '/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5' to 'https://cache.nix-ci.com'...
  12104. 929.51 s [hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12105. 929.82 s [hedgehog:post-build] copying 1 paths...
  12106. 929.86 s [hedgehog:post-build] copying path '/nix/store/5458kfdgkysbzx3n0ag8abp4zhiihjw2-hedgehog-1.5.drv' to 'https://cache.nix-ci.com'...
  12107. 930.10 s Progress: 32 of 47 built (1 building)
  12108. 930.16 s Building /nix/store/349qlybgg6fyg3x7dx68044ggfs7wkyj-duoids-hedgehog-0.0.1.0.drv
  12109. 930.19 s Building /nix/store/jds9nixsl9b83kdbkg1qm2ab0zxcij8p-tasty-hedgehog-1.4.0.2.drv
  12110. 930.20 s [integer-logarithms] Phase: checkPhase
  12111. 930.20 s [integer-logarithms] Running 1 test suites...
  12112. 930.20 s [integer-logarithms] Test suite spec: RUNNING...
  12113. 930.20 s [integer-logarithms] All
  12114. 930.20 s [integer-logarithms] Logarithms
  12115. 930.20 s [integer-logarithms] integerLogBase
  12116. 930.20 s [integer-logarithms] smallcheck: OK
  12117. 930.20 s [integer-logarithms] 25 tests completed
  12118. 930.20 s [integer-logarithms] quickcheck: OK
  12119. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12120. 930.20 s [integer-logarithms] integerLog2
  12121. 930.20 s [integer-logarithms] smallcheck: OK
  12122. 930.20 s [integer-logarithms] 5 tests completed
  12123. 930.20 s [integer-logarithms] quickcheck: OK
  12124. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12125. 930.20 s [integer-logarithms] integerLog2Huge
  12126. 930.20 s [integer-logarithms] smallcheck: OK
  12127. 930.20 s [integer-logarithms] 5 tests completed
  12128. 930.20 s [integer-logarithms] quickcheck: OK
  12129. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12130. 930.20 s [integer-logarithms] integerLog10
  12131. 930.20 s [integer-logarithms] smallcheck: OK
  12132. 930.20 s [integer-logarithms] 5 tests completed
  12133. 930.20 s [integer-logarithms] quickcheck: OK
  12134. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12135. 930.20 s [integer-logarithms] naturalLogBase
  12136. 930.20 s [integer-logarithms] smallcheck: OK
  12137. 930.20 s [integer-logarithms] 25 tests completed
  12138. 930.20 s [integer-logarithms] quickcheck: OK
  12139. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12140. 930.20 s [integer-logarithms] naturalLog2
  12141. 930.20 s [integer-logarithms] smallcheck: OK
  12142. 930.20 s [integer-logarithms] 5 tests completed
  12143. 930.20 s [integer-logarithms] quickcheck: OK
  12144. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12145. 930.20 s [integer-logarithms] naturalLog2Huge
  12146. 930.20 s [integer-logarithms] smallcheck: OK
  12147. 930.20 s [integer-logarithms] 5 tests completed
  12148. 930.20 s [integer-logarithms] quickcheck: OK
  12149. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12150. 930.20 s [integer-logarithms] naturalLog10
  12151. 930.20 s [integer-logarithms] smallcheck: OK
  12152. 930.20 s [integer-logarithms] 5 tests completed
  12153. 930.20 s [integer-logarithms] quickcheck: OK
  12154. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12155. 930.20 s [integer-logarithms] intLog2
  12156. 930.20 s [integer-logarithms] smallcheck: OK
  12157. 930.20 s [integer-logarithms] 5 tests completed
  12158. 930.20 s [integer-logarithms] quickcheck: OK
  12159. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12160. 930.20 s [integer-logarithms] wordLog2
  12161. 930.20 s [integer-logarithms] smallcheck: OK
  12162. 930.20 s [integer-logarithms] 5 tests completed
  12163. 930.20 s [integer-logarithms] quickcheck: OK
  12164. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12165. 930.20 s [integer-logarithms] integerLogBase'
  12166. 930.20 s [integer-logarithms] smallcheck: OK
  12167. 930.20 s [integer-logarithms] 25 tests completed
  12168. 930.20 s [integer-logarithms] quickcheck: OK
  12169. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12170. 930.20 s [integer-logarithms] integerLogBase' with base > 32 and n >= base ^ 2
  12171. 930.20 s [integer-logarithms] smallcheck: OK
  12172. 930.20 s [integer-logarithms] 25 tests completed
  12173. 930.20 s [integer-logarithms] quickcheck: OK
  12174. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12175. 930.20 s [integer-logarithms] integerLog2'
  12176. 930.20 s [integer-logarithms] smallcheck: OK
  12177. 930.20 s [integer-logarithms] 5 tests completed
  12178. 930.20 s [integer-logarithms] quickcheck: OK
  12179. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12180. 930.20 s [integer-logarithms] integerLog10'
  12181. 930.20 s [integer-logarithms] smallcheck: OK
  12182. 930.20 s [integer-logarithms] 5 tests completed
  12183. 930.20 s [integer-logarithms] quickcheck: OK
  12184. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12185. 930.20 s [integer-logarithms] intLog2'
  12186. 930.20 s [integer-logarithms] smallcheck: OK
  12187. 930.20 s [integer-logarithms] 5 tests completed
  12188. 930.20 s [integer-logarithms] quickcheck: OK
  12189. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12190. 930.20 s [integer-logarithms] wordLog2'
  12191. 930.20 s [integer-logarithms] smallcheck: OK
  12192. 930.20 s [integer-logarithms] 5 tests completed
  12193. 930.20 s [integer-logarithms] quickcheck: OK
  12194. 930.20 s [integer-logarithms] +++ OK, passed 100 tests.
  12195. 930.20 s [integer-logarithms]
  12196. 930.20 s [integer-logarithms] All 32 tests passed (0.01s)
  12197. 930.20 s [integer-logarithms] Test suite spec: PASS
  12198. 930.20 s [integer-logarithms] Test suite logged to: dist/test/integer-logarithms-1.0.4-spec.log
  12199. 930.21 s [integer-logarithms] 1 of 1 test suites (1 of 1 test cases) passed.
  12200. 930.21 s [integer-logarithms] Phase: haddockPhase
  12201. 930.21 s [integer-logarithms] Preprocessing library for integer-logarithms-1.0.4..
  12202. 930.21 s [integer-logarithms] Running Haddock on library for integer-logarithms-1.0.4..
  12203. 930.21 s [integer-logarithms] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  12204. 930.21 s [integer-logarithms] [1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, nothing )
  12205. 930.21 s [integer-logarithms] [2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, nothing )
  12206. 930.21 s [integer-logarithms] [3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, nothing )
  12207. 930.21 s [integer-logarithms] [4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, nothing )
  12208. 930.21 s [integer-logarithms] Haddock coverage:
  12209. 930.21 s [integer-logarithms] 40% ( 2 / 5) in 'GHC.Integer.Logarithms.Compat'
  12210. 930.21 s [integer-logarithms] Missing documentation for:
  12211. 930.21 s [integer-logarithms] integerLogBase#
  12212. 930.21 s [integer-logarithms] integerLog2#
  12213. 930.21 s [integer-logarithms] wordLog2#
  12214. 930.21 s [integer-logarithms] Warning: 'naturalLog2' is ambiguous. It is defined
  12215. 930.21 s [integer-logarithms] * in ‘GHC.Num.Natural’
  12216. 930.21 s [integer-logarithms] * at src/Math/NumberTheory/Logarithms.hs:109:1
  12217. 930.21 s [integer-logarithms] You may be able to disambiguate the identifier by qualifying it or
  12218. 930.21 s [integer-logarithms] by specifying the type/value namespace explicitly.
  12219. 930.21 s [integer-logarithms] Defaulting to the one defined at src/Math/NumberTheory/Logarithms.hs:109:1
  12220. 930.21 s [integer-logarithms] Warning: 'naturalLogBase' is ambiguous. It is defined
  12221. 930.21 s [integer-logarithms] * in ‘GHC.Num.Natural’
  12222. 930.21 s [integer-logarithms] * at src/Math/NumberTheory/Logarithms.hs:99:1
  12223. 930.21 s [integer-logarithms] You may be able to disambiguate the identifier by qualifying it or
  12224. 930.21 s [integer-logarithms] by specifying the type/value namespace explicitly.
  12225. 930.21 s [integer-logarithms] Defaulting to the one defined at src/Math/NumberTheory/Logarithms.hs:99:1
  12226. 930.21 s [integer-logarithms] 100% ( 17 / 17) in 'Math.NumberTheory.Logarithms'
  12227. 930.21 s [integer-logarithms] 100% ( 3 / 3) in 'Math.NumberTheory.Powers.Integer'
  12228. 930.21 s [integer-logarithms] 100% ( 3 / 3) in 'Math.NumberTheory.Powers.Natural'
  12229. 930.21 s [integer-logarithms] Documentation created: dist/doc/html/integer-logarithms/,
  12230. 930.21 s [integer-logarithms] dist/doc/html/integer-logarithms/integer-logarithms.txt
  12231. 930.21 s [integer-logarithms] Preprocessing test suite 'spec' for integer-logarithms-1.0.4..
  12232. 930.21 s [integer-logarithms] Phase: installPhase
  12233. 930.21 s [integer-logarithms] Installing library in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  12234. 930.21 s [integer-logarithms] Phase: fixupPhase
  12235. 930.21 s [integer-logarithms] shrinking RPATHs of ELF executables and libraries in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
  12236. 930.21 s [integer-logarithms] shrinking /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSinteger-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH-ghc9.8.1.so
  12237. 930.21 s [integer-logarithms] checking for references to /build/ in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4...
  12238. 930.21 s [integer-logarithms] patching script interpreter paths in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
  12239. 930.21 s [integer-logarithms] stripping (with command strip and flags -S -p) in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib
  12240. 930.21 s [integer-logarithms] shrinking RPATHs of ELF executables and libraries in /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc
  12241. 930.21 s [integer-logarithms] checking for references to /build/ in /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc...
  12242. 930.21 s [integer-logarithms] patching script interpreter paths in /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc
  12243. 930.28 s [integer-logarithms:post-build] Uploading to cachix cache "sellout": /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
  12244. 930.83 s [integer-logarithms:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  12245. 930.83 s [integer-logarithms:post-build]
  12246. 931.21 s [integer-logarithms:post-build] Pushing /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc (354.77 KiB)
  12247. 931.28 s [integer-logarithms:post-build] Pushing /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4 (900.41 KiB)
  12248. 932.30 s [integer-logarithms:post-build]
  12249. 932.30 s [integer-logarithms:post-build] All done.
  12250. 932.49 s [integer-logarithms:post-build] Uploading to the NixCI cache: /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
  12251. 932.92 s [integer-logarithms:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12252. 933.18 s [integer-logarithms:post-build] copying 2 paths...
  12253. 933.18 s [integer-logarithms:post-build] copying path '/nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc' to 'https://cache.nix-ci.com'...
  12254. 933.53 s [integer-logarithms:post-build] copying path '/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4' to 'https://cache.nix-ci.com'...
  12255. 934.63 s [integer-logarithms:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12256. 934.99 s [integer-logarithms:post-build] copying 1 paths...
  12257. 935.08 s [integer-logarithms:post-build] copying path '/nix/store/w3k022qgh9jnjzrax7zxd61gdyj6c7sc-integer-logarithms-1.0.4.drv' to 'https://cache.nix-ci.com'...
  12258. 935.44 s Progress: 33 of 47 built (2 building)
  12259. 935.51 s Building /nix/store/kmwyd33dsb5b986dg2s1ywr8cchd9p33-scientific-0.3.8.0.drv
  12260. 935.51 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  12261. 935.51 s [duoids-hedgehog] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  12262. 935.51 s [duoids-hedgehog] Phase: unpackPhase
  12263. 935.51 s [duoids-hedgehog] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./hedgehog
  12264. 935.51 s [duoids-hedgehog] source root is hedgehog
  12265. 935.51 s [duoids-hedgehog] Phase: patchPhase
  12266. 935.51 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  12267. 935.51 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.741IFhG65Z/setup-package.conf.d -threaded
  12268. 935.51 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.741IFhG65Z/Main.o )
  12269. 935.51 s [duoids-hedgehog] [2 of 2] Linking Setup
  12270. 935.51 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  12271. 935.51 s [duoids-hedgehog] Phase: configurePhase
  12272. 935.51 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.741IFhG65Z/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
  12273. 935.51 s [duoids-hedgehog] Using Parsec parser
  12274. 935.51 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  12275. 935.51 s [duoids-hedgehog] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  12276. 935.51 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  12277. 935.51 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.19.0.0
  12278. 935.51 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  12279. 935.51 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  12280. 935.51 s [duoids-hedgehog] hedgehog-1.5
  12281. 935.51 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  12282. 935.51 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.19.0.0
  12283. 935.51 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  12284. 935.51 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  12285. 935.51 s [duoids-hedgehog] hedgehog-1.5
  12286. 935.51 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  12287. 935.51 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.19.0.0
  12288. 935.51 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  12289. 935.51 s [duoids-hedgehog] <0.25: using doctest-0.22.6
  12290. 935.51 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  12291. 935.51 s [duoids-hedgehog] Source component graph:
  12292. 935.51 s [duoids-hedgehog] component lib
  12293. 935.51 s [duoids-hedgehog] component test:doctests dependency lib
  12294. 935.51 s [duoids-hedgehog] component test:laws dependency lib
  12295. 935.51 s [duoids-hedgehog] Configured component graph:
  12296. 935.51 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12297. 935.51 s [duoids-hedgehog] include base-4.19.0.0-b960
  12298. 935.51 s [duoids-hedgehog] include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  12299. 935.51 s [duoids-hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12300. 935.51 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-GPzU4X6nvkV28mgPo0dGEE-doctests
  12301. 935.51 s [duoids-hedgehog] include base-4.19.0.0-b960
  12302. 935.51 s [duoids-hedgehog] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  12303. 935.51 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12304. 935.51 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-EOfMK9uP5vVLJ7PYKxu4gL-laws
  12305. 935.51 s [duoids-hedgehog] include base-4.19.0.0-b960
  12306. 935.51 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12307. 935.51 s [duoids-hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12308. 935.51 s [duoids-hedgehog] Linked component graph:
  12309. 935.51 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12310. 935.51 s [duoids-hedgehog] include base-4.19.0.0-b960
  12311. 935.51 s [duoids-hedgehog] include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  12312. 935.51 s [tasty-hedgehog] Phase: setupCompilerEnvironmentPhase
  12313. 935.51 s [tasty-hedgehog] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  12314. 935.51 s [tasty-hedgehog] Phase: unpackPhase
  12315. 935.51 s [tasty-hedgehog] unpacking source archive /nix/store/c7lip15ss1zm2zsp6i971ky2zjla3sm3-tasty-hedgehog-1.4.0.2.tar.gz
  12316. 935.51 s [tasty-hedgehog] source root is tasty-hedgehog-1.4.0.2
  12317. 935.51 s [tasty-hedgehog] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "tasty-hedgehog-1.4.0.2/test/Main.hs"
  12318. 935.51 s [tasty-hedgehog] Phase: patchPhase
  12319. 935.51 s [tasty-hedgehog] Replace Cabal file with edited version from mirror://hackage/tasty-hedgehog-1.4.0.2/revision/6.cabal.
  12320. 935.51 s [tasty-hedgehog] Phase: compileBuildDriverPhase
  12321. 935.51 s [tasty-hedgehog] setupCompileFlags: -package-db=/build/tmp.ERLpd1DNaP/setup-package.conf.d -threaded
  12322. 935.51 s [tasty-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ERLpd1DNaP/Main.o )
  12323. 935.51 s [tasty-hedgehog] [2 of 2] Linking Setup
  12324. 935.51 s [tasty-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  12325. 935.51 s [tasty-hedgehog] Phase: configurePhase
  12326. 935.51 s [tasty-hedgehog] configureFlags: --verbose --prefix=/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc/share/doc/tasty-hedgehog-1.4.0.2 --with-gcc=gcc --package-db=/build/tmp.ERLpd1DNaP/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 --disable-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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  12327. 935.51 s [tasty-hedgehog] Using Parsec parser
  12328. 935.51 s [tasty-hedgehog] Configuring tasty-hedgehog-1.4.0.2...
  12329. 935.51 s [tasty-hedgehog] Dependency base >=4.8 && <4.22: using base-4.19.0.0
  12330. 935.51 s [tasty-hedgehog] Dependency hedgehog >=1.4 && <1.6: using hedgehog-1.5
  12331. 935.51 s [tasty-hedgehog] Dependency tagged >=0.8 && <0.9: using tagged-0.8.8
  12332. 935.51 s [tasty-hedgehog] Dependency tasty >=0.11 && <1.6: using tasty-1.5.3
  12333. 935.51 s [tasty-hedgehog] Source component graph: component lib
  12334. 935.51 s [tasty-hedgehog] Configured component graph:
  12335. 935.51 s [tasty-hedgehog] component tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  12336. 935.51 s [tasty-hedgehog] include base-4.19.0.0-b960
  12337. 935.51 s [tasty-hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12338. 935.51 s [tasty-hedgehog] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  12339. 935.51 s [tasty-hedgehog] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  12340. 935.51 s [tasty-hedgehog] Linked component graph:
  12341. 935.51 s [tasty-hedgehog] unit tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  12342. 935.51 s [tasty-hedgehog] include base-4.19.0.0-b960
  12343. 935.51 s [tasty-hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12344. 935.51 s [tasty-hedgehog] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  12345. 935.51 s [tasty-hedgehog] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  12346. 935.51 s [tasty-hedgehog] Test.Tasty.Hedgehog=tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t:Test.Tasty.Hedgehog
  12347. 935.52 s [tasty-hedgehog] Ready component graph:
  12348. 935.52 s [tasty-hedgehog] definite tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  12349. 935.52 s [tasty-hedgehog] depends base-4.19.0.0-b960
  12350. 935.52 s [tasty-hedgehog] depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12351. 935.52 s [tasty-hedgehog] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  12352. 935.52 s [tasty-hedgehog] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  12353. 935.52 s [tasty-hedgehog] Using Cabal-3.10.2.0 compiled by ghc-9.8
  12354. 935.52 s [tasty-hedgehog] Using compiler: ghc-9.8.1
  12355. 935.52 s [tasty-hedgehog] Using install prefix:
  12356. 935.52 s [tasty-hedgehog] /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
  12357. 935.52 s [tasty-hedgehog] Executables installed in:
  12358. 935.52 s [tasty-hedgehog] /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/bin
  12359. 935.52 s [tasty-hedgehog] Libraries installed in:
  12360. 935.52 s [tasty-hedgehog] /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  12361. 935.52 s [tasty-hedgehog] Dynamic Libraries installed in:
  12362. 935.52 s [tasty-hedgehog] /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  12363. 935.52 s [duoids-hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12364. 935.52 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR:Test.Duoidal
  12365. 935.52 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-GPzU4X6nvkV28mgPo0dGEE-doctests
  12366. 935.52 s [duoids-hedgehog] include base-4.19.0.0-b960
  12367. 935.52 s [duoids-hedgehog] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  12368. 935.52 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12369. 935.52 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-EOfMK9uP5vVLJ7PYKxu4gL-laws
  12370. 935.52 s [duoids-hedgehog] include base-4.19.0.0-b960
  12371. 935.52 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12372. 935.52 s [duoids-hedgehog] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12373. 935.52 s [duoids-hedgehog] Ready component graph:
  12374. 935.52 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12375. 935.52 s [duoids-hedgehog] depends base-4.19.0.0-b960
  12376. 935.52 s [duoids-hedgehog] depends duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  12377. 935.52 s [duoids-hedgehog] depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12378. 935.52 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-EOfMK9uP5vVLJ7PYKxu4gL-laws
  12379. 935.52 s [duoids-hedgehog] depends base-4.19.0.0-b960
  12380. 935.52 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12381. 935.52 s [duoids-hedgehog] depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  12382. 935.52 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-GPzU4X6nvkV28mgPo0dGEE-doctests
  12383. 935.52 s [duoids-hedgehog] depends base-4.19.0.0-b960
  12384. 935.52 s [duoids-hedgehog] depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  12385. 935.52 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12386. 935.52 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.8
  12387. 935.52 s [duoids-hedgehog] Using compiler: ghc-9.8.1
  12388. 935.52 s [duoids-hedgehog] Using install prefix:
  12389. 935.52 s [duoids-hedgehog] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0
  12390. 935.52 s [duoids-hedgehog] Executables installed in:
  12391. 935.52 s [duoids-hedgehog] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/bin
  12392. 935.52 s [duoids-hedgehog] Libraries installed in:
  12393. 935.52 s [duoids-hedgehog] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  12394. 935.52 s [duoids-hedgehog] Dynamic Libraries installed in:
  12395. 935.52 s [duoids-hedgehog] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
  12396. 935.52 s [duoids-hedgehog] Private executables installed in:
  12397. 935.52 s [duoids-hedgehog] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0
  12398. 935.52 s [duoids-hedgehog] Data files installed in:
  12399. 935.52 s [duoids-hedgehog] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0
  12400. 935.52 s [duoids-hedgehog] Documentation installed in:
  12401. 935.52 s [duoids-hedgehog] /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  12402. 935.52 s [duoids-hedgehog] Configuration files installed in:
  12403. 935.52 s [duoids-hedgehog] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/etc
  12404. 935.52 s [duoids-hedgehog] No alex found
  12405. 935.52 s [duoids-hedgehog] Using ar found on system at:
  12406. 935.52 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  12407. 935.52 s [duoids-hedgehog] No c2hs found
  12408. 935.52 s [duoids-hedgehog] No cpphs found
  12409. 935.52 s [duoids-hedgehog] Using doctest version 0.22.6 found on system at:
  12410. 935.52 s [duoids-hedgehog] /nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
  12411. 935.52 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  12412. 935.52 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  12413. 935.52 s [duoids-hedgehog] Using ghc version 9.8.1 found on system at:
  12414. 935.52 s [duoids-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  12415. 935.52 s [duoids-hedgehog] Using ghc-pkg version 9.8.1 found on system at:
  12416. 935.52 s [duoids-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  12417. 935.52 s [duoids-hedgehog] No ghcjs found
  12418. 935.52 s [duoids-hedgehog] No ghcjs-pkg found
  12419. 935.52 s [duoids-hedgehog] No greencard found
  12420. 935.52 s [duoids-hedgehog] Using haddock version 2.30.0 found on system at:
  12421. 935.52 s [duoids-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  12422. 935.52 s [duoids-hedgehog] No happy found
  12423. 935.52 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  12424. 935.52 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  12425. 935.52 s [duoids-hedgehog] No hmake found
  12426. 935.52 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  12427. 935.52 s [duoids-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  12428. 935.52 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  12429. 935.52 s [duoids-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  12430. 935.52 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  12431. 935.52 s [duoids-hedgehog] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  12432. 935.52 s [duoids-hedgehog] No jhc found
  12433. 935.52 s [duoids-hedgehog] Using ld found on system at:
  12434. 935.52 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  12435. 935.52 s [duoids-hedgehog] No pkg-config found
  12436. 935.52 s [duoids-hedgehog] Using runghc version 9.8.1 found on system at:
  12437. 935.52 s [duoids-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  12438. 935.52 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  12439. 935.52 s [tasty-hedgehog] Private executables installed in:
  12440. 935.52 s [tasty-hedgehog] /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/libexec/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2
  12441. 935.52 s [tasty-hedgehog] Data files installed in:
  12442. 935.52 s [tasty-hedgehog] /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/share/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2
  12443. 935.52 s [tasty-hedgehog] Documentation installed in:
  12444. 935.52 s [tasty-hedgehog] /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc/share/doc/tasty-hedgehog-1.4.0.2
  12445. 935.52 s [tasty-hedgehog] Configuration files installed in:
  12446. 935.52 s [tasty-hedgehog] /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/etc
  12447. 935.52 s [tasty-hedgehog] No alex found
  12448. 935.52 s [tasty-hedgehog] Using ar found on system at:
  12449. 935.52 s [tasty-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  12450. 935.52 s [tasty-hedgehog] No c2hs found
  12451. 935.52 s [tasty-hedgehog] No cpphs found
  12452. 935.52 s [tasty-hedgehog] No doctest found
  12453. 935.52 s [tasty-hedgehog] Using gcc version 14.3.0 given by user at:
  12454. 935.52 s [tasty-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  12455. 935.52 s [tasty-hedgehog] Using ghc version 9.8.1 found on system at:
  12456. 935.52 s [tasty-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  12457. 935.52 s [tasty-hedgehog] Using ghc-pkg version 9.8.1 found on system at:
  12458. 935.52 s [tasty-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  12459. 935.52 s [tasty-hedgehog] No ghcjs found
  12460. 935.52 s [tasty-hedgehog] No ghcjs-pkg found
  12461. 935.52 s [tasty-hedgehog] No greencard found
  12462. 935.52 s [tasty-hedgehog] Using haddock version 2.30.0 found on system at:
  12463. 935.52 s [tasty-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  12464. 935.52 s [tasty-hedgehog] No happy found
  12465. 935.52 s [tasty-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  12466. 935.52 s [tasty-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  12467. 935.52 s [tasty-hedgehog] No hmake found
  12468. 935.52 s [tasty-hedgehog] Using hpc version 0.69 found on system at:
  12469. 935.52 s [tasty-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  12470. 935.52 s [tasty-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  12471. 935.52 s [tasty-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  12472. 935.52 s [tasty-hedgehog] Using hscolour version 1.25 found on system at:
  12473. 935.52 s [tasty-hedgehog] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  12474. 935.52 s [tasty-hedgehog] No jhc found
  12475. 935.52 s [tasty-hedgehog] Using ld found on system at:
  12476. 935.52 s [tasty-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  12477. 935.52 s [tasty-hedgehog] No pkg-config found
  12478. 935.52 s [tasty-hedgehog] Using runghc version 9.8.1 found on system at:
  12479. 935.52 s [tasty-hedgehog] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  12480. 935.52 s [tasty-hedgehog] Using strip version 2.44 found on system at:
  12481. 935.52 s [tasty-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  12482. 935.52 s [tasty-hedgehog] Using tar found on system at:
  12483. 935.52 s [tasty-hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  12484. 935.52 s [tasty-hedgehog] No uhc found
  12485. 935.52 s [tasty-hedgehog] Phase: buildPhase
  12486. 935.52 s [tasty-hedgehog] Preprocessing library for tasty-hedgehog-1.4.0.2..
  12487. 935.52 s [tasty-hedgehog] Building library for tasty-hedgehog-1.4.0.2..
  12488. 935.52 s [tasty-hedgehog] [1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, dist/build/Test/Tasty/Hedgehog.o, dist/build/Test/Tasty/Hedgehog.dyn_o )
  12489. 935.52 s [tasty-hedgehog] [1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, dist/build/Test/Tasty/Hedgehog.p_o )
  12490. 935.52 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  12491. 935.52 s [duoids-hedgehog] Using tar found on system at:
  12492. 935.52 s [duoids-hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  12493. 935.52 s [duoids-hedgehog] No uhc found
  12494. 935.52 s [duoids-hedgehog] Phase: buildPhase
  12495. 935.52 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  12496. 935.52 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  12497. 935.52 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  12498. 935.52 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  12499. 935.52 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  12500. 935.61 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  12501. 935.63 s [scientific] Phase: setupCompilerEnvironmentPhase
  12502. 935.64 s [scientific] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  12503. 935.96 s [scientific] Phase: unpackPhase
  12504. 935.97 s [scientific] unpacking source archive /nix/store/8wdrn8qwx87rmmykvk7is30zx4xswld9-scientific-0.3.8.0.tar.gz
  12505. 935.99 s [scientific] source root is scientific-0.3.8.0
  12506. 936.01 s [scientific] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "scientific-0.3.8.0/test/test.hs"
  12507. 936.02 s [scientific] Phase: patchPhase
  12508. 936.04 s [scientific] Replace Cabal file with edited version from mirror://hackage/scientific-0.3.8.0/revision/2.cabal.
  12509. 936.05 s [scientific] Phase: compileBuildDriverPhase
  12510. 936.06 s [scientific] setupCompileFlags: -package-db=/build/tmp.14sAC0e5oJ/setup-package.conf.d -threaded
  12511. 936.14 s [scientific] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.14sAC0e5oJ/Main.o )
  12512. 936.23 s [scientific] [2 of 2] Linking Setup
  12513. 937.16 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  12514. 937.16 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  12515. 937.26 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  12516. 937.81 s [tasty-hedgehog] Phase: haddockPhase
  12517. 937.90 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  12518. 937.91 s [scientific] Phase: updateAutotoolsGnuConfigScriptsPhase
  12519. 937.95 s [scientific] Phase: configurePhase
  12520. 937.96 s [scientific] configureFlags: --verbose --prefix=/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc/share/doc/scientific-0.3.8.0 --with-gcc=gcc --package-db=/build/tmp.14sAC0e5oJ/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  12521. 937.99 s [scientific] Using Parsec parser
  12522. 937.99 s [scientific] Configuring scientific-0.3.8.0...
  12523. 938.02 s [tasty-hedgehog] Preprocessing library for tasty-hedgehog-1.4.0.2..
  12524. 938.02 s [tasty-hedgehog] Running Haddock on library for tasty-hedgehog-1.4.0.2..
  12525. 938.12 s [tasty-hedgehog] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  12526. 938.33 s [tasty-hedgehog] [1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, nothing )
  12527. 938.51 s [scientific] Flags chosen: integer-simple=False
  12528. 938.51 s [scientific] Dependency base >=4.15 && <4.22: using base-4.19.0.0
  12529. 938.51 s [scientific] Dependency binary >=0.8.6.0 && <0.9: using binary-0.8.9.1
  12530. 938.51 s [scientific] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
  12531. 938.51 s [scientific] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
  12532. 938.51 s [scientific] Dependency deepseq >=1.4.4.0 && <1.6: using deepseq-1.5.0.0
  12533. 938.51 s [scientific] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  12534. 938.51 s [scientific] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  12535. 938.51 s [scientific] integer-logarithms-1.0.4
  12536. 938.51 s [scientific] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  12537. 938.51 s [scientific] Dependency template-haskell >=2.14.0.0 && <2.24: using
  12538. 938.51 s [scientific] template-haskell-2.21.0.0
  12539. 938.51 s [scientific] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
  12540. 938.51 s [scientific] Dependency QuickCheck >=2.14.2: using QuickCheck-2.14.3
  12541. 938.51 s [scientific] Dependency base: using base-4.19.0.0
  12542. 938.51 s [scientific] Dependency binary: using binary-0.8.9.1
  12543. 938.51 s [scientific] Dependency bytestring: using bytestring-0.12.0.2
  12544. 938.51 s [scientific] Dependency scientific: using scientific-0.3.8.0
  12545. 938.51 s [scientific] Dependency smallcheck >=1.0: using smallcheck-1.2.1.1
  12546. 938.51 s [scientific] Dependency tasty >=1.4.0.1: using tasty-1.5.3
  12547. 938.51 s [scientific] Dependency tasty-hunit >=0.8: using tasty-hunit-0.10.2
  12548. 938.51 s [scientific] Dependency tasty-quickcheck >=0.8: using tasty-quickcheck-0.11
  12549. 938.51 s [scientific] Dependency tasty-smallcheck >=0.2: using tasty-smallcheck-0.8.2
  12550. 938.51 s [scientific] Dependency text: using text-2.1
  12551. 938.64 s [tasty-hedgehog] Haddock coverage:
  12552. 938.64 s [tasty-hedgehog] Warning: 'Property' is ambiguous. It is defined
  12553. 938.64 s [tasty-hedgehog] * in ‘Hedgehog.Internal.Property’
  12554. 938.64 s [tasty-hedgehog] * in ‘Hedgehog.Internal.Property’
  12555. 938.64 s [tasty-hedgehog] You may be able to disambiguate the identifier by qualifying it or
  12556. 938.64 s [tasty-hedgehog] by specifying the type/value namespace explicitly.
  12557. 938.64 s [tasty-hedgehog] Defaulting to the one defined in ‘Hedgehog.Internal.Property’
  12558. 938.64 s [tasty-hedgehog] Warning: 'Group' is ambiguous. It is defined
  12559. 938.64 s [tasty-hedgehog] * in ‘Hedgehog.Internal.Property’
  12560. 938.64 s [tasty-hedgehog] * in ‘Hedgehog.Internal.Property’
  12561. 938.64 s [tasty-hedgehog] You may be able to disambiguate the identifier by qualifying it or
  12562. 938.64 s [tasty-hedgehog] by specifying the type/value namespace explicitly.
  12563. 938.64 s [tasty-hedgehog] Defaulting to the one defined in ‘Hedgehog.Internal.Property’
  12564. 938.64 s [tasty-hedgehog] 100% ( 11 / 11) in 'Test.Tasty.Hedgehog'
  12565. 938.86 s [scientific] Source component graph:
  12566. 938.86 s [scientific] component lib
  12567. 938.86 s [scientific] component test:test-scientific dependency lib
  12568. 938.86 s [scientific] Configured component graph:
  12569. 938.86 s [scientific] component scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  12570. 938.86 s [scientific] include base-4.19.0.0-b960
  12571. 938.86 s [scientific] include binary-0.8.9.1-0e3e
  12572. 938.86 s [scientific] include bytestring-0.12.0.2-4690
  12573. 938.86 s [scientific] include containers-0.6.8-4775
  12574. 938.87 s [scientific] include deepseq-1.5.0.0-412f
  12575. 938.87 s [scientific] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  12576. 938.87 s [scientific] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  12577. 938.87 s [scientific] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  12578. 938.87 s [scientific] include template-haskell-2.21.0.0-8831
  12579. 938.87 s [scientific] include text-2.1-c36a
  12580. 938.87 s [scientific] component scientific-0.3.8.0-ERgFuAaF9w6JlyRZv4Gsn-test-scientific
  12581. 938.87 s [scientific] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  12582. 938.87 s [scientific] include base-4.19.0.0-b960
  12583. 938.87 s [scientific] include binary-0.8.9.1-0e3e
  12584. 938.87 s [scientific] include bytestring-0.12.0.2-4690
  12585. 938.87 s [scientific] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  12586. 938.87 s [scientific] include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  12587. 938.87 s [scientific] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  12588. 938.87 s [scientific] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  12589. 938.87 s [scientific] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  12590. 938.87 s [scientific] include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  12591. 938.87 s [scientific] include text-2.1-c36a
  12592. 938.87 s [scientific] Linked component graph:
  12593. 938.87 s [scientific] unit scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  12594. 938.87 s [scientific] include base-4.19.0.0-b960
  12595. 938.87 s [scientific] include binary-0.8.9.1-0e3e
  12596. 938.87 s [scientific] include bytestring-0.12.0.2-4690
  12597. 938.87 s [scientific] include containers-0.6.8-4775
  12598. 938.87 s [scientific] include deepseq-1.5.0.0-412f
  12599. 938.87 s [scientific] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  12600. 938.87 s [scientific] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  12601. 938.87 s [scientific] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  12602. 938.87 s [scientific] include template-haskell-2.21.0.0-8831
  12603. 938.87 s [scientific] include text-2.1-c36a
  12604. 938.87 s [scientific] Data.ByteString.Builder.Scientific=scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X:Data.ByteString.Builder.Scientific,Data.Scientific=scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X:Data.Scientific,Data.Text.Lazy.Builder.Scientific=scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X:Data.Text.Lazy.Builder.Scientific
  12605. 938.87 s [scientific] unit scientific-0.3.8.0-ERgFuAaF9w6JlyRZv4Gsn-test-scientific
  12606. 938.87 s [scientific] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  12607. 938.87 s [scientific] include base-4.19.0.0-b960
  12608. 938.87 s [scientific] include binary-0.8.9.1-0e3e
  12609. 938.87 s [scientific] include bytestring-0.12.0.2-4690
  12610. 938.87 s [scientific] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  12611. 938.87 s [scientific] include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  12612. 938.87 s [scientific] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  12613. 938.87 s [scientific] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  12614. 938.87 s [scientific] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  12615. 938.87 s [scientific] include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  12616. 938.87 s [scientific] include text-2.1-c36a
  12617. 938.87 s [scientific] Ready component graph:
  12618. 938.87 s [scientific] definite scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  12619. 938.87 s [scientific] depends base-4.19.0.0-b960
  12620. 938.87 s [scientific] depends binary-0.8.9.1-0e3e
  12621. 938.87 s [scientific] depends bytestring-0.12.0.2-4690
  12622. 938.87 s [scientific] depends containers-0.6.8-4775
  12623. 938.87 s [scientific] depends deepseq-1.5.0.0-412f
  12624. 938.87 s [scientific] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  12625. 938.87 s [scientific] depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  12626. 938.87 s [scientific] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  12627. 938.87 s [scientific] depends template-haskell-2.21.0.0-8831
  12628. 938.87 s [scientific] depends text-2.1-c36a
  12629. 938.87 s [scientific] definite scientific-0.3.8.0-ERgFuAaF9w6JlyRZv4Gsn-test-scientific
  12630. 938.87 s [scientific] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  12631. 938.87 s [scientific] depends base-4.19.0.0-b960
  12632. 938.87 s [scientific] depends binary-0.8.9.1-0e3e
  12633. 938.87 s [scientific] depends bytestring-0.12.0.2-4690
  12634. 938.87 s [scientific] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  12635. 938.87 s [scientific] depends smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
  12636. 938.87 s [scientific] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  12637. 938.87 s [scientific] depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  12638. 938.87 s [scientific] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  12639. 938.87 s [scientific] depends tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
  12640. 938.87 s [scientific] depends text-2.1-c36a
  12641. 938.87 s [scientific] Using Cabal-3.10.2.0 compiled by ghc-9.8
  12642. 938.87 s [scientific] Using compiler: ghc-9.8.1
  12643. 938.87 s [scientific] Using install prefix:
  12644. 938.87 s [scientific] /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
  12645. 938.87 s [scientific] Executables installed in:
  12646. 938.87 s [scientific] /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/bin
  12647. 938.87 s [scientific] Libraries installed in:
  12648. 938.87 s [scientific] /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  12649. 938.87 s [scientific] Dynamic Libraries installed in:
  12650. 938.87 s [scientific] /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  12651. 938.87 s [scientific] Private executables installed in:
  12652. 938.87 s [scientific] /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/libexec/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0
  12653. 938.87 s [scientific] Data files installed in:
  12654. 938.87 s [scientific] /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/share/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0
  12655. 938.87 s [scientific] Documentation installed in:
  12656. 938.87 s [scientific] /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc/share/doc/scientific-0.3.8.0
  12657. 938.87 s [scientific] Configuration files installed in:
  12658. 938.87 s [scientific] /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/etc
  12659. 938.87 s [scientific] No alex found
  12660. 938.87 s [scientific] Using ar found on system at:
  12661. 938.87 s [scientific] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  12662. 938.87 s [scientific] No c2hs found
  12663. 938.87 s [scientific] No cpphs found
  12664. 938.87 s [scientific] No doctest found
  12665. 938.87 s [scientific] Using gcc version 14.3.0 given by user at:
  12666. 938.87 s [scientific] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  12667. 938.87 s [scientific] Using ghc version 9.8.1 found on system at:
  12668. 938.87 s [scientific] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  12669. 938.87 s [scientific] Using ghc-pkg version 9.8.1 found on system at:
  12670. 938.87 s [scientific] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  12671. 938.87 s [scientific] No ghcjs found
  12672. 938.87 s [scientific] No ghcjs-pkg found
  12673. 938.87 s [scientific] No greencard found
  12674. 938.87 s [scientific] Using haddock version 2.30.0 found on system at:
  12675. 938.87 s [scientific] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  12676. 938.87 s [scientific] No happy found
  12677. 938.87 s [scientific] Using haskell-suite found on system at: haskell-suite-dummy-location
  12678. 938.87 s [scientific] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  12679. 938.87 s [scientific] No hmake found
  12680. 938.87 s [scientific] Using hpc version 0.69 found on system at:
  12681. 938.87 s [scientific] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  12682. 938.87 s [scientific] Using hsc2hs version 0.68.10 found on system at:
  12683. 938.87 s [scientific] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  12684. 938.87 s [scientific] Using hscolour version 1.25 found on system at:
  12685. 938.87 s [scientific] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  12686. 938.87 s [scientific] No jhc found
  12687. 938.87 s [scientific] Using ld found on system at:
  12688. 938.87 s [scientific] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  12689. 938.87 s [scientific] No pkg-config found
  12690. 938.87 s [scientific] Using runghc version 9.8.1 found on system at:
  12691. 938.87 s [scientific] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  12692. 938.87 s [scientific] Using strip version 2.44 found on system at:
  12693. 938.87 s [scientific] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  12694. 938.87 s [scientific] Using tar found on system at:
  12695. 938.87 s [scientific] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  12696. 938.87 s [scientific] No uhc found
  12697. 939.15 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  12698. 939.15 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  12699. 939.15 s [scientific] Phase: buildPhase
  12700. 939.23 s [scientific] Preprocessing library for scientific-0.3.8.0..
  12701. 939.23 s [scientific] Building library for scientific-0.3.8.0..
  12702. 939.26 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  12703. 939.39 s [scientific] [1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, dist/build/GHC/Integer/Compat.o, dist/build/GHC/Integer/Compat.dyn_o )
  12704. 939.49 s [scientific] [2 of 5] Compiling Utils ( src/Utils.hs, dist/build/Utils.o, dist/build/Utils.dyn_o )
  12705. 939.50 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  12706. 939.89 s [scientific] [3 of 5] Compiling Data.Scientific ( src/Data/Scientific.hs, dist/build/Data/Scientific.o, dist/build/Data/Scientific.dyn_o )
  12707. 940.08 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  12708. 940.22 s [scientific]
  12709. 940.22 s [scientific] src/Data/Scientific.hs:1041:16: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12710. 940.22 s [scientific] Pattern match(es) are non-exhaustive
  12711. 940.22 s [scientific] In a pattern binding:
  12712. 940.22 s [scientific] Patterns of type ‘[Char]’ not matched:
  12713. 940.22 s [scientific] []
  12714. 940.22 s [scientific] []
  12715. 940.22 s [scientific] []
  12716. 940.22 s [scientific] |
  12717. 940.22 s [scientific] 1041 | (d:ds') = map intToDigit (if ei > 0 then init is' else is')
  12718. 940.22 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12719. 940.22 s [scientific]
  12720. 940.22 s [scientific] src/Data/Scientific.hs:1057:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12721. 940.22 s [scientific] Pattern match(es) are non-exhaustive
  12722. 940.22 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  12723. 940.22 s [scientific] |
  12724. 940.22 s [scientific] 1057 | d:ds' = map intToDigit (if ei > 0 then is' else 0:is')
  12725. 940.22 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12726. 942.26 s [scientific] [4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, dist/build/Data/Text/Lazy/Builder/Scientific.o, dist/build/Data/Text/Lazy/Builder/Scientific.dyn_o )
  12727. 942.29 s [scientific]
  12728. 942.29 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:19:1: warning: [GHC-66111] [-Wunused-imports]
  12729. 942.29 s [scientific] The import of ‘Data.Monoid’ is redundant
  12730. 942.29 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  12731. 942.29 s [scientific] To import instances alone, use: import Data.Monoid()
  12732. 942.29 s [scientific] |
  12733. 942.29 s [scientific] 19 | import Data.Monoid ((<>))
  12734. 942.29 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12735. 942.29 s [scientific]
  12736. 942.29 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:60:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12737. 942.29 s [scientific] Pattern match(es) are non-exhaustive
  12738. 942.29 s [scientific] In a pattern binding:
  12739. 942.29 s [scientific] Patterns of type ‘[Char]’ not matched:
  12740. 942.29 s [scientific] []
  12741. 942.29 s [scientific] []
  12742. 942.29 s [scientific] []
  12743. 942.29 s [scientific] |
  12744. 942.29 s [scientific] 60 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  12745. 942.29 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12746. 942.29 s [scientific]
  12747. 942.29 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:88:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12748. 942.29 s [scientific] Pattern match(es) are non-exhaustive
  12749. 942.29 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  12750. 942.29 s [scientific] |
  12751. 942.29 s [scientific] 88 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  12752. 942.29 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12753. 943.63 s [scientific] [5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, dist/build/Data/ByteString/Builder/Scientific.o, dist/build/Data/ByteString/Builder/Scientific.dyn_o )
  12754. 943.63 s [scientific]
  12755. 943.63 s [scientific] src/Data/ByteString/Builder/Scientific.hs:20:1: warning: [GHC-66111] [-Wunused-imports]
  12756. 943.63 s [scientific] The import of ‘Data.Monoid’ is redundant
  12757. 943.63 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  12758. 943.63 s [scientific] To import instances alone, use: import Data.Monoid()
  12759. 943.63 s [scientific] |
  12760. 943.63 s [scientific] 20 | import Data.Monoid ((<>))
  12761. 943.63 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12762. 943.63 s [scientific]
  12763. 943.63 s [scientific] src/Data/ByteString/Builder/Scientific.hs:64:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12764. 943.63 s [scientific] Pattern match(es) are non-exhaustive
  12765. 943.63 s [scientific] In a pattern binding:
  12766. 943.63 s [scientific] Patterns of type ‘[Char]’ not matched:
  12767. 943.63 s [scientific] []
  12768. 943.63 s [scientific] []
  12769. 943.63 s [scientific] []
  12770. 943.63 s [scientific] |
  12771. 943.63 s [scientific] 64 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  12772. 943.63 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12773. 943.63 s [scientific]
  12774. 943.63 s [scientific] src/Data/ByteString/Builder/Scientific.hs:94:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12775. 943.63 s [scientific] Pattern match(es) are non-exhaustive
  12776. 943.63 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  12777. 943.63 s [scientific] |
  12778. 943.63 s [scientific] 94 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  12779. 943.63 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12780. 943.77 s [tasty-hedgehog] Documentation created: dist/doc/html/tasty-hedgehog/,
  12781. 943.77 s [tasty-hedgehog] dist/doc/html/tasty-hedgehog/tasty-hedgehog.txt
  12782. 943.85 s [tasty-hedgehog] Phase: installPhase
  12783. 943.94 s [tasty-hedgehog] Installing library in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  12784. 943.99 s [scientific] [1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, dist/build/GHC/Integer/Compat.p_o )
  12785. 944.20 s [scientific] [2 of 5] Compiling Utils ( src/Utils.hs, dist/build/Utils.p_o )
  12786. 944.22 s [tasty-hedgehog] Phase: fixupPhase
  12787. 944.24 s [tasty-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
  12788. 944.24 s [tasty-hedgehog] shrinking /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t-ghc9.8.1.so
  12789. 944.25 s [tasty-hedgehog] checking for references to /build/ in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2...
  12790. 944.26 s [tasty-hedgehog] patching script interpreter paths in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
  12791. 944.27 s [tasty-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib
  12792. 944.33 s [scientific] [3 of 5] Compiling Data.Scientific ( src/Data/Scientific.hs, dist/build/Data/Scientific.p_o )
  12793. 944.34 s [tasty-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc
  12794. 944.35 s [tasty-hedgehog] checking for references to /build/ in /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc...
  12795. 944.36 s [tasty-hedgehog] patching script interpreter paths in /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc
  12796. 944.71 s [tasty-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
  12797. 945.96 s [tasty-hedgehog:post-build] Pushing 2 paths (138 are already present) using zstd to cache sellout ⏳
  12798. 945.96 s [tasty-hedgehog:post-build]
  12799. 946.34 s [tasty-hedgehog:post-build] Pushing /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2 (926.47 KiB)
  12800. 946.43 s [tasty-hedgehog:post-build] Pushing /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc (348.98 KiB)
  12801. 947.46 s [tasty-hedgehog:post-build]
  12802. 947.46 s [tasty-hedgehog:post-build] All done.
  12803. 947.58 s [tasty-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
  12804. 948.06 s [tasty-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12805. 948.45 s [tasty-hedgehog:post-build] copying 2 paths...
  12806. 948.45 s [tasty-hedgehog:post-build] copying path '/nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc' to 'https://cache.nix-ci.com'...
  12807. 948.83 s [tasty-hedgehog:post-build] copying path '/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2' to 'https://cache.nix-ci.com'...
  12808. 949.80 s [tasty-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12809. 950.17 s [tasty-hedgehog:post-build] copying 1 paths...
  12810. 950.17 s [tasty-hedgehog:post-build] copying path '/nix/store/jds9nixsl9b83kdbkg1qm2ab0zxcij8p-tasty-hedgehog-1.4.0.2.drv' to 'https://cache.nix-ci.com'...
  12811. 950.56 s Progress: 34 of 47 built (2 building)
  12812. 950.63 s Building /nix/store/w1l3ywx2hi2wfc49gx8mlzxfb6sxzkmw-nothunks-0.3.0.0.drv
  12813. 950.63 s [duoids-hedgehog] Phase: checkPhase
  12814. 950.63 s [duoids-hedgehog] Running 2 test suites...
  12815. 950.63 s [duoids-hedgehog] Test suite laws: RUNNING...
  12816. 950.63 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  12817. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12818. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12819. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12820. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12821. 950.63 s [duoids-hedgehog] ✓ 4 succeeded.
  12822. 950.63 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  12823. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12824. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12825. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12826. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12827. 950.63 s [duoids-hedgehog] ✓ 4 succeeded.
  12828. 950.63 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  12829. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12830. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12831. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12832. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12833. 950.63 s [duoids-hedgehog] ✓ 4 succeeded.
  12834. 950.63 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  12835. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12836. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12837. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12838. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12839. 950.63 s [duoids-hedgehog] ✓ 4 succeeded.
  12840. 950.63 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  12841. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12842. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12843. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12844. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12845. 950.63 s [duoids-hedgehog] ✓ 4 succeeded.
  12846. 950.63 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  12847. 950.63 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  12848. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12849. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12850. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12851. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12852. 950.63 s [duoids-hedgehog] ✓ 5 succeeded.
  12853. 950.63 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  12854. 950.63 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  12855. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12856. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12857. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12858. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12859. 950.63 s [duoids-hedgehog] ✓ 5 succeeded.
  12860. 950.63 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  12861. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12862. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12863. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12864. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12865. 950.63 s [duoids-hedgehog] ✓ 4 succeeded.
  12866. 950.63 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  12867. 950.63 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  12868. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12869. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12870. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12871. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12872. 950.63 s [duoids-hedgehog] ✓ 5 succeeded.
  12873. 950.63 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  12874. 950.63 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  12875. 950.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12876. 950.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12877. 950.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12878. 950.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12879. 950.63 s [duoids-hedgehog] ✓ 5 succeeded.
  12880. 950.63 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  12881. 950.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  12882. 950.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12883. 950.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12884. 950.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12885. 950.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12886. 950.64 s [duoids-hedgehog] ✓ 5 succeeded.
  12887. 950.64 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  12888. 950.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  12889. 950.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12890. 950.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12891. 950.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12892. 950.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12893. 950.64 s [duoids-hedgehog] ✓ 5 succeeded.
  12894. 950.64 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  12895. 950.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  12896. 950.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  12897. 950.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  12898. 950.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  12899. 950.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  12900. 950.64 s [duoids-hedgehog] ✓ 5 succeeded.
  12901. 950.64 s [duoids-hedgehog] Test suite laws: PASS
  12902. 950.64 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  12903. 950.64 s [duoids-hedgehog] Test suite doctests: RUNNING...
  12904. 950.64 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  12905. 950.64 s [duoids-hedgehog] Test suite doctests: PASS
  12906. 950.64 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  12907. 950.64 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  12908. 950.64 s [duoids-hedgehog] Phase: haddockPhase
  12909. 950.64 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  12910. 950.64 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  12911. 950.64 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  12912. 950.64 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  12913. 950.64 s [duoids-hedgehog] Haddock coverage:
  12914. 950.64 s [duoids-hedgehog] 33% ( 1 / 3) in 'Test.Duoid'
  12915. 950.64 s [duoids-hedgehog] Missing documentation for:
  12916. 950.64 s [duoids-hedgehog] validate (src/Test/Duoid.hs:72)
  12917. 950.64 s [duoids-hedgehog] validateNormal (src/Test/Duoid.hs:82)
  12918. 950.64 s [duoids-hedgehog] 50% ( 1 / 2) in 'Test.Duoidal'
  12919. 950.64 s [duoids-hedgehog] Missing documentation for:
  12920. 950.64 s [duoids-hedgehog] validate (src/Test/Duoidal.hs:98)
  12921. 950.64 s [scientific]
  12922. 950.64 s [scientific] src/Data/Scientific.hs:1041:16: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12923. 950.64 s [scientific] Pattern match(es) are non-exhaustive
  12924. 950.64 s [scientific] In a pattern binding:
  12925. 950.64 s [scientific] Patterns of type ‘[Char]’ not matched:
  12926. 950.64 s [scientific] []
  12927. 950.64 s [scientific] []
  12928. 950.64 s [scientific] []
  12929. 950.64 s [scientific] |
  12930. 950.64 s [scientific] 1041 | (d:ds') = map intToDigit (if ei > 0 then init is' else is')
  12931. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12932. 950.64 s [scientific]
  12933. 950.64 s [scientific] src/Data/Scientific.hs:1057:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12934. 950.64 s [scientific] Pattern match(es) are non-exhaustive
  12935. 950.64 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  12936. 950.64 s [scientific] |
  12937. 950.64 s [scientific] 1057 | d:ds' = map intToDigit (if ei > 0 then is' else 0:is')
  12938. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12939. 950.64 s [scientific] [4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, dist/build/Data/Text/Lazy/Builder/Scientific.p_o )
  12940. 950.64 s [scientific]
  12941. 950.64 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:19:1: warning: [GHC-66111] [-Wunused-imports]
  12942. 950.64 s [scientific] The import of ‘Data.Monoid’ is redundant
  12943. 950.64 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  12944. 950.64 s [scientific] To import instances alone, use: import Data.Monoid()
  12945. 950.64 s [scientific] |
  12946. 950.64 s [scientific] 19 | import Data.Monoid ((<>))
  12947. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12948. 950.64 s [scientific]
  12949. 950.64 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:60:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12950. 950.64 s [scientific] Pattern match(es) are non-exhaustive
  12951. 950.64 s [scientific] In a pattern binding:
  12952. 950.64 s [scientific] Patterns of type ‘[Char]’ not matched:
  12953. 950.64 s [scientific] []
  12954. 950.64 s [scientific] []
  12955. 950.64 s [scientific] []
  12956. 950.64 s [scientific] |
  12957. 950.64 s [scientific] 60 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  12958. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12959. 950.64 s [scientific]
  12960. 950.64 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:88:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12961. 950.64 s [scientific] Pattern match(es) are non-exhaustive
  12962. 950.64 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  12963. 950.64 s [scientific] |
  12964. 950.64 s [scientific] 88 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  12965. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12966. 950.64 s [scientific] [5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, dist/build/Data/ByteString/Builder/Scientific.p_o )
  12967. 950.64 s [scientific]
  12968. 950.64 s [scientific] src/Data/ByteString/Builder/Scientific.hs:20:1: warning: [GHC-66111] [-Wunused-imports]
  12969. 950.64 s [scientific] The import of ‘Data.Monoid’ is redundant
  12970. 950.64 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  12971. 950.64 s [scientific] To import instances alone, use: import Data.Monoid()
  12972. 950.64 s [scientific] |
  12973. 950.64 s [scientific] 20 | import Data.Monoid ((<>))
  12974. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12975. 950.64 s [scientific]
  12976. 950.64 s [scientific] src/Data/ByteString/Builder/Scientific.hs:64:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12977. 950.64 s [scientific] Pattern match(es) are non-exhaustive
  12978. 950.64 s [scientific] In a pattern binding:
  12979. 950.64 s [scientific] Patterns of type ‘[Char]’ not matched:
  12980. 950.64 s [scientific] []
  12981. 950.64 s [scientific] []
  12982. 950.64 s [scientific] []
  12983. 950.64 s [scientific] |
  12984. 950.64 s [scientific] 64 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  12985. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12986. 950.64 s [scientific]
  12987. 950.64 s [scientific] src/Data/ByteString/Builder/Scientific.hs:94:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  12988. 950.64 s [scientific] Pattern match(es) are non-exhaustive
  12989. 950.64 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  12990. 950.64 s [scientific] |
  12991. 950.64 s [scientific] 94 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  12992. 950.64 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12993. 950.64 s [scientific] Preprocessing test suite 'test-scientific' for scientific-0.3.8.0..
  12994. 950.64 s [scientific] Building test suite 'test-scientific' for scientific-0.3.8.0..
  12995. 950.64 s [scientific] [1 of 1] Compiling Main ( test/test.hs, dist/build/test-scientific/test-scientific-tmp/Main.o )
  12996. 950.75 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  12997. 950.75 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  12998. 950.82 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  12999. 950.82 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  13000. 950.82 s [nothunks] Phase: setupCompilerEnvironmentPhase
  13001. 950.82 s [nothunks] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  13002. 950.83 s [duoids-hedgehog] Phase: installPhase
  13003. 950.93 s [duoids-hedgehog] Installing library in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  13004. 951.18 s [nothunks] Phase: unpackPhase
  13005. 951.19 s [nothunks] unpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
  13006. 951.28 s [nothunks] source root is nothunks-0.3.0.0
  13007. 951.28 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
  13008. 951.28 s [nothunks] Phase: patchPhase
  13009. 951.28 s [duoids-hedgehog] Phase: fixupPhase
  13010. 951.29 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
  13011. 951.31 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  13012. 951.33 s [nothunks] Phase: compileBuildDriverPhase
  13013. 951.35 s [nothunks] setupCompileFlags: -package-db=/build/tmp.hkxskjs4A9/setup-package.conf.d -threaded
  13014. 951.38 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0
  13015. 951.39 s [duoids-hedgehog] shrinking /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSduoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR-ghc9.8.1.so
  13016. 951.40 s [duoids-hedgehog] checking for references to /build/ in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0...
  13017. 951.41 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.hkxskjs4A9/Main.o )
  13018. 951.43 s [duoids-hedgehog] patching script interpreter paths in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0
  13019. 951.44 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib
  13020. 951.50 s [nothunks] [2 of 2] Linking Setup
  13021. 951.52 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc
  13022. 951.52 s [duoids-hedgehog] checking for references to /build/ in /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc...
  13023. 951.54 s [duoids-hedgehog] patching script interpreter paths in /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc
  13024. 951.83 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc
  13025. 952.90 s [duoids-hedgehog:post-build] Pushing 2 paths (132 are already present) using zstd to cache sellout ⏳
  13026. 952.90 s [duoids-hedgehog:post-build]
  13027. 953.33 s [duoids-hedgehog:post-build] Pushing /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc (297.07 KiB)
  13028. 953.37 s [duoids-hedgehog:post-build] Pushing /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 (495.92 KiB)
  13029. 954.41 s [duoids-hedgehog:post-build]
  13030. 954.41 s [duoids-hedgehog:post-build] All done.
  13031. 954.60 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc
  13032. 955.14 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13033. 955.21 s [duoids-hedgehog:post-build] copying 2 paths...
  13034. 955.21 s [duoids-hedgehog:post-build] copying path '/nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  13035. 955.69 s [duoids-hedgehog:post-build] copying path '/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  13036. 956.63 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13037. 956.94 s [duoids-hedgehog:post-build] copying 1 paths...
  13038. 956.99 s [duoids-hedgehog:post-build] copying path '/nix/store/349qlybgg6fyg3x7dx68044ggfs7wkyj-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  13039. 957.33 s Progress: 35 of 47 built (2 building)
  13040. 957.34 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  13041. 957.34 s [nothunks] Phase: configurePhase
  13042. 957.34 s [nothunks] configureFlags: --verbose --prefix=/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.hkxskjs4A9/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  13043. 957.34 s [nothunks] Using Parsec parser
  13044. 957.34 s [nothunks] Configuring nothunks-0.3.0.0...
  13045. 957.34 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  13046. 957.34 s [nothunks] Dependency base: using base-4.19.0.0
  13047. 957.34 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.0.2
  13048. 957.34 s [nothunks] Dependency containers: using containers-0.6.8
  13049. 957.34 s [nothunks] Dependency ghc-heap: using ghc-heap-9.8.1
  13050. 957.34 s [nothunks] Dependency stm: using stm-2.5.2.1
  13051. 957.34 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1
  13052. 957.34 s [nothunks] Dependency time: using time-1.12.2
  13053. 957.34 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  13054. 957.34 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
  13055. 957.34 s [nothunks] Dependency base: using base-4.19.0.0
  13056. 957.34 s [nothunks] Dependency containers: using containers-0.6.8
  13057. 957.34 s [nothunks] Dependency ghc-prim: using ghc-prim-0.11.0
  13058. 957.34 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  13059. 957.34 s [nothunks] Dependency nothunks: using nothunks-0.3.0.0
  13060. 957.34 s [nothunks] Dependency random: using random-1.2.1.3
  13061. 957.34 s [nothunks] Dependency stm: using stm-2.5.2.1
  13062. 957.34 s [nothunks] Dependency tasty: using tasty-1.5.3
  13063. 957.34 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  13064. 957.34 s [nothunks] Source component graph:
  13065. 957.34 s [nothunks] component lib
  13066. 957.34 s [nothunks] component test:nothunks-test dependency lib
  13067. 957.34 s [nothunks] Configured component graph:
  13068. 957.34 s [nothunks] component nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13069. 957.34 s [nothunks] include base-4.19.0.0-b960
  13070. 957.34 s [nothunks] include bytestring-0.12.0.2-4690
  13071. 957.34 s [nothunks] include containers-0.6.8-4775
  13072. 957.34 s [nothunks] include ghc-heap-9.8.1-6b37
  13073. 957.34 s [nothunks] include stm-2.5.2.1-83fa
  13074. 957.34 s [nothunks] include text-2.1-c36a
  13075. 957.34 s [nothunks] include time-1.12.2-d26d
  13076. 957.34 s [nothunks] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
  13077. 957.34 s [nothunks] include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
  13078. 957.34 s [nothunks] component nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
  13079. 957.34 s [nothunks] include base-4.19.0.0-b960
  13080. 957.34 s [nothunks] include containers-0.6.8-4775
  13081. 957.34 s [nothunks] include ghc-prim-0.11.0-a69e
  13082. 957.34 s [nothunks] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  13083. 957.34 s [nothunks] include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13084. 957.34 s [nothunks] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  13085. 957.34 s [nothunks] include stm-2.5.2.1-83fa
  13086. 957.34 s [nothunks] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  13087. 957.34 s [nothunks] include tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  13088. 957.34 s [nothunks] Linked component graph:
  13089. 957.34 s [nothunks] unit nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13090. 957.34 s [nothunks] include base-4.19.0.0-b960
  13091. 957.34 s [nothunks] include bytestring-0.12.0.2-4690
  13092. 957.34 s [nothunks] include containers-0.6.8-4775
  13093. 957.34 s [nothunks] include ghc-heap-9.8.1-6b37
  13094. 957.34 s [nothunks] include stm-2.5.2.1-83fa
  13095. 957.34 s [nothunks] include text-2.1-c36a
  13096. 957.34 s [nothunks] include time-1.12.2-d26d
  13097. 957.34 s [nothunks] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
  13098. 957.34 s [nothunks] include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
  13099. 957.34 s [nothunks] NoThunks.Class=nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg:NoThunks.Class
  13100. 957.34 s [nothunks] unit nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
  13101. 957.34 s [nothunks] include base-4.19.0.0-b960
  13102. 957.34 s [nothunks] include containers-0.6.8-4775
  13103. 957.34 s [nothunks] include ghc-prim-0.11.0-a69e
  13104. 957.34 s [nothunks] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  13105. 957.34 s [nothunks] include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13106. 957.34 s [scientific] [2 of 2] Linking dist/build/test-scientific/test-scientific
  13107. 957.34 s [scientific] Phase: checkPhase
  13108. 957.34 s [scientific] Running 1 test suites...
  13109. 957.34 s [scientific] Test suite test-scientific: RUNNING...
  13110. 957.34 s [scientific] scientific
  13111. 957.34 s [scientific] DoS protection
  13112. 957.34 s [scientific] Eq
  13113. 957.34 s [scientific] 1e1000000: OK
  13114. 957.34 s [scientific] Ord
  13115. 957.34 s [scientific] compare 1234e1000000 123e1000001: OK
  13116. 957.34 s [scientific] RealFrac
  13117. 957.34 s [scientific] floor
  13118. 957.34 s [scientific] 1e1000000: OK
  13119. 957.34 s [scientific] -1e-1000000: OK
  13120. 957.34 s [scientific] 1e-1000000: OK
  13121. 957.34 s [scientific] ceiling
  13122. 957.34 s [scientific] 1e1000000: OK
  13123. 957.34 s [scientific] -1e-1000000: OK
  13124. 957.34 s [scientific] 1e-1000000: OK
  13125. 957.34 s [scientific] round
  13126. 957.34 s [scientific] 1e1000000: OK
  13127. 957.34 s [scientific] -1e-1000000: OK
  13128. 957.34 s [scientific] 1e-1000000: OK
  13129. 957.34 s [scientific] truncate
  13130. 957.34 s [scientific] 1e1000000: OK
  13131. 957.34 s [scientific] -1e-1000000: OK
  13132. 957.34 s [scientific] 1e-1000000: OK
  13133. 957.34 s [scientific] properFracton
  13134. 957.34 s [scientific] 1e1000000: OK
  13135. 957.34 s [scientific] -1e-1000000: OK
  13136. 957.34 s [scientific] 1e-1000000: OK
  13137. 957.34 s [scientific] toRealFloat
  13138. 957.34 s [scientific] 1e1000000: OK
  13139. 957.34 s [scientific] 1e-1000000: OK
  13140. 957.34 s [scientific] toBoundedInteger
  13141. 957.34 s [scientific] 1e1000000: OK
  13142. 957.34 s [scientific] normalization
  13143. 957.34 s [scientific] smallcheck: OK
  13144. 957.34 s [scientific] 81 tests completed (but 9 did not meet the condition)
  13145. 957.34 s [scientific] quickcheck: OK
  13146. 957.34 s [scientific] +++ OK, passed 100 tests; 27 discarded.
  13147. 957.34 s [scientific] Binary
  13148. 957.34 s [scientific] decode . encode == id
  13149. 957.34 s [scientific] smallcheck: OK
  13150. 957.34 s [scientific] 81 tests completed
  13151. 957.34 s [scientific] quickcheck: OK
  13152. 957.34 s [scientific] +++ OK, passed 100 tests.
  13153. 957.34 s [scientific] Parsing
  13154. 957.34 s [scientific] reads "": OK
  13155. 957.34 s [scientific] reads "1.": OK
  13156. 957.34 s [scientific] reads "1.2e": OK
  13157. 957.34 s [scientific] reads "(1.3 )": OK
  13158. 957.34 s [scientific] reads "((1.3))": OK
  13159. 957.34 s [scientific] reads " 1.3": OK
  13160. 957.34 s [scientific] read " ( (( -1.0e+3 ) ))": OK
  13161. 957.34 s [scientific] scientificP "3": OK
  13162. 957.34 s [scientific] scientificP "3.0e2": OK
  13163. 957.34 s [scientific] scientificP "+3.0e+2": OK
  13164. 957.34 s [scientific] scientificP "-3.0e-2": OK
  13165. 957.34 s [scientific] Formatting
  13166. 957.34 s [scientific] read . show == id
  13167. 957.34 s [scientific] smallcheck: OK
  13168. 957.34 s [scientific] 81 tests completed
  13169. 957.34 s [scientific] quickcheck: OK
  13170. 957.34 s [scientific] +++ OK, passed 100 tests.
  13171. 957.34 s [scientific] show (Just 1): OK
  13172. 957.34 s [scientific] show (Just 0): OK
  13173. 957.34 s [scientific] show (Just (-1)): OK
  13174. 957.34 s [scientific] toDecimalDigits
  13175. 957.34 s [scientific] laws
  13176. 957.34 s [scientific] smallcheck: OK
  13177. 957.34 s [scientific] 45 tests completed
  13178. 957.34 s [scientific] quickcheck: OK
  13179. 957.34 s [scientific] +++ OK, passed 100 tests.
  13180. 957.34 s [scientific] == Numeric.floatToDigits
  13181. 957.34 s [scientific] smallcheck: OK
  13182. 957.34 s [scientific] 19 tests completed
  13183. 957.34 s [scientific] quickcheck: OK
  13184. 957.34 s [scientific] +++ OK, passed 100 tests.
  13185. 957.34 s [scientific] Builder
  13186. 957.34 s [scientific] Text
  13187. 957.34 s [scientific] smallcheck: OK
  13188. 957.34 s [scientific] 81 tests completed
  13189. 957.34 s [scientific] quickcheck: OK
  13190. 957.34 s [scientific] +++ OK, passed 100 tests.
  13191. 957.34 s [scientific] ByteString
  13192. 957.34 s [scientific] smallcheck: OK
  13193. 957.34 s [scientific] 81 tests completed
  13194. 957.34 s [scientific] quickcheck: OK
  13195. 957.34 s [scientific] +++ OK, passed 100 tests.
  13196. 957.34 s [scientific] formatScientific_fromFloatDigits
  13197. 957.34 s [scientific] smallcheck: OK
  13198. 957.34 s [scientific] 37 tests completed
  13199. 957.34 s [scientific] quickcheck: OK
  13200. 957.34 s [scientific] +++ OK, passed 100 tests.
  13201. 957.34 s [scientific] Eq
  13202. 957.34 s [scientific] ==
  13203. 957.34 s [scientific] smallcheck: OK (0.06s)
  13204. 957.34 s [scientific] 6561 tests completed
  13205. 957.34 s [scientific] quickcheck: OK (0.01s)
  13206. 957.34 s [scientific] +++ OK, passed 100 tests.
  13207. 957.34 s [scientific] s == s
  13208. 957.34 s [scientific] smallcheck: OK
  13209. 957.34 s [scientific] 81 tests completed
  13210. 957.34 s [scientific] quickcheck: OK
  13211. 957.35 s [scientific] +++ OK, passed 100 tests.
  13212. 957.35 s [scientific] Ord
  13213. 957.35 s [scientific] compare
  13214. 957.35 s [scientific] smallcheck: OK (0.02s)
  13215. 957.35 s [scientific] 6561 tests completed
  13216. 957.35 s [scientific] quickcheck: OK (0.02s)
  13217. 957.35 s [scientific] +++ OK, passed 100 tests.
  13218. 957.35 s [scientific] Num
  13219. 957.35 s [scientific] Equal to Rational
  13220. 957.35 s [scientific] fromInteger
  13221. 957.35 s [scientific] smallcheck: OK
  13222. 957.35 s [scientific] 11 tests completed
  13223. 957.35 s [scientific] quickcheck: OK
  13224. 957.35 s [scientific] +++ OK, passed 100 tests.
  13225. 957.35 s [scientific] +
  13226. 957.35 s [scientific] smallcheck: OK (0.02s)
  13227. 957.35 s [nothunks] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  13228. 957.35 s [nothunks] include stm-2.5.2.1-83fa
  13229. 957.35 s [nothunks] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  13230. 957.35 s [nothunks] include tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  13231. 957.35 s [nothunks] Ready component graph:
  13232. 957.35 s [nothunks] definite nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13233. 957.35 s [nothunks] depends base-4.19.0.0-b960
  13234. 957.35 s [nothunks] depends bytestring-0.12.0.2-4690
  13235. 957.35 s [nothunks] depends containers-0.6.8-4775
  13236. 957.35 s [nothunks] depends ghc-heap-9.8.1-6b37
  13237. 957.35 s [nothunks] depends stm-2.5.2.1-83fa
  13238. 957.35 s [nothunks] depends text-2.1-c36a
  13239. 957.35 s [nothunks] depends time-1.12.2-d26d
  13240. 957.35 s [nothunks] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
  13241. 957.35 s [nothunks] depends wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
  13242. 957.35 s [nothunks] definite nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
  13243. 957.35 s [nothunks] depends base-4.19.0.0-b960
  13244. 957.35 s [nothunks] depends containers-0.6.8-4775
  13245. 957.35 s [nothunks] depends ghc-prim-0.11.0-a69e
  13246. 957.35 s [nothunks] depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  13247. 957.35 s [nothunks] depends nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13248. 957.35 s [nothunks] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  13249. 957.35 s [nothunks] depends stm-2.5.2.1-83fa
  13250. 957.35 s [nothunks] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  13251. 957.35 s [nothunks] depends tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
  13252. 957.35 s [nothunks] Using Cabal-3.10.2.0 compiled by ghc-9.8
  13253. 957.35 s [nothunks] Using compiler: ghc-9.8.1
  13254. 957.35 s [nothunks] Using install prefix:
  13255. 957.35 s [nothunks] /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
  13256. 957.35 s [nothunks] Executables installed in:
  13257. 957.35 s [nothunks] /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/bin
  13258. 957.35 s [nothunks] Libraries installed in:
  13259. 957.35 s [nothunks] /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13260. 957.35 s [nothunks] Dynamic Libraries installed in:
  13261. 957.35 s [nothunks] /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  13262. 957.35 s [nothunks] Private executables installed in:
  13263. 957.35 s [nothunks] /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0
  13264. 957.35 s [nothunks] Data files installed in:
  13265. 957.35 s [nothunks] /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0
  13266. 957.35 s [nothunks] Documentation installed in:
  13267. 957.35 s [nothunks] /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
  13268. 957.35 s [nothunks] Configuration files installed in:
  13269. 957.35 s [nothunks] /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/etc
  13270. 957.35 s [nothunks] No alex found
  13271. 957.35 s [nothunks] Using ar found on system at:
  13272. 957.35 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  13273. 957.35 s [nothunks] No c2hs found
  13274. 957.35 s [nothunks] No cpphs found
  13275. 957.35 s [nothunks] No doctest found
  13276. 957.35 s [nothunks] Using gcc version 14.3.0 given by user at:
  13277. 957.35 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  13278. 957.35 s [nothunks] Using ghc version 9.8.1 found on system at:
  13279. 957.35 s [nothunks] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  13280. 957.35 s [nothunks] Using ghc-pkg version 9.8.1 found on system at:
  13281. 957.35 s [nothunks] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  13282. 957.35 s [nothunks] No ghcjs found
  13283. 957.35 s [nothunks] No ghcjs-pkg found
  13284. 957.35 s [nothunks] No greencard found
  13285. 957.35 s [nothunks] Using haddock version 2.30.0 found on system at:
  13286. 957.35 s [nothunks] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  13287. 957.35 s [nothunks] No happy found
  13288. 957.35 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  13289. 957.35 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13290. 957.35 s [nothunks] No hmake found
  13291. 957.35 s [nothunks] Using hpc version 0.69 found on system at:
  13292. 957.35 s [nothunks] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  13293. 957.35 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  13294. 957.35 s [nothunks] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  13295. 957.35 s [nothunks] Using hscolour version 1.25 found on system at:
  13296. 957.35 s [nothunks] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  13297. 957.35 s [nothunks] No jhc found
  13298. 957.35 s [nothunks] Using ld found on system at:
  13299. 957.35 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  13300. 957.35 s [nothunks] No pkg-config found
  13301. 957.35 s [nothunks] Using runghc version 9.8.1 found on system at:
  13302. 957.35 s [nothunks] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  13303. 957.35 s [nothunks] Using strip version 2.44 found on system at:
  13304. 957.35 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  13305. 957.35 s [nothunks] Using tar found on system at:
  13306. 957.35 s [nothunks] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  13307. 957.35 s [nothunks] No uhc found
  13308. 957.35 s [nothunks] Phase: buildPhase
  13309. 957.35 s [nothunks] Preprocessing library for nothunks-0.3.0.0..
  13310. 957.35 s [nothunks] Building library for nothunks-0.3.0.0..
  13311. 957.35 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  13312. 957.35 s [scientific] 6561 tests completed
  13313. 957.35 s [scientific] quickcheck: OK (0.04s)
  13314. 957.35 s [scientific] +++ OK, passed 100 tests.
  13315. 957.35 s [scientific] -
  13316. 957.35 s [scientific] smallcheck: OK (0.02s)
  13317. 957.35 s [scientific] 6561 tests completed
  13318. 957.35 s [scientific] quickcheck: OK (0.04s)
  13319. 957.35 s [scientific] +++ OK, passed 100 tests.
  13320. 957.35 s [scientific] *
  13321. 957.35 s [scientific] smallcheck: OK (0.02s)
  13322. 957.35 s [scientific] 6561 tests completed
  13323. 957.35 s [scientific] quickcheck: OK (0.03s)
  13324. 957.35 s [scientific] +++ OK, passed 100 tests.
  13325. 957.35 s [scientific] abs
  13326. 957.35 s [scientific] smallcheck: OK
  13327. 957.35 s [scientific] 81 tests completed
  13328. 957.35 s [scientific] quickcheck: OK (0.01s)
  13329. 957.35 s [scientific] +++ OK, passed 100 tests.
  13330. 957.35 s [scientific] negate
  13331. 957.35 s [scientific] smallcheck: OK
  13332. 957.35 s [scientific] 81 tests completed
  13333. 957.35 s [scientific] quickcheck: OK (0.01s)
  13334. 957.35 s [scientific] +++ OK, passed 100 tests.
  13335. 957.35 s [scientific] signum
  13336. 957.35 s [scientific] smallcheck: OK
  13337. 957.35 s [scientific] 81 tests completed
  13338. 957.35 s [scientific] quickcheck: OK
  13339. 957.35 s [scientific] +++ OK, passed 100 tests.
  13340. 957.35 s [scientific] 0 identity of +
  13341. 957.35 s [scientific] smallcheck: OK
  13342. 957.35 s [scientific] 81 tests completed
  13343. 957.35 s [scientific] quickcheck: OK (2.50s)
  13344. 957.35 s [scientific] +++ OK, passed 100 tests.
  13345. 957.35 s [scientific] 1 identity of *
  13346. 957.35 s [scientific] smallcheck: OK
  13347. 957.35 s [scientific] 81 tests completed
  13348. 957.35 s [scientific] quickcheck: OK
  13349. 957.35 s [scientific] +++ OK, passed 100 tests.
  13350. 957.35 s [scientific] 0 identity of *
  13351. 957.35 s [scientific] smallcheck: OK
  13352. 957.35 s [scientific] 81 tests completed
  13353. 957.35 s [scientific] quickcheck: OK
  13354. 957.35 s [scientific] +++ OK, passed 100 tests.
  13355. 957.35 s [scientific] associativity of +
  13356. 957.35 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  13357. 957.49 s [scientific] smallcheck: OK (1.54s)
  13358. 957.49 s [scientific] 531441 tests completed
  13359. 960.11 s [scientific] quickcheck: OK (2.64s)
  13360. 960.11 s [scientific] +++ OK, passed 100 tests.
  13361. 960.11 s [scientific] commutativity of +
  13362. 960.15 s [scientific] smallcheck: OK
  13363. 960.15 s [scientific] 6561 tests completed
  13364. 961.17 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
  13365. 961.17 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.0.0..
  13366. 961.32 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 )
  13367. 961.62 s [scientific] quickcheck: OK (1.49s)
  13368. 961.62 s [scientific] +++ OK, passed 100 tests.
  13369. 961.62 s [scientific] distributivity of * over +
  13370. 963.32 s [scientific] smallcheck: OK (1.70s)
  13371. 963.32 s [scientific] 531441 tests completed
  13372. 964.18 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  13373. 964.27 s [scientific] quickcheck: OK (0.92s)
  13374. 964.27 s [scientific] +++ OK, passed 100 tests.
  13375. 964.27 s [scientific] subtracting the addition
  13376. 964.31 s [scientific] smallcheck: OK (0.03s)
  13377. 964.31 s [scientific] 6561 tests completed
  13378. 965.18 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  13379. 966.57 s [scientific] quickcheck: OK (2.31s)
  13380. 966.57 s [scientific] +++ OK, passed 100 tests.
  13381. 966.57 s [scientific] + and negate
  13382. 966.57 s [scientific] smallcheck: OK
  13383. 966.57 s [scientific] 81 tests completed
  13384. 966.58 s [scientific] quickcheck: OK
  13385. 966.58 s [scientific] +++ OK, passed 100 tests.
  13386. 966.58 s [scientific] - and negate
  13387. 966.58 s [scientific] smallcheck: OK
  13388. 966.58 s [scientific] 81 tests completed
  13389. 966.58 s [scientific] quickcheck: OK
  13390. 966.58 s [scientific] +++ OK, passed 100 tests.
  13391. 966.58 s [scientific] abs . negate == id
  13392. 966.58 s [scientific] smallcheck: OK
  13393. 966.58 s [scientific] 45 tests completed
  13394. 966.58 s [scientific] quickcheck: OK
  13395. 966.58 s [scientific] +++ OK, passed 100 tests.
  13396. 966.58 s [scientific] Real
  13397. 966.58 s [scientific] fromRational . toRational == id
  13398. 966.59 s [scientific] smallcheck: OK
  13399. 966.59 s [scientific] 81 tests completed
  13400. 967.30 s [nothunks] Phase: checkPhase
  13401. 967.39 s [nothunks] Running 1 test suites...
  13402. 967.39 s [nothunks] Test suite nothunks-test: RUNNING...
  13403. 967.40 s [nothunks] Tests
  13404. 967.40 s [nothunks] NoThunks.Class
  13405. 967.40 s [nothunks] Sanity
  13406. 967.40 s [nothunks] IntNotNF: OK
  13407. 967.40 s [nothunks] ✓ <interactive> passed 1 test.
  13408. 967.40 s [nothunks] IntIsNF: OK
  13409. 967.40 s [nothunks] ✓ <interactive> passed 1 test.
  13410. 967.40 s [nothunks] Pair: OK
  13411. 967.40 s [nothunks] ✓ <interactive> passed 1 test.
  13412. 967.40 s [nothunks] Sum: OK
  13413. 967.40 s [nothunks] ✓ <interactive> passed 1 test.
  13414. 967.40 s [nothunks] Fn: OK
  13415. 967.40 s [nothunks] ✓ <interactive> passed 1 test.
  13416. 967.40 s [nothunks] IO: OK
  13417. 967.41 s [nothunks] ✓ <interactive> passed 1 test.
  13418. 967.41 s [nothunks] InspectHeap
  13419. 967.45 s [nothunks] Int: OK (0.04s)
  13420. 967.45 s [nothunks] ✓ <interactive> passed 1000 tests.
  13421. 967.45 s [nothunks] Just ["Int"] 51% ██████████▏·········
  13422. 967.45 s [nothunks] Nothing 49% █████████▊··········
  13423. 967.46 s [nothunks] IntInt: OK (0.02s)
  13424. 967.46 s [nothunks] ✓ <interactive> passed 1000 tests.
  13425. 967.46 s [nothunks] Just ["Int","Tuple2"] 38% ███████▋············
  13426. 967.46 s [nothunks] Just ["Tuple2"] 49% █████████▊··········
  13427. 967.46 s [nothunks] Nothing 12% ██▌·················
  13428. 967.48 s [nothunks] SumInt: OK (0.02s)
  13429. 967.48 s [nothunks] ✓ <interactive> passed 1000 tests.
  13430. 967.48 s [nothunks] Just ["Either"] 34% ██████▋·············
  13431. 967.48 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  13432. 967.48 s [nothunks] Nothing 32% ██████▍·············
  13433. 967.50 s [nothunks] ListInt: OK (0.02s)
  13434. 967.50 s [nothunks] ✓ <interactive> passed 1000 tests.
  13435. 967.50 s [nothunks] Just ["Int","List"] 22% ████▍···············
  13436. 967.50 s [nothunks] Just ["List"] 44% ████████▊···········
  13437. 967.50 s [nothunks] Nothing 34% ██████▊·············
  13438. 967.52 s [nothunks] IntListInt: OK (0.03s)
  13439. 967.52 s [nothunks] ✓ <interactive> passed 1000 tests.
  13440. 967.52 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  13441. 967.52 s [nothunks] Just ["Int","Tuple2"] 24% ████▉···············
  13442. 967.52 s [nothunks] Just ["List","Tuple2"] 12% ██▍·················
  13443. 967.52 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  13444. 967.52 s [nothunks] Nothing 8% █▋··················
  13445. 967.56 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  13446. 967.56 s [nothunks] after 7 tests.
  13447. 967.56 s [nothunks] shrink path: 7:
  13448. 967.56 s [nothunks] Just ["Int","Seq"] 43% ████████▌···········
  13449. 967.56 s [nothunks] Nothing 43% ████████▌···········
  13450. 967.56 s [nothunks]
  13451. 967.56 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  13452. 967.56 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  13453. 967.56 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  13454. 967.56 s [nothunks] 168 ┃ -> Proxy a
  13455. 967.56 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  13456. 967.56 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  13457. 967.56 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  13458. 967.56 s [nothunks] 172 ┃ -> Property
  13459. 967.56 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  13460. 967.56 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  13461. 967.56 s [nothunks] ┃ │ Wrap
  13462. 967.56 s [nothunks] ┃ │ { unwrap =
  13463. 967.56 s [nothunks] ┃ │ SeqEnqueue
  13464. 967.56 s [nothunks] ┃ │ (IntValue 0)
  13465. 967.56 s [nothunks] ┃ │ (SeqEnqueue
  13466. 967.56 s [nothunks] ┃ │ (IntValue 0)
  13467. 967.56 s [nothunks] ┃ │ (SeqEnqueue
  13468. 967.56 s [nothunks] ┃ │ (IntValue 0)
  13469. 967.56 s [nothunks] ┃ │ (SeqEnqueue
  13470. 967.56 s [nothunks] ┃ │ (IntValue 0)
  13471. 967.56 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  13472. 967.56 s [nothunks] ┃ │ }
  13473. 967.56 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  13474. 967.56 s [nothunks] 176 ┃ fromModel m $ \a -> do
  13475. 967.56 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  13476. 967.56 s [nothunks] ┃ │ IsNF
  13477. 967.56 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  13478. 967.56 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  13479. 967.56 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13480. 967.56 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  13481. 967.56 s [nothunks] ┃ │ - Just
  13482. 967.56 s [nothunks] ┃ │ - ThunkInfo
  13483. 967.56 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  13484. 967.56 s [nothunks] ┃ │ + Nothing
  13485. 967.56 s [nothunks]
  13486. 967.56 s [nothunks] This failure can be reproduced by running:
  13487. 967.56 s [nothunks] > recheckAt (Seed 11937808295631642844 9520887802073393749) "7:" EXPECTED FAILURE
  13488. 967.56 s [nothunks]
  13489. 967.57 s [nothunks] OK (0.03s)
  13490. 967.57 s [nothunks] ✓ <interactive> passed 1 test.
  13491. 967.57 s [nothunks] Model
  13492. 967.58 s [nothunks] Int: OK (0.01s)
  13493. 967.58 s [nothunks] ✓ <interactive> passed 1000 tests.
  13494. 967.58 s [nothunks] Just ["Int"] 50% ██████████··········
  13495. 967.58 s [nothunks] Nothing 50% █████████▉··········
  13496. 967.61 s [nothunks] IntInt: OK (0.02s)
  13497. 967.61 s [nothunks] ✓ <interactive> passed 1000 tests.
  13498. 967.61 s [nothunks] Just ["Int","Tuple2"] 40% ███████▉············
  13499. 967.61 s [nothunks] Just ["Tuple2"] 47% █████████▍··········
  13500. 967.61 s [nothunks] Nothing 13% ██▋·················
  13501. 967.62 s [nothunks] SumInt: OK (0.02s)
  13502. 967.62 s [nothunks] ✓ <interactive> passed 1000 tests.
  13503. 967.62 s [nothunks] Just ["Either"] 33% ██████▌·············
  13504. 967.62 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  13505. 967.62 s [nothunks] Nothing 33% ██████▌·············
  13506. 967.62 s [nothunks] ListInt: OK (0.02s)
  13507. 967.62 s [nothunks] ✓ <interactive> passed 1000 tests.
  13508. 967.62 s [nothunks] Just ["Int","List"] 23% ████▌···············
  13509. 967.62 s [nothunks] Just ["List"] 42% ████████▍···········
  13510. 967.62 s [nothunks] Nothing 35% ███████·············
  13511. 967.65 s [nothunks] IntListInt: OK (0.03s)
  13512. 967.65 s [nothunks] ✓ <interactive> passed 1000 tests.
  13513. 967.65 s [nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
  13514. 967.65 s [nothunks] Just ["Int","Tuple2"] 22% ████▍···············
  13515. 967.65 s [nothunks] Just ["List","Tuple2"] 10% ██··················
  13516. 967.65 s [nothunks] Just ["Tuple2"] 55% ███████████·········
  13517. 967.65 s [nothunks] Nothing 6% █▎··················
  13518. 967.75 s [nothunks] SeqInt: OK (0.07s)
  13519. 967.75 s [nothunks] ✓ <interactive> passed 1000 tests.
  13520. 967.75 s [nothunks] Just ["Int","Seq"] 48% █████████▌··········
  13521. 967.75 s [nothunks] Nothing 52% ██████████▍·········
  13522. 967.76 s [nothunks] AllowThunksIn: OK (0.03s)
  13523. 967.76 s [nothunks] ✓ <interactive> passed 1000 tests.
  13524. 967.76 s [nothunks] Just ["Int","field2","Record"] 26% █████▏··············
  13525. 967.76 s [nothunks] Just ["Record"] 50% ██████████··········
  13526. 967.76 s [nothunks] Nothing 24% ████▊···············
  13527. 967.78 s [nothunks] Fn: OK (0.01s)
  13528. 967.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  13529. 967.78 s [nothunks] Just ["->"] 26% █████···············
  13530. 967.78 s [nothunks] Nothing 74% ██████████████▉·····
  13531. 967.78 s [nothunks] IO: OK (0.01s)
  13532. 967.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  13533. 967.78 s [nothunks] Just ["IO"] 26% █████▏··············
  13534. 967.78 s [nothunks] Nothing 74% ██████████████▊·····
  13535. 967.80 s [nothunks] ThunkFreeFn: OK (0.01s)
  13536. 967.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  13537. 967.80 s [nothunks] Just ["->"] 25% ████▉···············
  13538. 967.80 s [nothunks] Just ["...","->"] 34% ██████▊·············
  13539. 967.80 s [nothunks] Nothing 41% ████████▏···········
  13540. 967.80 s [nothunks] ThunkFreeIO: OK (0.01s)
  13541. 967.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  13542. 967.80 s [nothunks] Just ["...","IO"] 40% ███████▉············
  13543. 967.80 s [nothunks] Just ["IO"] 26% █████▏··············
  13544. 967.80 s [nothunks] Nothing 34% ██████▉·············
  13545. 967.80 s [nothunks] MutableVars
  13546. 967.80 s [nothunks] IORef
  13547. 967.80 s [nothunks] NotNF: OK
  13548. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13549. 967.80 s [nothunks] NF: OK
  13550. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13551. 967.80 s [nothunks] NotNFPure: OK
  13552. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13553. 967.80 s [nothunks] NFPure: OK
  13554. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13555. 967.80 s [nothunks] NotNFAtomically: OK
  13556. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13557. 967.80 s [nothunks] NFAtomically: OK
  13558. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13559. 967.80 s [nothunks] MVar
  13560. 967.80 s [nothunks] NotNF: OK
  13561. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13562. 967.80 s [nothunks] NF: OK
  13563. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13564. 967.80 s [nothunks] NotNFPure: OK
  13565. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13566. 967.80 s [nothunks] NFPure: OK
  13567. 967.80 s [nothunks] ✓ <interactive> passed 1 test.
  13568. 967.81 s [nothunks] NotNFAtomically: OK
  13569. 967.81 s [nothunks] ✓ <interactive> passed 1 test.
  13570. 967.81 s [nothunks] NFAtomically: OK
  13571. 967.81 s [nothunks] ✓ <interactive> passed 1 test.
  13572. 967.81 s [nothunks] TVar
  13573. 967.81 s [nothunks] NotNF: OK
  13574. 967.81 s [nothunks] ✓ <interactive> passed 1 test.
  13575. 967.81 s [nothunks] NF: OK
  13576. 967.81 s [nothunks] ✓ <interactive> passed 1 test.
  13577. 967.81 s [nothunks] NotNFPure: OK
  13578. 967.81 s [nothunks] ✓ <interactive> passed 1 test.
  13579. 967.81 s [nothunks] NFPure: OK
  13580. 967.82 s [nothunks] ✓ <interactive> passed 1 test.
  13581. 967.82 s [nothunks] NotNFAtomically: OK
  13582. 967.82 s [nothunks] ✓ <interactive> passed 1 test.
  13583. 967.82 s [nothunks] NFAtomically: OK
  13584. 967.82 s [nothunks] ✓ <interactive> passed 1 test.
  13585. 967.82 s [nothunks]
  13586. 967.82 s [nothunks] All 41 tests passed (0.41s)
  13587. 967.82 s [nothunks] Test suite nothunks-test: PASS
  13588. 967.82 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
  13589. 967.82 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  13590. 967.82 s [nothunks] Phase: haddockPhase
  13591. 968.30 s [nothunks] Preprocessing library for nothunks-0.3.0.0..
  13592. 968.30 s [nothunks] Running Haddock on library for nothunks-0.3.0.0..
  13593. 968.31 s [nothunks] Warning: The documentation for the following packages are not installed. No
  13594. 968.31 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  13595. 968.39 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  13596. 968.64 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  13597. 969.42 s [nothunks] Haddock coverage:
  13598. 969.42 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  13599. 969.42 s [nothunks] * at src/NoThunks/Class.hs:334:48
  13600. 969.50 s [nothunks] * at src/NoThunks/Class.hs:334:1
  13601. 969.50 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13602. 969.50 s [nothunks] by specifying the type/value namespace explicitly.
  13603. 969.50 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  13604. 969.50 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  13605. 969.50 s [nothunks] * at src/NoThunks/Class.hs:353:25
  13606. 969.50 s [nothunks] * at src/NoThunks/Class.hs:353:1
  13607. 969.50 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13608. 969.50 s [nothunks] by specifying the type/value namespace explicitly.
  13609. 969.50 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  13610. 969.50 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  13611. 969.50 s [nothunks] * at src/NoThunks/Class.hs:358:47
  13612. 969.50 s [nothunks] * at src/NoThunks/Class.hs:358:1
  13613. 969.50 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13614. 969.50 s [nothunks] by specifying the type/value namespace explicitly.
  13615. 969.50 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  13616. 969.50 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  13617. 969.50 s [nothunks] * at src/NoThunks/Class.hs:308:27
  13618. 969.50 s [nothunks] * at src/NoThunks/Class.hs:308:1
  13619. 969.50 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13620. 969.50 s [nothunks] by specifying the type/value namespace explicitly.
  13621. 969.50 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  13622. 969.50 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  13623. 969.50 s [nothunks] * at src/NoThunks/Class.hs:230:18
  13624. 969.50 s [nothunks] * at src/NoThunks/Class.hs:230:1
  13625. 969.50 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13626. 969.50 s [nothunks] by specifying the type/value namespace explicitly.
  13627. 969.50 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  13628. 969.50 s [nothunks] Warning: 'GHC' is out of scope.
  13629. 969.50 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13630. 969.50 s [nothunks] Warning: 'a' is out of scope.
  13631. 969.50 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13632. 969.50 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  13633. 969.50 s [nothunks] Missing documentation for:
  13634. 969.50 s [nothunks] Module header
  13635. 969.65 s [scientific] quickcheck: OK (3.07s)
  13636. 969.65 s [scientific] +++ OK, passed 100 tests.
  13637. 969.65 s [scientific] RealFrac
  13638. 969.65 s [scientific] Equal to Rational
  13639. 969.65 s [scientific] properFraction
  13640. 969.67 s [scientific] smallcheck: OK
  13641. 969.67 s [scientific] 81 tests completed
  13642. 970.41 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  13643. 970.41 s [nothunks] - Data.Vector.Vector
  13644. 970.42 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  13645. 970.42 s [nothunks] - NoThunks.Class.HasFields
  13646. 970.42 s [nothunks] - NoThunks.Class.Elem
  13647. 970.42 s [nothunks] - NoThunks.Class.GShowTypeOf
  13648. 970.42 s [nothunks] - NoThunks.Class.GWRecordField
  13649. 970.42 s [nothunks] - NoThunks.Class.checkContainsThunks
  13650. 972.98 s [scientific] quickcheck: OK (3.32s)
  13651. 972.98 s [scientific] +++ OK, passed 100 tests.
  13652. 972.98 s [scientific] round
  13653. 972.98 s [scientific] smallcheck: OK
  13654. 972.98 s [scientific] 81 tests completed
  13655. 972.98 s [scientific] quickcheck: OK (0.01s)
  13656. 972.98 s [scientific] +++ OK, passed 100 tests.
  13657. 972.98 s [scientific] truncate
  13658. 972.98 s [scientific] smallcheck: OK
  13659. 972.99 s [scientific] 81 tests completed
  13660. 973.00 s [scientific] quickcheck: OK
  13661. 973.00 s [scientific] +++ OK, passed 100 tests.
  13662. 973.00 s [scientific] ceiling
  13663. 973.00 s [scientific] smallcheck: OK
  13664. 973.00 s [scientific] 81 tests completed
  13665. 973.01 s [scientific] quickcheck: OK (0.01s)
  13666. 973.01 s [scientific] +++ OK, passed 100 tests.
  13667. 973.01 s [scientific] floor
  13668. 973.01 s [scientific] smallcheck: OK
  13669. 973.01 s [scientific] 81 tests completed
  13670. 973.02 s [scientific] quickcheck: OK
  13671. 973.02 s [scientific] +++ OK, passed 100 tests.
  13672. 973.02 s [scientific] properFraction_laws
  13673. 973.03 s [scientific] smallcheck: OK
  13674. 973.03 s [scientific] 81 tests completed
  13675. 974.27 s [scientific] quickcheck: OK (1.25s)
  13676. 974.27 s [scientific] +++ OK, passed 100 tests.
  13677. 974.27 s [scientific] round
  13678. 974.28 s [scientific] smallcheck: OK
  13679. 974.28 s [scientific] 81 tests completed
  13680. 974.28 s [scientific] quickcheck: OK
  13681. 974.28 s [scientific] +++ OK, passed 100 tests.
  13682. 974.28 s [scientific] truncate
  13683. 974.28 s [scientific] smallcheck: OK
  13684. 974.28 s [scientific] 81 tests completed
  13685. 974.28 s [scientific] quickcheck: OK
  13686. 974.28 s [scientific] +++ OK, passed 100 tests.
  13687. 974.28 s [scientific] ceiling
  13688. 974.29 s [scientific] smallcheck: OK
  13689. 974.29 s [scientific] 81 tests completed
  13690. 974.29 s [scientific] quickcheck: OK
  13691. 974.29 s [scientific] +++ OK, passed 100 tests.
  13692. 974.29 s [scientific] floor
  13693. 974.30 s [scientific] smallcheck: OK
  13694. 974.30 s [scientific] 81 tests completed
  13695. 974.30 s [scientific] quickcheck: OK
  13696. 974.30 s [scientific] +++ OK, passed 100 tests.
  13697. 974.30 s [scientific] Conversions
  13698. 974.30 s [scientific] fromRationalRepetend
  13699. 974.30 s [scientific] smallcheck: OK
  13700. 974.30 s [scientific] 189 tests completed
  13701. 974.30 s [scientific] quickcheck: OK
  13702. 974.30 s [scientific] +++ OK, passed 100 tests.
  13703. 974.30 s [scientific] Float
  13704. 974.30 s [scientific] toRealFloat
  13705. 974.30 s [scientific] smallcheck: OK
  13706. 974.30 s [scientific] 37 tests completed
  13707. 974.30 s [scientific] quickcheck: OK
  13708. 974.30 s [scientific] +++ OK, passed 100 tests.
  13709. 974.30 s [scientific] toRealFloat . fromFloatDigits == id
  13710. 974.30 s [scientific] smallcheck: OK
  13711. 974.30 s [scientific] 37 tests completed
  13712. 974.30 s [scientific] quickcheck: OK
  13713. 974.30 s [scientific] +++ OK, passed 100 tests.
  13714. 974.30 s [scientific] Double
  13715. 974.30 s [scientific] toRealFloat
  13716. 974.31 s [scientific] smallcheck: OK
  13717. 974.31 s [scientific] 37 tests completed
  13718. 974.31 s [scientific] quickcheck: OK
  13719. 974.31 s [scientific] +++ OK, passed 100 tests.
  13720. 974.31 s [scientific] toRealFloat . fromFloatDigits == id
  13721. 974.31 s [scientific] smallcheck: OK
  13722. 974.31 s [scientific] 37 tests completed
  13723. 974.31 s [scientific] quickcheck: OK
  13724. 974.31 s [scientific] +++ OK, passed 100 tests.
  13725. 974.31 s [scientific] floatingOrInteger
  13726. 974.31 s [scientific] correct conversion
  13727. 974.31 s [scientific] smallcheck: OK
  13728. 974.31 s [scientific] 81 tests completed
  13729. 974.31 s [scientific] quickcheck: OK
  13730. 974.31 s [scientific] +++ OK, passed 100 tests.
  13731. 974.31 s [scientific] Integer == Right
  13732. 974.31 s [scientific] smallcheck: OK
  13733. 974.31 s [scientific] 11 tests completed
  13734. 974.31 s [scientific] quickcheck: OK
  13735. 974.31 s [scientific] +++ OK, passed 100 tests.
  13736. 974.31 s [scientific] Double == Left
  13737. 974.31 s [scientific] smallcheck: OK
  13738. 974.31 s [scientific] 37 tests completed (but 21 did not meet the condition)
  13739. 974.31 s [scientific] quickcheck: OK
  13740. 974.31 s [scientific] +++ OK, passed 100 tests; 58 discarded.
  13741. 974.31 s [scientific] toBoundedInteger
  13742. 974.31 s [scientific] correct conversion
  13743. 974.31 s [scientific] Int64
  13744. 974.31 s [scientific] smallcheck: OK
  13745. 974.31 s [scientific] 81 tests completed
  13746. 974.31 s [scientific] quickcheck: OK
  13747. 974.31 s [scientific] +++ OK, passed 100 tests.
  13748. 974.31 s [scientific] Word64
  13749. 974.31 s [scientific] smallcheck: OK
  13750. 974.31 s [scientific] 81 tests completed
  13751. 974.31 s [scientific] quickcheck: OK
  13752. 974.31 s [scientific] +++ OK, passed 100 tests.
  13753. 974.31 s [scientific] NegativeNum
  13754. 974.31 s [scientific] smallcheck: OK
  13755. 974.31 s [scientific] 81 tests completed
  13756. 974.31 s [scientific] quickcheck: OK
  13757. 974.31 s [scientific] +++ OK, passed 100 tests.
  13758. 974.31 s [scientific] toBoundedRealFloat
  13759. 974.31 s [scientific] 0 * 10^1000 == 0: OK
  13760. 974.31 s [scientific] toBoundedInteger
  13761. 974.31 s [scientific] to Int64
  13762. 974.31 s [scientific] succ of maxBound: OK
  13763. 974.31 s [scientific] pred of minBound: OK
  13764. 974.31 s [scientific] 0 * 10^1000 == 0: OK
  13765. 974.31 s [scientific] Predicates
  13766. 974.31 s [scientific] isFloating
  13767. 974.33 s [scientific] smallcheck: OK
  13768. 974.33 s [scientific] 81 tests completed
  13769. 974.60 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  13770. 974.68 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  13771. 974.69 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
  13772. 974.70 s [nothunks] Phase: installPhase
  13773. 974.80 s [nothunks] Installing library in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13774. 975.25 s [nothunks] Phase: fixupPhase
  13775. 975.31 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
  13776. 975.32 s [nothunks] shrinking /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSnothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg-ghc9.8.1.so
  13777. 975.33 s [nothunks] checking for references to /build/ in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0...
  13778. 975.36 s [nothunks] patching script interpreter paths in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
  13779. 975.38 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib
  13780. 975.39 s [scientific] quickcheck: OK (1.08s)
  13781. 975.39 s [scientific] +++ OK, passed 100 tests.
  13782. 975.39 s [scientific] isInteger
  13783. 975.41 s [scientific] smallcheck: OK
  13784. 975.41 s [scientific] 81 tests completed
  13785. 975.51 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc
  13786. 975.52 s [nothunks] checking for references to /build/ in /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc...
  13787. 975.53 s [nothunks] patching script interpreter paths in /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc
  13788. 975.90 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
  13789. 977.19 s [nothunks:post-build] Pushing 2 paths (96 are already present) using zstd to cache sellout ⏳
  13790. 977.19 s [nothunks:post-build]
  13791. 977.56 s [nothunks:post-build] Pushing /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc (841.92 KiB)
  13792. 977.73 s [nothunks:post-build] Pushing /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0 (2.71 MiB)
  13793. 978.86 s [nothunks:post-build]
  13794. 978.86 s [nothunks:post-build] All done.
  13795. 979.01 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
  13796. 979.46 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13797. 979.80 s [nothunks:post-build] copying 2 paths...
  13798. 979.84 s [nothunks:post-build] copying path '/nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
  13799. 980.31 s [nothunks:post-build] copying path '/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
  13800. 982.07 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13801. 982.49 s [nothunks:post-build] copying 1 paths...
  13802. 982.49 s [nothunks:post-build] copying path '/nix/store/w1l3ywx2hi2wfc49gx8mlzxfb6sxzkmw-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  13803. 982.92 s Progress: 36 of 46 built (1 building)
  13804. 982.98 s Building /nix/store/sl4dwg6r5dr8h3npvwjsv9kdvg0gwxn6-unordered-containers-0.2.20.drv
  13805. 982.98 s [scientific] quickcheck: OK (0.50s)
  13806. 982.98 s [scientific] +++ OK, passed 100 tests.
  13807. 982.98 s [scientific]
  13808. 982.99 s [scientific] All 142 tests passed (22.79s)
  13809. 982.99 s [scientific] Test suite test-scientific: PASS
  13810. 982.99 s [scientific] Test suite logged to: dist/test/scientific-0.3.8.0-test-scientific.log
  13811. 982.99 s [scientific] 1 of 1 test suites (1 of 1 test cases) passed.
  13812. 982.99 s [scientific] Phase: haddockPhase
  13813. 982.99 s [scientific] Preprocessing library for scientific-0.3.8.0..
  13814. 982.99 s [scientific] Running Haddock on library for scientific-0.3.8.0..
  13815. 982.99 s [scientific] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  13816. 982.99 s [scientific] [1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, nothing )
  13817. 982.99 s [scientific] [2 of 5] Compiling Utils ( src/Utils.hs, nothing )
  13818. 982.99 s [scientific] [3 of 5] Compiling Data.Scientific ( src/Data/Scientific.hs, nothing )
  13819. 982.99 s [scientific] [4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, nothing )
  13820. 982.99 s [scientific]
  13821. 982.99 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:19:1: warning: [GHC-66111] [-Wunused-imports]
  13822. 982.99 s [scientific] The import of ‘Data.Monoid’ is redundant
  13823. 982.99 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  13824. 982.99 s [scientific] To import instances alone, use: import Data.Monoid()
  13825. 982.99 s [scientific] |
  13826. 982.99 s [scientific] 19 | import Data.Monoid ((<>))
  13827. 982.99 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13828. 982.99 s [scientific] [5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, nothing )
  13829. 982.99 s [scientific]
  13830. 982.99 s [scientific] src/Data/ByteString/Builder/Scientific.hs:20:1: warning: [GHC-66111] [-Wunused-imports]
  13831. 982.99 s [scientific] The import of ‘Data.Monoid’ is redundant
  13832. 982.99 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  13833. 982.99 s [scientific] To import instances alone, use: import Data.Monoid()
  13834. 982.99 s [scientific] |
  13835. 982.99 s [scientific] 20 | import Data.Monoid ((<>))
  13836. 982.99 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13837. 982.99 s [scientific] Haddock coverage:
  13838. 982.99 s [scientific] Warning: 'Scientific' is ambiguous. It is defined
  13839. 982.99 s [scientific] * at src/Data/Scientific.hs:139:19
  13840. 982.99 s [scientific] * at src/Data/Scientific.hs:139:1
  13841. 982.99 s [scientific] You may be able to disambiguate the identifier by qualifying it or
  13842. 982.99 s [scientific] by specifying the type/value namespace explicitly.
  13843. 982.99 s [scientific] Defaulting to the one defined at src/Data/Scientific.hs:139:1
  13844. 982.99 s [scientific] Warning: 'base10exponent' is out of scope.
  13845. 982.99 s [scientific] If you qualify the identifier, haddock can try to link it anyway.
  13846. 982.99 s [scientific] Warning: 'base10Exponent' is out of scope.
  13847. 982.99 s [scientific] If you qualify the identifier, haddock can try to link it anyway.
  13848. 982.99 s [scientific] 100% ( 31 / 31) in 'Data.Scientific'
  13849. 982.99 s [scientific] 75% ( 3 / 4) in 'Data.Text.Lazy.Builder.Scientific'
  13850. 982.99 s [scientific] Missing documentation for:
  13851. 982.99 s [scientific] Module header
  13852. 982.99 s [scientific] 75% ( 3 / 4) in 'Data.ByteString.Builder.Scientific'
  13853. 982.99 s [scientific] Missing documentation for:
  13854. 982.99 s [scientific] Module header
  13855. 982.99 s [scientific] Documentation created: dist/doc/html/scientific/,
  13856. 982.99 s [scientific] dist/doc/html/scientific/scientific.txt
  13857. 982.99 s [scientific] Preprocessing test suite 'test-scientific' for scientific-0.3.8.0..
  13858. 982.99 s [scientific] Phase: installPhase
  13859. 982.99 s [scientific] Installing library in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  13860. 983.13 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  13861. 983.14 s [unordered-containers] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  13862. 983.37 s [scientific] Phase: fixupPhase
  13863. 983.45 s [scientific] shrinking RPATHs of ELF executables and libraries in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
  13864. 983.46 s [scientific] shrinking /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSscientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X-ghc9.8.1.so
  13865. 983.47 s [scientific] checking for references to /build/ in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0...
  13866. 983.50 s [scientific] patching script interpreter paths in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
  13867. 983.51 s [scientific] stripping (with command strip and flags -S -p) in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib
  13868. 983.53 s [unordered-containers] Phase: unpackPhase
  13869. 983.54 s [unordered-containers] unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
  13870. 983.57 s [unordered-containers] source root is unordered-containers-0.2.20
  13871. 983.59 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
  13872. 983.61 s [unordered-containers] Phase: patchPhase
  13873. 983.62 s [unordered-containers] Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
  13874. 983.64 s [unordered-containers] Phase: compileBuildDriverPhase
  13875. 983.65 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.2oC7ggLua1/setup-package.conf.d -threaded
  13876. 983.72 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.2oC7ggLua1/Main.o )
  13877. 983.72 s [scientific] shrinking RPATHs of ELF executables and libraries in /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc
  13878. 983.73 s [scientific] checking for references to /build/ in /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc...
  13879. 983.74 s [scientific] patching script interpreter paths in /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc
  13880. 983.94 s [scientific:post-build] Uploading to cachix cache "sellout": /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
  13881. 985.06 s [scientific:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  13882. 985.06 s [scientific:post-build]
  13883. 985.47 s [scientific:post-build] Pushing /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc (988.15 KiB)
  13884. 985.71 s [scientific:post-build] Pushing /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0 (2.93 MiB)
  13885. 986.72 s [scientific:post-build]
  13886. 986.72 s [scientific:post-build] All done.
  13887. 986.81 s [scientific:post-build] Uploading to the NixCI cache: /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
  13888. 986.98 s [scientific:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13889. 987.30 s [scientific:post-build] copying 2 paths...
  13890. 987.31 s [scientific:post-build] copying path '/nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc' to 'https://cache.nix-ci.com'...
  13891. 987.80 s [scientific:post-build] copying path '/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0' to 'https://cache.nix-ci.com'...
  13892. 989.94 s [scientific:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13893. 990.35 s [scientific:post-build] copying 1 paths...
  13894. 990.35 s [scientific:post-build] copying path '/nix/store/kmwyd33dsb5b986dg2s1ywr8cchd9p33-scientific-0.3.8.0.drv' to 'https://cache.nix-ci.com'...
  13895. 990.78 s Progress: 37 of 46 built (1 building)
  13896. 990.78 s [unordered-containers] [2 of 2] Linking Setup
  13897. 990.78 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  13898. 990.82 s [unordered-containers] Phase: configurePhase
  13899. 990.82 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.2oC7ggLua1/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  13900. 990.82 s [unordered-containers] Using Parsec parser
  13901. 990.82 s [unordered-containers] Configuring unordered-containers-0.2.20...
  13902. 990.82 s [unordered-containers] Flags chosen: debug=False
  13903. 990.82 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.19.0.0
  13904. 990.82 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  13905. 990.82 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  13906. 990.82 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.21.0.0
  13907. 990.82 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
  13908. 990.82 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  13909. 990.82 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
  13910. 990.82 s [unordered-containers] Dependency base: using base-4.19.0.0
  13911. 990.82 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.8
  13912. 990.82 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  13913. 990.83 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
  13914. 990.83 s [unordered-containers] Dependency random: using random-1.2.1.3
  13915. 990.83 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  13916. 990.83 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  13917. 990.83 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
  13918. 990.83 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20
  13919. 990.83 s [unordered-containers] Source component graph:
  13920. 990.83 s [unordered-containers] component lib
  13921. 990.83 s [unordered-containers] component test:unordered-containers-tests dependency lib
  13922. 990.83 s [unordered-containers] Configured component graph:
  13923. 990.83 s [unordered-containers] component unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  13924. 990.83 s [unordered-containers] include base-4.19.0.0-b960
  13925. 990.83 s [unordered-containers] include deepseq-1.5.0.0-412f
  13926. 990.83 s [unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  13927. 990.83 s [unordered-containers] include template-haskell-2.21.0.0-8831
  13928. 990.83 s [unordered-containers] component unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
  13929. 990.83 s [unordered-containers] include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
  13930. 990.83 s [unordered-containers] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
  13931. 990.83 s [unordered-containers] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  13932. 990.83 s [unordered-containers] include base-4.19.0.0-b960
  13933. 990.83 s [unordered-containers] include containers-0.6.8-4775
  13934. 990.83 s [unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  13935. 990.83 s [unordered-containers] include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13936. 990.83 s [unordered-containers] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  13937. 990.83 s [unordered-containers] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  13938. 990.83 s [unordered-containers] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  13939. 990.83 s [unordered-containers] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  13940. 990.83 s [unordered-containers] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  13941. 990.83 s [unordered-containers] Linked component graph:
  13942. 990.83 s [unordered-containers] unit unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  13943. 990.83 s [unordered-containers] include base-4.19.0.0-b960
  13944. 990.83 s [unordered-containers] include deepseq-1.5.0.0-412f
  13945. 990.83 s [unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  13946. 990.83 s [unordered-containers] include template-haskell-2.21.0.0-8831
  13947. 990.83 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet.Internal
  13948. 990.83 s [unordered-containers] unit unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
  13949. 990.83 s [unordered-containers] include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
  13950. 990.83 s [unordered-containers] include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
  13951. 990.83 s [unordered-containers] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  13952. 990.83 s [unordered-containers] include base-4.19.0.0-b960
  13953. 990.83 s [unordered-containers] include containers-0.6.8-4775
  13954. 990.83 s [unordered-containers] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  13955. 990.83 s [unordered-containers] include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13956. 990.83 s [unordered-containers] include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  13957. 990.83 s [unordered-containers] include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  13958. 990.83 s [unordered-containers] include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  13959. 990.83 s [unordered-containers] include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  13960. 990.83 s [unordered-containers] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  13961. 990.83 s [unordered-containers] Ready component graph:
  13962. 990.83 s [unordered-containers] definite unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  13963. 990.83 s [unordered-containers] depends base-4.19.0.0-b960
  13964. 990.83 s [unordered-containers] depends deepseq-1.5.0.0-412f
  13965. 990.83 s [unordered-containers] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  13966. 990.83 s [unordered-containers] depends template-haskell-2.21.0.0-8831
  13967. 990.83 s [unordered-containers] definite unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
  13968. 990.83 s [unordered-containers] depends ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
  13969. 990.83 s [unordered-containers] depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
  13970. 990.83 s [unordered-containers] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  13971. 990.83 s [unordered-containers] depends base-4.19.0.0-b960
  13972. 990.83 s [unordered-containers] depends containers-0.6.8-4775
  13973. 990.83 s [unordered-containers] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  13974. 990.83 s [unordered-containers] depends nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
  13975. 990.83 s [unordered-containers] depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
  13976. 990.83 s [unordered-containers] depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
  13977. 990.83 s [unordered-containers] depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
  13978. 990.83 s [unordered-containers] depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
  13979. 990.83 s [unordered-containers] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  13980. 990.83 s [unordered-containers] Using Cabal-3.10.2.0 compiled by ghc-9.8
  13981. 990.83 s [unordered-containers] Using compiler: ghc-9.8.1
  13982. 990.83 s [unordered-containers] Using install prefix:
  13983. 990.83 s [unordered-containers] /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
  13984. 990.83 s [unordered-containers] Executables installed in:
  13985. 990.83 s [unordered-containers] /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/bin
  13986. 990.83 s [unordered-containers] Libraries installed in:
  13987. 990.83 s [unordered-containers] /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  13988. 990.83 s [unordered-containers] Dynamic Libraries installed in:
  13989. 990.83 s [unordered-containers] /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  13990. 990.83 s [unordered-containers] Private executables installed in:
  13991. 990.83 s [unordered-containers] /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
  13992. 990.83 s [unordered-containers] Data files installed in:
  13993. 990.83 s [unordered-containers] /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
  13994. 990.83 s [unordered-containers] Documentation installed in:
  13995. 990.83 s [unordered-containers] /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
  13996. 990.83 s [unordered-containers] Configuration files installed in:
  13997. 990.83 s [unordered-containers] /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/etc
  13998. 990.83 s [unordered-containers] No alex found
  13999. 990.83 s [unordered-containers] Using ar found on system at:
  14000. 990.83 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  14001. 990.83 s [unordered-containers] No c2hs found
  14002. 990.83 s [unordered-containers] No cpphs found
  14003. 990.83 s [unordered-containers] No doctest found
  14004. 990.83 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  14005. 990.83 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  14006. 990.83 s [unordered-containers] Using ghc version 9.8.1 found on system at:
  14007. 990.83 s [unordered-containers] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  14008. 990.83 s [unordered-containers] Using ghc-pkg version 9.8.1 found on system at:
  14009. 990.83 s [unordered-containers] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  14010. 990.83 s [unordered-containers] No ghcjs found
  14011. 990.83 s [unordered-containers] No ghcjs-pkg found
  14012. 990.83 s [unordered-containers] No greencard found
  14013. 990.83 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  14014. 990.83 s [unordered-containers] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  14015. 990.83 s [unordered-containers] No happy found
  14016. 990.83 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  14017. 990.83 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14018. 990.83 s [unordered-containers] No hmake found
  14019. 990.83 s [unordered-containers] Using hpc version 0.69 found on system at:
  14020. 990.83 s [unordered-containers] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  14021. 990.83 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  14022. 990.83 s [unordered-containers] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  14023. 990.83 s [unordered-containers] Using hscolour version 1.25 found on system at:
  14024. 990.83 s [unordered-containers] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  14025. 990.83 s [unordered-containers] No jhc found
  14026. 990.83 s [unordered-containers] Using ld found on system at:
  14027. 990.83 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  14028. 990.83 s [unordered-containers] No pkg-config found
  14029. 990.83 s [unordered-containers] Using runghc version 9.8.1 found on system at:
  14030. 990.83 s [unordered-containers] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  14031. 990.83 s [unordered-containers] Using strip version 2.44 found on system at:
  14032. 990.83 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  14033. 990.83 s [unordered-containers] Using tar found on system at:
  14034. 990.83 s [unordered-containers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  14035. 990.83 s [unordered-containers] No uhc found
  14036. 990.83 s [unordered-containers] Phase: buildPhase
  14037. 990.83 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20..
  14038. 990.83 s [unordered-containers] Building library for unordered-containers-0.2.20..
  14039. 990.83 s [unordered-containers]
  14040. 990.83 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14041. 990.83 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14042. 990.83 s [unordered-containers] |
  14043. 990.83 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14044. 990.83 s [unordered-containers] | ^^^^^^^^^^
  14045. 990.84 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
  14046. 990.84 s [unordered-containers]
  14047. 990.84 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14048. 990.84 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14049. 990.84 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14050. 990.84 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14051. 990.84 s [unordered-containers] |
  14052. 990.84 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14053. 990.84 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14054. 990.84 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.o, dist/build/Data/HashMap/Internal/List.dyn_o )
  14055. 990.84 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
  14056. 996.92 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 )
  14057. 997.28 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 )
  14058. 999.38 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 )
  14059. 999.38 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  14060. 999.38 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 )
  14061. 999.41 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 )
  14062. 999.71 s [unordered-containers]
  14063. 999.71 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14064. 999.71 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14065. 999.71 s [unordered-containers] |
  14066. 999.71 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14067. 999.71 s [unordered-containers] | ^^^^^^^^^^
  14068. 999.92 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  14069. 1000.06 s [unordered-containers]
  14070. 1000.06 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14071. 1000.06 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14072. 1000.06 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14073. 1000.06 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14074. 1000.06 s [unordered-containers] |
  14075. 1000.06 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14076. 1000.06 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14077. 1000.83 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  14078. 1000.83 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  14079. 1010.42 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  14080. 1011.01 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  14081. 1013.24 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  14082. 1013.24 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  14083. 1013.24 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  14084. 1013.35 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  14085. 1014.48 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  14086. 1014.48 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  14087. 1014.64 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 )
  14088. 1014.86 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  14089. 1014.86 s [unordered-containers]
  14090. 1014.86 s [unordered-containers] tests/Regressions.hs:91:16: warning: [GHC-63394] [-Wx-partial]
  14091. 1014.86 s [unordered-containers] In the use of ‘head’
  14092. 1014.86 s [unordered-containers] (imported from Prelude, but defined in GHC.List):
  14093. 1014.86 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."
  14094. 1014.86 s [unordered-containers] |
  14095. 1014.86 s [unordered-containers] 91 | k = head keys
  14096. 1014.86 s [unordered-containers] | ^^^^
  14097. 1017.66 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 )
  14098. 1017.70 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  14099. 1017.70 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 )
  14100. 1017.70 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 )
  14101. 1024.38 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 )
  14102. 1024.42 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  14103. 1024.42 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  14104. 1025.00 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  14105. 1026.04 s [unordered-containers] buildPhase completed in 39 seconds
  14106. 1026.04 s [unordered-containers] Phase: checkPhase
  14107. 1026.08 s [unordered-containers] Running 1 test suites...
  14108. 1026.08 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  14109. 1026.11 s [unordered-containers] All
  14110. 1026.11 s [unordered-containers] Properties
  14111. 1026.11 s [unordered-containers] Data.HashMap.Lazy
  14112. 1026.11 s [unordered-containers] instances
  14113. 1026.11 s [unordered-containers] Eq
  14114. 1026.14 s [unordered-containers] ==: OK (0.04s)
  14115. 1026.14 s [unordered-containers] +++ OK, passed 100 tests.
  14116. 1026.14 s [unordered-containers] /=: OK (0.05s)
  14117. 1026.14 s [unordered-containers] +++ OK, passed 100 tests.
  14118. 1026.14 s [unordered-containers] Ord
  14119. 1026.18 s [unordered-containers] compare reflexive: OK (0.06s)
  14120. 1026.18 s [unordered-containers] +++ OK, passed 100 tests.
  14121. 1026.18 s [unordered-containers] compare transitive: OK (0.05s)
  14122. 1026.18 s [unordered-containers] +++ OK, passed 100 tests.
  14123. 1026.18 s [unordered-containers] compare antisymmetric: OK (0.05s)
  14124. 1026.18 s [unordered-containers] +++ OK, passed 100 tests.
  14125. 1026.18 s [unordered-containers] Ord => Eq: OK (0.05s)
  14126. 1026.18 s [unordered-containers] +++ OK, passed 100 tests.
  14127. 1026.40 s [unordered-containers] Read/Show: OK (0.30s)
  14128. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14129. 1026.40 s [unordered-containers] Functor: OK (0.16s)
  14130. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14131. 1026.40 s [unordered-containers] Foldable: OK (0.05s)
  14132. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14133. 1026.40 s [unordered-containers] Bifoldable
  14134. 1026.40 s [unordered-containers] bifoldMap: OK (0.03s)
  14135. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14136. 1026.40 s [unordered-containers] bifoldr: OK (0.04s)
  14137. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14138. 1026.40 s [unordered-containers] bifoldl: OK (0.05s)
  14139. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14140. 1026.40 s [unordered-containers] Hashable: OK (0.04s)
  14141. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14142. 1026.40 s [unordered-containers] empty
  14143. 1026.40 s [unordered-containers] valid: OK
  14144. 1026.40 s [unordered-containers] +++ OK, passed 1 test.
  14145. 1026.40 s [unordered-containers] singleton
  14146. 1026.40 s [unordered-containers] valid: OK
  14147. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14148. 1026.40 s [unordered-containers] size: OK (0.02s)
  14149. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14150. 1026.40 s [unordered-containers] member: OK (0.03s)
  14151. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14152. 1026.40 s [unordered-containers] lookup: OK (0.03s)
  14153. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14154. 1026.40 s [unordered-containers] !?: OK (0.03s)
  14155. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14156. 1026.40 s [unordered-containers] insert
  14157. 1026.40 s [unordered-containers] model: OK (0.03s)
  14158. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14159. 1026.40 s [unordered-containers] valid: OK (0.02s)
  14160. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14161. 1026.40 s [unordered-containers] insertWith
  14162. 1026.40 s [unordered-containers] insertWith: OK (0.02s)
  14163. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14164. 1026.40 s [unordered-containers] valid: OK (0.01s)
  14165. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14166. 1026.40 s [unordered-containers] delete
  14167. 1026.40 s [unordered-containers] model: OK (0.03s)
  14168. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14169. 1026.40 s [unordered-containers] valid: OK (0.01s)
  14170. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14171. 1026.40 s [unordered-containers] adjust
  14172. 1026.40 s [unordered-containers] model: OK (0.03s)
  14173. 1026.40 s [unordered-containers] +++ OK, passed 100 tests.
  14174. 1026.41 s [unordered-containers] valid: OK (0.01s)
  14175. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14176. 1026.41 s [unordered-containers] update
  14177. 1026.41 s [unordered-containers] model: OK (0.04s)
  14178. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14179. 1026.41 s [unordered-containers] valid: OK (0.02s)
  14180. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14181. 1026.41 s [unordered-containers] alter
  14182. 1026.41 s [unordered-containers] model: OK (0.04s)
  14183. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14184. 1026.41 s [unordered-containers] valid: OK (0.01s)
  14185. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14186. 1026.41 s [unordered-containers] alterF
  14187. 1026.41 s [unordered-containers] model
  14188. 1026.41 s [unordered-containers] []: OK (0.12s)
  14189. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14190. 1026.41 s [unordered-containers] adjust: OK (0.03s)
  14191. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14192. 1026.41 s [unordered-containers] insert: OK (0.01s)
  14193. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14194. 1026.41 s [unordered-containers] insertWith: OK (0.03s)
  14195. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14196. 1026.41 s [unordered-containers] delete: OK (0.03s)
  14197. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14198. 1026.41 s [unordered-containers] lookup: OK (0.02s)
  14199. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14200. 1026.41 s [unordered-containers] valid: OK (0.04s)
  14201. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14202. 1026.41 s [unordered-containers] isSubmapOf
  14203. 1026.41 s [unordered-containers] model: OK (0.01s)
  14204. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14205. 1026.41 s [unordered-containers] m ⊆ m: OK (0.07s)
  14206. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14207. 1026.41 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  14208. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14209. 1026.41 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.02s)
  14210. 1026.41 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  14211. 1026.41 s [unordered-containers] m1\m2 ⊆ m1: OK (0.04s)
  14212. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14213. 1026.41 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  14214. 1026.41 s [unordered-containers] +++ OK, passed 100 tests; 190 discarded.
  14215. 1026.41 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  14216. 1026.41 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  14217. 1026.41 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  14218. 1026.41 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  14219. 1026.41 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.03s)
  14220. 1026.41 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  14221. 1026.41 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  14222. 1026.41 s [unordered-containers] +++ OK, passed 100 tests; 6 discarded.
  14223. 1026.41 s [unordered-containers] union
  14224. 1026.41 s [unordered-containers] model: OK (0.07s)
  14225. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14226. 1026.41 s [unordered-containers] valid: OK (0.02s)
  14227. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14228. 1026.41 s [unordered-containers] unionWith
  14229. 1026.41 s [unordered-containers] model: OK (0.04s)
  14230. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14231. 1026.41 s [unordered-containers] valid: OK (0.06s)
  14232. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14233. 1026.41 s [unordered-containers] unionWithKey
  14234. 1026.41 s [unordered-containers] model: OK (0.11s)
  14235. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14236. 1026.41 s [unordered-containers] valid: OK (0.02s)
  14237. 1026.41 s [unordered-containers] +++ OK, passed 100 tests.
  14238. 1026.41 s [unordered-containers] unions
  14239. 1027.86 s [unordered-containers] model: OK (1.65s)
  14240. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14241. 1027.86 s [unordered-containers] valid: OK (0.70s)
  14242. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14243. 1027.86 s [unordered-containers] difference
  14244. 1027.86 s [unordered-containers] model: OK (0.05s)
  14245. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14246. 1027.86 s [unordered-containers] valid: OK (0.03s)
  14247. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14248. 1027.86 s [unordered-containers] differenceWith
  14249. 1027.86 s [unordered-containers] model: OK (0.06s)
  14250. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14251. 1027.86 s [unordered-containers] valid: OK (0.02s)
  14252. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14253. 1027.86 s [unordered-containers] intersection
  14254. 1027.86 s [unordered-containers] model: OK (0.03s)
  14255. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14256. 1027.86 s [unordered-containers] valid: OK (0.04s)
  14257. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14258. 1027.86 s [unordered-containers] intersectionWith
  14259. 1027.86 s [unordered-containers] model: OK (0.09s)
  14260. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14261. 1027.86 s [unordered-containers] valid: OK (0.03s)
  14262. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14263. 1027.86 s [unordered-containers] intersectionWithKey
  14264. 1027.86 s [unordered-containers] model: OK (0.13s)
  14265. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14266. 1027.86 s [unordered-containers] valid: OK (0.04s)
  14267. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14268. 1027.86 s [unordered-containers] compose
  14269. 1027.86 s [unordered-containers] valid: OK (0.03s)
  14270. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14271. 1027.86 s [unordered-containers] map
  14272. 1027.86 s [unordered-containers] model: OK (0.10s)
  14273. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14274. 1027.86 s [unordered-containers] valid: OK (0.03s)
  14275. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14276. 1027.86 s [unordered-containers] traverseWithKey
  14277. 1027.86 s [unordered-containers] model: OK (0.17s)
  14278. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14279. 1027.86 s [unordered-containers] valid: OK (0.05s)
  14280. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14281. 1027.86 s [unordered-containers] mapKeys
  14282. 1027.86 s [unordered-containers] model: OK (0.01s)
  14283. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14284. 1027.86 s [unordered-containers] valid: OK (0.71s)
  14285. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14286. 1027.86 s [unordered-containers] foldr: OK (0.03s)
  14287. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14288. 1027.86 s [unordered-containers] foldl: OK (0.03s)
  14289. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14290. 1027.86 s [unordered-containers] foldrWithKey: OK (0.01s)
  14291. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14292. 1027.86 s [unordered-containers] foldlWithKey: OK (0.03s)
  14293. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14294. 1027.86 s [unordered-containers] foldrWithKey': OK (0.05s)
  14295. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14296. 1027.86 s [unordered-containers] foldlWithKey': OK (0.04s)
  14297. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14298. 1027.86 s [unordered-containers] foldl': OK (0.03s)
  14299. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14300. 1027.86 s [unordered-containers] foldr': OK (0.02s)
  14301. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14302. 1027.86 s [unordered-containers] foldMapWithKey: OK (0.08s)
  14303. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14304. 1027.86 s [unordered-containers] filter
  14305. 1027.86 s [unordered-containers] model: OK (0.12s)
  14306. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14307. 1027.86 s [unordered-containers] valid: OK (0.10s)
  14308. 1027.86 s [unordered-containers] +++ OK, passed 100 tests.
  14309. 1027.86 s [unordered-containers] filterWithKey
  14310. 1028.05 s [unordered-containers] model: OK (1.76s)
  14311. 1028.05 s [unordered-containers] +++ OK, passed 100 tests.
  14312. 1028.05 s [unordered-containers] valid: OK (1.34s)
  14313. 1028.05 s [unordered-containers] +++ OK, passed 100 tests.
  14314. 1028.05 s [unordered-containers] mapMaybe
  14315. 1028.05 s [unordered-containers] model: OK (0.28s)
  14316. 1028.05 s [unordered-containers] +++ OK, passed 100 tests.
  14317. 1028.05 s [unordered-containers] valid: OK (0.04s)
  14318. 1028.05 s [unordered-containers] +++ OK, passed 100 tests.
  14319. 1028.05 s [unordered-containers] mapMaybeWithKey
  14320. 1028.14 s [unordered-containers] model: OK (1.83s)
  14321. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14322. 1028.14 s [unordered-containers] valid: OK (1.21s)
  14323. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14324. 1028.14 s [unordered-containers] elems: OK (0.02s)
  14325. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14326. 1028.14 s [unordered-containers] keys: OK (0.07s)
  14327. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14328. 1028.14 s [unordered-containers] fromList
  14329. 1028.14 s [unordered-containers] model: OK (0.02s)
  14330. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14331. 1028.14 s [unordered-containers] valid: OK (0.04s)
  14332. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14333. 1028.14 s [unordered-containers] fromListWith
  14334. 1028.14 s [unordered-containers] model: OK (0.03s)
  14335. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14336. 1028.14 s [unordered-containers] valid: OK (0.03s)
  14337. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14338. 1028.14 s [unordered-containers] fromListWithKey
  14339. 1028.14 s [unordered-containers] model: OK (0.01s)
  14340. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14341. 1028.14 s [unordered-containers] valid: OK (0.02s)
  14342. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14343. 1028.14 s [unordered-containers] toList: OK (0.02s)
  14344. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14345. 1028.14 s [unordered-containers] Data.HashMap.Strict
  14346. 1028.14 s [unordered-containers] instances
  14347. 1028.14 s [unordered-containers] Eq
  14348. 1028.14 s [unordered-containers] ==: OK (0.05s)
  14349. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14350. 1028.14 s [unordered-containers] /=: OK (0.08s)
  14351. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14352. 1028.14 s [unordered-containers] Ord
  14353. 1028.14 s [unordered-containers] compare reflexive: OK (0.06s)
  14354. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14355. 1028.14 s [unordered-containers] compare transitive: OK (0.07s)
  14356. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14357. 1028.14 s [unordered-containers] compare antisymmetric: OK (0.02s)
  14358. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14359. 1028.14 s [unordered-containers] Ord => Eq: OK (0.02s)
  14360. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14361. 1028.14 s [unordered-containers] Read/Show: OK (0.66s)
  14362. 1028.14 s [unordered-containers] +++ OK, passed 100 tests.
  14363. 1028.15 s [unordered-containers] Functor: OK (0.24s)
  14364. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14365. 1028.15 s [unordered-containers] Foldable: OK (0.02s)
  14366. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14367. 1028.15 s [unordered-containers] Bifoldable
  14368. 1028.15 s [unordered-containers] bifoldMap: OK (0.01s)
  14369. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14370. 1028.15 s [unordered-containers] bifoldr: OK (0.07s)
  14371. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14372. 1028.15 s [unordered-containers] bifoldl: OK (0.05s)
  14373. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14374. 1028.15 s [unordered-containers] Hashable: OK (0.07s)
  14375. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14376. 1028.15 s [unordered-containers] empty
  14377. 1028.15 s [unordered-containers] valid: OK
  14378. 1028.15 s [unordered-containers] +++ OK, passed 1 test.
  14379. 1028.15 s [unordered-containers] singleton
  14380. 1028.15 s [unordered-containers] valid: OK
  14381. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14382. 1028.15 s [unordered-containers] size: OK (0.03s)
  14383. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14384. 1028.15 s [unordered-containers] member: OK (0.02s)
  14385. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14386. 1028.15 s [unordered-containers] lookup: OK (0.03s)
  14387. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14388. 1028.15 s [unordered-containers] !?: OK (0.08s)
  14389. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14390. 1028.15 s [unordered-containers] insert
  14391. 1028.15 s [unordered-containers] model: OK (0.10s)
  14392. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14393. 1028.15 s [unordered-containers] valid: OK (0.08s)
  14394. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14395. 1028.15 s [unordered-containers] insertWith
  14396. 1028.15 s [unordered-containers] insertWith: OK (0.09s)
  14397. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14398. 1028.15 s [unordered-containers] valid: OK (0.09s)
  14399. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14400. 1028.15 s [unordered-containers] delete
  14401. 1028.15 s [unordered-containers] model: OK (0.09s)
  14402. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14403. 1028.15 s [unordered-containers] valid: OK (0.05s)
  14404. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14405. 1028.15 s [unordered-containers] adjust
  14406. 1028.15 s [unordered-containers] model: OK (0.09s)
  14407. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14408. 1028.15 s [unordered-containers] valid: OK (0.06s)
  14409. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14410. 1028.15 s [unordered-containers] update
  14411. 1028.15 s [unordered-containers] model: OK (0.06s)
  14412. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14413. 1028.15 s [unordered-containers] valid: OK
  14414. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14415. 1028.15 s [unordered-containers] alter
  14416. 1028.15 s [unordered-containers] model: OK (0.02s)
  14417. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14418. 1028.15 s [unordered-containers] valid: OK (0.01s)
  14419. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14420. 1028.15 s [unordered-containers] alterF
  14421. 1028.15 s [unordered-containers] model
  14422. 1028.15 s [unordered-containers] []: OK (0.23s)
  14423. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14424. 1028.15 s [unordered-containers] adjust: OK (0.04s)
  14425. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14426. 1028.15 s [unordered-containers] insert: OK (0.03s)
  14427. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14428. 1028.15 s [unordered-containers] insertWith: OK (0.03s)
  14429. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14430. 1028.15 s [unordered-containers] delete: OK (0.05s)
  14431. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14432. 1028.15 s [unordered-containers] lookup: OK (0.02s)
  14433. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14434. 1028.15 s [unordered-containers] valid: OK (0.03s)
  14435. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14436. 1028.15 s [unordered-containers] isSubmapOf
  14437. 1028.15 s [unordered-containers] model: OK (0.02s)
  14438. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14439. 1028.15 s [unordered-containers] m ⊆ m: OK (0.03s)
  14440. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14441. 1028.15 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.16s)
  14442. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14443. 1028.15 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.05s)
  14444. 1028.15 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14445. 1028.15 s [unordered-containers] m1\m2 ⊆ m1: OK (0.03s)
  14446. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14447. 1028.15 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.06s)
  14448. 1028.15 s [unordered-containers] +++ OK, passed 100 tests; 166 discarded.
  14449. 1028.15 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  14450. 1028.15 s [unordered-containers] +++ OK, passed 100 tests; 20 discarded.
  14451. 1028.15 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  14452. 1028.15 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  14453. 1028.15 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.04s)
  14454. 1028.15 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  14455. 1028.15 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  14456. 1028.15 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  14457. 1028.15 s [unordered-containers] union
  14458. 1028.15 s [unordered-containers] model: OK (0.13s)
  14459. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14460. 1028.15 s [unordered-containers] valid: OK (0.07s)
  14461. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14462. 1028.15 s [unordered-containers] unionWith
  14463. 1028.15 s [unordered-containers] model: OK (0.15s)
  14464. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14465. 1028.15 s [unordered-containers] valid: OK (0.08s)
  14466. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14467. 1028.15 s [unordered-containers] unionWithKey
  14468. 1028.15 s [unordered-containers] model: OK (0.15s)
  14469. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14470. 1028.15 s [unordered-containers] valid: OK (0.09s)
  14471. 1028.15 s [unordered-containers] +++ OK, passed 100 tests.
  14472. 1028.15 s [unordered-containers] unions
  14473. 1028.18 s [unordered-containers] model: OK (1.40s)
  14474. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14475. 1028.18 s [unordered-containers] valid: OK (0.84s)
  14476. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14477. 1028.18 s [unordered-containers] difference
  14478. 1028.18 s [unordered-containers] model: OK (0.14s)
  14479. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14480. 1028.18 s [unordered-containers] valid: OK (0.03s)
  14481. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14482. 1028.18 s [unordered-containers] differenceWith
  14483. 1028.18 s [unordered-containers] model: OK (0.14s)
  14484. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14485. 1028.18 s [unordered-containers] valid: OK (0.14s)
  14486. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14487. 1028.18 s [unordered-containers] intersection
  14488. 1028.18 s [unordered-containers] model: OK (0.05s)
  14489. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14490. 1028.18 s [unordered-containers] valid: OK (0.02s)
  14491. 1028.18 s [unordered-containers] +++ OK, passed 100 tests.
  14492. 1028.19 s [unordered-containers] intersectionWith
  14493. 1028.19 s [unordered-containers] model: OK (0.11s)
  14494. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14495. 1028.19 s [unordered-containers] valid: OK (0.09s)
  14496. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14497. 1028.19 s [unordered-containers] intersectionWithKey
  14498. 1028.19 s [unordered-containers] model: OK (0.19s)
  14499. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14500. 1028.19 s [unordered-containers] valid: OK (0.10s)
  14501. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14502. 1028.19 s [unordered-containers] compose
  14503. 1028.19 s [unordered-containers] valid: OK (0.05s)
  14504. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14505. 1028.19 s [unordered-containers] map
  14506. 1028.19 s [unordered-containers] model: OK (0.17s)
  14507. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14508. 1028.19 s [unordered-containers] valid: OK (0.14s)
  14509. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14510. 1028.19 s [unordered-containers] traverseWithKey
  14511. 1028.19 s [unordered-containers] model: OK (0.29s)
  14512. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14513. 1028.19 s [unordered-containers] valid: OK (0.02s)
  14514. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14515. 1028.19 s [unordered-containers] mapKeys
  14516. 1028.19 s [unordered-containers] model: OK
  14517. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14518. 1028.19 s [unordered-containers] valid: OK (0.65s)
  14519. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14520. 1028.19 s [unordered-containers] foldr: OK (0.05s)
  14521. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14522. 1028.19 s [unordered-containers] foldl: OK
  14523. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14524. 1028.19 s [unordered-containers] foldrWithKey: OK (0.04s)
  14525. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14526. 1028.19 s [unordered-containers] foldlWithKey: OK (0.02s)
  14527. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14528. 1028.19 s [unordered-containers] foldrWithKey': OK (0.05s)
  14529. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14530. 1028.19 s [unordered-containers] foldlWithKey': OK (0.03s)
  14531. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14532. 1028.19 s [unordered-containers] foldl': OK
  14533. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14534. 1028.19 s [unordered-containers] foldr': OK (0.02s)
  14535. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14536. 1028.19 s [unordered-containers] foldMapWithKey: OK (0.02s)
  14537. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14538. 1028.19 s [unordered-containers] filter
  14539. 1028.19 s [unordered-containers] model: OK (0.11s)
  14540. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14541. 1028.19 s [unordered-containers] valid: OK (0.07s)
  14542. 1028.19 s [unordered-containers] +++ OK, passed 100 tests.
  14543. 1028.19 s [unordered-containers] filterWithKey
  14544. 1028.20 s [unordered-containers] model: OK (1.11s)
  14545. 1028.20 s [unordered-containers] +++ OK, passed 100 tests.
  14546. 1028.20 s [unordered-containers] valid: OK (0.86s)
  14547. 1028.20 s [unordered-containers] +++ OK, passed 100 tests.
  14548. 1028.20 s [unordered-containers] mapMaybe
  14549. 1028.20 s [unordered-containers] model: OK (0.14s)
  14550. 1028.20 s [unordered-containers] +++ OK, passed 100 tests.
  14551. 1028.20 s [unordered-containers] valid: OK (0.14s)
  14552. 1028.20 s [unordered-containers] +++ OK, passed 100 tests.
  14553. 1028.20 s [unordered-containers] mapMaybeWithKey
  14554. 1028.27 s [unordered-containers] model: OK (1.13s)
  14555. 1028.27 s [unordered-containers] +++ OK, passed 100 tests.
  14556. 1028.27 s [unordered-containers] valid: OK (0.80s)
  14557. 1028.27 s [unordered-containers] +++ OK, passed 100 tests.
  14558. 1028.27 s [unordered-containers] elems: OK (0.04s)
  14559. 1028.27 s [unordered-containers] +++ OK, passed 100 tests.
  14560. 1028.27 s [unordered-containers] keys: OK (0.04s)
  14561. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14562. 1028.28 s [unordered-containers] fromList
  14563. 1028.28 s [unordered-containers] model: OK (0.02s)
  14564. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14565. 1028.28 s [unordered-containers] valid: OK (0.05s)
  14566. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14567. 1028.28 s [unordered-containers] fromListWith
  14568. 1028.28 s [unordered-containers] model: OK (0.03s)
  14569. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14570. 1028.28 s [unordered-containers] valid: OK (0.04s)
  14571. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14572. 1028.28 s [unordered-containers] fromListWithKey
  14573. 1028.28 s [unordered-containers] model: OK (0.04s)
  14574. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14575. 1028.28 s [unordered-containers] valid: OK (0.06s)
  14576. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14577. 1028.28 s [unordered-containers] toList: OK (0.03s)
  14578. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14579. 1028.28 s [unordered-containers] Data.HashSet
  14580. 1028.28 s [unordered-containers] instances
  14581. 1028.28 s [unordered-containers] Eq
  14582. 1028.28 s [unordered-containers] ==: OK (0.02s)
  14583. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14584. 1028.28 s [unordered-containers] == permutations: OK (0.03s)
  14585. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14586. 1028.28 s [unordered-containers] /=: OK (0.03s)
  14587. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14588. 1028.28 s [unordered-containers] Ord
  14589. 1028.28 s [unordered-containers] compare reflexive: OK (0.05s)
  14590. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14591. 1028.28 s [unordered-containers] compare transitive: OK (0.07s)
  14592. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14593. 1028.28 s [unordered-containers] compare antisymmetric: OK (0.03s)
  14594. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14595. 1028.28 s [unordered-containers] Ord => Eq: OK (0.08s)
  14596. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14597. 1028.28 s [unordered-containers] Read/Show: OK (0.38s)
  14598. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14599. 1028.28 s [unordered-containers] Foldable: OK (0.07s)
  14600. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14601. 1028.28 s [unordered-containers] Hashable: OK (0.09s)
  14602. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14603. 1028.28 s [unordered-containers] size: OK (0.04s)
  14604. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14605. 1028.28 s [unordered-containers] member: OK (0.03s)
  14606. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14607. 1028.28 s [unordered-containers] insert: OK (0.01s)
  14608. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14609. 1028.28 s [unordered-containers] delete: OK (0.03s)
  14610. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14611. 1028.28 s [unordered-containers] union: OK (0.03s)
  14612. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14613. 1028.28 s [unordered-containers] map: OK (0.69s)
  14614. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14615. 1028.28 s [unordered-containers] foldr: OK (0.02s)
  14616. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14617. 1028.28 s [unordered-containers] foldl': OK
  14618. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14619. 1028.28 s [unordered-containers] filter: OK (0.69s)
  14620. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14621. 1028.28 s [unordered-containers] toList: OK (0.03s)
  14622. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14623. 1028.28 s [unordered-containers] Data.HashMap.Internal.List
  14624. 1028.28 s [unordered-containers] isPermutationBy: OK (0.03s)
  14625. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14626. 1028.28 s [unordered-containers] isPermutationBy of different length: OK (0.04s)
  14627. 1028.28 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  14628. 1028.28 s [unordered-containers] pUnorderedCompare: OK (0.07s)
  14629. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14630. 1028.28 s [unordered-containers] modelUnorderedCompare
  14631. 1028.28 s [unordered-containers] reflexive: OK (0.05s)
  14632. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14633. 1028.28 s [unordered-containers] anti-symmetric: OK (0.01s)
  14634. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14635. 1028.28 s [unordered-containers] transitive: OK (0.04s)
  14636. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14637. 1028.28 s [unordered-containers] Regression tests
  14638. 1028.28 s [unordered-containers] issue32: OK
  14639. 1028.28 s [unordered-containers] issue39a: OK
  14640. 1028.28 s [unordered-containers] issue39b: OK (0.01s)
  14641. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14642. 1028.28 s [unordered-containers] issue254 lazy: OK (0.05s)
  14643. 1028.28 s [unordered-containers] issue254 strict: OK
  14644. 1028.28 s [unordered-containers] issue379
  14645. 1028.28 s [unordered-containers] Lazy.unionWith: OK
  14646. 1028.28 s [unordered-containers] union: OK
  14647. 1028.28 s [unordered-containers] Strict.unionWith: OK
  14648. 1028.28 s [unordered-containers] Strict.unionWithKey: OK
  14649. 1028.28 s [unordered-containers] issue381
  14650. 1028.28 s [unordered-containers] mapMaybe: OK
  14651. 1028.28 s [unordered-containers] mapMaybeWithKey: OK
  14652. 1028.28 s [unordered-containers] issue382: OK
  14653. 1028.28 s [unordered-containers] issue383: OK (0.03s)
  14654. 1028.28 s [unordered-containers] issue420: OK
  14655. 1028.28 s [unordered-containers] Strictness
  14656. 1028.28 s [unordered-containers] HashMap.Strict
  14657. 1028.28 s [unordered-containers] singleton is key-strict: OK
  14658. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14659. 1028.28 s [unordered-containers] singleton is value-strict: OK
  14660. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14661. 1028.28 s [unordered-containers] member is key-strict: OK
  14662. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14663. 1028.28 s [unordered-containers] lookup is key-strict: OK
  14664. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14665. 1028.28 s [unordered-containers] lookupDefault is key-strict: OK
  14666. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14667. 1028.28 s [unordered-containers] findWithDefault is key-strict: OK
  14668. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14669. 1028.28 s [unordered-containers] ! is key-strict: OK
  14670. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14671. 1028.28 s [unordered-containers] delete is key-strict: OK (0.03s)
  14672. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14673. 1028.28 s [unordered-containers] adjust is key-strict: OK (0.04s)
  14674. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14675. 1028.28 s [unordered-containers] adjust is value-strict: OK (0.01s)
  14676. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14677. 1028.28 s [unordered-containers] insert is key-strict: OK
  14678. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14679. 1028.28 s [unordered-containers] insert is value-strict: OK
  14680. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14681. 1028.28 s [unordered-containers] insertWith is key-strict: OK
  14682. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14683. 1028.28 s [unordered-containers] insertWith is value-strict: OK (0.02s)
  14684. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14685. 1028.28 s [unordered-containers] fromList is key-strict: OK
  14686. 1028.28 s [unordered-containers] +++ OK, passed 1 test.
  14687. 1028.28 s [unordered-containers] fromList is value-strict: OK
  14688. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14689. 1028.28 s [unordered-containers] fromListWith is key-strict: OK
  14690. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14691. 1028.28 s [unordered-containers] fromListWith is value-strict: OK (0.02s)
  14692. 1028.28 s [unordered-containers] +++ OK, passed 100 tests.
  14693. 1028.28 s [unordered-containers]
  14694. 1028.28 s [unordered-containers] All 256 tests passed (2.19s)
  14695. 1028.30 s [unordered-containers] Test suite unordered-containers-tests: PASS
  14696. 1028.30 s [unordered-containers] Test suite logged to:
  14697. 1028.30 s [unordered-containers] dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
  14698. 1028.30 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  14699. 1028.31 s [unordered-containers] Phase: haddockPhase
  14700. 1028.46 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20..
  14701. 1028.47 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20..
  14702. 1028.52 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  14703. 1028.69 s [unordered-containers]
  14704. 1028.69 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14705. 1028.69 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14706. 1028.69 s [unordered-containers] |
  14707. 1028.69 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14708. 1028.69 s [unordered-containers] | ^^^^^^^^^^
  14709. 1028.95 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  14710. 1029.28 s [unordered-containers]
  14711. 1029.28 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14712. 1029.28 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14713. 1029.28 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14714. 1029.28 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14715. 1029.28 s [unordered-containers] |
  14716. 1029.28 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14717. 1029.28 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14718. 1029.29 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  14719. 1029.32 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  14720. 1030.67 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  14721. 1030.71 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  14722. 1030.90 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  14723. 1030.99 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  14724. 1031.00 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  14725. 1031.00 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  14726. 1031.01 s [unordered-containers] Haddock coverage:
  14727. 1031.01 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  14728. 1031.02 s [unordered-containers] Missing documentation for:
  14729. 1031.02 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  14730. 1031.02 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  14731. 1031.02 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  14732. 1031.02 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  14733. 1031.02 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  14734. 1031.02 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  14735. 1031.02 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  14736. 1031.02 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  14737. 1031.02 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  14738. 1031.02 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  14739. 1031.02 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  14740. 1031.02 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  14741. 1031.02 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  14742. 1031.02 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  14743. 1031.02 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  14744. 1031.02 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  14745. 1031.02 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  14746. 1031.02 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  14747. 1031.02 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  14748. 1031.02 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  14749. 1031.02 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  14750. 1031.02 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  14751. 1031.02 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  14752. 1031.02 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  14753. 1031.02 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  14754. 1031.02 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  14755. 1031.02 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  14756. 1031.02 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  14757. 1031.02 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  14758. 1031.02 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  14759. 1031.02 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  14760. 1031.02 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  14761. 1031.02 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  14762. 1031.02 s [unordered-containers] Missing documentation for:
  14763. 1031.02 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  14764. 1031.02 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  14765. 1031.02 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  14766. 1031.02 s [unordered-containers] Warning: 'hash' is ambiguous. It is defined
  14767. 1031.02 s [unordered-containers] * in ‘Data.Hashable.Class’
  14768. 1031.02 s [unordered-containers] * at Data/HashMap/Internal.hs:183:1
  14769. 1031.02 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14770. 1031.02 s [unordered-containers] by specifying the type/value namespace explicitly.
  14771. 1031.02 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:183:1
  14772. 1031.02 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  14773. 1031.02 s [unordered-containers] * at Data/HashMap/Internal.hs:225:7
  14774. 1031.02 s [unordered-containers] * at Data/HashMap/Internal.hs:185:1
  14775. 1031.02 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14776. 1031.02 s [unordered-containers] by specifying the type/value namespace explicitly.
  14777. 1031.02 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
  14778. 1031.02 s [unordered-containers] Warning: 'lookup' is ambiguous. It is defined
  14779. 1031.02 s [unordered-containers] * in ‘GHC.List’
  14780. 1031.02 s [unordered-containers] * at Data/HashMap/Internal.hs:632:1
  14781. 1031.02 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14782. 1031.02 s [unordered-containers] by specifying the type/value namespace explicitly.
  14783. 1031.02 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
  14784. 1031.03 s [unordered-containers] Warning: 'update' is ambiguous. It is defined
  14785. 1031.03 s [unordered-containers] * at Data/HashMap/Internal.hs:1289:1
  14786. 1031.03 s [unordered-containers] * at Data/HashMap/Internal/Array.hs:341:1
  14787. 1031.03 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14788. 1031.03 s [unordered-containers] by specifying the type/value namespace explicitly.
  14789. 1031.03 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Array.hs:341:1
  14790. 1031.03 s [unordered-containers] Warning: 'at' is out of scope.
  14791. 1031.03 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14792. 1031.03 s [unordered-containers] Warning: '!?' is ambiguous. It is defined
  14793. 1031.03 s [unordered-containers] * in ‘GHC.List’
  14794. 1031.03 s [unordered-containers] * at Data/HashMap/Internal.hs:741:1
  14795. 1031.03 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14796. 1031.03 s [unordered-containers] by specifying the type/value namespace explicitly.
  14797. 1031.03 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:741:1
  14798. 1031.04 s [unordered-containers] Warning: 'index' is ambiguous. It is defined
  14799. 1031.04 s [unordered-containers] * at Data/HashMap/Internal.hs:2460:1
  14800. 1031.04 s [unordered-containers] * at Data/HashMap/Internal/Array.hs:262:1
  14801. 1031.04 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14802. 1031.04 s [unordered-containers] by specifying the type/value namespace explicitly.
  14803. 1031.04 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Array.hs:262:1
  14804. 1031.04 s [unordered-containers] Warning: 'union' is ambiguous. It is defined
  14805. 1031.04 s [unordered-containers] * in ‘Data.OldList’
  14806. 1031.04 s [unordered-containers] * at Data/HashMap/Internal.hs:1586:1
  14807. 1031.04 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14808. 1031.04 s [unordered-containers] by specifying the type/value namespace explicitly.
  14809. 1031.04 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:1586:1
  14810. 1031.04 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  14811. 1031.04 s [unordered-containers] Missing documentation for:
  14812. 1031.04 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:185)
  14813. 1031.04 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1855)
  14814. 1031.04 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
  14815. 1031.04 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:511)
  14816. 1031.04 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:495)
  14817. 1031.04 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:678)
  14818. 1031.04 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:657)
  14819. 1031.04 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:660)
  14820. 1031.04 s [unordered-containers] insert' (Data/HashMap/Internal.hs:806)
  14821. 1031.04 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1124)
  14822. 1031.04 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:848)
  14823. 1031.04 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:883)
  14824. 1031.04 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  14825. 1031.04 s [unordered-containers] Missing documentation for:
  14826. 1031.04 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  14827. 1031.04 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  14828. 1031.04 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  14829. 1031.04 s [unordered-containers] Warning: 'update' is ambiguous. It is defined
  14830. 1031.04 s [unordered-containers] * at Data/HashMap/Internal.hs:1289:1
  14831. 1031.04 s [unordered-containers] * at Data/HashMap/Internal/Array.hs:341:1
  14832. 1031.04 s [unordered-containers] * at Data/HashMap/Internal/Strict.hs:296:1
  14833. 1031.04 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14834. 1031.04 s [unordered-containers] by specifying the type/value namespace explicitly.
  14835. 1031.04 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:296:1
  14836. 1031.04 s [unordered-containers] Warning: 'alter' is ambiguous. It is defined
  14837. 1031.04 s [unordered-containers] * at Data/HashMap/Internal.hs:1302:1
  14838. 1031.04 s [unordered-containers] * at Data/HashMap/Internal/Strict.hs:308:1
  14839. 1031.04 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14840. 1031.04 s [unordered-containers] by specifying the type/value namespace explicitly.
  14841. 1031.04 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:308:1
  14842. 1031.04 s [unordered-containers] Warning: 'lookup' is ambiguous. It is defined
  14843. 1031.04 s [unordered-containers] * in ‘GHC.List’
  14844. 1031.04 s [unordered-containers] * at Data/HashMap/Internal.hs:632:1
  14845. 1031.04 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14846. 1031.04 s [unordered-containers] by specifying the type/value namespace explicitly.
  14847. 1031.04 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
  14848. 1031.04 s [unordered-containers] Warning: 'alterF' is ambiguous. It is defined
  14849. 1031.04 s [unordered-containers] * at Data/HashMap/Internal.hs:1333:1
  14850. 1031.04 s [unordered-containers] * at Data/HashMap/Internal/Strict.hs:339:1
  14851. 1031.04 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14852. 1031.04 s [unordered-containers] by specifying the type/value namespace explicitly.
  14853. 1031.04 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:339:1
  14854. 1031.04 s [unordered-containers] Warning: 'at' is out of scope.
  14855. 1031.04 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14856. 1031.04 s [unordered-containers] Warning: 'map' is ambiguous. It is defined
  14857. 1031.04 s [unordered-containers] * in ‘GHC.Base’
  14858. 1031.04 s [unordered-containers] * at Data/HashMap/Internal.hs:1767:1
  14859. 1031.04 s [unordered-containers] * at Data/HashMap/Internal/Array.hs:461:1
  14860. 1031.04 s [unordered-containers] * at Data/HashMap/Internal/Strict.hs:557:1
  14861. 1031.04 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14862. 1031.04 s [unordered-containers] by specifying the type/value namespace explicitly.
  14863. 1031.04 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:557:1
  14864. 1031.05 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  14865. 1031.05 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14866. 1031.05 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14867. 1031.05 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14868. 1031.05 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14869. 1031.05 s [unordered-containers] by specifying the type/value namespace explicitly.
  14870. 1031.05 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14871. 1031.05 s [unordered-containers] Warning: 'empty' is ambiguous. It is defined
  14872. 1031.05 s [unordered-containers] * at Data/HashMap/Internal.hs:594:1
  14873. 1031.05 s [unordered-containers] * at Data/HashSet/Internal.hs:255:1
  14874. 1031.05 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14875. 1031.05 s [unordered-containers] by specifying the type/value namespace explicitly.
  14876. 1031.05 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:255:1
  14877. 1031.05 s [unordered-containers] Warning: 'union' is ambiguous. It is defined
  14878. 1031.05 s [unordered-containers] * in ‘Data.OldList’
  14879. 1031.05 s [unordered-containers] * at Data/HashMap/Internal.hs:1586:1
  14880. 1031.05 s [unordered-containers] * at Data/HashSet/Internal.hs:310:1
  14881. 1031.05 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14882. 1031.05 s [unordered-containers] by specifying the type/value namespace explicitly.
  14883. 1031.05 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:310:1
  14884. 1031.05 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  14885. 1031.05 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14886. 1031.05 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14887. 1031.05 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14888. 1031.05 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14889. 1031.05 s [unordered-containers] by specifying the type/value namespace explicitly.
  14890. 1031.05 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14891. 1031.05 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  14892. 1031.05 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  14893. 1031.06 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  14894. 1031.32 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  14895. 1031.32 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14896. 1031.32 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  14897. 1031.32 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14898. 1031.32 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  14899. 1031.32 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14900. 1031.32 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  14901. 1031.32 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14902. 1031.33 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  14903. 1031.33 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14904. 1031.33 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  14905. 1031.33 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14906. 1034.91 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  14907. 1034.91 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  14908. 1034.97 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  14909. 1034.98 s [unordered-containers] Phase: installPhase
  14910. 1035.03 s [unordered-containers] Installing library in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  14911. 1035.34 s [unordered-containers] Phase: fixupPhase
  14912. 1035.36 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
  14913. 1035.37 s [unordered-containers] shrinking /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSunordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq-ghc9.8.1.so
  14914. 1035.38 s [unordered-containers] checking for references to /build/ in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20...
  14915. 1035.39 s [unordered-containers] patching script interpreter paths in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
  14916. 1035.40 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib
  14917. 1035.53 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc
  14918. 1035.54 s [unordered-containers] checking for references to /build/ in /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc...
  14919. 1035.55 s [unordered-containers] patching script interpreter paths in /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc
  14920. 1035.65 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
  14921. 1036.13 s [unordered-containers:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  14922. 1036.13 s [unordered-containers:post-build]
  14923. 1036.56 s [unordered-containers:post-build] Pushing /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20 (9.28 MiB)
  14924. 1036.75 s [unordered-containers:post-build] Pushing /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc (4.50 MiB)
  14925. 1037.90 s [unordered-containers:post-build]
  14926. 1037.90 s [unordered-containers:post-build] All done.
  14927. 1037.93 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
  14928. 1037.98 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14929. 1038.19 s [unordered-containers:post-build] copying 2 paths...
  14930. 1038.19 s [unordered-containers:post-build] copying path '/nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...
  14931. 1039.03 s [unordered-containers:post-build] copying path '/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
  14932. 1041.66 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14933. 1041.93 s [unordered-containers:post-build] copying 1 paths...
  14934. 1041.97 s [unordered-containers:post-build] copying path '/nix/store/sl4dwg6r5dr8h3npvwjsv9kdvg0gwxn6-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
  14935. 1042.35 s Progress: 38 of 46 built
  14936. 1042.39 s Building /nix/store/zb93y8x0dvbjy13nrbg8syz8g82r2xaw-quickcheck-instances-0.3.32.drv
  14937. 1042.52 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  14938. 1042.53 s [quickcheck-instances] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  14939. 1042.72 s [quickcheck-instances] Phase: unpackPhase
  14940. 1042.73 s [quickcheck-instances] unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
  14941. 1042.73 s [quickcheck-instances] source root is quickcheck-instances-0.3.32
  14942. 1042.74 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
  14943. 1042.74 s [quickcheck-instances] Phase: patchPhase
  14944. 1042.75 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
  14945. 1042.75 s [quickcheck-instances] Phase: compileBuildDriverPhase
  14946. 1042.76 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.DEOi1JRYCP/setup-package.conf.d -threaded
  14947. 1042.80 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.DEOi1JRYCP/Main.o )
  14948. 1042.86 s [quickcheck-instances] [2 of 2] Linking Setup
  14949. 1044.14 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  14950. 1044.16 s [quickcheck-instances] Phase: configurePhase
  14951. 1044.16 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.DEOi1JRYCP/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  14952. 1044.17 s [quickcheck-instances] Using Parsec parser
  14953. 1044.17 s [quickcheck-instances] Configuring quickcheck-instances-0.3.32...
  14954. 1044.50 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  14955. 1044.50 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
  14956. 1044.50 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.6.0
  14957. 1044.50 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.19.0.0
  14958. 1044.50 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
  14959. 1044.50 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  14960. 1044.50 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
  14961. 1044.50 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  14962. 1044.50 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  14963. 1044.50 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  14964. 1044.50 s [quickcheck-instances] integer-logarithms-1.0.4
  14965. 1044.50 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  14966. 1044.50 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  14967. 1044.50 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  14968. 1044.50 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
  14969. 1044.50 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  14970. 1044.50 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.8
  14971. 1044.50 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
  14972. 1044.50 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  14973. 1044.50 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  14974. 1044.50 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.7
  14975. 1044.50 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  14976. 1044.50 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  14977. 1044.50 s [quickcheck-instances] unordered-containers-0.2.20
  14978. 1044.50 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  14979. 1044.50 s [quickcheck-instances] Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
  14980. 1044.50 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.14.3
  14981. 1044.50 s [quickcheck-instances] Dependency base: using base-4.19.0.0
  14982. 1044.50 s [quickcheck-instances] Dependency containers: using containers-0.6.8
  14983. 1044.50 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  14984. 1044.50 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.32
  14985. 1044.50 s [quickcheck-instances] Dependency tagged: using tagged-0.8.8
  14986. 1044.50 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  14987. 1044.70 s [quickcheck-instances] Source component graph:
  14988. 1044.70 s [quickcheck-instances] component lib
  14989. 1044.70 s [quickcheck-instances] component test:self-test dependency lib
  14990. 1044.70 s [quickcheck-instances] Configured component graph:
  14991. 1044.70 s [quickcheck-instances] component quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  14992. 1044.70 s [quickcheck-instances] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
  14993. 1044.70 s [quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  14994. 1044.70 s [quickcheck-instances] include array-0.5.6.0-dc89
  14995. 1044.70 s [quickcheck-instances] include base-4.19.0.0-b960
  14996. 1044.70 s [quickcheck-instances] include bytestring-0.12.0.2-4690
  14997. 1044.70 s [quickcheck-instances] include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
  14998. 1044.70 s [quickcheck-instances] include containers-0.6.8-4775
  14999. 1044.70 s [quickcheck-instances] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
  15000. 1044.70 s [quickcheck-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  15001. 1044.70 s [quickcheck-instances] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  15002. 1044.70 s [quickcheck-instances] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
  15003. 1044.70 s [quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  15004. 1044.70 s [quickcheck-instances] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  15005. 1044.70 s [quickcheck-instances] include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
  15006. 1044.70 s [quickcheck-instances] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
  15007. 1044.70 s [quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  15008. 1044.70 s [quickcheck-instances] include text-2.1-c36a
  15009. 1044.70 s [quickcheck-instances] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
  15010. 1044.70 s [quickcheck-instances] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
  15011. 1044.70 s [quickcheck-instances] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
  15012. 1044.70 s [quickcheck-instances] include transformers-0.6.1.0-c3ec
  15013. 1044.70 s [quickcheck-instances] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  15014. 1044.70 s [quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
  15015. 1044.70 s [quickcheck-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
  15016. 1044.70 s [quickcheck-instances] component quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
  15017. 1044.70 s [quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15018. 1044.70 s [quickcheck-instances] include base-4.19.0.0-b960
  15019. 1044.70 s [quickcheck-instances] include containers-0.6.8-4775
  15020. 1044.70 s [quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  15021. 1044.70 s [quickcheck-instances] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15022. 1044.70 s [quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  15023. 1044.70 s [quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
  15024. 1044.70 s [quickcheck-instances] Linked component graph:
  15025. 1044.70 s [quickcheck-instances] unit quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15026. 1044.70 s [quickcheck-instances] include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
  15027. 1044.70 s [quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15028. 1044.70 s [quickcheck-instances] include array-0.5.6.0-dc89
  15029. 1044.70 s [quickcheck-instances] include base-4.19.0.0-b960
  15030. 1044.70 s [quickcheck-instances] include bytestring-0.12.0.2-4690
  15031. 1044.70 s [quickcheck-instances] include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
  15032. 1044.70 s [quickcheck-instances] include containers-0.6.8-4775
  15033. 1044.70 s [quickcheck-instances] include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
  15034. 1044.70 s [quickcheck-instances] include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  15035. 1044.70 s [quickcheck-instances] include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  15036. 1044.70 s [quickcheck-instances] include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
  15037. 1044.70 s [quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  15038. 1044.70 s [quickcheck-instances] include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  15039. 1044.70 s [quickcheck-instances] include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
  15040. 1044.70 s [quickcheck-instances] include strict-0.5.1-GVSVdbGTOCS56r31yJq782
  15041. 1044.70 s [quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  15042. 1044.70 s [quickcheck-instances] include text-2.1-c36a
  15043. 1044.70 s [quickcheck-instances] include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
  15044. 1044.70 s [quickcheck-instances] include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
  15045. 1044.70 s [quickcheck-instances] include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
  15046. 1044.70 s [quickcheck-instances] include transformers-0.6.1.0-c3ec
  15047. 1044.70 s [quickcheck-instances] include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  15048. 1044.70 s [quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
  15049. 1044.70 s [quickcheck-instances] include vector-0.13.2.0-KITycIPQp0R25115diGgzh
  15050. 1044.70 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Void
  15051. 1044.70 s [quickcheck-instances] unit quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
  15052. 1044.70 s [quickcheck-instances] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15053. 1044.70 s [quickcheck-instances] include base-4.19.0.0-b960
  15054. 1044.70 s [quickcheck-instances] include containers-0.6.8-4775
  15055. 1044.70 s [quickcheck-instances] include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  15056. 1044.70 s [quickcheck-instances] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15057. 1044.70 s [quickcheck-instances] include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  15058. 1044.70 s [quickcheck-instances] include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
  15059. 1044.70 s [quickcheck-instances] Ready component graph:
  15060. 1044.70 s [quickcheck-instances] definite quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15061. 1044.70 s [quickcheck-instances] depends OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
  15062. 1044.70 s [quickcheck-instances] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15063. 1044.70 s [quickcheck-instances] depends array-0.5.6.0-dc89
  15064. 1044.70 s [quickcheck-instances] depends base-4.19.0.0-b960
  15065. 1044.70 s [quickcheck-instances] depends bytestring-0.12.0.2-4690
  15066. 1044.70 s [quickcheck-instances] depends case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
  15067. 1044.70 s [quickcheck-instances] depends containers-0.6.8-4775
  15068. 1044.70 s [quickcheck-instances] depends data-fix-0.3.4-90kAYHfhdX433d7z3npPya
  15069. 1044.70 s [quickcheck-instances] depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
  15070. 1044.70 s [quickcheck-instances] depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
  15071. 1044.70 s [quickcheck-instances] depends old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
  15072. 1044.70 s [quickcheck-instances] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  15073. 1044.70 s [quickcheck-instances] depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
  15074. 1044.70 s [quickcheck-instances] depends splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
  15075. 1044.70 s [quickcheck-instances] depends strict-0.5.1-GVSVdbGTOCS56r31yJq782
  15076. 1044.70 s [quickcheck-instances] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  15077. 1044.70 s [quickcheck-instances] depends text-2.1-c36a
  15078. 1044.70 s [quickcheck-instances] depends text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
  15079. 1044.70 s [quickcheck-instances] depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
  15080. 1044.70 s [quickcheck-instances] depends time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
  15081. 1044.70 s [quickcheck-instances] depends transformers-0.6.1.0-c3ec
  15082. 1044.70 s [quickcheck-instances] depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
  15083. 1044.70 s [quickcheck-instances] depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
  15084. 1044.70 s [quickcheck-instances] depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
  15085. 1044.70 s [quickcheck-instances] definite quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
  15086. 1044.70 s [quickcheck-instances] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15087. 1044.70 s [quickcheck-instances] depends base-4.19.0.0-b960
  15088. 1044.70 s [quickcheck-instances] depends containers-0.6.8-4775
  15089. 1044.71 s [quickcheck-instances] depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
  15090. 1044.71 s [quickcheck-instances] depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15091. 1044.71 s [quickcheck-instances] depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
  15092. 1044.71 s [quickcheck-instances] depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
  15093. 1044.71 s [quickcheck-instances] Using Cabal-3.10.2.0 compiled by ghc-9.8
  15094. 1044.71 s [quickcheck-instances] Using compiler: ghc-9.8.1
  15095. 1044.71 s [quickcheck-instances] Using install prefix:
  15096. 1044.71 s [quickcheck-instances] /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
  15097. 1044.71 s [quickcheck-instances] Executables installed in:
  15098. 1044.71 s [quickcheck-instances] /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/bin
  15099. 1044.71 s [quickcheck-instances] Libraries installed in:
  15100. 1044.71 s [quickcheck-instances] /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15101. 1044.71 s [quickcheck-instances] Dynamic Libraries installed in:
  15102. 1044.71 s [quickcheck-instances] /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  15103. 1044.71 s [quickcheck-instances] Private executables installed in:
  15104. 1044.71 s [quickcheck-instances] /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
  15105. 1044.71 s [quickcheck-instances] Data files installed in:
  15106. 1044.71 s [quickcheck-instances] /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
  15107. 1044.71 s [quickcheck-instances] Documentation installed in:
  15108. 1044.71 s [quickcheck-instances] /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
  15109. 1044.71 s [quickcheck-instances] Configuration files installed in:
  15110. 1044.71 s [quickcheck-instances] /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/etc
  15111. 1044.71 s [quickcheck-instances] No alex found
  15112. 1044.71 s [quickcheck-instances] Using ar found on system at:
  15113. 1044.71 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  15114. 1044.71 s [quickcheck-instances] No c2hs found
  15115. 1044.71 s [quickcheck-instances] No cpphs found
  15116. 1044.71 s [quickcheck-instances] No doctest found
  15117. 1044.71 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  15118. 1044.71 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  15119. 1044.71 s [quickcheck-instances] Using ghc version 9.8.1 found on system at:
  15120. 1044.71 s [quickcheck-instances] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  15121. 1044.71 s [quickcheck-instances] Using ghc-pkg version 9.8.1 found on system at:
  15122. 1044.71 s [quickcheck-instances] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  15123. 1044.71 s [quickcheck-instances] No ghcjs found
  15124. 1044.71 s [quickcheck-instances] No ghcjs-pkg found
  15125. 1044.71 s [quickcheck-instances] No greencard found
  15126. 1044.71 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  15127. 1044.71 s [quickcheck-instances] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  15128. 1044.71 s [quickcheck-instances] No happy found
  15129. 1044.71 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  15130. 1044.71 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15131. 1044.71 s [quickcheck-instances] No hmake found
  15132. 1044.71 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  15133. 1044.71 s [quickcheck-instances] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  15134. 1044.71 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  15135. 1044.71 s [quickcheck-instances] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  15136. 1044.71 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  15137. 1044.71 s [quickcheck-instances] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  15138. 1044.71 s [quickcheck-instances] No jhc found
  15139. 1044.71 s [quickcheck-instances] Using ld found on system at:
  15140. 1044.71 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  15141. 1044.71 s [quickcheck-instances] No pkg-config found
  15142. 1044.71 s [quickcheck-instances] Using runghc version 9.8.1 found on system at:
  15143. 1044.71 s [quickcheck-instances] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  15144. 1044.71 s [quickcheck-instances] Using strip version 2.44 found on system at:
  15145. 1044.71 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  15146. 1044.71 s [quickcheck-instances] Using tar found on system at:
  15147. 1044.71 s [quickcheck-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  15148. 1044.71 s [quickcheck-instances] No uhc found
  15149. 1044.83 s [quickcheck-instances] Phase: buildPhase
  15150. 1044.87 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
  15151. 1044.88 s [quickcheck-instances] Building library for quickcheck-instances-0.3.32..
  15152. 1045.00 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 )
  15153. 1045.04 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 )
  15154. 1045.55 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 )
  15155. 1045.70 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 )
  15156. 1045.70 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 )
  15157. 1045.97 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 )
  15158. 1045.97 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 )
  15159. 1045.97 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 )
  15160. 1045.97 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 )
  15161. 1045.97 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 )
  15162. 1045.97 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 )
  15163. 1045.97 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 )
  15164. 1045.97 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 )
  15165. 1045.97 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 )
  15166. 1045.97 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 )
  15167. 1046.36 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 )
  15168. 1046.36 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 )
  15169. 1046.36 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 )
  15170. 1046.36 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 )
  15171. 1046.36 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 )
  15172. 1046.77 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.o, dist/build/Test/QuickCheck/Instances/Transformer.dyn_o )
  15173. 1046.77 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.o, dist/build/Test/QuickCheck/Instances/UUID.dyn_o )
  15174. 1046.77 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.o, dist/build/Test/QuickCheck/Instances/UnorderedContainers.dyn_o )
  15175. 1046.77 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.o, dist/build/Test/QuickCheck/Instances/Vector.dyn_o )
  15176. 1046.77 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.o, dist/build/Test/QuickCheck/Instances/Void.dyn_o )
  15177. 1046.77 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.o, dist/build/Test/QuickCheck/Instances.dyn_o )
  15178. 1047.20 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 )
  15179. 1047.44 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 )
  15180. 1047.49 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 )
  15181. 1048.66 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 )
  15182. 1048.66 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 )
  15183. 1048.94 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 )
  15184. 1049.06 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 )
  15185. 1049.06 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 )
  15186. 1049.06 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 )
  15187. 1049.06 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 )
  15188. 1049.06 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 )
  15189. 1049.06 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 )
  15190. 1049.06 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 )
  15191. 1049.06 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 )
  15192. 1049.06 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 )
  15193. 1049.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 )
  15194. 1049.25 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 )
  15195. 1049.25 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.p_o )
  15196. 1049.25 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 )
  15197. 1049.41 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 )
  15198. 1049.72 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 )
  15199. 1049.72 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 )
  15200. 1049.72 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 )
  15201. 1049.72 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 )
  15202. 1049.72 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 )
  15203. 1049.72 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  15204. 1051.22 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
  15205. 1051.22 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.32..
  15206. 1051.30 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  15207. 1051.60 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  15208. 1052.39 s [quickcheck-instances] Phase: checkPhase
  15209. 1052.43 s [quickcheck-instances] Running 1 test suites...
  15210. 1052.43 s [quickcheck-instances] Test suite self-test: RUNNING...
  15211. 1052.47 s [quickcheck-instances] +++ OK, passed 100 tests.
  15212. 1052.47 s [quickcheck-instances] +++ OK, passed 100 tests.
  15213. 1052.47 s [quickcheck-instances] +++ OK, passed 100 tests.
  15214. 1052.47 s [quickcheck-instances] +++ OK, passed 100 tests.
  15215. 1052.47 s [quickcheck-instances] +++ OK, passed 100 tests.
  15216. 1052.47 s [quickcheck-instances] Test suite self-test: PASS
  15217. 1052.47 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
  15218. 1052.47 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  15219. 1052.47 s [quickcheck-instances] Phase: haddockPhase
  15220. 1052.58 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
  15221. 1052.59 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.32..
  15222. 1052.59 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  15223. 1052.59 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  15224. 1052.67 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  15225. 1052.88 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  15226. 1052.89 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  15227. 1052.91 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  15228. 1053.05 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  15229. 1053.08 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  15230. 1053.10 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  15231. 1053.11 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  15232. 1053.12 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  15233. 1053.12 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  15234. 1053.15 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  15235. 1053.20 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  15236. 1053.20 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  15237. 1053.21 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  15238. 1053.25 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  15239. 1053.26 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  15240. 1053.41 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  15241. 1053.47 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  15242. 1053.48 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  15243. 1053.48 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  15244. 1053.51 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  15245. 1053.60 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  15246. 1053.63 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  15247. 1053.64 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  15248. 1053.66 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  15249. 1053.84 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  15250. 1053.84 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  15251. 1053.84 s [quickcheck-instances] Haddock coverage:
  15252. 1053.84 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  15253. 1053.84 s [quickcheck-instances] Missing documentation for:
  15254. 1053.84 s [quickcheck-instances] Module header
  15255. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  15256. 1053.85 s [quickcheck-instances] Missing documentation for:
  15257. 1053.85 s [quickcheck-instances] Module header
  15258. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  15259. 1053.85 s [quickcheck-instances] Missing documentation for:
  15260. 1053.85 s [quickcheck-instances] Module header
  15261. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  15262. 1053.85 s [quickcheck-instances] Missing documentation for:
  15263. 1053.85 s [quickcheck-instances] Module header
  15264. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  15265. 1053.85 s [quickcheck-instances] Missing documentation for:
  15266. 1053.85 s [quickcheck-instances] Module header
  15267. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  15268. 1053.85 s [quickcheck-instances] Missing documentation for:
  15269. 1053.85 s [quickcheck-instances] Module header
  15270. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  15271. 1053.85 s [quickcheck-instances] Missing documentation for:
  15272. 1053.85 s [quickcheck-instances] Module header
  15273. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  15274. 1053.85 s [quickcheck-instances] Missing documentation for:
  15275. 1053.85 s [quickcheck-instances] Module header
  15276. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  15277. 1053.85 s [quickcheck-instances] Missing documentation for:
  15278. 1053.85 s [quickcheck-instances] Module header
  15279. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  15280. 1053.85 s [quickcheck-instances] Missing documentation for:
  15281. 1053.85 s [quickcheck-instances] Module header
  15282. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  15283. 1053.85 s [quickcheck-instances] Missing documentation for:
  15284. 1053.85 s [quickcheck-instances] Module header
  15285. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  15286. 1053.85 s [quickcheck-instances] Missing documentation for:
  15287. 1053.85 s [quickcheck-instances] Module header
  15288. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15289. 1053.85 s [quickcheck-instances] Missing documentation for:
  15290. 1053.85 s [quickcheck-instances] Module header
  15291. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  15292. 1053.85 s [quickcheck-instances] Missing documentation for:
  15293. 1053.85 s [quickcheck-instances] Module header
  15294. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  15295. 1053.85 s [quickcheck-instances] Missing documentation for:
  15296. 1053.85 s [quickcheck-instances] Module header
  15297. 1053.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  15298. 1053.86 s [quickcheck-instances] Missing documentation for:
  15299. 1053.86 s [quickcheck-instances] Module header
  15300. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  15301. 1053.86 s [quickcheck-instances] Missing documentation for:
  15302. 1053.86 s [quickcheck-instances] Module header
  15303. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  15304. 1053.86 s [quickcheck-instances] Missing documentation for:
  15305. 1053.86 s [quickcheck-instances] Module header
  15306. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  15307. 1053.86 s [quickcheck-instances] Missing documentation for:
  15308. 1053.86 s [quickcheck-instances] Module header
  15309. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  15310. 1053.86 s [quickcheck-instances] Missing documentation for:
  15311. 1053.86 s [quickcheck-instances] Module header
  15312. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  15313. 1053.86 s [quickcheck-instances] Missing documentation for:
  15314. 1053.86 s [quickcheck-instances] Module header
  15315. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  15316. 1053.86 s [quickcheck-instances] Missing documentation for:
  15317. 1053.86 s [quickcheck-instances] Module header
  15318. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  15319. 1053.86 s [quickcheck-instances] Missing documentation for:
  15320. 1053.86 s [quickcheck-instances] Module header
  15321. 1053.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  15322. 1053.86 s [quickcheck-instances] Missing documentation for:
  15323. 1053.86 s [quickcheck-instances] Module header
  15324. 1053.86 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  15325. 1054.59 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  15326. 1054.59 s [quickcheck-instances] - Data.Vector.Vector
  15327. 1054.59 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  15328. 1054.59 s [quickcheck-instances] - Data.Vector.Storable.Vector
  15329. 1054.59 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  15330. 1054.59 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  15331. 1058.45 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  15332. 1058.54 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  15333. 1058.54 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
  15334. 1058.54 s [quickcheck-instances] Phase: installPhase
  15335. 1058.57 s [quickcheck-instances] Installing library in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15336. 1059.07 s [quickcheck-instances] Phase: fixupPhase
  15337. 1059.09 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
  15338. 1059.11 s [quickcheck-instances] shrinking /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSquickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA-ghc9.8.1.so
  15339. 1059.12 s [quickcheck-instances] checking for references to /build/ in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32...
  15340. 1059.14 s [quickcheck-instances] patching script interpreter paths in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
  15341. 1059.15 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib
  15342. 1059.36 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc
  15343. 1059.38 s [quickcheck-instances] checking for references to /build/ in /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc...
  15344. 1059.40 s [quickcheck-instances] patching script interpreter paths in /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc
  15345. 1059.65 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
  15346. 1060.20 s [quickcheck-instances:post-build] Pushing 2 paths (130 are already present) using zstd to cache sellout ⏳
  15347. 1060.20 s [quickcheck-instances:post-build]
  15348. 1060.56 s [quickcheck-instances:post-build] Pushing /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc (1.48 MiB)
  15349. 1060.64 s [quickcheck-instances:post-build] Pushing /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32 (5.35 MiB)
  15350. 1061.83 s [quickcheck-instances:post-build]
  15351. 1061.83 s [quickcheck-instances:post-build] All done.
  15352. 1061.86 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
  15353. 1061.93 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15354. 1062.16 s [quickcheck-instances:post-build] copying 2 paths...
  15355. 1062.16 s [quickcheck-instances:post-build] copying path '/nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc' to 'https://cache.nix-ci.com'...
  15356. 1062.61 s [quickcheck-instances:post-build] copying path '/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
  15357. 1064.24 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15358. 1064.52 s [quickcheck-instances:post-build] copying 1 paths...
  15359. 1064.56 s [quickcheck-instances:post-build] copying path '/nix/store/zb93y8x0dvbjy13nrbg8syz8g82r2xaw-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...
  15360. 1064.80 s Progress: 39 of 46 built
  15361. 1064.86 s Building /nix/store/9p7f127bf99874y0pziszzcc3pkbckn3-extra-1.7.16.drv
  15362. 1065.02 s [extra] Phase: setupCompilerEnvironmentPhase
  15363. 1065.02 s [extra] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  15364. 1065.27 s [extra] Phase: unpackPhase
  15365. 1065.27 s [extra] unpacking source archive /nix/store/zap07ayqyv48lfcxp4yva8sylcvy2knk-extra-1.7.16.tar.gz
  15366. 1065.28 s [extra] source root is extra-1.7.16
  15367. 1065.29 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.7.16/test/TestUtil.hs"
  15368. 1065.30 s [extra] Phase: patchPhase
  15369. 1065.30 s [extra] Replace Cabal file with edited version from mirror://hackage/extra-1.7.16/revision/1.cabal.
  15370. 1065.31 s [extra] Phase: compileBuildDriverPhase
  15371. 1065.31 s [extra] setupCompileFlags: -package-db=/build/tmp.9jyZczK3Jh/setup-package.conf.d -threaded
  15372. 1065.36 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.9jyZczK3Jh/Main.o )
  15373. 1065.45 s [extra] [2 of 2] Linking Setup
  15374. 1066.82 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  15375. 1066.83 s [extra] Phase: configurePhase
  15376. 1066.84 s [extra] configureFlags: --verbose --prefix=/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc/share/doc/extra-1.7.16 --with-gcc=gcc --package-db=/build/tmp.9jyZczK3Jh/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  15377. 1066.84 s [extra] Using Parsec parser
  15378. 1066.84 s [extra] Configuring extra-1.7.16...
  15379. 1067.22 s [extra] Dependency base >=4.9 && <4.21: using base-4.19.0.0
  15380. 1067.22 s [extra] Dependency clock >=0.7: using clock-0.8.4
  15381. 1067.22 s [extra] Dependency directory: using directory-1.3.8.1
  15382. 1067.22 s [extra] Dependency filepath: using filepath-1.4.100.4
  15383. 1067.22 s [extra] Dependency process: using process-1.6.18.0
  15384. 1067.22 s [extra] Dependency time: using time-1.12.2
  15385. 1067.22 s [extra] Dependency unix: using unix-2.8.3.0
  15386. 1067.22 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.14.3
  15387. 1067.22 s [extra] Dependency base >=4 && <5: using base-4.19.0.0
  15388. 1067.22 s [extra] Dependency directory: using directory-1.3.8.1
  15389. 1067.22 s [extra] Dependency extra: using extra-1.7.16
  15390. 1067.22 s [extra] Dependency filepath: using filepath-1.4.100.4
  15391. 1067.22 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
  15392. 1067.22 s [extra] Dependency unix: using unix-2.8.3.0
  15393. 1067.52 s [extra] Source component graph:
  15394. 1067.52 s [extra] component lib
  15395. 1067.52 s [extra] component test:extra-test dependency lib
  15396. 1067.52 s [extra] Configured component graph:
  15397. 1067.52 s [extra] component extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  15398. 1067.52 s [extra] include base-4.19.0.0-b960
  15399. 1067.52 s [extra] include clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
  15400. 1067.52 s [extra] include directory-1.3.8.1-6a8e
  15401. 1067.52 s [extra] include filepath-1.4.100.4-fa1c
  15402. 1067.52 s [extra] include process-1.6.18.0-26fa
  15403. 1067.52 s [extra] include time-1.12.2-d26d
  15404. 1067.52 s [extra] include unix-2.8.3.0-8aa6
  15405. 1067.52 s [extra] component extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
  15406. 1067.52 s [extra] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15407. 1067.52 s [extra] include base-4.19.0.0-b960
  15408. 1067.52 s [extra] include directory-1.3.8.1-6a8e
  15409. 1067.52 s [extra] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  15410. 1067.53 s [extra] include filepath-1.4.100.4-fa1c
  15411. 1067.53 s [extra] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15412. 1067.53 s [extra] include unix-2.8.3.0-8aa6
  15413. 1067.53 s [extra] Linked component graph:
  15414. 1067.53 s [extra] unit extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  15415. 1067.53 s [extra] include base-4.19.0.0-b960
  15416. 1067.53 s [extra] include clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
  15417. 1067.53 s [extra] include directory-1.3.8.1-6a8e
  15418. 1067.53 s [extra] include filepath-1.4.100.4-fa1c
  15419. 1067.53 s [extra] include process-1.6.18.0-26fa
  15420. 1067.53 s [extra] include time-1.12.2-d26d
  15421. 1067.53 s [extra] include unix-2.8.3.0-8aa6
  15422. 1067.53 s [extra] Control.Concurrent.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Exception.Extra,Control.Monad.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Monad.Extra,Data.Either.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Either.Extra,Data.Foldable.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Foldable.Extra,Data.IORef.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.IORef.Extra,Data.List.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Typeable.Extra,Data.Version.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Version.Extra,Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Extra,Numeric.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Numeric.Extra,System.Directory.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Directory.Extra,System.Environment.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Environment.Extra,System.IO.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.IO.Extra,System.Info.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Info.Extra,System.Process.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Process.Extra,System.Time.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Time.Extra,Text.Read.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Text.Read.Extra
  15423. 1067.53 s [extra] unit extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
  15424. 1067.53 s [extra] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15425. 1067.53 s [extra] include base-4.19.0.0-b960
  15426. 1067.53 s [extra] include directory-1.3.8.1-6a8e
  15427. 1067.53 s [extra] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  15428. 1067.53 s [extra] include filepath-1.4.100.4-fa1c
  15429. 1067.53 s [extra] include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15430. 1067.53 s [extra] include unix-2.8.3.0-8aa6
  15431. 1067.53 s [extra] Ready component graph:
  15432. 1067.53 s [extra] definite extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  15433. 1067.53 s [extra] depends base-4.19.0.0-b960
  15434. 1067.53 s [extra] depends clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
  15435. 1067.53 s [extra] depends directory-1.3.8.1-6a8e
  15436. 1067.53 s [extra] depends filepath-1.4.100.4-fa1c
  15437. 1067.53 s [extra] depends process-1.6.18.0-26fa
  15438. 1067.53 s [extra] depends time-1.12.2-d26d
  15439. 1067.53 s [extra] depends unix-2.8.3.0-8aa6
  15440. 1067.53 s [extra] definite extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
  15441. 1067.53 s [extra] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  15442. 1067.53 s [extra] depends base-4.19.0.0-b960
  15443. 1067.53 s [extra] depends directory-1.3.8.1-6a8e
  15444. 1067.53 s [extra] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  15445. 1067.53 s [extra] depends filepath-1.4.100.4-fa1c
  15446. 1067.53 s [extra] depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
  15447. 1067.53 s [extra] depends unix-2.8.3.0-8aa6
  15448. 1067.53 s [extra] Using Cabal-3.10.2.0 compiled by ghc-9.8
  15449. 1067.53 s [extra] Using compiler: ghc-9.8.1
  15450. 1067.53 s [extra] Using install prefix: /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
  15451. 1067.53 s [extra] Executables installed in:
  15452. 1067.53 s [extra] /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/bin
  15453. 1067.53 s [extra] Libraries installed in:
  15454. 1067.53 s [extra] /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  15455. 1067.53 s [extra] Dynamic Libraries installed in:
  15456. 1067.53 s [extra] /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  15457. 1067.53 s [extra] Private executables installed in:
  15458. 1067.53 s [extra] /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/libexec/x86_64-linux-ghc-9.8.1/extra-1.7.16
  15459. 1067.53 s [extra] Data files installed in:
  15460. 1067.53 s [extra] /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/share/x86_64-linux-ghc-9.8.1/extra-1.7.16
  15461. 1067.53 s [extra] Documentation installed in:
  15462. 1067.53 s [extra] /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc/share/doc/extra-1.7.16
  15463. 1067.53 s [extra] Configuration files installed in:
  15464. 1067.53 s [extra] /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/etc
  15465. 1067.53 s [extra] No alex found
  15466. 1067.53 s [extra] Using ar found on system at:
  15467. 1067.53 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  15468. 1067.53 s [extra] No c2hs found
  15469. 1067.53 s [extra] No cpphs found
  15470. 1067.53 s [extra] No doctest found
  15471. 1067.53 s [extra] Using gcc version 14.3.0 given by user at:
  15472. 1067.53 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  15473. 1067.53 s [extra] Using ghc version 9.8.1 found on system at:
  15474. 1067.53 s [extra] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  15475. 1067.53 s [extra] Using ghc-pkg version 9.8.1 found on system at:
  15476. 1067.53 s [extra] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  15477. 1067.53 s [extra] No ghcjs found
  15478. 1067.53 s [extra] No ghcjs-pkg found
  15479. 1067.53 s [extra] No greencard found
  15480. 1067.53 s [extra] Using haddock version 2.30.0 found on system at:
  15481. 1067.53 s [extra] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  15482. 1067.53 s [extra] No happy found
  15483. 1067.53 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  15484. 1067.53 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15485. 1067.53 s [extra] No hmake found
  15486. 1067.53 s [extra] Using hpc version 0.69 found on system at:
  15487. 1067.53 s [extra] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  15488. 1067.53 s [extra] Using hsc2hs version 0.68.10 found on system at:
  15489. 1067.53 s [extra] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  15490. 1067.53 s [extra] Using hscolour version 1.25 found on system at:
  15491. 1067.53 s [extra] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  15492. 1067.53 s [extra] No jhc found
  15493. 1067.53 s [extra] Using ld found on system at:
  15494. 1067.53 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  15495. 1067.53 s [extra] No pkg-config found
  15496. 1067.53 s [extra] Using runghc version 9.8.1 found on system at:
  15497. 1067.53 s [extra] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  15498. 1067.53 s [extra] Using strip version 2.44 found on system at:
  15499. 1067.53 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  15500. 1067.53 s [extra] Using tar found on system at:
  15501. 1067.53 s [extra] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  15502. 1067.53 s [extra] No uhc found
  15503. 1067.69 s [extra] Phase: buildPhase
  15504. 1067.76 s [extra] Preprocessing library for extra-1.7.16..
  15505. 1067.77 s [extra] Building library for extra-1.7.16..
  15506. 1068.12 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 )
  15507. 1068.37 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 )
  15508. 1068.37 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 )
  15509. 1068.38 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 )
  15510. 1068.38 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  15511. 1068.38 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  15512. 1068.39 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 )
  15513. 1069.57 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 )
  15514. 1069.74 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 )
  15515. 1069.83 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 )
  15516. 1069.83 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 )
  15517. 1069.83 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 )
  15518. 1070.10 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 )
  15519. 1070.17 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 )
  15520. 1070.60 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 )
  15521. 1070.60 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 )
  15522. 1070.60 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 )
  15523. 1070.80 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 )
  15524. 1070.80 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 )
  15525. 1070.87 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 )
  15526. 1070.88 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  15527. 1070.95 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 )
  15528. 1071.50 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  15529. 1071.91 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  15530. 1071.91 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  15531. 1072.06 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  15532. 1072.08 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  15533. 1072.08 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  15534. 1072.08 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  15535. 1073.45 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  15536. 1073.82 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  15537. 1073.88 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  15538. 1073.88 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  15539. 1073.90 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  15540. 1074.24 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  15541. 1074.85 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  15542. 1075.21 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  15543. 1075.21 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  15544. 1075.21 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  15545. 1075.23 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  15546. 1075.23 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  15547. 1075.43 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  15548. 1075.43 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  15549. 1075.74 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  15550. 1077.13 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16..
  15551. 1077.13 s [extra] Building test suite 'extra-test' for extra-1.7.16..
  15552. 1077.24 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  15553. 1077.75 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  15554. 1079.85 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  15555. 1079.85 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  15556. 1080.78 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  15557. 1081.78 s [extra] Phase: checkPhase
  15558. 1081.85 s [extra] Running 1 test suites...
  15559. 1081.85 s [extra] Test suite extra-test: RUNNING...
  15560. 1081.87 s [extra] withTempFile
  15561. 1081.87 s [extra] +++ OK, passed 1 test.
  15562. 1081.87 s [extra] captureOutput
  15563. 1081.87 s [extra] +++ OK, passed 1 test.
  15564. 1081.87 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  15565. 1081.93 s [extra] +++ OK, passed 100 tests.
  15566. 1081.93 s [extra] \(x :: IO Int) -> join (once x) == x
  15567. 1081.99 s [extra] +++ OK, passed 100 tests.
  15568. 1081.99 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  15569. 1082.04 s [extra] +++ OK, passed 100 tests.
  15570. 1082.04 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  15571. 1082.42 s [extra] +++ OK, passed 100 tests.
  15572. 1082.42 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  15573. 1082.60 s [extra] +++ OK, passed 100 tests.
  15574. 1082.60 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  15575. 1082.67 s [extra] +++ OK, passed 100 tests.
  15576. 1082.67 s [extra] stringException "test" == pure "test"
  15577. 1082.68 s [extra] +++ OK, passed 1 test.
  15578. 1082.68 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  15579. 1082.68 s [extra] +++ OK, passed 1 test.
  15580. 1082.68 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  15581. 1082.68 s [extra] +++ OK, passed 1 test.
  15582. 1082.68 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  15583. 1082.68 s [extra] +++ OK, passed 1 test.
  15584. 1082.68 s [extra] ignore (print 1) == print 1
  15585. 1082.68 s [extra] +++ OK, passed 1 test.
  15586. 1082.68 s [extra] ignore (fail "die") == pure ()
  15587. 1082.68 s [extra] +++ OK, passed 1 test.
  15588. 1082.68 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  15589. 1082.68 s [extra] +++ OK, passed 1 test.
  15590. 1082.68 s [extra] seq (errorIO "foo") (print 1) == print 1
  15591. 1082.68 s [extra] +++ OK, passed 1 test.
  15592. 1082.68 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  15593. 1082.68 s [extra] +++ OK, passed 1 test.
  15594. 1082.68 s [extra] seq (assertIO False) (print 1) == print 1
  15595. 1082.68 s [extra] +++ OK, passed 1 test.
  15596. 1082.68 s [extra] retry 1 (print "x") == print "x"
  15597. 1082.68 s [extra] +++ OK, passed 1 test.
  15598. 1082.68 s [extra] retry 3 (fail "die") == fail "die"
  15599. 1082.68 s [extra] +++ OK, passed 1 test.
  15600. 1082.68 s [extra] whenJust Nothing print == pure ()
  15601. 1082.68 s [extra] +++ OK, passed 1 test.
  15602. 1082.68 s [extra] whenJust (Just 1) print == print 1
  15603. 1082.68 s [extra] +++ OK, passed 1 test.
  15604. 1082.68 s [extra] pureIf @Maybe True 5 == Just 5
  15605. 1082.68 s [extra] +++ OK, passed 1 test.
  15606. 1082.68 s [extra] pureIf @Maybe False 5 == Nothing
  15607. 1082.68 s [extra] +++ OK, passed 1 test.
  15608. 1082.68 s [extra] pureIf @[] True 5 == [5]
  15609. 1082.68 s [extra] +++ OK, passed 1 test.
  15610. 1082.68 s [extra] pureIf @[] False 5 == []
  15611. 1082.68 s [extra] +++ OK, passed 1 test.
  15612. 1082.68 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  15613. 1082.68 s [extra] +++ OK, passed 1 test.
  15614. 1082.68 s [extra] whenMaybe False (print 1) == pure Nothing
  15615. 1082.68 s [extra] +++ OK, passed 1 test.
  15616. 1082.68 s [extra] \(x :: Maybe ()) -> unit x == x
  15617. 1082.68 s [extra] +++ OK, passed 100 tests.
  15618. 1082.68 s [extra] fold1M (\x y -> Just x) [] == undefined
  15619. 1082.68 s [extra] +++ OK, passed 1 test.
  15620. 1082.68 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  15621. 1082.68 s [extra] +++ OK, passed 1 test.
  15622. 1082.68 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  15623. 1082.68 s [extra] +++ OK, passed 1 test.
  15624. 1082.68 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  15625. 1082.68 s [extra] +++ OK, passed 1 test.
  15626. 1082.68 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  15627. 1082.68 s [extra] +++ OK, passed 1 test.
  15628. 1082.68 s [extra] Just True ||^ undefined == Just True
  15629. 1082.68 s [extra] +++ OK, passed 1 test.
  15630. 1082.68 s [extra] Just False ||^ Just True == Just True
  15631. 1082.68 s [extra] +++ OK, passed 1 test.
  15632. 1082.68 s [extra] Just False ||^ Just False == Just False
  15633. 1082.68 s [extra] +++ OK, passed 1 test.
  15634. 1082.68 s [extra] Just False &&^ undefined == Just False
  15635. 1082.68 s [extra] +++ OK, passed 1 test.
  15636. 1082.68 s [extra] Just True &&^ Just True == Just True
  15637. 1082.68 s [extra] +++ OK, passed 1 test.
  15638. 1082.68 s [extra] Just True &&^ Just False == Just False
  15639. 1082.68 s [extra] +++ OK, passed 1 test.
  15640. 1082.68 s [extra] anyM Just [False,True ,undefined] == Just True
  15641. 1082.68 s [extra] +++ OK, passed 1 test.
  15642. 1082.68 s [extra] anyM Just [False,False,undefined] == undefined
  15643. 1082.69 s [extra] +++ OK, passed 1 test.
  15644. 1082.69 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15645. 1082.69 s [extra] +++ OK, passed 100 tests.
  15646. 1082.69 s [extra] allM Just [True,False,undefined] == Just False
  15647. 1082.69 s [extra] +++ OK, passed 1 test.
  15648. 1082.69 s [extra] allM Just [True,True ,undefined] == undefined
  15649. 1082.69 s [extra] +++ OK, passed 1 test.
  15650. 1082.69 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15651. 1082.70 s [extra] +++ OK, passed 100 tests.
  15652. 1082.70 s [extra] orM [Just False,Just True ,undefined] == Just True
  15653. 1082.70 s [extra] +++ OK, passed 1 test.
  15654. 1082.70 s [extra] orM [Just False,Just False,undefined] == undefined
  15655. 1082.70 s [extra] +++ OK, passed 1 test.
  15656. 1082.70 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  15657. 1082.70 s [extra] +++ OK, passed 100 tests.
  15658. 1082.70 s [extra] andM [Just True,Just False,undefined] == Just False
  15659. 1082.70 s [extra] +++ OK, passed 1 test.
  15660. 1082.70 s [extra] andM [Just True,Just True ,undefined] == undefined
  15661. 1082.70 s [extra] +++ OK, passed 1 test.
  15662. 1082.70 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  15663. 1082.70 s [extra] +++ OK, passed 100 tests.
  15664. 1082.70 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  15665. 1082.70 s [extra] +++ OK, passed 1 test.
  15666. 1082.70 s [extra] findM (Just . isUpper) "test" == Just Nothing
  15667. 1082.70 s [extra] +++ OK, passed 1 test.
  15668. 1082.70 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  15669. 1082.70 s [extra] +++ OK, passed 1 test.
  15670. 1082.70 s [extra] fromLeft 1 (Left 3) == 3
  15671. 1082.70 s [extra] +++ OK, passed 1 test.
  15672. 1082.70 s [extra] fromLeft 1 (Right "foo") == 1
  15673. 1082.70 s [extra] +++ OK, passed 1 test.
  15674. 1082.70 s [extra] fromRight 1 (Right 3) == 3
  15675. 1082.70 s [extra] +++ OK, passed 1 test.
  15676. 1082.70 s [extra] fromRight 1 (Left "foo") == 1
  15677. 1082.70 s [extra] +++ OK, passed 1 test.
  15678. 1082.70 s [extra] \x -> fromLeft' (Left x) == x
  15679. 1082.70 s [extra] +++ OK, passed 100 tests.
  15680. 1082.70 s [extra] \x -> fromLeft' (Right x) == undefined
  15681. 1082.70 s [extra] +++ OK, passed 100 tests.
  15682. 1082.70 s [extra] \x -> fromRight' (Right x) == x
  15683. 1082.70 s [extra] +++ OK, passed 100 tests.
  15684. 1082.70 s [extra] \x -> fromRight' (Left x) == undefined
  15685. 1082.71 s [extra] +++ OK, passed 100 tests.
  15686. 1082.71 s [extra] \x -> fromEither (Left x ) == x
  15687. 1082.71 s [extra] +++ OK, passed 100 tests.
  15688. 1082.71 s [extra] \x -> fromEither (Right x) == x
  15689. 1082.71 s [extra] +++ OK, passed 100 tests.
  15690. 1082.71 s [extra] \a b -> maybeToEither a (Just b) == Right b
  15691. 1082.71 s [extra] +++ OK, passed 100 tests.
  15692. 1082.71 s [extra] \a -> maybeToEither a Nothing == Left a
  15693. 1082.71 s [extra] +++ OK, passed 100 tests.
  15694. 1082.71 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  15695. 1082.71 s [extra] +++ OK, passed 100 tests.
  15696. 1082.71 s [extra] \x -> eitherToMaybe (Right x) == Just x
  15697. 1082.71 s [extra] +++ OK, passed 100 tests.
  15698. 1082.71 s [extra] mapLeft show (Left 1) == Left "1"
  15699. 1082.71 s [extra] +++ OK, passed 1 test.
  15700. 1082.71 s [extra] mapLeft show (Right True) == Right True
  15701. 1082.71 s [extra] +++ OK, passed 1 test.
  15702. 1082.71 s [extra] mapRight show (Left 1) == Left 1
  15703. 1082.71 s [extra] +++ OK, passed 1 test.
  15704. 1082.71 s [extra] mapRight show (Right True) == Right "True"
  15705. 1082.71 s [extra] +++ OK, passed 1 test.
  15706. 1082.71 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  15707. 1082.73 s [extra] +++ OK, passed 100 tests.
  15708. 1082.73 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  15709. 1082.73 s [extra] +++ OK, passed 100 tests.
  15710. 1082.73 s [extra] \xs -> repeatedly line1 xs == lines xs
  15711. 1082.73 s [extra] +++ OK, passed 100 tests.
  15712. 1082.73 s [extra] disjoint [1,2,3] [4,5] == True
  15713. 1082.73 s [extra] +++ OK, passed 1 test.
  15714. 1082.73 s [extra] disjoint [1,2,3] [4,1] == False
  15715. 1082.73 s [extra] +++ OK, passed 1 test.
  15716. 1082.73 s [extra] disjointOrd [1,2,3] [4,5] == True
  15717. 1082.73 s [extra] +++ OK, passed 1 test.
  15718. 1082.73 s [extra] disjointOrd [1,2,3] [4,1] == False
  15719. 1082.73 s [extra] +++ OK, passed 1 test.
  15720. 1082.73 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  15721. 1082.73 s [extra] +++ OK, passed 1 test.
  15722. 1082.73 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  15723. 1082.73 s [extra] +++ OK, passed 1 test.
  15724. 1082.73 s [extra] anySame [1,1,2] == True
  15725. 1082.73 s [extra] +++ OK, passed 1 test.
  15726. 1082.73 s [extra] anySame [1,2,3] == False
  15727. 1082.73 s [extra] +++ OK, passed 1 test.
  15728. 1082.73 s [extra] anySame (1:2:1:undefined) == True
  15729. 1082.73 s [extra] +++ OK, passed 1 test.
  15730. 1082.73 s [extra] anySame [] == False
  15731. 1082.73 s [extra] +++ OK, passed 1 test.
  15732. 1082.73 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  15733. 1082.73 s [extra] +++ OK, passed 100 tests.
  15734. 1082.73 s [extra] allSame [1,1,2] == False
  15735. 1082.73 s [extra] +++ OK, passed 1 test.
  15736. 1082.73 s [extra] allSame [1,1,1] == True
  15737. 1082.73 s [extra] +++ OK, passed 1 test.
  15738. 1082.73 s [extra] allSame [1] == True
  15739. 1082.73 s [extra] +++ OK, passed 1 test.
  15740. 1082.74 s [extra] allSame [] == True
  15741. 1082.74 s [extra] +++ OK, passed 1 test.
  15742. 1082.74 s [extra] allSame (1:1:2:undefined) == False
  15743. 1082.74 s [extra] +++ OK, passed 1 test.
  15744. 1082.74 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  15745. 1082.74 s [extra] +++ OK, passed 100 tests.
  15746. 1082.74 s [extra] headDef 1 [] == 1
  15747. 1082.74 s [extra] +++ OK, passed 1 test.
  15748. 1082.74 s [extra] headDef 1 [2,3,4] == 2
  15749. 1082.74 s [extra] +++ OK, passed 1 test.
  15750. 1082.74 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  15751. 1082.75 s [extra] +++ OK, passed 100 tests.
  15752. 1082.75 s [extra] lastDef 1 [] == 1
  15753. 1082.75 s [extra] +++ OK, passed 1 test.
  15754. 1082.75 s [extra] lastDef 1 [2,3,4] == 4
  15755. 1082.75 s [extra] +++ OK, passed 1 test.
  15756. 1082.75 s [extra] \x xs -> lastDef x xs == last (x:xs)
  15757. 1082.75 s [extra] +++ OK, passed 100 tests.
  15758. 1082.75 s [extra] [2,3,4] !? 1 == Just 3
  15759. 1082.75 s [extra] +++ OK, passed 1 test.
  15760. 1082.75 s [extra] [2,3,4] !? (-1) == Nothing
  15761. 1082.75 s [extra] +++ OK, passed 1 test.
  15762. 1082.75 s [extra] [] !? 0 == Nothing
  15763. 1082.75 s [extra] +++ OK, passed 1 test.
  15764. 1082.75 s [extra] notNull [] == False
  15765. 1082.75 s [extra] +++ OK, passed 1 test.
  15766. 1082.75 s [extra] notNull [1] == True
  15767. 1082.75 s [extra] +++ OK, passed 1 test.
  15768. 1082.75 s [extra] \xs -> notNull xs == not (null xs)
  15769. 1082.75 s [extra] +++ OK, passed 100 tests.
  15770. 1082.75 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  15771. 1082.75 s [extra] +++ OK, passed 1 test.
  15772. 1082.75 s [extra] list 1 (\v _ -> v - 2) [] == 1
  15773. 1082.75 s [extra] +++ OK, passed 1 test.
  15774. 1082.75 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  15775. 1082.75 s [extra] +++ OK, passed 100 tests.
  15776. 1082.75 s [extra] unsnoc "test" == Just ("tes",'t')
  15777. 1082.75 s [extra] +++ OK, passed 1 test.
  15778. 1082.75 s [extra] unsnoc "" == Nothing
  15779. 1082.75 s [extra] +++ OK, passed 1 test.
  15780. 1082.75 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  15781. 1082.76 s [extra] +++ OK, passed 100 tests.
  15782. 1082.76 s [extra] cons 't' "est" == "test"
  15783. 1082.76 s [extra] +++ OK, passed 1 test.
  15784. 1082.76 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  15785. 1082.76 s [extra] +++ OK, passed 100 tests.
  15786. 1082.76 s [extra] snoc "tes" 't' == "test"
  15787. 1082.76 s [extra] +++ OK, passed 1 test.
  15788. 1082.76 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  15789. 1082.76 s [extra] +++ OK, passed 100 tests.
  15790. 1082.76 s [extra] enumerate == [False, True]
  15791. 1082.76 s [extra] +++ OK, passed 1 test.
  15792. 1082.76 s [extra] takeEnd 3 "hello" == "llo"
  15793. 1082.76 s [extra] +++ OK, passed 1 test.
  15794. 1082.76 s [extra] takeEnd 5 "bye" == "bye"
  15795. 1082.76 s [extra] +++ OK, passed 1 test.
  15796. 1082.76 s [extra] takeEnd (-1) "bye" == ""
  15797. 1082.76 s [extra] +++ OK, passed 1 test.
  15798. 1082.76 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  15799. 1082.77 s [extra] +++ OK, passed 100 tests.
  15800. 1082.77 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  15801. 1082.77 s [extra] +++ OK, passed 100 tests.
  15802. 1082.77 s [extra] dropEnd 3 "hello" == "he"
  15803. 1082.77 s [extra] +++ OK, passed 1 test.
  15804. 1082.77 s [extra] dropEnd 5 "bye" == ""
  15805. 1082.77 s [extra] +++ OK, passed 1 test.
  15806. 1082.77 s [extra] dropEnd (-1) "bye" == "bye"
  15807. 1082.77 s [extra] +++ OK, passed 1 test.
  15808. 1082.77 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  15809. 1082.77 s [extra] +++ OK, passed 100 tests.
  15810. 1082.77 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  15811. 1082.77 s [extra] +++ OK, passed 100 tests.
  15812. 1082.77 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  15813. 1082.77 s [extra] +++ OK, passed 100 tests.
  15814. 1082.77 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  15815. 1082.77 s [extra] +++ OK, passed 1 test.
  15816. 1082.77 s [extra] splitAtEnd 3 "he" == ("", "he")
  15817. 1082.77 s [extra] +++ OK, passed 1 test.
  15818. 1082.77 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  15819. 1082.77 s [extra] +++ OK, passed 100 tests.
  15820. 1082.77 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  15821. 1082.77 s [extra] +++ OK, passed 100 tests.
  15822. 1082.77 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  15823. 1082.78 s [extra] +++ OK, passed 100 tests.
  15824. 1082.78 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  15825. 1082.78 s [extra] +++ OK, passed 1 test.
  15826. 1082.78 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  15827. 1082.78 s [extra] +++ OK, passed 100 tests.
  15828. 1082.78 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  15829. 1082.78 s [extra] +++ OK, passed 1 test.
  15830. 1082.78 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  15831. 1082.78 s [extra] +++ OK, passed 1 test.
  15832. 1082.78 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  15833. 1082.78 s [extra] +++ OK, passed 1 test.
  15834. 1082.78 s [extra] trim " hello " == "hello"
  15835. 1082.78 s [extra] +++ OK, passed 1 test.
  15836. 1082.78 s [extra] trimStart " hello " == "hello "
  15837. 1082.78 s [extra] +++ OK, passed 1 test.
  15838. 1082.78 s [extra] trimEnd " hello " == " hello"
  15839. 1082.78 s [extra] +++ OK, passed 1 test.
  15840. 1082.78 s [extra] \s -> trim s == trimEnd (trimStart s)
  15841. 1082.79 s [extra] +++ OK, passed 100 tests.
  15842. 1082.79 s [extra] lower "This is A TEST" == "this is a test"
  15843. 1082.79 s [extra] +++ OK, passed 1 test.
  15844. 1082.79 s [extra] lower "" == ""
  15845. 1082.79 s [extra] +++ OK, passed 1 test.
  15846. 1082.79 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  15847. 1082.79 s [extra] +++ OK, passed 1 test.
  15848. 1082.79 s [extra] upper "" == ""
  15849. 1082.79 s [extra] +++ OK, passed 1 test.
  15850. 1082.79 s [extra] word1 "" == ("", "")
  15851. 1082.79 s [extra] +++ OK, passed 1 test.
  15852. 1082.79 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  15853. 1082.79 s [extra] +++ OK, passed 1 test.
  15854. 1082.79 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  15855. 1082.79 s [extra] +++ OK, passed 1 test.
  15856. 1082.79 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  15857. 1082.79 s [extra] +++ OK, passed 100 tests.
  15858. 1082.79 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  15859. 1082.80 s [extra] +++ OK, passed 100 tests.
  15860. 1082.80 s [extra] line1 "" == ("", "")
  15861. 1082.80 s [extra] +++ OK, passed 1 test.
  15862. 1082.80 s [extra] line1 "test" == ("test","")
  15863. 1082.80 s [extra] +++ OK, passed 1 test.
  15864. 1082.80 s [extra] line1 "test\n" == ("test","")
  15865. 1082.80 s [extra] +++ OK, passed 1 test.
  15866. 1082.80 s [extra] line1 "test\nrest" == ("test","rest")
  15867. 1082.80 s [extra] +++ OK, passed 1 test.
  15868. 1082.80 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  15869. 1082.80 s [extra] +++ OK, passed 1 test.
  15870. 1082.80 s [extra] escapeHTML "this is a test" == "this is a test"
  15871. 1082.80 s [extra] +++ OK, passed 1 test.
  15872. 1082.80 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  15873. 1082.80 s [extra] +++ OK, passed 1 test.
  15874. 1082.80 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  15875. 1082.80 s [extra] +++ OK, passed 1 test.
  15876. 1082.80 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  15877. 1082.80 s [extra] +++ OK, passed 100 tests.
  15878. 1082.80 s [extra] escapeJSON "this is a test" == "this is a test"
  15879. 1082.80 s [extra] +++ OK, passed 1 test.
  15880. 1082.80 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  15881. 1082.80 s [extra] +++ OK, passed 1 test.
  15882. 1082.80 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  15883. 1082.80 s [extra] +++ OK, passed 1 test.
  15884. 1082.80 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  15885. 1082.81 s [extra] +++ OK, passed 100 tests.
  15886. 1082.81 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  15887. 1082.81 s [extra] +++ OK, passed 1 test.
  15888. 1082.81 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  15889. 1082.81 s [extra] +++ OK, passed 1 test.
  15890. 1082.81 s [extra] maximumOn id [] == undefined
  15891. 1082.81 s [extra] +++ OK, passed 1 test.
  15892. 1082.81 s [extra] maximumOn length ["test","extra","a"] == "extra"
  15893. 1082.81 s [extra] +++ OK, passed 1 test.
  15894. 1082.81 s [extra] minimumOn id [] == undefined
  15895. 1082.81 s [extra] +++ OK, passed 1 test.
  15896. 1082.81 s [extra] minimumOn length ["test","extra","a"] == "a"
  15897. 1082.81 s [extra] +++ OK, passed 1 test.
  15898. 1082.81 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  15899. 1082.81 s [extra] +++ OK, passed 1 test.
  15900. 1082.81 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  15901. 1082.82 s [extra] +++ OK, passed 100 tests.
  15902. 1082.82 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  15903. 1082.82 s [extra] +++ OK, passed 100 tests.
  15904. 1082.82 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15905. 1082.82 s [extra] +++ OK, passed 1 test.
  15906. 1082.82 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15907. 1082.82 s [extra] +++ OK, passed 1 test.
  15908. 1082.82 s [extra] sum' [1, 2, 3] == 6
  15909. 1082.82 s [extra] +++ OK, passed 1 test.
  15910. 1082.82 s [extra] sumOn' read ["1", "2", "3"] == 6
  15911. 1082.82 s [extra] +++ OK, passed 1 test.
  15912. 1082.82 s [extra] product' [1, 2, 4] == 8
  15913. 1082.82 s [extra] +++ OK, passed 1 test.
  15914. 1082.82 s [extra] productOn' read ["1", "2", "4"] == 8
  15915. 1082.82 s [extra] +++ OK, passed 1 test.
  15916. 1082.82 s [extra] merge "ace" "bd" == "abcde"
  15917. 1082.82 s [extra] +++ OK, passed 1 test.
  15918. 1082.82 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  15919. 1082.84 s [extra] +++ OK, passed 100 tests.
  15920. 1082.84 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  15921. 1082.84 s [extra] +++ OK, passed 1 test.
  15922. 1082.84 s [extra] replace "el" "e" "Hello" == "Helo"
  15923. 1082.84 s [extra] +++ OK, passed 1 test.
  15924. 1082.84 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  15925. 1082.84 s [extra] +++ OK, passed 1 test.
  15926. 1082.84 s [extra] replace "" "x" "" == "x"
  15927. 1082.84 s [extra] +++ OK, passed 1 test.
  15928. 1082.84 s [extra] \xs ys -> replace xs xs ys == ys
  15929. 1082.84 s [extra] +++ OK, passed 100 tests.
  15930. 1082.84 s [extra] breakEnd isLower "youRE" == ("you","RE")
  15931. 1082.84 s [extra] +++ OK, passed 1 test.
  15932. 1082.84 s [extra] breakEnd isLower "youre" == ("youre","")
  15933. 1082.84 s [extra] +++ OK, passed 1 test.
  15934. 1082.84 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  15935. 1082.84 s [extra] +++ OK, passed 1 test.
  15936. 1082.84 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  15937. 1082.85 s [extra] +++ OK, passed 100 tests.
  15938. 1082.85 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  15939. 1082.85 s [extra] +++ OK, passed 1 test.
  15940. 1082.85 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  15941. 1082.85 s [extra] +++ OK, passed 1 test.
  15942. 1082.85 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  15943. 1082.85 s [extra] +++ OK, passed 100 tests.
  15944. 1082.85 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  15945. 1082.85 s [extra] +++ OK, passed 100 tests.
  15946. 1082.85 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  15947. 1082.85 s [extra] +++ OK, passed 1 test.
  15948. 1082.85 s [extra] \s -> wordsBy isSpace s == words s
  15949. 1082.85 s [extra] +++ OK, passed 100 tests.
  15950. 1082.85 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  15951. 1082.85 s [extra] +++ OK, passed 1 test.
  15952. 1082.85 s [extra] \s -> linesBy (== '\n') s == lines s
  15953. 1082.86 s [extra] +++ OK, passed 100 tests.
  15954. 1082.86 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  15955. 1082.86 s [extra] +++ OK, passed 1 test.
  15956. 1082.86 s [extra] firstJust id [Nothing,Just 3] == Just 3
  15957. 1082.86 s [extra] +++ OK, passed 1 test.
  15958. 1082.86 s [extra] firstJust id [Nothing,Nothing] == Nothing
  15959. 1082.86 s [extra] +++ OK, passed 1 test.
  15960. 1082.86 s [extra] drop1 "" == ""
  15961. 1082.86 s [extra] +++ OK, passed 1 test.
  15962. 1082.86 s [extra] drop1 "test" == "est"
  15963. 1082.86 s [extra] +++ OK, passed 1 test.
  15964. 1082.86 s [extra] \xs -> drop 1 xs == drop1 xs
  15965. 1082.86 s [extra] +++ OK, passed 100 tests.
  15966. 1082.86 s [extra] dropEnd1 "" == ""
  15967. 1082.86 s [extra] +++ OK, passed 1 test.
  15968. 1082.86 s [extra] dropEnd1 "test" == "tes"
  15969. 1082.86 s [extra] +++ OK, passed 1 test.
  15970. 1082.86 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  15971. 1082.86 s [extra] +++ OK, passed 100 tests.
  15972. 1082.86 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  15973. 1082.86 s [extra] +++ OK, passed 1 test.
  15974. 1082.86 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  15975. 1082.97 s [extra] +++ OK, passed 100 tests.
  15976. 1082.97 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  15977. 1082.97 s [extra] +++ OK, passed 1 test.
  15978. 1082.97 s [extra] breakOn "/" "foobar" == ("foobar", "")
  15979. 1082.97 s [extra] +++ OK, passed 1 test.
  15980. 1082.97 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  15981. 1082.97 s [extra] +++ OK, passed 100 tests.
  15982. 1082.97 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  15983. 1082.97 s [extra] +++ OK, passed 1 test.
  15984. 1082.97 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  15985. 1082.97 s [extra] +++ OK, passed 1 test.
  15986. 1082.97 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  15987. 1082.97 s [extra] +++ OK, passed 1 test.
  15988. 1082.98 s [extra] splitOn "x" "x" == ["",""]
  15989. 1082.98 s [extra] +++ OK, passed 1 test.
  15990. 1082.98 s [extra] splitOn "x" "" == [""]
  15991. 1082.98 s [extra] +++ OK, passed 1 test.
  15992. 1082.98 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  15993. 1082.98 s [extra] +++ OK, passed 100 tests; 14 discarded.
  15994. 1082.98 s [extra] \c x -> splitOn [c] x == split (==c) x
  15995. 1082.98 s [extra] +++ OK, passed 100 tests.
  15996. 1082.98 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  15997. 1082.99 s [extra] +++ OK, passed 1 test.
  15998. 1082.99 s [extra] split (== 'a') "" == [""]
  15999. 1082.99 s [extra] +++ OK, passed 1 test.
  16000. 1082.99 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  16001. 1082.99 s [extra] +++ OK, passed 1 test.
  16002. 1082.99 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  16003. 1082.99 s [extra] +++ OK, passed 1 test.
  16004. 1082.99 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  16005. 1082.99 s [extra] +++ OK, passed 1 test.
  16006. 1082.99 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  16007. 1082.99 s [extra] +++ OK, passed 1 test.
  16008. 1082.99 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  16009. 1082.99 s [extra] +++ OK, passed 1 test.
  16010. 1082.99 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  16011. 1082.99 s [extra] +++ OK, passed 1 test.
  16012. 1082.99 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  16013. 1082.99 s [extra] +++ OK, passed 1 test.
  16014. 1082.99 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  16015. 1082.99 s [extra] +++ OK, passed 1 test.
  16016. 1082.99 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  16017. 1082.99 s [extra] +++ OK, passed 1 test.
  16018. 1082.99 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  16019. 1082.99 s [extra] +++ OK, passed 1 test.
  16020. 1082.99 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  16021. 1082.99 s [extra] +++ OK, passed 1 test.
  16022. 1082.99 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  16023. 1082.99 s [extra] +++ OK, passed 1 test.
  16024. 1082.99 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  16025. 1082.99 s [extra] +++ OK, passed 1 test.
  16026. 1082.99 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  16027. 1082.99 s [extra] +++ OK, passed 1 test.
  16028. 1082.99 s [extra] stripSuffix "" "baz" == Just "baz"
  16029. 1082.99 s [extra] +++ OK, passed 1 test.
  16030. 1082.99 s [extra] stripSuffix "foo" "quux" == Nothing
  16031. 1082.99 s [extra] +++ OK, passed 1 test.
  16032. 1082.99 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  16033. 1082.99 s [extra] +++ OK, passed 1 test.
  16034. 1082.99 s [extra] stripInfix "/" "foobar" == Nothing
  16035. 1082.99 s [extra] +++ OK, passed 1 test.
  16036. 1082.99 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  16037. 1082.99 s [extra] +++ OK, passed 1 test.
  16038. 1082.99 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  16039. 1082.99 s [extra] +++ OK, passed 1 test.
  16040. 1082.99 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  16041. 1082.99 s [extra] +++ OK, passed 1 test.
  16042. 1082.99 s [extra] chunksOf 8 "" == []
  16043. 1082.99 s [extra] +++ OK, passed 1 test.
  16044. 1082.99 s [extra] chunksOf 0 "test" == undefined
  16045. 1082.99 s [extra] +++ OK, passed 1 test.
  16046. 1082.99 s [extra] nubSort "this is a test" == " aehist"
  16047. 1082.99 s [extra] +++ OK, passed 1 test.
  16048. 1082.99 s [extra] \xs -> nubSort xs == nub (sort xs)
  16049. 1082.99 s [extra] +++ OK, passed 100 tests.
  16050. 1082.99 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  16051. 1082.99 s [extra] +++ OK, passed 1 test.
  16052. 1082.99 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  16053. 1082.99 s [extra] +++ OK, passed 1 test.
  16054. 1082.99 s [extra] nubOrd "this is a test" == "this ae"
  16055. 1083.00 s [extra] +++ OK, passed 1 test.
  16056. 1083.00 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  16057. 1083.00 s [extra] +++ OK, passed 1 test.
  16058. 1083.00 s [extra] \xs -> nubOrd xs == nub xs
  16059. 1083.00 s [extra] +++ OK, passed 100 tests.
  16060. 1083.00 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  16061. 1083.00 s [extra] +++ OK, passed 1 test.
  16062. 1083.00 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  16063. 1083.00 s [extra] +++ OK, passed 1 test.
  16064. 1083.00 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  16065. 1083.00 s [extra] +++ OK, passed 1 test.
  16066. 1083.00 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  16067. 1083.00 s [extra] +++ OK, passed 1 test.
  16068. 1083.00 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  16069. 1083.00 s [extra] +++ OK, passed 1 test.
  16070. 1083.00 s [extra] compareLength [1,2,3] 1 == GT
  16071. 1083.00 s [extra] +++ OK, passed 1 test.
  16072. 1083.00 s [extra] compareLength [1,2] 2 == EQ
  16073. 1083.00 s [extra] +++ OK, passed 1 test.
  16074. 1083.00 s [extra] \(xs :: [Int]) n -> compareLength xs n == compare (length xs) n
  16075. 1083.00 s [extra] +++ OK, passed 100 tests.
  16076. 1083.00 s [extra] compareLength (1:2:3:undefined) 2 == GT
  16077. 1083.00 s [extra] +++ OK, passed 1 test.
  16078. 1083.00 s [extra] comparingLength [1,2,3] [False] == GT
  16079. 1083.00 s [extra] +++ OK, passed 1 test.
  16080. 1083.00 s [extra] comparingLength [1,2] "ab" == EQ
  16081. 1083.00 s [extra] +++ OK, passed 1 test.
  16082. 1083.00 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  16083. 1083.01 s [extra] +++ OK, passed 100 tests.
  16084. 1083.01 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  16085. 1083.01 s [extra] +++ OK, passed 1 test.
  16086. 1083.01 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  16087. 1083.01 s [extra] +++ OK, passed 1 test.
  16088. 1083.01 s [extra] mwhen True "test" == "test"
  16089. 1083.01 s [extra] +++ OK, passed 1 test.
  16090. 1083.01 s [extra] mwhen False "test" == ""
  16091. 1083.01 s [extra] +++ OK, passed 1 test.
  16092. 1083.01 s [extra] first succ (1,"test") == (2,"test")
  16093. 1083.01 s [extra] +++ OK, passed 1 test.
  16094. 1083.01 s [extra] second reverse (1,"test") == (1,"tset")
  16095. 1083.01 s [extra] +++ OK, passed 1 test.
  16096. 1083.01 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  16097. 1083.01 s [extra] +++ OK, passed 1 test.
  16098. 1083.01 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  16099. 1083.01 s [extra] +++ OK, passed 1 test.
  16100. 1083.01 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  16101. 1083.01 s [extra] +++ OK, passed 1 test.
  16102. 1083.01 s [extra] (succ &&& pred) 1 == (2,0)
  16103. 1083.01 s [extra] +++ OK, passed 1 test.
  16104. 1083.01 s [extra] dupe 12 == (12, 12)
  16105. 1083.01 s [extra] +++ OK, passed 1 test.
  16106. 1083.01 s [extra] both succ (1,2) == (2,3)
  16107. 1083.01 s [extra] +++ OK, passed 1 test.
  16108. 1083.01 s [extra] first3 succ (1,1,1) == (2,1,1)
  16109. 1083.01 s [extra] +++ OK, passed 1 test.
  16110. 1083.01 s [extra] second3 succ (1,1,1) == (1,2,1)
  16111. 1083.01 s [extra] +++ OK, passed 1 test.
  16112. 1083.01 s [extra] third3 succ (1,1,1) == (1,1,2)
  16113. 1083.01 s [extra] +++ OK, passed 1 test.
  16114. 1083.01 s [extra] \x -> readVersion (showVersion x) == x
  16115. 1083.01 s [extra] +++ OK, passed 100 tests.
  16116. 1083.01 s [extra] readVersion "hello" == undefined
  16117. 1083.01 s [extra] +++ OK, passed 1 test.
  16118. 1083.01 s [extra] showDP 4 pi == "3.1416"
  16119. 1083.01 s [extra] +++ OK, passed 1 test.
  16120. 1083.01 s [extra] showDP 0 pi == "3"
  16121. 1083.01 s [extra] +++ OK, passed 1 test.
  16122. 1083.01 s [extra] showDP 2 3 == "3.00"
  16123. 1083.01 s [extra] +++ OK, passed 1 test.
  16124. 1083.01 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  16125. 1083.01 s [extra] +++ OK, passed 1 test.
  16126. 1083.01 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  16127. 1083.01 s [extra] +++ OK, passed 1 test.
  16128. 1083.01 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  16129. 1083.01 s [extra] +++ OK, passed 1 test.
  16130. 1083.01 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  16131. 1083.02 s [extra] +++ OK, passed 1 test.
  16132. 1083.02 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  16133. 1083.02 s [extra] +++ OK, passed 1 test.
  16134. 1083.02 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16135. 1083.02 s [extra] +++ OK, passed 1 test.
  16136. 1083.02 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16137. 1083.02 s [extra] +++ OK, passed 1 test.
  16138. 1083.02 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  16139. 1083.02 s [extra] +++ OK, passed 1 test.
  16140. 1083.02 s [extra] isWindows == (os == "mingw32")
  16141. 1083.02 s [extra] +++ OK, passed 1 test.
  16142. 1083.02 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  16143. 1083.19 s [extra] +++ OK, passed 100 tests.
  16144. 1083.19 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  16145. 1083.37 s [extra] +++ OK, passed 100 tests.
  16146. 1083.37 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  16147. 1083.48 s [extra] +++ OK, passed 100 tests.
  16148. 1083.48 s [extra] captureOutput (print 1) == pure ("1\n",())
  16149. 1083.48 s [extra] +++ OK, passed 1 test.
  16150. 1083.48 s [extra] withTempFile doesFileExist == pure True
  16151. 1083.48 s [extra] +++ OK, passed 1 test.
  16152. 1083.48 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  16153. 1083.48 s [extra] +++ OK, passed 1 test.
  16154. 1083.48 s [extra] withTempFile readFile' == pure ""
  16155. 1083.48 s [extra] +++ OK, passed 1 test.
  16156. 1083.48 s [extra] withTempDir doesDirectoryExist == pure True
  16157. 1083.48 s [extra] +++ OK, passed 1 test.
  16158. 1083.48 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  16159. 1083.48 s [extra] +++ OK, passed 1 test.
  16160. 1083.48 s [extra] withTempDir listFiles == pure []
  16161. 1083.48 s [extra] +++ OK, passed 1 test.
  16162. 1083.48 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  16163. 1083.48 s [extra] +++ OK, passed 1 test.
  16164. 1083.48 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  16165. 1083.48 s [extra] +++ OK, passed 1 test.
  16166. 1083.48 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  16167. 1083.48 s [extra] +++ OK, passed 1 test.
  16168. 1083.48 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  16169. 1083.48 s [extra] +++ OK, passed 1 test.
  16170. 1083.48 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  16171. 1083.49 s [extra] +++ OK, passed 1 test.
  16172. 1083.49 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  16173. 1083.49 s [extra] +++ OK, passed 1 test.
  16174. 1083.49 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  16175. 1084.49 s [extra] +++ OK, passed 1 test.
  16176. 1084.49 s [extra] timeout (-3) (print 1) == pure Nothing
  16177. 1084.49 s [extra] +++ OK, passed 1 test.
  16178. 1084.49 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  16179. 1084.50 s [extra] +++ OK, passed 1 test.
  16180. 1084.50 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  16181. 1084.60 s [extra] 0.104603652
  16182. 1084.60 s [extra] +++ OK, passed 1 test.
  16183. 1084.60 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  16184. 1084.71 s [extra] +++ OK, passed 1 test.
  16185. 1084.71 s [extra] showDuration 3.435 == "3.44s"
  16186. 1084.71 s [extra] +++ OK, passed 1 test.
  16187. 1084.71 s [extra] showDuration 623.8 == "10m24s"
  16188. 1084.71 s [extra] +++ OK, passed 1 test.
  16189. 1084.71 s [extra] showDuration 62003.8 == "17h13m"
  16190. 1084.71 s [extra] +++ OK, passed 1 test.
  16191. 1084.71 s [extra] showDuration 1e8 == "27777h47m"
  16192. 1084.71 s [extra] +++ OK, passed 1 test.
  16193. 1084.71 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  16194. 1084.71 s [extra] +++ OK, passed 1 test.
  16195. 1084.71 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  16196. 1085.71 s [extra] +++ OK, passed 1 test.
  16197. 1085.71 s [extra] Extra export
  16198. 1085.71 s [extra] +++ OK, passed 1 test.
  16199. 1085.71 s [extra] withTempFile
  16200. 1085.74 s [extra] ....done
  16201. 1085.74 s [extra] withTempDir
  16202. 1085.75 s [extra] ....done
  16203. 1085.75 s [extra] retry
  16204. 1085.75 s [extra] +++ OK, passed 1 test.
  16205. 1085.75 s [extra] barrier
  16206. 1085.75 s [extra] Success (323 tests)
  16207. 1085.78 s [extra] Test suite extra-test: PASS
  16208. 1085.78 s [extra] Test suite logged to: dist/test/extra-1.7.16-extra-test.log
  16209. 1085.78 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  16210. 1085.79 s [extra] Phase: haddockPhase
  16211. 1085.99 s [extra] Preprocessing library for extra-1.7.16..
  16212. 1086.00 s [extra] Running Haddock on library for extra-1.7.16..
  16213. 1086.17 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  16214. 1086.54 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  16215. 1086.57 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  16216. 1086.58 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  16217. 1086.63 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  16218. 1086.63 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  16219. 1086.63 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  16220. 1086.63 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  16221. 1086.88 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  16222. 1086.89 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  16223. 1086.91 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  16224. 1086.97 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  16225. 1087.01 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  16226. 1087.05 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  16227. 1087.07 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  16228. 1087.10 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  16229. 1087.13 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  16230. 1087.13 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  16231. 1087.27 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  16232. 1087.28 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  16233. 1087.29 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  16234. 1087.32 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  16235. 1087.43 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  16236. 1087.43 s [extra] Haddock coverage:
  16237. 1087.44 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  16238. 1087.44 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  16239. 1087.44 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  16240. 1087.44 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  16241. 1087.44 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  16242. 1087.45 s [extra] Warning: '(:)' is out of scope.
  16243. 1087.45 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16244. 1087.45 s [extra] Warning: 'unzip' is ambiguous. It is defined
  16245. 1087.45 s [extra] * in ‘Data.Functor’
  16246. 1087.45 s [extra] * in ‘GHC.List’
  16247. 1087.45 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16248. 1087.45 s [extra] by specifying the type/value namespace explicitly.
  16249. 1087.45 s [extra] Defaulting to the one defined in ‘GHC.List’
  16250. 1087.45 s [extra] Warning: 'firstJustM' is out of scope.
  16251. 1087.45 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16252. 1087.45 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  16253. 1087.45 s [extra] Warning: 'Version' is ambiguous. It is defined
  16254. 1087.45 s [extra] * in ‘Data.Version’
  16255. 1087.45 s [extra] * in ‘Data.Version’
  16256. 1087.45 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16257. 1087.45 s [extra] by specifying the type/value namespace explicitly.
  16258. 1087.45 s [extra] Defaulting to the one defined in ‘Data.Version’
  16259. 1087.45 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  16260. 1087.46 s [extra] Warning: '(!?)' is ambiguous. It is defined
  16261. 1087.46 s [extra] * in ‘GHC.List’
  16262. 1087.46 s [extra] * at src/Data/List/NonEmpty/Extra.hs:48:1
  16263. 1087.46 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16264. 1087.46 s [extra] by specifying the type/value namespace explicitly.
  16265. 1087.46 s [extra] Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:48:1
  16266. 1087.46 s [extra] Warning: 'union' is ambiguous. It is defined
  16267. 1087.46 s [extra] * in ‘Data.OldList’
  16268. 1087.46 s [extra] * at src/Data/List/NonEmpty/Extra.hs:80:1
  16269. 1087.46 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16270. 1087.46 s [extra] by specifying the type/value namespace explicitly.
  16271. 1087.46 s [extra] Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:80:1
  16272. 1087.46 s [extra] 100% ( 22 / 22) in 'Data.List.NonEmpty.Extra'
  16273. 1087.46 s [extra] Warning: 'fromJust' is out of scope.
  16274. 1087.46 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16275. 1087.46 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  16276. 1087.46 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  16277. 1087.46 s [extra] * in ‘GHC.Exception’
  16278. 1087.46 s [extra] * in ‘GHC.Exception’
  16279. 1087.46 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16280. 1087.46 s [extra] by specifying the type/value namespace explicitly.
  16281. 1087.46 s [extra] Defaulting to the one defined in ‘GHC.Exception’
  16282. 1087.46 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  16283. 1087.46 s [extra] * in ‘GHC.IO.Exception’
  16284. 1087.46 s [extra] * in ‘GHC.IO.Exception’
  16285. 1087.46 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16286. 1087.46 s [extra] by specifying the type/value namespace explicitly.
  16287. 1087.46 s [extra] Defaulting to the one defined in ‘GHC.IO.Exception’
  16288. 1087.46 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  16289. 1087.46 s [extra] * in ‘GHC.Exception.Type’
  16290. 1087.46 s [extra] * in ‘GHC.Exception.Type’
  16291. 1087.46 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16292. 1087.46 s [extra] by specifying the type/value namespace explicitly.
  16293. 1087.46 s [extra] Defaulting to the one defined in ‘GHC.Exception.Type’
  16294. 1087.46 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  16295. 1087.46 s [extra] Warning: 'partition' is out of scope.
  16296. 1087.46 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16297. 1087.46 s [extra] Warning: 'mconcatMap' is out of scope.
  16298. 1087.46 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16299. 1087.47 s [extra] Warning: 'find' is out of scope.
  16300. 1087.47 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16301. 1087.47 s [extra] 100% ( 38 / 38) in 'Control.Monad.Extra'
  16302. 1087.47 s [extra] 92% ( 12 / 13) in 'Data.Foldable.Extra'
  16303. 1087.47 s [extra] Missing documentation for:
  16304. 1087.47 s [extra] Module header
  16305. 1087.47 s [extra] Warning: 'Lock' is ambiguous. It is defined
  16306. 1087.47 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  16307. 1087.47 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  16308. 1087.47 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16309. 1087.47 s [extra] by specifying the type/value namespace explicitly.
  16310. 1087.47 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  16311. 1087.47 s [extra] Warning: 'Var' is ambiguous. It is defined
  16312. 1087.47 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  16313. 1087.47 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  16314. 1087.47 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16315. 1087.47 s [extra] by specifying the type/value namespace explicitly.
  16316. 1087.47 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  16317. 1087.47 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  16318. 1087.47 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  16319. 1087.47 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  16320. 1087.47 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16321. 1087.47 s [extra] by specifying the type/value namespace explicitly.
  16322. 1087.47 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  16323. 1087.47 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  16324. 1087.49 s [extra] Warning: 'createDirectory' is ambiguous. It is defined
  16325. 1087.49 s [extra] * in ‘System.Directory’
  16326. 1087.49 s [extra] * in ‘System.Posix.Directory’
  16327. 1087.49 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16328. 1087.49 s [extra] by specifying the type/value namespace explicitly.
  16329. 1087.49 s [extra] Defaulting to the one defined in ‘System.Posix.Directory’
  16330. 1087.49 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  16331. 1087.49 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  16332. 1087.49 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  16333. 1087.49 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  16334. 1087.49 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  16335. 1087.49 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  16336. 1087.49 s [extra] 100% (268 /268) in 'Extra'
  16337. 1087.49 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  16338. 1087.91 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  16339. 1087.91 s [extra] - GHC.Generics.Rep1_Solo
  16340. 1087.91 s [extra] - GHC.Generics.Rep_Solo
  16341. 1091.61 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  16342. 1091.71 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16..
  16343. 1091.80 s [extra] Phase: installPhase
  16344. 1091.83 s [extra] Installing library in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  16345. 1092.85 s [extra] Phase: fixupPhase
  16346. 1093.02 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
  16347. 1093.02 s [extra] shrinking /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSextra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ-ghc9.8.1.so
  16348. 1093.02 s [extra] checking for references to /build/ in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16...
  16349. 1093.04 s [extra] patching script interpreter paths in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
  16350. 1093.06 s [extra] stripping (with command strip and flags -S -p) in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib
  16351. 1093.59 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc
  16352. 1093.61 s [extra] checking for references to /build/ in /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc...
  16353. 1093.66 s [extra] patching script interpreter paths in /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc
  16354. 1094.18 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
  16355. 1095.69 s [extra:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  16356. 1095.69 s [extra:post-build]
  16357. 1096.07 s [extra:post-build] Pushing /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16 (4.07 MiB)
  16358. 1096.15 s [extra:post-build] Pushing /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc (3.06 MiB)
  16359. 1097.19 s [extra:post-build]
  16360. 1097.19 s [extra:post-build] All done.
  16361. 1097.40 s [extra:post-build] Uploading to the NixCI cache: /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
  16362. 1097.93 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16363. 1098.23 s [extra:post-build] copying 2 paths...
  16364. 1098.23 s [extra:post-build] copying path '/nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc' to 'https://cache.nix-ci.com'...
  16365. 1099.13 s [extra:post-build] copying path '/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16' to 'https://cache.nix-ci.com'...
  16366. 1101.84 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16367. 1102.30 s [extra:post-build] copying 1 paths...
  16368. 1102.34 s [extra:post-build] copying path '/nix/store/9p7f127bf99874y0pziszzcc3pkbckn3-extra-1.7.16.drv' to 'https://cache.nix-ci.com'...
  16369. 1102.86 s Progress: 40 of 46 built
  16370. 1102.92 s Building /nix/store/95fb9gb6crg1i0pfri43y25jsra3fcj4-algebraic-graphs-0.7.drv
  16371. 1103.02 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  16372. 1103.03 s [algebraic-graphs] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  16373. 1103.33 s [algebraic-graphs] Phase: unpackPhase
  16374. 1103.34 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  16375. 1103.37 s [algebraic-graphs] source root is algebraic-graphs-0.7
  16376. 1103.39 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  16377. 1103.41 s [algebraic-graphs] Phase: patchPhase
  16378. 1103.43 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  16379. 1103.46 s [algebraic-graphs] Phase: compileBuildDriverPhase
  16380. 1103.55 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.MslengsmfE/setup-package.conf.d -threaded
  16381. 1103.77 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.MslengsmfE/Main.o )
  16382. 1103.92 s [algebraic-graphs] [2 of 2] Linking Setup
  16383. 1106.15 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  16384. 1106.18 s [algebraic-graphs] Phase: configurePhase
  16385. 1106.21 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.MslengsmfE/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
  16386. 1106.23 s [algebraic-graphs] Using Parsec parser
  16387. 1106.23 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  16388. 1106.97 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.6.0
  16389. 1106.97 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.0.0
  16390. 1106.97 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  16391. 1106.97 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16392. 1106.97 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  16393. 1106.97 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
  16394. 1106.97 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  16395. 1106.97 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.6.0
  16396. 1106.97 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.0.0
  16397. 1106.97 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  16398. 1106.97 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16399. 1106.97 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.7.16
  16400. 1106.97 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.6: using
  16401. 1106.97 s [algebraic-graphs] inspection-testing-0.5.0.3
  16402. 1106.97 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  16403. 1107.65 s [algebraic-graphs] Source component graph:
  16404. 1107.70 s [algebraic-graphs] component lib
  16405. 1107.70 s [algebraic-graphs] component test:main dependency lib
  16406. 1107.70 s [algebraic-graphs] Configured component graph:
  16407. 1107.70 s [algebraic-graphs] component algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  16408. 1107.70 s [algebraic-graphs] include array-0.5.6.0-dc89
  16409. 1107.70 s [algebraic-graphs] include base-4.19.0.0-b960
  16410. 1107.70 s [algebraic-graphs] include containers-0.6.8-4775
  16411. 1107.70 s [algebraic-graphs] include deepseq-1.5.0.0-412f
  16412. 1107.70 s [algebraic-graphs] include transformers-0.6.1.0-c3ec
  16413. 1107.70 s [algebraic-graphs] component algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
  16414. 1107.70 s [algebraic-graphs] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  16415. 1107.70 s [algebraic-graphs] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  16416. 1107.70 s [algebraic-graphs] include array-0.5.6.0-dc89
  16417. 1107.70 s [algebraic-graphs] include base-4.19.0.0-b960
  16418. 1107.70 s [algebraic-graphs] include containers-0.6.8-4775
  16419. 1107.70 s [algebraic-graphs] include deepseq-1.5.0.0-412f
  16420. 1107.70 s [algebraic-graphs] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  16421. 1107.70 s [algebraic-graphs] include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
  16422. 1107.70 s [algebraic-graphs] include transformers-0.6.1.0-c3ec
  16423. 1107.70 s [algebraic-graphs] Linked component graph:
  16424. 1107.70 s [algebraic-graphs] unit algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  16425. 1107.70 s [algebraic-graphs] include array-0.5.6.0-dc89
  16426. 1107.70 s [algebraic-graphs] include base-4.19.0.0-b960
  16427. 1107.70 s [algebraic-graphs] include containers-0.6.8-4775
  16428. 1107.70 s [algebraic-graphs] include deepseq-1.5.0.0-412f
  16429. 1107.70 s [algebraic-graphs] include transformers-0.6.1.0-c3ec
  16430. 1107.70 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Data.Graph.Typed
  16431. 1107.70 s [algebraic-graphs] unit algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
  16432. 1107.70 s [algebraic-graphs] include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  16433. 1107.70 s [algebraic-graphs] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  16434. 1107.70 s [algebraic-graphs] include array-0.5.6.0-dc89
  16435. 1107.70 s [algebraic-graphs] include base-4.19.0.0-b960
  16436. 1107.70 s [algebraic-graphs] include containers-0.6.8-4775
  16437. 1107.70 s [algebraic-graphs] include deepseq-1.5.0.0-412f
  16438. 1107.70 s [algebraic-graphs] include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  16439. 1107.70 s [algebraic-graphs] include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
  16440. 1107.70 s [algebraic-graphs] include transformers-0.6.1.0-c3ec
  16441. 1107.70 s [algebraic-graphs] Ready component graph:
  16442. 1107.70 s [algebraic-graphs] definite algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  16443. 1107.70 s [algebraic-graphs] depends array-0.5.6.0-dc89
  16444. 1107.70 s [algebraic-graphs] depends base-4.19.0.0-b960
  16445. 1107.70 s [algebraic-graphs] depends containers-0.6.8-4775
  16446. 1107.70 s [algebraic-graphs] depends deepseq-1.5.0.0-412f
  16447. 1107.70 s [algebraic-graphs] depends transformers-0.6.1.0-c3ec
  16448. 1107.70 s [algebraic-graphs] definite algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
  16449. 1107.70 s [algebraic-graphs] depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
  16450. 1107.70 s [algebraic-graphs] depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  16451. 1107.70 s [algebraic-graphs] depends array-0.5.6.0-dc89
  16452. 1107.70 s [algebraic-graphs] depends base-4.19.0.0-b960
  16453. 1107.70 s [algebraic-graphs] depends containers-0.6.8-4775
  16454. 1107.70 s [algebraic-graphs] depends deepseq-1.5.0.0-412f
  16455. 1107.70 s [algebraic-graphs] depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
  16456. 1107.70 s [algebraic-graphs] depends inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
  16457. 1107.70 s [algebraic-graphs] depends transformers-0.6.1.0-c3ec
  16458. 1107.70 s [algebraic-graphs] Using Cabal-3.10.2.0 compiled by ghc-9.8
  16459. 1107.70 s [algebraic-graphs] Using compiler: ghc-9.8.1
  16460. 1107.70 s [algebraic-graphs] Using install prefix:
  16461. 1107.70 s [algebraic-graphs] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  16462. 1107.70 s [algebraic-graphs] Executables installed in:
  16463. 1107.70 s [algebraic-graphs] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/bin
  16464. 1107.70 s [algebraic-graphs] Libraries installed in:
  16465. 1107.70 s [algebraic-graphs] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  16466. 1107.70 s [algebraic-graphs] Dynamic Libraries installed in:
  16467. 1107.70 s [algebraic-graphs] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
  16468. 1107.70 s [algebraic-graphs] Private executables installed in:
  16469. 1107.70 s [algebraic-graphs] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
  16470. 1107.70 s [algebraic-graphs] Data files installed in:
  16471. 1107.70 s [algebraic-graphs] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
  16472. 1107.70 s [algebraic-graphs] Documentation installed in:
  16473. 1107.70 s [algebraic-graphs] /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  16474. 1107.70 s [algebraic-graphs] Configuration files installed in:
  16475. 1107.70 s [algebraic-graphs] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/etc
  16476. 1107.70 s [algebraic-graphs] No alex found
  16477. 1107.70 s [algebraic-graphs] Using ar found on system at:
  16478. 1107.70 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  16479. 1107.70 s [algebraic-graphs] No c2hs found
  16480. 1107.70 s [algebraic-graphs] No cpphs found
  16481. 1107.70 s [algebraic-graphs] No doctest found
  16482. 1107.70 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  16483. 1107.70 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  16484. 1107.70 s [algebraic-graphs] Using ghc version 9.8.1 found on system at:
  16485. 1107.70 s [algebraic-graphs] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  16486. 1107.70 s [algebraic-graphs] Using ghc-pkg version 9.8.1 found on system at:
  16487. 1107.70 s [algebraic-graphs] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  16488. 1107.70 s [algebraic-graphs] No ghcjs found
  16489. 1107.70 s [algebraic-graphs] No ghcjs-pkg found
  16490. 1107.70 s [algebraic-graphs] No greencard found
  16491. 1107.70 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  16492. 1107.70 s [algebraic-graphs] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  16493. 1107.70 s [algebraic-graphs] No happy found
  16494. 1107.70 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  16495. 1107.70 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16496. 1107.70 s [algebraic-graphs] No hmake found
  16497. 1107.70 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  16498. 1107.70 s [algebraic-graphs] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  16499. 1107.70 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  16500. 1107.70 s [algebraic-graphs] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  16501. 1107.70 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  16502. 1107.70 s [algebraic-graphs] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  16503. 1107.70 s [algebraic-graphs] No jhc found
  16504. 1107.70 s [algebraic-graphs] Using ld found on system at:
  16505. 1107.70 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  16506. 1107.70 s [algebraic-graphs] No pkg-config found
  16507. 1107.70 s [algebraic-graphs] Using runghc version 9.8.1 found on system at:
  16508. 1107.70 s [algebraic-graphs] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  16509. 1107.70 s [algebraic-graphs] Using strip version 2.44 found on system at:
  16510. 1107.70 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  16511. 1107.70 s [algebraic-graphs] Using tar found on system at:
  16512. 1107.70 s [algebraic-graphs] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  16513. 1107.70 s [algebraic-graphs] No uhc found
  16514. 1108.00 s [algebraic-graphs] Phase: buildPhase
  16515. 1108.10 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  16516. 1108.10 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  16517. 1108.33 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 )
  16518. 1110.92 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
  16519. 1112.11 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 )
  16520. 1113.48 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 )
  16521. 1113.58 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  16522. 1115.40 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 )
  16523. 1116.06 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 )
  16524. 1116.81 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 )
  16525. 1118.23 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 )
  16526. 1118.23 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 )
  16527. 1118.23 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 )
  16528. 1118.23 s [algebraic-graphs]
  16529. 1118.23 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16530. 1118.23 s [algebraic-graphs] In the use of ‘head’
  16531. 1118.23 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16532. 1118.23 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."
  16533. 1118.23 s [algebraic-graphs] |
  16534. 1118.23 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16535. 1118.23 s [algebraic-graphs] | ^^^^
  16536. 1118.23 s [algebraic-graphs]
  16537. 1118.23 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16538. 1118.23 s [algebraic-graphs] In the use of ‘tail’
  16539. 1118.23 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16540. 1118.23 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."
  16541. 1118.23 s [algebraic-graphs] |
  16542. 1118.23 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16543. 1118.23 s [algebraic-graphs] | ^^^^
  16544. 1118.23 s [algebraic-graphs]
  16545. 1118.23 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16546. 1118.23 s [algebraic-graphs] In the use of ‘head’
  16547. 1118.23 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16548. 1118.23 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."
  16549. 1118.23 s [algebraic-graphs] |
  16550. 1118.23 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16551. 1118.23 s [algebraic-graphs] | ^^^^
  16552. 1118.23 s [algebraic-graphs]
  16553. 1118.23 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16554. 1118.23 s [algebraic-graphs] In the use of ‘tail’
  16555. 1118.23 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16556. 1118.23 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."
  16557. 1118.23 s [algebraic-graphs] |
  16558. 1118.23 s [algebraic-graphs] 397 | bnd' = tail bnd
  16559. 1118.23 s [algebraic-graphs] | ^^^^
  16560. 1118.23 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 )
  16561. 1118.23 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 )
  16562. 1118.23 s [algebraic-graphs]
  16563. 1118.23 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16564. 1118.23 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16565. 1118.23 s [algebraic-graphs] will become an error in a future GHC release.
  16566. 1118.23 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16567. 1118.23 s [algebraic-graphs] |
  16568. 1118.23 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16569. 1118.23 s [algebraic-graphs] | ^
  16570. 1118.23 s [algebraic-graphs]
  16571. 1118.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16572. 1118.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16573. 1118.24 s [algebraic-graphs] will become an error in a future GHC release.
  16574. 1118.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16575. 1118.24 s [algebraic-graphs] |
  16576. 1118.24 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16577. 1118.24 s [algebraic-graphs] | ^
  16578. 1118.24 s [algebraic-graphs]
  16579. 1118.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16580. 1118.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16581. 1118.24 s [algebraic-graphs] will become an error in a future GHC release.
  16582. 1118.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16583. 1118.24 s [algebraic-graphs] |
  16584. 1118.24 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16585. 1118.24 s [algebraic-graphs] | ^
  16586. 1118.24 s [algebraic-graphs]
  16587. 1118.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16588. 1118.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16589. 1118.24 s [algebraic-graphs] will become an error in a future GHC release.
  16590. 1118.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16591. 1118.24 s [algebraic-graphs] |
  16592. 1118.24 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16593. 1118.24 s [algebraic-graphs] | ^
  16594. 1118.24 s [algebraic-graphs]
  16595. 1118.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16596. 1118.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16597. 1118.24 s [algebraic-graphs] will become an error in a future GHC release.
  16598. 1118.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16599. 1118.24 s [algebraic-graphs] |
  16600. 1118.24 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16601. 1118.24 s [algebraic-graphs] | ^
  16602. 1118.24 s [algebraic-graphs]
  16603. 1118.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16604. 1118.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16605. 1118.24 s [algebraic-graphs] will become an error in a future GHC release.
  16606. 1118.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16607. 1118.24 s [algebraic-graphs] |
  16608. 1118.24 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16609. 1118.24 s [algebraic-graphs] | ^
  16610. 1118.24 s [algebraic-graphs]
  16611. 1118.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16612. 1118.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16613. 1118.24 s [algebraic-graphs] will become an error in a future GHC release.
  16614. 1118.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16615. 1118.24 s [algebraic-graphs] |
  16616. 1118.24 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16617. 1118.24 s [algebraic-graphs] | ^
  16618. 1118.24 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 )
  16619. 1118.74 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 )
  16620. 1119.36 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 )
  16621. 1119.46 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 )
  16622. 1119.46 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 )
  16623. 1120.15 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 )
  16624. 1120.48 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 )
  16625. 1120.85 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 )
  16626. 1120.85 s [algebraic-graphs]
  16627. 1120.85 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16628. 1120.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16629. 1120.85 s [algebraic-graphs] will become an error in a future GHC release.
  16630. 1120.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16631. 1120.85 s [algebraic-graphs] |
  16632. 1120.85 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16633. 1120.85 s [algebraic-graphs] | ^
  16634. 1120.85 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 )
  16635. 1120.85 s [algebraic-graphs]
  16636. 1120.85 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16637. 1120.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16638. 1120.85 s [algebraic-graphs] will become an error in a future GHC release.
  16639. 1120.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16640. 1120.85 s [algebraic-graphs] |
  16641. 1120.85 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16642. 1120.85 s [algebraic-graphs] | ^
  16643. 1120.85 s [algebraic-graphs]
  16644. 1120.85 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16645. 1120.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16646. 1120.85 s [algebraic-graphs] will become an error in a future GHC release.
  16647. 1120.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16648. 1120.85 s [algebraic-graphs] |
  16649. 1120.85 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16650. 1120.85 s [algebraic-graphs] | ^
  16651. 1120.85 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 )
  16652. 1120.85 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 )
  16653. 1120.85 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 )
  16654. 1121.02 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 )
  16655. 1121.03 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 )
  16656. 1121.03 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 )
  16657. 1121.10 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 )
  16658. 1121.45 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  16659. 1122.88 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  16660. 1124.25 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 )
  16661. 1125.74 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  16662. 1125.74 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  16663. 1126.48 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 )
  16664. 1126.85 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 )
  16665. 1127.43 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
  16666. 1128.78 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  16667. 1128.78 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 )
  16668. 1128.78 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 )
  16669. 1128.78 s [algebraic-graphs]
  16670. 1128.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16671. 1128.78 s [algebraic-graphs] In the use of ‘head’
  16672. 1128.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16673. 1128.78 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."
  16674. 1128.78 s [algebraic-graphs] |
  16675. 1128.78 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16676. 1128.78 s [algebraic-graphs] | ^^^^
  16677. 1128.78 s [algebraic-graphs]
  16678. 1128.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16679. 1128.78 s [algebraic-graphs] In the use of ‘tail’
  16680. 1128.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16681. 1128.78 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."
  16682. 1128.78 s [algebraic-graphs] |
  16683. 1128.78 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16684. 1128.78 s [algebraic-graphs] | ^^^^
  16685. 1128.78 s [algebraic-graphs]
  16686. 1128.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16687. 1128.78 s [algebraic-graphs] In the use of ‘head’
  16688. 1128.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16689. 1128.78 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."
  16690. 1128.78 s [algebraic-graphs] |
  16691. 1128.78 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16692. 1128.78 s [algebraic-graphs] | ^^^^
  16693. 1128.78 s [algebraic-graphs]
  16694. 1128.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16695. 1128.78 s [algebraic-graphs] In the use of ‘tail’
  16696. 1128.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16697. 1128.78 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."
  16698. 1128.78 s [algebraic-graphs] |
  16699. 1128.79 s [algebraic-graphs] 397 | bnd' = tail bnd
  16700. 1128.79 s [algebraic-graphs] | ^^^^
  16701. 1128.79 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 )
  16702. 1128.79 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  16703. 1128.79 s [algebraic-graphs]
  16704. 1128.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16705. 1128.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16706. 1128.79 s [algebraic-graphs] will become an error in a future GHC release.
  16707. 1128.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16708. 1128.79 s [algebraic-graphs] |
  16709. 1128.79 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16710. 1128.79 s [algebraic-graphs] | ^
  16711. 1128.79 s [algebraic-graphs]
  16712. 1128.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16713. 1128.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16714. 1128.79 s [algebraic-graphs] will become an error in a future GHC release.
  16715. 1128.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16716. 1128.79 s [algebraic-graphs] |
  16717. 1128.79 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16718. 1128.79 s [algebraic-graphs] | ^
  16719. 1128.79 s [algebraic-graphs]
  16720. 1128.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16721. 1128.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16722. 1128.79 s [algebraic-graphs] will become an error in a future GHC release.
  16723. 1128.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16724. 1128.79 s [algebraic-graphs] |
  16725. 1128.79 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16726. 1128.79 s [algebraic-graphs] | ^
  16727. 1128.79 s [algebraic-graphs]
  16728. 1128.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16729. 1128.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16730. 1128.79 s [algebraic-graphs] will become an error in a future GHC release.
  16731. 1128.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16732. 1128.79 s [algebraic-graphs] |
  16733. 1128.79 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16734. 1128.79 s [algebraic-graphs] | ^
  16735. 1128.79 s [algebraic-graphs]
  16736. 1128.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16737. 1128.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16738. 1128.79 s [algebraic-graphs] will become an error in a future GHC release.
  16739. 1128.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16740. 1128.79 s [algebraic-graphs] |
  16741. 1128.79 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16742. 1128.79 s [algebraic-graphs] | ^
  16743. 1128.79 s [algebraic-graphs]
  16744. 1128.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16745. 1128.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16746. 1128.79 s [algebraic-graphs] will become an error in a future GHC release.
  16747. 1128.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16748. 1128.79 s [algebraic-graphs] |
  16749. 1128.79 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16750. 1128.79 s [algebraic-graphs] | ^
  16751. 1128.79 s [algebraic-graphs]
  16752. 1128.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16753. 1128.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16754. 1128.79 s [algebraic-graphs] will become an error in a future GHC release.
  16755. 1128.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16756. 1128.79 s [algebraic-graphs] |
  16757. 1128.79 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16758. 1128.79 s [algebraic-graphs] | ^
  16759. 1128.79 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  16760. 1129.31 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 )
  16761. 1129.85 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  16762. 1129.85 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 )
  16763. 1129.85 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  16764. 1130.44 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 )
  16765. 1130.84 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 )
  16766. 1131.08 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  16767. 1131.08 s [algebraic-graphs]
  16768. 1131.08 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16769. 1131.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16770. 1131.08 s [algebraic-graphs] will become an error in a future GHC release.
  16771. 1131.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16772. 1131.08 s [algebraic-graphs] |
  16773. 1131.08 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16774. 1131.08 s [algebraic-graphs] | ^
  16775. 1131.08 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 )
  16776. 1131.08 s [algebraic-graphs]
  16777. 1131.08 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16778. 1131.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16779. 1131.08 s [algebraic-graphs] will become an error in a future GHC release.
  16780. 1131.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16781. 1131.08 s [algebraic-graphs] |
  16782. 1131.08 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16783. 1131.08 s [algebraic-graphs] | ^
  16784. 1131.08 s [algebraic-graphs]
  16785. 1131.08 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16786. 1131.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16787. 1131.08 s [algebraic-graphs] will become an error in a future GHC release.
  16788. 1131.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16789. 1131.08 s [algebraic-graphs] |
  16790. 1131.08 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16791. 1131.08 s [algebraic-graphs] | ^
  16792. 1131.08 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  16793. 1131.08 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  16794. 1131.08 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 )
  16795. 1131.21 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 )
  16796. 1131.21 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 )
  16797. 1131.26 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 )
  16798. 1131.30 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  16799. 1132.60 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  16800. 1132.60 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  16801. 1132.79 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 )
  16802. 1134.24 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 )
  16803. 1139.17 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 )
  16804. 1139.22 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 )
  16805. 1139.22 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 )
  16806. 1141.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 )
  16807. 1141.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 )
  16808. 1141.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 )
  16809. 1146.84 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 )
  16810. 1147.08 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 )
  16811. 1147.08 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 )
  16812. 1147.82 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 )
  16813. 1147.82 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 )
  16814. 1147.82 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 )
  16815. 1148.66 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 )
  16816. 1148.66 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 )
  16817. 1148.66 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 )
  16818. 1148.66 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 )
  16819. 1148.66 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 )
  16820. 1148.66 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 )
  16821. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  16822. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  16823. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  16824. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  16825. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  16826. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  16827. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  16828. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  16829. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  16830. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  16831. 1148.66 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  16832. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  16833. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16834. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  16835. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  16836. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  16837. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  16838. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  16839. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  16840. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  16841. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  16842. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  16843. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  16844. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16845. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  16846. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16847. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  16848. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  16849. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16850. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16851. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  16852. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  16853. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  16854. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  16855. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  16856. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  16857. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  16858. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16859. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  16860. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  16861. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16862. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  16863. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  16864. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  16865. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  16866. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  16867. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  16868. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16869. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16870. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  16871. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  16872. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16873. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  16874. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  16875. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  16876. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  16877. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  16878. 1148.67 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  16879. 1148.67 s [algebraic-graphs] inspection testing successful
  16880. 1148.67 s [algebraic-graphs] expected successes: 58
  16881. 1148.67 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 )
  16882. 1148.67 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 )
  16883. 1148.67 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 )
  16884. 1149.53 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  16885. 1150.55 s [algebraic-graphs] buildPhase completed in 42 seconds
  16886. 1150.55 s [algebraic-graphs] Phase: checkPhase
  16887. 1150.57 s [algebraic-graphs] Running 1 test suites...
  16888. 1150.57 s [algebraic-graphs] Test suite main: RUNNING...
  16889. 1158.08 s [algebraic-graphs]
  16890. 1158.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  16891. 1158.12 s [algebraic-graphs] OK: show empty == "empty"
  16892. 1158.12 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  16893. 1158.12 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  16894. 1158.12 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  16895. 1158.12 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  16896. 1158.12 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  16897. 1158.12 s [algebraic-graphs]
  16898. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  16899. 1158.12 s [algebraic-graphs] OK: fromAcyclic empty == empty
  16900. 1158.12 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  16901. 1158.12 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  16902. 1158.12 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  16903. 1158.12 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  16904. 1158.12 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  16905. 1158.12 s [algebraic-graphs]
  16906. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  16907. 1158.12 s [algebraic-graphs] OK: isEmpty empty == True
  16908. 1158.12 s [algebraic-graphs] OK: hasVertex x empty == False
  16909. 1158.12 s [algebraic-graphs] OK: vertexCount empty == 0
  16910. 1158.12 s [algebraic-graphs] OK: edgeCount empty == 0
  16911. 1158.12 s [algebraic-graphs]
  16912. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  16913. 1158.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16914. 1158.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16915. 1158.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16916. 1158.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16917. 1158.12 s [algebraic-graphs]
  16918. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  16919. 1158.12 s [algebraic-graphs] OK: vertices [] == empty
  16920. 1158.12 s [algebraic-graphs] OK: vertices [x] == vertex x
  16921. 1158.12 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16922. 1158.12 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16923. 1158.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16924. 1158.12 s [algebraic-graphs]
  16925. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  16926. 1158.12 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  16927. 1158.12 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  16928. 1158.12 s [algebraic-graphs]
  16929. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  16930. 1158.12 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  16931. 1158.12 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  16932. 1158.12 s [algebraic-graphs]
  16933. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  16934. 1158.12 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  16935. 1158.12 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  16936. 1158.12 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16937. 1158.12 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  16938. 1158.12 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  16939. 1158.12 s [algebraic-graphs]
  16940. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  16941. 1158.12 s [algebraic-graphs] OK: isEmpty empty == True
  16942. 1158.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16943. 1158.12 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  16944. 1158.12 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  16945. 1158.12 s [algebraic-graphs]
  16946. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  16947. 1158.12 s [algebraic-graphs] OK: hasVertex x empty == False
  16948. 1158.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16949. 1158.12 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  16950. 1158.12 s [algebraic-graphs]
  16951. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  16952. 1158.12 s [algebraic-graphs] OK: hasEdge x y empty == False
  16953. 1158.12 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16954. 1158.12 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  16955. 1158.12 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  16956. 1158.12 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16957. 1158.12 s [algebraic-graphs]
  16958. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  16959. 1158.12 s [algebraic-graphs] OK: vertexCount empty == 0
  16960. 1158.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16961. 1158.12 s [algebraic-graphs] OK: vertexCount == length . vertexList
  16962. 1158.12 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  16963. 1158.12 s [algebraic-graphs]
  16964. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  16965. 1158.12 s [algebraic-graphs] OK: edgeCount empty == 0
  16966. 1158.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16967. 1158.12 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  16968. 1158.12 s [algebraic-graphs] OK: edgeCount == length . edgeList
  16969. 1158.12 s [algebraic-graphs]
  16970. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  16971. 1158.12 s [algebraic-graphs] OK: vertexList empty == []
  16972. 1158.12 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16973. 1158.12 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  16974. 1158.12 s [algebraic-graphs]
  16975. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  16976. 1158.12 s [algebraic-graphs] OK: edgeList empty == []
  16977. 1158.12 s [algebraic-graphs] OK: edgeList (vertex x) == []
  16978. 1158.12 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  16979. 1158.12 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16980. 1158.12 s [algebraic-graphs]
  16981. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  16982. 1158.12 s [algebraic-graphs] OK: adjacencyList empty == []
  16983. 1158.12 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  16984. 1158.12 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  16985. 1158.12 s [algebraic-graphs]
  16986. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  16987. 1158.12 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16988. 1158.12 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16989. 1158.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16990. 1158.12 s [algebraic-graphs]
  16991. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  16992. 1158.12 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  16993. 1158.12 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  16994. 1158.12 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  16995. 1158.12 s [algebraic-graphs]
  16996. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  16997. 1158.12 s [algebraic-graphs] OK: preSet x empty == Set.empty
  16998. 1158.12 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  16999. 1158.12 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  17000. 1158.12 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  17001. 1158.12 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  17002. 1158.12 s [algebraic-graphs]
  17003. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  17004. 1158.12 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17005. 1158.12 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17006. 1158.12 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  17007. 1158.12 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  17008. 1158.12 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  17009. 1158.12 s [algebraic-graphs]
  17010. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  17011. 1158.12 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17012. 1158.12 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17013. 1158.12 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  17014. 1158.12 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17015. 1158.12 s [algebraic-graphs]
  17016. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  17017. 1158.12 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  17018. 1158.12 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17019. 1158.12 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17020. 1158.12 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  17021. 1158.12 s [algebraic-graphs]
  17022. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  17023. 1158.12 s [algebraic-graphs] OK: transpose empty == empty
  17024. 1158.12 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17025. 1158.12 s [algebraic-graphs] OK: transpose . transpose == id
  17026. 1158.12 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17027. 1158.12 s [algebraic-graphs]
  17028. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  17029. 1158.12 s [algebraic-graphs] OK: induce (const True ) x == x
  17030. 1158.12 s [algebraic-graphs] OK: induce (const False) x == empty
  17031. 1158.12 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17032. 1158.12 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17033. 1158.12 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17034. 1158.12 s [algebraic-graphs]
  17035. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  17036. 1158.12 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17037. 1158.12 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  17038. 1158.12 s [algebraic-graphs]
  17039. 1158.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  17040. 1158.12 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  17041. 1158.12 s [algebraic-graphs]
  17042. 1158.12 s [algebraic-graphs] OK: box x y ~~ box y x
  17043. 1158.12 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17044. 1158.13 s [algebraic-graphs] OK: box x empty ~~ empty
  17045. 1158.13 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17046. 1158.13 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17047. 1158.13 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17048. 1158.13 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17049. 1158.13 s [algebraic-graphs]
  17050. 1158.13 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  17051. 1158.13 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17052. 1158.13 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17053. 1158.13 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  17054. 1158.13 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17055. 1158.13 s [algebraic-graphs]
  17056. 1158.13 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  17057. 1158.13 s [algebraic-graphs] OK: topSort empty == []
  17058. 1158.13 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  17059. 1158.13 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  17060. 1158.13 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  17061. 1158.13 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  17062. 1158.13 s [algebraic-graphs]
  17063. 1158.13 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  17064. 1158.13 s [algebraic-graphs] OK: scc empty == empty
  17065. 1158.13 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17066. 1158.13 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17067. 1158.13 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  17068. 1158.13 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17069. 1158.13 s [algebraic-graphs]
  17070. 1158.13 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  17071. 1158.13 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  17072. 1158.13 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  17073. 1158.13 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  17074. 1158.13 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  17075. 1158.13 s [algebraic-graphs]
  17076. 1158.13 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  17077. 1158.13 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  17078. 1158.13 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  17079. 1158.13 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  17080. 1158.13 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  17081. 1158.13 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  17082. 1158.13 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  17083. 1161.05 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  17084. 1161.05 s [algebraic-graphs]
  17085. 1161.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  17086. 1161.05 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  17087. 1161.05 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  17088. 1161.05 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  17089. 1161.05 s [algebraic-graphs]
  17090. 1161.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  17091. 1161.05 s [algebraic-graphs] OK: Arbitrary
  17092. 1161.05 s [algebraic-graphs] OK: empty
  17093. 1161.05 s [algebraic-graphs] OK: vertex
  17094. 1161.05 s [algebraic-graphs] OK: vertices
  17095. 1161.05 s [algebraic-graphs] OK: union
  17096. 1161.05 s [algebraic-graphs] OK: join
  17097. 1161.05 s [algebraic-graphs] OK: transpose
  17098. 1161.05 s [algebraic-graphs] OK: box
  17099. 1161.05 s [algebraic-graphs] OK: transitiveClosure
  17100. 1161.05 s [algebraic-graphs] OK: scc
  17101. 1161.05 s [algebraic-graphs] OK: toAcyclic
  17102. 1161.05 s [algebraic-graphs] OK: toAcyclicOrd
  17103. 1161.05 s [algebraic-graphs]
  17104. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap ============
  17105. 1161.05 s [algebraic-graphs] OK: Axioms of graphs
  17106. 1161.05 s [algebraic-graphs]
  17107. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  17108. 1161.05 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  17109. 1161.05 s [algebraic-graphs]
  17110. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  17111. 1161.05 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17112. 1161.05 s [algebraic-graphs]
  17113. 1161.05 s [algebraic-graphs] OK: consistent empty == True
  17114. 1161.05 s [algebraic-graphs] OK: consistent (vertex x) == True
  17115. 1161.05 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17116. 1161.05 s [algebraic-graphs] OK: consistent (connect x y) == True
  17117. 1161.05 s [algebraic-graphs] OK: consistent (edge x y) == True
  17118. 1161.05 s [algebraic-graphs] OK: consistent (edges xs) == True
  17119. 1161.05 s [algebraic-graphs] OK: consistent (stars xs) == True
  17120. 1161.05 s [algebraic-graphs]
  17121. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  17122. 1161.05 s [algebraic-graphs] OK: show (empty ) == "empty"
  17123. 1161.05 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17124. 1161.05 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17125. 1161.05 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17126. 1161.05 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17127. 1161.05 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17128. 1161.05 s [algebraic-graphs]
  17129. 1161.05 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17130. 1161.05 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17131. 1161.05 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17132. 1161.05 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17133. 1161.05 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17134. 1161.05 s [algebraic-graphs]
  17135. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  17136. 1161.05 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17137. 1161.05 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17138. 1161.05 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17139. 1161.05 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17140. 1161.05 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17141. 1161.05 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17142. 1161.05 s [algebraic-graphs] OK: x <= x + y
  17143. 1161.05 s [algebraic-graphs] OK: x + y <= x * y
  17144. 1161.05 s [algebraic-graphs]
  17145. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  17146. 1161.05 s [algebraic-graphs] OK: isEmpty empty == True
  17147. 1161.05 s [algebraic-graphs] OK: hasVertex x empty == False
  17148. 1161.05 s [algebraic-graphs] OK: vertexCount empty == 0
  17149. 1161.05 s [algebraic-graphs] OK: edgeCount empty == 0
  17150. 1161.05 s [algebraic-graphs]
  17151. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  17152. 1161.05 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17153. 1161.05 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17154. 1161.05 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17155. 1161.05 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17156. 1161.05 s [algebraic-graphs]
  17157. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  17158. 1161.05 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17159. 1161.05 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17160. 1161.05 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17161. 1161.05 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17162. 1161.05 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17163. 1161.05 s [algebraic-graphs]
  17164. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  17165. 1161.05 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17166. 1161.05 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17167. 1161.05 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17168. 1161.05 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17169. 1161.05 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17170. 1161.05 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17171. 1161.05 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17172. 1161.05 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17173. 1161.05 s [algebraic-graphs]
  17174. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  17175. 1161.05 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17176. 1161.05 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17177. 1161.05 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17178. 1161.05 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17179. 1161.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17180. 1161.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17181. 1161.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17182. 1161.05 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17183. 1161.05 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17184. 1161.05 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17185. 1161.05 s [algebraic-graphs]
  17186. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  17187. 1161.05 s [algebraic-graphs] OK: vertices [] == empty
  17188. 1161.05 s [algebraic-graphs] OK: vertices [x] == vertex x
  17189. 1161.05 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17190. 1161.05 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17191. 1161.05 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17192. 1161.05 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17193. 1161.05 s [algebraic-graphs]
  17194. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  17195. 1161.05 s [algebraic-graphs] OK: edges [] == empty
  17196. 1161.05 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17197. 1161.05 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17198. 1161.05 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17199. 1161.05 s [algebraic-graphs]
  17200. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  17201. 1161.05 s [algebraic-graphs] OK: overlays [] == empty
  17202. 1161.05 s [algebraic-graphs] OK: overlays [x] == x
  17203. 1161.05 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17204. 1161.05 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17205. 1161.05 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17206. 1161.05 s [algebraic-graphs]
  17207. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  17208. 1161.05 s [algebraic-graphs] OK: connects [] == empty
  17209. 1161.05 s [algebraic-graphs] OK: connects [x] == x
  17210. 1161.05 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17211. 1161.05 s [algebraic-graphs] OK: connects == foldr connect empty
  17212. 1161.05 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17213. 1161.05 s [algebraic-graphs]
  17214. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  17215. 1161.05 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  17216. 1161.05 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  17217. 1161.05 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  17218. 1161.05 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  17219. 1161.05 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  17220. 1161.05 s [algebraic-graphs]
  17221. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  17222. 1161.05 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17223. 1161.05 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17224. 1161.05 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17225. 1161.05 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17226. 1161.05 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17227. 1161.05 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17228. 1161.05 s [algebraic-graphs]
  17229. 1161.05 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  17230. 1161.05 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17231. 1161.05 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17232. 1161.05 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17233. 1161.05 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17234. 1161.05 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17235. 1161.05 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17236. 1161.05 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17237. 1161.05 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17238. 1161.05 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17239. 1161.05 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17240. 1161.05 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17241. 1161.05 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17242. 1161.05 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17243. 1161.05 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17244. 1161.05 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17245. 1161.05 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17246. 1161.05 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17247. 1161.05 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17248. 1161.05 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17249. 1161.05 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17250. 1161.05 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17251. 1161.05 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17252. 1161.05 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17253. 1161.05 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17254. 1161.05 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17255. 1161.05 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17256. 1161.05 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17257. 1161.05 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17258. 1161.05 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17259. 1161.05 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17260. 1161.05 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17261. 1161.05 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17262. 1161.05 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17263. 1161.05 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17264. 1161.74 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17265. 1161.74 s [algebraic-graphs]
  17266. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  17267. 1161.74 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17268. 1161.74 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17269. 1161.74 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17270. 1161.74 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17271. 1161.74 s [algebraic-graphs]
  17272. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  17273. 1161.74 s [algebraic-graphs] OK: isEmpty empty == True
  17274. 1161.74 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17275. 1161.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17276. 1161.74 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17277. 1161.74 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17278. 1161.74 s [algebraic-graphs]
  17279. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  17280. 1161.74 s [algebraic-graphs] OK: hasVertex x empty == False
  17281. 1161.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17282. 1161.74 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17283. 1161.74 s [algebraic-graphs]
  17284. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  17285. 1161.74 s [algebraic-graphs] OK: hasEdge x y empty == False
  17286. 1161.74 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17287. 1161.74 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17288. 1161.74 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17289. 1161.74 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17290. 1161.74 s [algebraic-graphs]
  17291. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  17292. 1161.74 s [algebraic-graphs] OK: vertexCount empty == 0
  17293. 1161.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17294. 1161.74 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17295. 1161.74 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17296. 1161.74 s [algebraic-graphs]
  17297. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  17298. 1161.74 s [algebraic-graphs] OK: edgeCount empty == 0
  17299. 1161.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17300. 1161.74 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17301. 1161.74 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17302. 1161.74 s [algebraic-graphs]
  17303. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  17304. 1161.74 s [algebraic-graphs] OK: vertexList empty == []
  17305. 1161.74 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17306. 1161.74 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17307. 1161.74 s [algebraic-graphs]
  17308. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  17309. 1161.74 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17310. 1161.74 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17311. 1161.74 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17312. 1161.74 s [algebraic-graphs]
  17313. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  17314. 1161.74 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17315. 1161.74 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17316. 1161.74 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17317. 1161.74 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17318. 1161.74 s [algebraic-graphs]
  17319. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  17320. 1161.74 s [algebraic-graphs] OK: edgeList empty == []
  17321. 1161.74 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17322. 1161.74 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17323. 1161.74 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17324. 1161.74 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17325. 1161.74 s [algebraic-graphs]
  17326. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  17327. 1161.74 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17328. 1161.74 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17329. 1161.74 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17330. 1161.74 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17331. 1161.74 s [algebraic-graphs]
  17332. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  17333. 1161.74 s [algebraic-graphs] OK: adjacencyList empty == []
  17334. 1161.74 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17335. 1161.74 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17336. 1161.74 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17337. 1161.74 s [algebraic-graphs]
  17338. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  17339. 1161.74 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17340. 1161.74 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17341. 1161.74 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17342. 1161.74 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17343. 1161.74 s [algebraic-graphs]
  17344. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  17345. 1161.74 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17346. 1161.74 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17347. 1161.74 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17348. 1161.74 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17349. 1161.74 s [algebraic-graphs]
  17350. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  17351. 1161.74 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17352. 1161.74 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17353. 1161.74 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17354. 1161.74 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17355. 1161.74 s [algebraic-graphs]
  17356. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  17357. 1161.74 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17358. 1161.74 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17359. 1161.74 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17360. 1161.74 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17361. 1161.74 s [algebraic-graphs]
  17362. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  17363. 1161.74 s [algebraic-graphs] OK: path [] == empty
  17364. 1161.74 s [algebraic-graphs] OK: path [x] == vertex x
  17365. 1161.74 s [algebraic-graphs] OK: path [x,y] == edge x y
  17366. 1161.74 s [algebraic-graphs]
  17367. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  17368. 1161.74 s [algebraic-graphs] OK: circuit [] == empty
  17369. 1161.74 s [algebraic-graphs] OK: circuit [x] == edge x x
  17370. 1161.74 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17371. 1161.74 s [algebraic-graphs]
  17372. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  17373. 1161.74 s [algebraic-graphs] OK: clique [] == empty
  17374. 1161.74 s [algebraic-graphs] OK: clique [x] == vertex x
  17375. 1161.74 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17376. 1161.74 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17377. 1161.74 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17378. 1161.74 s [algebraic-graphs]
  17379. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  17380. 1161.74 s [algebraic-graphs] OK: biclique [] [] == empty
  17381. 1161.74 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17382. 1161.74 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17383. 1161.74 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17384. 1161.74 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17385. 1161.74 s [algebraic-graphs]
  17386. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  17387. 1161.74 s [algebraic-graphs] OK: star x [] == vertex x
  17388. 1161.74 s [algebraic-graphs] OK: star x [y] == edge x y
  17389. 1161.74 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17390. 1161.74 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17391. 1161.74 s [algebraic-graphs]
  17392. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  17393. 1161.74 s [algebraic-graphs] OK: stars [] == empty
  17394. 1161.74 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17395. 1161.74 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17396. 1161.74 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17397. 1161.74 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17398. 1161.74 s [algebraic-graphs] OK: stars . adjacencyList == id
  17399. 1161.74 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17400. 1161.74 s [algebraic-graphs]
  17401. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  17402. 1161.74 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17403. 1161.74 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17404. 1161.74 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17405. 1161.74 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17406. 1161.74 s [algebraic-graphs]
  17407. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  17408. 1161.74 s [algebraic-graphs] OK: forest [] == empty
  17409. 1161.74 s [algebraic-graphs] OK: forest [x] == tree x
  17410. 1161.74 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17411. 1161.74 s [algebraic-graphs] OK: forest == overlays . map tree
  17412. 1161.74 s [algebraic-graphs]
  17413. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  17414. 1161.74 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17415. 1161.74 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17416. 1161.74 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17417. 1161.74 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17418. 1161.74 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17419. 1161.74 s [algebraic-graphs]
  17420. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  17421. 1161.74 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17422. 1161.74 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17423. 1161.74 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17424. 1161.74 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17425. 1161.74 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17426. 1161.74 s [algebraic-graphs]
  17427. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  17428. 1161.74 s [algebraic-graphs] OK: replaceVertex x x == id
  17429. 1161.74 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17430. 1161.74 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17431. 1161.74 s [algebraic-graphs]
  17432. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  17433. 1161.74 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17434. 1161.74 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17435. 1161.74 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17436. 1161.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17437. 1161.74 s [algebraic-graphs]
  17438. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  17439. 1161.74 s [algebraic-graphs] OK: transpose empty == empty
  17440. 1161.74 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17441. 1161.74 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17442. 1161.74 s [algebraic-graphs] OK: transpose . transpose == id
  17443. 1161.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17444. 1161.74 s [algebraic-graphs]
  17445. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  17446. 1161.74 s [algebraic-graphs] OK: gmap f empty == empty
  17447. 1161.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17448. 1161.74 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17449. 1161.74 s [algebraic-graphs] OK: gmap id == id
  17450. 1161.74 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17451. 1161.74 s [algebraic-graphs]
  17452. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  17453. 1161.74 s [algebraic-graphs] OK: induce (const True ) x == x
  17454. 1161.74 s [algebraic-graphs] OK: induce (const False) x == empty
  17455. 1161.74 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17456. 1161.74 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17457. 1161.74 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17458. 1161.74 s [algebraic-graphs]
  17459. 1161.74 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  17460. 1161.74 s [algebraic-graphs] OK: compose empty x == empty
  17461. 1161.74 s [algebraic-graphs] OK: compose x empty == empty
  17462. 1161.74 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17463. 1161.74 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17464. 1161.74 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17465. 1161.74 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17466. 1161.95 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17467. 1161.95 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17468. 1161.95 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17469. 1161.95 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17470. 1161.95 s [algebraic-graphs]
  17471. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  17472. 1161.95 s [algebraic-graphs] OK: closure empty == empty
  17473. 1161.95 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17474. 1161.95 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17475. 1161.95 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17476. 1161.95 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17477. 1161.95 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17478. 1161.95 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17479. 1161.95 s [algebraic-graphs] OK: closure . closure == closure
  17480. 1161.95 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17481. 1161.95 s [algebraic-graphs]
  17482. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  17483. 1161.95 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17484. 1161.95 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17485. 1161.95 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17486. 1161.95 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17487. 1161.95 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17488. 1161.95 s [algebraic-graphs]
  17489. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  17490. 1161.95 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17491. 1161.95 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17492. 1161.95 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17493. 1161.95 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17494. 1161.95 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17495. 1161.95 s [algebraic-graphs]
  17496. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  17497. 1161.95 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17498. 1161.95 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17499. 1161.95 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17500. 1161.95 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17501. 1161.95 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17502. 1161.95 s [algebraic-graphs]
  17503. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  17504. 1161.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17505. 1161.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17506. 1161.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17507. 1161.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17508. 1161.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17509. 1161.95 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17510. 1161.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17511. 1161.95 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17512. 1161.95 s [algebraic-graphs] OK: bfsForest x [] == []
  17513. 1161.95 s [algebraic-graphs] OK: bfsForest empty vs == []
  17514. 1161.95 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17515. 1161.95 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17516. 1161.95 s [algebraic-graphs]
  17517. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  17518. 1161.95 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17519. 1161.95 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17520. 1161.95 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17521. 1161.95 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17522. 1161.95 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17523. 1161.95 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17524. 1161.95 s [algebraic-graphs] OK: bfs empty vs == []
  17525. 1161.95 s [algebraic-graphs] OK: bfs x [] == []
  17526. 1161.95 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17527. 1161.95 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17528. 1161.95 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17529. 1161.95 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17530. 1161.95 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17531. 1161.95 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17532. 1161.95 s [algebraic-graphs]
  17533. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  17534. 1161.95 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17535. 1161.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17536. 1161.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17537. 1161.95 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17538. 1161.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17539. 1161.95 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17540. 1161.95 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17541. 1161.95 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17542. 1161.95 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17543. 1161.95 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17544. 1161.95 s [algebraic-graphs]
  17545. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  17546. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17547. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17548. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17549. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17550. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17551. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17552. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17553. 1161.95 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17554. 1161.95 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17555. 1161.95 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17556. 1161.95 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17557. 1161.95 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17558. 1161.95 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17559. 1161.95 s [algebraic-graphs]
  17560. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17561. 1161.95 s [algebraic-graphs] OK: dfs empty vs == []
  17562. 1161.95 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17563. 1161.95 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17564. 1161.95 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17565. 1161.95 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17566. 1161.95 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17567. 1161.95 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17568. 1161.95 s [algebraic-graphs] OK: dfs x [] == []
  17569. 1161.95 s [algebraic-graphs]
  17570. 1161.95 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17571. 1161.95 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17572. 1161.95 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17573. 1161.95 s [algebraic-graphs]
  17574. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17575. 1161.95 s [algebraic-graphs] OK: reachable empty x == []
  17576. 1161.95 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17577. 1161.95 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17578. 1161.95 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17579. 1161.95 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17580. 1161.95 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17581. 1161.95 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17582. 1161.95 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17583. 1161.95 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17584. 1161.95 s [algebraic-graphs]
  17585. 1161.95 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17586. 1161.95 s [algebraic-graphs]
  17587. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  17588. 1161.95 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17589. 1161.95 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17590. 1161.95 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17591. 1161.95 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17592. 1161.95 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17593. 1161.95 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17594. 1161.95 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17595. 1161.95 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17596. 1161.95 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17597. 1161.95 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17598. 1161.95 s [algebraic-graphs]
  17599. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  17600. 1161.95 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17601. 1161.95 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17602. 1161.95 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17603. 1161.95 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17604. 1161.95 s [algebraic-graphs]
  17605. 1161.95 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  17606. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17607. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17608. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17609. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17610. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17611. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17612. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17613. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17614. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17615. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17616. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17617. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17618. 1161.95 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17619. 1166.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17620. 1166.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17621. 1166.70 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17622. 1166.70 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17623. 1166.70 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17624. 1166.70 s [algebraic-graphs]
  17625. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  17626. 1166.70 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17627. 1166.70 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17628. 1166.70 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17629. 1166.70 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17630. 1166.70 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17631. 1166.70 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17632. 1166.70 s [algebraic-graphs]
  17633. 1166.70 s [algebraic-graphs] ============ AdjacencyMap ============
  17634. 1166.70 s [algebraic-graphs] OK: Axioms of graphs
  17635. 1166.70 s [algebraic-graphs]
  17636. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  17637. 1166.70 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17638. 1166.70 s [algebraic-graphs]
  17639. 1166.70 s [algebraic-graphs] OK: consistent empty == True
  17640. 1166.70 s [algebraic-graphs] OK: consistent (vertex x) == True
  17641. 1166.70 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17642. 1166.70 s [algebraic-graphs] OK: consistent (connect x y) == True
  17643. 1166.70 s [algebraic-graphs] OK: consistent (edge x y) == True
  17644. 1166.70 s [algebraic-graphs] OK: consistent (edges xs) == True
  17645. 1166.70 s [algebraic-graphs] OK: consistent (stars xs) == True
  17646. 1166.70 s [algebraic-graphs]
  17647. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  17648. 1166.70 s [algebraic-graphs] OK: show (empty ) == "empty"
  17649. 1166.70 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17650. 1166.70 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17651. 1166.70 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17652. 1166.70 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17653. 1166.70 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17654. 1166.70 s [algebraic-graphs]
  17655. 1166.70 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17656. 1166.70 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17657. 1166.70 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17658. 1166.70 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17659. 1166.70 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17660. 1166.70 s [algebraic-graphs]
  17661. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  17662. 1166.70 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17663. 1166.70 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17664. 1166.70 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17665. 1166.70 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17666. 1166.70 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17667. 1166.70 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17668. 1166.70 s [algebraic-graphs] OK: x <= x + y
  17669. 1166.70 s [algebraic-graphs] OK: x + y <= x * y
  17670. 1166.70 s [algebraic-graphs]
  17671. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  17672. 1166.70 s [algebraic-graphs] OK: isEmpty empty == True
  17673. 1166.70 s [algebraic-graphs] OK: hasVertex x empty == False
  17674. 1166.70 s [algebraic-graphs] OK: vertexCount empty == 0
  17675. 1166.70 s [algebraic-graphs] OK: edgeCount empty == 0
  17676. 1166.70 s [algebraic-graphs]
  17677. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  17678. 1166.70 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17679. 1166.70 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17680. 1166.70 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17681. 1166.70 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17682. 1166.70 s [algebraic-graphs]
  17683. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  17684. 1166.70 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17685. 1166.70 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17686. 1166.70 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17687. 1166.70 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17688. 1166.70 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17689. 1166.70 s [algebraic-graphs]
  17690. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  17691. 1166.70 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17692. 1166.70 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17693. 1166.70 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17694. 1166.70 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17695. 1166.70 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17696. 1166.70 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17697. 1166.70 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17698. 1166.70 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17699. 1166.70 s [algebraic-graphs]
  17700. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  17701. 1166.70 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17702. 1166.70 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17703. 1166.70 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17704. 1166.70 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17705. 1166.70 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17706. 1166.70 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17707. 1166.70 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17708. 1166.70 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17709. 1166.70 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17710. 1166.70 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17711. 1166.70 s [algebraic-graphs]
  17712. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  17713. 1166.70 s [algebraic-graphs] OK: vertices [] == empty
  17714. 1166.70 s [algebraic-graphs] OK: vertices [x] == vertex x
  17715. 1166.70 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17716. 1166.70 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17717. 1166.70 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17718. 1166.70 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17719. 1166.70 s [algebraic-graphs]
  17720. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  17721. 1166.70 s [algebraic-graphs] OK: edges [] == empty
  17722. 1166.70 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17723. 1166.70 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17724. 1166.70 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17725. 1166.70 s [algebraic-graphs]
  17726. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  17727. 1166.70 s [algebraic-graphs] OK: overlays [] == empty
  17728. 1166.70 s [algebraic-graphs] OK: overlays [x] == x
  17729. 1166.70 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17730. 1166.70 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17731. 1166.70 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17732. 1166.70 s [algebraic-graphs]
  17733. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  17734. 1166.70 s [algebraic-graphs] OK: connects [] == empty
  17735. 1166.70 s [algebraic-graphs] OK: connects [x] == x
  17736. 1166.70 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17737. 1166.70 s [algebraic-graphs] OK: connects == foldr connect empty
  17738. 1166.70 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17739. 1166.70 s [algebraic-graphs]
  17740. 1166.70 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  17741. 1166.70 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  17742. 1166.71 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  17743. 1166.71 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  17744. 1166.71 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  17745. 1166.71 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  17746. 1166.71 s [algebraic-graphs]
  17747. 1166.71 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  17748. 1166.71 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17749. 1166.71 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17750. 1166.71 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17751. 1166.71 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17752. 1166.71 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17753. 1166.71 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17754. 1166.71 s [algebraic-graphs]
  17755. 1166.71 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  17756. 1166.71 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17757. 1166.71 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17758. 1166.71 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17759. 1166.71 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17760. 1166.71 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17761. 1166.71 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17762. 1166.71 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17763. 1166.71 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17764. 1166.71 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17765. 1166.71 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17766. 1166.71 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17767. 1166.71 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17768. 1166.71 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17769. 1166.71 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17770. 1166.71 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17771. 1166.71 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17772. 1166.71 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17773. 1166.71 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17774. 1166.71 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17775. 1166.71 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17776. 1166.71 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17777. 1166.71 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17778. 1166.71 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17779. 1166.71 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17780. 1166.71 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17781. 1166.71 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17782. 1166.71 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17783. 1166.71 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17784. 1166.71 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17785. 1166.71 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17786. 1166.71 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17787. 1166.71 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17788. 1166.71 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17789. 1168.30 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17790. 1168.30 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17791. 1168.30 s [algebraic-graphs]
  17792. 1168.30 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  17793. 1168.30 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17794. 1168.30 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17795. 1168.30 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17796. 1168.30 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17797. 1168.30 s [algebraic-graphs]
  17798. 1168.30 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  17799. 1168.30 s [algebraic-graphs] OK: isEmpty empty == True
  17800. 1168.30 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17801. 1168.30 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17802. 1168.30 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17803. 1168.30 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17804. 1168.30 s [algebraic-graphs]
  17805. 1168.30 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  17806. 1168.30 s [algebraic-graphs] OK: hasVertex x empty == False
  17807. 1168.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17808. 1168.30 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17809. 1168.30 s [algebraic-graphs]
  17810. 1168.30 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  17811. 1168.30 s [algebraic-graphs] OK: hasEdge x y empty == False
  17812. 1168.30 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17813. 1168.30 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17814. 1168.30 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17815. 1168.30 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17816. 1168.30 s [algebraic-graphs]
  17817. 1168.30 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  17818. 1168.30 s [algebraic-graphs] OK: vertexCount empty == 0
  17819. 1168.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17820. 1168.30 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17821. 1168.30 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17822. 1168.30 s [algebraic-graphs]
  17823. 1168.30 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  17824. 1168.30 s [algebraic-graphs] OK: edgeCount empty == 0
  17825. 1168.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17826. 1168.30 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17827. 1168.30 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17828. 1168.31 s [algebraic-graphs]
  17829. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  17830. 1168.31 s [algebraic-graphs] OK: vertexList empty == []
  17831. 1168.31 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17832. 1168.31 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17833. 1168.31 s [algebraic-graphs]
  17834. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  17835. 1168.31 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17836. 1168.31 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17837. 1168.31 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17838. 1168.31 s [algebraic-graphs]
  17839. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  17840. 1168.31 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17841. 1168.31 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17842. 1168.31 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17843. 1168.31 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17844. 1168.31 s [algebraic-graphs]
  17845. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  17846. 1168.31 s [algebraic-graphs] OK: edgeList empty == []
  17847. 1168.31 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17848. 1168.31 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17849. 1168.31 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17850. 1168.31 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17851. 1168.31 s [algebraic-graphs]
  17852. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  17853. 1168.31 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17854. 1168.31 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17855. 1168.31 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17856. 1168.31 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17857. 1168.31 s [algebraic-graphs]
  17858. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  17859. 1168.31 s [algebraic-graphs] OK: adjacencyList empty == []
  17860. 1168.31 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17861. 1168.31 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17862. 1168.31 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17863. 1168.31 s [algebraic-graphs]
  17864. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  17865. 1168.31 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17866. 1168.31 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17867. 1168.31 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17868. 1168.31 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17869. 1168.31 s [algebraic-graphs]
  17870. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  17871. 1168.31 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17872. 1168.31 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17873. 1168.31 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17874. 1168.31 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17875. 1168.31 s [algebraic-graphs]
  17876. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  17877. 1168.31 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17878. 1168.31 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17879. 1168.31 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17880. 1168.31 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17881. 1168.31 s [algebraic-graphs]
  17882. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  17883. 1168.31 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17884. 1168.31 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17885. 1168.31 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17886. 1168.31 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17887. 1168.31 s [algebraic-graphs]
  17888. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.path ============
  17889. 1168.31 s [algebraic-graphs] OK: path [] == empty
  17890. 1168.31 s [algebraic-graphs] OK: path [x] == vertex x
  17891. 1168.31 s [algebraic-graphs] OK: path [x,y] == edge x y
  17892. 1168.31 s [algebraic-graphs]
  17893. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  17894. 1168.31 s [algebraic-graphs] OK: circuit [] == empty
  17895. 1168.31 s [algebraic-graphs] OK: circuit [x] == edge x x
  17896. 1168.31 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17897. 1168.31 s [algebraic-graphs]
  17898. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  17899. 1168.31 s [algebraic-graphs] OK: clique [] == empty
  17900. 1168.31 s [algebraic-graphs] OK: clique [x] == vertex x
  17901. 1168.31 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17902. 1168.31 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17903. 1168.31 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17904. 1168.31 s [algebraic-graphs]
  17905. 1168.31 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  17906. 1168.31 s [algebraic-graphs] OK: biclique [] [] == empty
  17907. 1168.31 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17908. 1168.31 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17909. 1168.32 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17910. 1168.32 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17911. 1168.32 s [algebraic-graphs]
  17912. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.star ============
  17913. 1168.32 s [algebraic-graphs] OK: star x [] == vertex x
  17914. 1168.32 s [algebraic-graphs] OK: star x [y] == edge x y
  17915. 1168.32 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17916. 1168.32 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17917. 1168.32 s [algebraic-graphs]
  17918. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  17919. 1168.32 s [algebraic-graphs] OK: stars [] == empty
  17920. 1168.32 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17921. 1168.32 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17922. 1168.32 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17923. 1168.32 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17924. 1168.32 s [algebraic-graphs] OK: stars . adjacencyList == id
  17925. 1168.32 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17926. 1168.32 s [algebraic-graphs]
  17927. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  17928. 1168.32 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17929. 1168.32 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17930. 1168.32 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17931. 1168.32 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17932. 1168.32 s [algebraic-graphs]
  17933. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  17934. 1168.32 s [algebraic-graphs] OK: forest [] == empty
  17935. 1168.32 s [algebraic-graphs] OK: forest [x] == tree x
  17936. 1168.32 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17937. 1168.32 s [algebraic-graphs] OK: forest == overlays . map tree
  17938. 1168.32 s [algebraic-graphs]
  17939. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  17940. 1168.32 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17941. 1168.32 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17942. 1168.32 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17943. 1168.32 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17944. 1168.32 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17945. 1168.32 s [algebraic-graphs]
  17946. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  17947. 1168.32 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17948. 1168.32 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17949. 1168.32 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17950. 1168.32 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17951. 1168.32 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17952. 1168.32 s [algebraic-graphs]
  17953. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  17954. 1168.32 s [algebraic-graphs] OK: replaceVertex x x == id
  17955. 1168.32 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17956. 1168.32 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17957. 1168.32 s [algebraic-graphs]
  17958. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  17959. 1168.32 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17960. 1168.32 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17961. 1168.32 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17962. 1168.32 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17963. 1168.32 s [algebraic-graphs]
  17964. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  17965. 1168.32 s [algebraic-graphs] OK: transpose empty == empty
  17966. 1168.32 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17967. 1168.32 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17968. 1168.32 s [algebraic-graphs] OK: transpose . transpose == id
  17969. 1168.32 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17970. 1168.32 s [algebraic-graphs]
  17971. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  17972. 1168.32 s [algebraic-graphs] OK: gmap f empty == empty
  17973. 1168.32 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17974. 1168.32 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17975. 1168.32 s [algebraic-graphs] OK: gmap id == id
  17976. 1168.32 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17977. 1168.32 s [algebraic-graphs]
  17978. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  17979. 1168.32 s [algebraic-graphs] OK: induce (const True ) x == x
  17980. 1168.32 s [algebraic-graphs] OK: induce (const False) x == empty
  17981. 1168.32 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17982. 1168.32 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17983. 1168.32 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17984. 1168.32 s [algebraic-graphs]
  17985. 1168.32 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  17986. 1168.32 s [algebraic-graphs] OK: compose empty x == empty
  17987. 1168.32 s [algebraic-graphs] OK: compose x empty == empty
  17988. 1168.32 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17989. 1168.32 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17990. 1168.32 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17991. 1168.32 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17992. 1171.06 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17993. 1171.06 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17994. 1171.06 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17995. 1171.06 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17996. 1171.06 s [algebraic-graphs]
  17997. 1171.06 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  17998. 1171.06 s [algebraic-graphs] OK: closure empty == empty
  17999. 1171.06 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18000. 1171.06 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18001. 1171.06 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18002. 1171.06 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18003. 1171.06 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18004. 1171.06 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18005. 1171.06 s [algebraic-graphs] OK: closure . closure == closure
  18006. 1171.06 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18007. 1171.06 s [algebraic-graphs]
  18008. 1171.06 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  18009. 1171.06 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18010. 1171.06 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18011. 1171.07 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18012. 1171.07 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18013. 1171.07 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18014. 1171.07 s [algebraic-graphs]
  18015. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  18016. 1171.07 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18017. 1171.07 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18018. 1171.07 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18019. 1171.07 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18020. 1171.07 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18021. 1171.07 s [algebraic-graphs]
  18022. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  18023. 1171.07 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18024. 1171.07 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18025. 1171.07 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18026. 1171.07 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18027. 1171.07 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18028. 1171.07 s [algebraic-graphs]
  18029. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.box ============
  18030. 1171.07 s [algebraic-graphs] OK: box x y ~~ box y x
  18031. 1171.07 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18032. 1171.07 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18033. 1171.07 s [algebraic-graphs] OK: box x empty ~~ empty
  18034. 1171.07 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18035. 1171.07 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18036. 1171.07 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18037. 1171.07 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18038. 1171.07 s [algebraic-graphs]
  18039. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  18040. 1171.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18041. 1171.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18042. 1171.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18043. 1171.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18044. 1171.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18045. 1171.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18046. 1171.07 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18047. 1171.07 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18048. 1171.07 s [algebraic-graphs] OK: bfsForest x [] == []
  18049. 1171.07 s [algebraic-graphs] OK: bfsForest empty vs == []
  18050. 1171.07 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18051. 1171.07 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18052. 1171.07 s [algebraic-graphs]
  18053. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  18054. 1171.07 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18055. 1171.07 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18056. 1171.07 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18057. 1171.07 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18058. 1171.07 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18059. 1171.07 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18060. 1171.07 s [algebraic-graphs] OK: bfs empty vs == []
  18061. 1171.07 s [algebraic-graphs] OK: bfs x [] == []
  18062. 1171.07 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18063. 1171.07 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18064. 1171.07 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18065. 1171.07 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18066. 1171.07 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18067. 1171.07 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18068. 1171.07 s [algebraic-graphs]
  18069. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  18070. 1171.07 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18071. 1171.07 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18072. 1171.07 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18073. 1171.07 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18074. 1171.07 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18075. 1171.07 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18076. 1171.07 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18077. 1171.07 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18078. 1171.07 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18079. 1171.07 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18080. 1171.07 s [algebraic-graphs]
  18081. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  18082. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18083. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18084. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18085. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18086. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18087. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18088. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18089. 1171.07 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18090. 1171.07 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18091. 1171.07 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18092. 1171.07 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18093. 1171.07 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18094. 1171.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18095. 1171.07 s [algebraic-graphs]
  18096. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18097. 1171.07 s [algebraic-graphs] OK: dfs empty vs == []
  18098. 1171.07 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18099. 1171.07 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18100. 1171.07 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18101. 1171.07 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18102. 1171.07 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18103. 1171.07 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18104. 1171.07 s [algebraic-graphs] OK: dfs x [] == []
  18105. 1171.07 s [algebraic-graphs]
  18106. 1171.07 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18107. 1171.07 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18108. 1171.07 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18109. 1171.07 s [algebraic-graphs]
  18110. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18111. 1171.07 s [algebraic-graphs] OK: reachable empty x == []
  18112. 1171.07 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18113. 1171.07 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18114. 1171.07 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18115. 1171.07 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18116. 1171.07 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18117. 1171.07 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18118. 1171.07 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18119. 1171.07 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18120. 1171.07 s [algebraic-graphs]
  18121. 1171.07 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18122. 1171.07 s [algebraic-graphs]
  18123. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  18124. 1171.07 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18125. 1171.07 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18126. 1171.07 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18127. 1171.07 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18128. 1171.07 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18129. 1171.07 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18130. 1171.07 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18131. 1171.07 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18132. 1171.07 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18133. 1171.07 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18134. 1171.07 s [algebraic-graphs]
  18135. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  18136. 1171.07 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18137. 1171.07 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18138. 1171.07 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18139. 1171.07 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18140. 1171.07 s [algebraic-graphs]
  18141. 1171.07 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  18142. 1171.07 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18143. 1171.08 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18144. 1171.08 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18145. 1171.08 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18146. 1171.08 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18147. 1171.08 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18148. 1171.08 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18149. 1176.77 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18150. 1176.77 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18151. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18152. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18153. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18154. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18155. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18156. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18157. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18158. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18159. 1176.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18160. 1176.81 s [algebraic-graphs]
  18161. 1176.81 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  18162. 1176.81 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18163. 1176.81 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18164. 1176.81 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18165. 1176.81 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18166. 1176.81 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18167. 1176.81 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18168. 1176.81 s [algebraic-graphs]
  18169. 1176.81 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  18170. 1176.81 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18171. 1176.81 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18172. 1176.81 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18173. 1176.81 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18174. 1176.81 s [algebraic-graphs]
  18175. 1176.81 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  18176. 1176.81 s [algebraic-graphs] OK: scc empty == empty
  18177. 1176.81 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  18178. 1176.81 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  18179. 1176.81 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  18180. 1176.81 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  18181. 1176.81 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  18182. 1176.81 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  18183. 1176.81 s [algebraic-graphs] OK: isAcyclic . scc == const True
  18184. 1176.81 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  18185. 1176.81 s [algebraic-graphs] OK: scc g == KL.scc g
  18186. 1176.81 s [algebraic-graphs]
  18187. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  18188. 1176.81 s [algebraic-graphs] OK: 0 == rightVertex 0
  18189. 1176.81 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  18190. 1176.81 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  18191. 1176.81 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  18192. 1176.81 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  18193. 1176.81 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  18194. 1176.81 s [algebraic-graphs]
  18195. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  18196. 1176.81 s [algebraic-graphs] OK: show empty == "empty"
  18197. 1176.81 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  18198. 1176.81 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  18199. 1176.81 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  18200. 1176.81 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  18201. 1176.81 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  18202. 1176.81 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  18203. 1176.81 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  18204. 1176.81 s [algebraic-graphs]
  18205. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  18206. 1176.81 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  18207. 1176.81 s [algebraic-graphs]
  18208. 1176.81 s [algebraic-graphs] OK: x + y == y + x
  18209. 1176.81 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  18210. 1176.81 s [algebraic-graphs] OK: x * empty == x
  18211. 1176.81 s [algebraic-graphs] OK: empty * x == x
  18212. 1176.81 s [algebraic-graphs] OK: x * y == y * x
  18213. 1176.81 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  18214. 1176.81 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  18215. 1176.81 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  18216. 1176.81 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  18217. 1176.81 s [algebraic-graphs] OK: x + empty == x
  18218. 1176.81 s [algebraic-graphs] OK: empty + x == x
  18219. 1176.81 s [algebraic-graphs] OK: x + x == x
  18220. 1176.81 s [algebraic-graphs] OK: x * y + x + y == x * y
  18221. 1176.81 s [algebraic-graphs] OK: x * x * x == x * x
  18222. 1176.81 s [algebraic-graphs]
  18223. 1176.81 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  18224. 1176.81 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  18225. 1176.81 s [algebraic-graphs]
  18226. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  18227. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18228. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18229. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18230. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18231. 1176.81 s [algebraic-graphs]
  18232. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  18233. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18234. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18235. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18236. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18237. 1176.81 s [algebraic-graphs]
  18238. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  18239. 1176.81 s [algebraic-graphs] OK: isEmpty empty == True
  18240. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18241. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18242. 1176.81 s [algebraic-graphs] OK: hasVertex x empty == False
  18243. 1176.81 s [algebraic-graphs]
  18244. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  18245. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18246. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18247. 1176.81 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18248. 1176.81 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18249. 1176.81 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  18250. 1176.81 s [algebraic-graphs]
  18251. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  18252. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18253. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18254. 1176.81 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18255. 1176.81 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18256. 1176.81 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  18257. 1176.81 s [algebraic-graphs]
  18258. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  18259. 1176.81 s [algebraic-graphs] OK: vertex . Left == leftVertex
  18260. 1176.81 s [algebraic-graphs] OK: vertex . Right == rightVertex
  18261. 1176.81 s [algebraic-graphs]
  18262. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  18263. 1176.81 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  18264. 1176.81 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18265. 1176.81 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18266. 1176.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18267. 1176.81 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  18268. 1176.81 s [algebraic-graphs]
  18269. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  18270. 1176.81 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18271. 1176.81 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18272. 1176.81 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18273. 1176.81 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18274. 1176.81 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18275. 1176.81 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18276. 1176.81 s [algebraic-graphs]
  18277. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  18278. 1176.81 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  18279. 1176.81 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  18280. 1176.81 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  18281. 1176.81 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  18282. 1176.81 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  18283. 1176.81 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18284. 1176.81 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18285. 1176.81 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18286. 1176.81 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18287. 1176.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18288. 1176.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  18289. 1176.81 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  18290. 1176.81 s [algebraic-graphs]
  18291. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  18292. 1176.81 s [algebraic-graphs] OK: vertices [] [] == empty
  18293. 1176.81 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  18294. 1176.81 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  18295. 1176.81 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  18296. 1176.81 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  18297. 1176.81 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  18298. 1176.81 s [algebraic-graphs]
  18299. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  18300. 1176.81 s [algebraic-graphs] OK: edges [] == empty
  18301. 1176.81 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18302. 1176.81 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18303. 1176.81 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  18304. 1176.81 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18305. 1176.81 s [algebraic-graphs]
  18306. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  18307. 1176.81 s [algebraic-graphs] OK: overlays [] == empty
  18308. 1176.81 s [algebraic-graphs] OK: overlays [x] == x
  18309. 1176.81 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18310. 1176.81 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18311. 1176.81 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18312. 1176.81 s [algebraic-graphs]
  18313. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  18314. 1176.81 s [algebraic-graphs] OK: connects [] == empty
  18315. 1176.81 s [algebraic-graphs] OK: connects [x] == x
  18316. 1176.81 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18317. 1176.81 s [algebraic-graphs] OK: connects == foldr connect empty
  18318. 1176.81 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18319. 1176.81 s [algebraic-graphs]
  18320. 1176.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  18321. 1177.94 s [algebraic-graphs] OK: swap empty == empty
  18322. 1177.94 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  18323. 1177.94 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  18324. 1177.94 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  18325. 1177.94 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  18326. 1177.94 s [algebraic-graphs] OK: swap . swap == id
  18327. 1177.94 s [algebraic-graphs]
  18328. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  18329. 1177.94 s [algebraic-graphs] OK: toBipartite empty == empty
  18330. 1177.94 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  18331. 1177.94 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  18332. 1177.94 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  18333. 1177.94 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  18334. 1177.94 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  18335. 1177.94 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  18336. 1177.94 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  18337. 1177.94 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  18338. 1177.94 s [algebraic-graphs]
  18339. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  18340. 1177.94 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  18341. 1177.94 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  18342. 1177.94 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  18343. 1177.94 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  18344. 1177.94 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  18345. 1177.94 s [algebraic-graphs]
  18346. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  18347. 1177.94 s [algebraic-graphs] OK: fromBipartite empty == empty
  18348. 1177.94 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  18349. 1177.94 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  18350. 1177.94 s [algebraic-graphs]
  18351. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  18352. 1177.94 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  18353. 1177.94 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  18354. 1177.94 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  18355. 1177.94 s [algebraic-graphs]
  18356. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  18357. 1177.94 s [algebraic-graphs] OK: isEmpty empty == True
  18358. 1177.94 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18359. 1177.94 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18360. 1177.94 s [algebraic-graphs] OK: isEmpty == (==) empty
  18361. 1177.94 s [algebraic-graphs]
  18362. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  18363. 1177.94 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  18364. 1177.94 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18365. 1177.94 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18366. 1177.94 s [algebraic-graphs]
  18367. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  18368. 1177.94 s [algebraic-graphs] OK: hasRightVertex x empty == False
  18369. 1177.94 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18370. 1177.94 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18371. 1177.94 s [algebraic-graphs]
  18372. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  18373. 1177.94 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  18374. 1177.94 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  18375. 1177.94 s [algebraic-graphs]
  18376. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  18377. 1177.94 s [algebraic-graphs] OK: hasEdge x y empty == False
  18378. 1177.94 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18379. 1177.94 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18380. 1177.94 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18381. 1177.94 s [algebraic-graphs]
  18382. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  18383. 1177.94 s [algebraic-graphs] OK: leftVertexCount empty == 0
  18384. 1177.94 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  18385. 1177.94 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  18386. 1177.94 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  18387. 1177.94 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  18388. 1177.94 s [algebraic-graphs]
  18389. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  18390. 1177.94 s [algebraic-graphs] OK: rightVertexCount empty == 0
  18391. 1177.94 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  18392. 1177.94 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  18393. 1177.94 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  18394. 1177.94 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  18395. 1177.94 s [algebraic-graphs]
  18396. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  18397. 1177.94 s [algebraic-graphs] OK: vertexCount empty == 0
  18398. 1177.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18399. 1177.94 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  18400. 1177.94 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  18401. 1177.94 s [algebraic-graphs]
  18402. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  18403. 1177.94 s [algebraic-graphs] OK: edgeCount empty == 0
  18404. 1177.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18405. 1177.94 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18406. 1177.94 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18407. 1177.94 s [algebraic-graphs]
  18408. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  18409. 1177.94 s [algebraic-graphs] OK: leftVertexList empty == []
  18410. 1177.94 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  18411. 1177.94 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  18412. 1177.94 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  18413. 1177.94 s [algebraic-graphs]
  18414. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  18415. 1177.94 s [algebraic-graphs] OK: rightVertexList empty == []
  18416. 1177.94 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  18417. 1177.94 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  18418. 1177.94 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  18419. 1177.94 s [algebraic-graphs]
  18420. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  18421. 1177.94 s [algebraic-graphs] OK: vertexList empty == []
  18422. 1177.94 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18423. 1177.94 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  18424. 1177.94 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  18425. 1177.94 s [algebraic-graphs]
  18426. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  18427. 1177.94 s [algebraic-graphs] OK: edgeList empty == []
  18428. 1177.94 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18429. 1177.94 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18430. 1177.94 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18431. 1177.94 s [algebraic-graphs]
  18432. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  18433. 1177.94 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  18434. 1177.94 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  18435. 1177.94 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  18436. 1177.94 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  18437. 1177.94 s [algebraic-graphs]
  18438. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  18439. 1177.94 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  18440. 1177.94 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  18441. 1177.94 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  18442. 1177.94 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  18443. 1177.94 s [algebraic-graphs]
  18444. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  18445. 1177.94 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18446. 1177.94 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18447. 1177.94 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  18448. 1177.94 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  18449. 1177.94 s [algebraic-graphs]
  18450. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  18451. 1177.94 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18452. 1177.94 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18453. 1177.94 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18454. 1177.94 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18455. 1177.94 s [algebraic-graphs]
  18456. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  18457. 1177.94 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  18458. 1177.94 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  18459. 1177.94 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  18460. 1177.94 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  18461. 1177.94 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  18462. 1177.94 s [algebraic-graphs]
  18463. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  18464. 1177.94 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  18465. 1177.94 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  18466. 1177.94 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  18467. 1177.94 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  18468. 1177.94 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  18469. 1177.94 s [algebraic-graphs]
  18470. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  18471. 1177.94 s [algebraic-graphs] OK: evenList [] == Nil
  18472. 1177.94 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  18473. 1177.94 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  18474. 1177.94 s [algebraic-graphs]
  18475. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  18476. 1177.94 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  18477. 1177.94 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  18478. 1177.94 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  18479. 1177.94 s [algebraic-graphs]
  18480. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  18481. 1177.94 s [algebraic-graphs] OK: path Nil == empty
  18482. 1177.94 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  18483. 1177.94 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  18484. 1177.94 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  18485. 1177.94 s [algebraic-graphs]
  18486. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  18487. 1177.94 s [algebraic-graphs] OK: circuit [] == empty
  18488. 1177.94 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  18489. 1177.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)]
  18490. 1177.94 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  18491. 1177.94 s [algebraic-graphs]
  18492. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  18493. 1177.94 s [algebraic-graphs] OK: biclique [] [] == empty
  18494. 1177.94 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  18495. 1177.94 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  18496. 1177.94 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  18497. 1177.94 s [algebraic-graphs]
  18498. 1177.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  18499. 1177.94 s [algebraic-graphs] OK: star x [] == leftVertex x
  18500. 1177.94 s [algebraic-graphs] OK: star x [y] == edge x y
  18501. 1177.94 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18502. 1177.94 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  18503. 1177.95 s [algebraic-graphs]
  18504. 1177.95 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  18505. 1177.95 s [algebraic-graphs] OK: stars [] == empty
  18506. 1177.95 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  18507. 1177.95 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18508. 1177.95 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18509. 1194.32 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18510. 1194.35 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18511. 1194.35 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18512. 1194.35 s [algebraic-graphs]
  18513. 1194.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  18514. 1194.35 s [algebraic-graphs] OK: mesh xs [] == empty
  18515. 1194.35 s [algebraic-graphs] OK: mesh [] ys == empty
  18516. 1194.35 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  18517. 1194.35 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  18518. 1194.35 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  18519. 1194.35 s [algebraic-graphs]
  18520. 1194.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  18521. 1194.35 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  18522. 1194.35 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  18523. 1194.35 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  18524. 1194.35 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  18525. 1194.35 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  18526. 1194.35 s [algebraic-graphs]
  18527. 1194.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  18528. 1194.35 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  18529. 1194.35 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  18530. 1194.35 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  18531. 1194.35 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  18532. 1194.35 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  18533. 1194.35 s [algebraic-graphs]
  18534. 1194.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  18535. 1194.35 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  18536. 1194.35 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18537. 1194.35 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  18538. 1194.35 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  18539. 1194.35 s [algebraic-graphs]
  18540. 1194.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  18541. 1194.35 s [algebraic-graphs] OK: bimap f g empty == empty
  18542. 1194.35 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  18543. 1194.35 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  18544. 1194.36 s [algebraic-graphs] OK: bimap id id == id
  18545. 1194.36 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  18546. 1194.36 s [algebraic-graphs]
  18547. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  18548. 1194.36 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  18549. 1194.36 s [algebraic-graphs]
  18550. 1194.36 s [algebraic-graphs] OK: box x y ~~ box y x
  18551. 1194.36 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18552. 1194.36 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18553. 1194.36 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  18554. 1194.36 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  18555. 1194.36 s [algebraic-graphs] OK: box x empty ~~ empty
  18556. 1194.36 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  18557. 1194.36 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18558. 1194.36 s [algebraic-graphs]
  18559. 1194.36 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  18560. 1194.36 s [algebraic-graphs]
  18561. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  18562. 1194.36 s [algebraic-graphs] OK: consistent empty == True
  18563. 1194.36 s [algebraic-graphs] OK: consistent (vertex x) == True
  18564. 1194.36 s [algebraic-graphs] OK: consistent (edge x y) == True
  18565. 1194.36 s [algebraic-graphs] OK: consistent (edges x) == True
  18566. 1194.36 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  18567. 1194.36 s [algebraic-graphs] OK: consistent (swap x) == True
  18568. 1194.36 s [algebraic-graphs] OK: consistent (circuit xs) == True
  18569. 1194.36 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  18570. 1194.36 s [algebraic-graphs]
  18571. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  18572. 1194.36 s [algebraic-graphs] OK: detectParts empty == Right empty
  18573. 1194.36 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  18574. 1194.36 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  18575. 1194.36 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  18576. 1194.36 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  18577. 1194.36 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  18578. 1194.36 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  18579. 1194.36 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  18580. 1194.36 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  18581. 1194.36 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  18582. 1194.36 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  18583. 1194.36 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  18584. 1194.36 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  18585. 1194.36 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  18586. 1194.36 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  18587. 1194.36 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  18588. 1194.36 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  18589. 1194.36 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  18590. 1194.36 s [algebraic-graphs]
  18591. 1194.36 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  18592. 1194.36 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  18593. 1194.36 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  18594. 1194.36 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  18595. 1194.36 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  18596. 1194.36 s [algebraic-graphs]
  18597. 1194.36 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18598. 1194.36 s [algebraic-graphs] OK: show (matching []) == "matching []"
  18599. 1194.36 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  18600. 1194.36 s [algebraic-graphs]
  18601. 1194.36 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18602. 1194.36 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  18603. 1194.36 s [algebraic-graphs]
  18604. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  18605. 1194.36 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  18606. 1194.36 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  18607. 1194.36 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  18608. 1194.36 s [algebraic-graphs]
  18609. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  18610. 1194.36 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  18611. 1194.36 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  18612. 1194.36 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  18613. 1194.36 s [algebraic-graphs]
  18614. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  18615. 1194.36 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  18616. 1194.36 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  18617. 1194.36 s [algebraic-graphs]
  18618. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  18619. 1194.36 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  18620. 1194.36 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  18621. 1194.36 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  18622. 1194.36 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  18623. 1194.36 s [algebraic-graphs]
  18624. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  18625. 1194.36 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  18626. 1194.36 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  18627. 1194.36 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  18628. 1194.36 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  18629. 1194.36 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  18630. 1194.36 s [algebraic-graphs]
  18631. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  18632. 1194.36 s [algebraic-graphs] OK: maxMatching empty == matching []
  18633. 1194.36 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  18634. 1194.36 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  18635. 1194.36 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  18636. 1194.36 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  18637. 1194.36 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18638. 1194.36 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  18639. 1194.36 s [algebraic-graphs]
  18640. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  18641. 1194.36 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  18642. 1194.36 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18643. 1194.36 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  18644. 1194.36 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  18645. 1194.36 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  18646. 1194.36 s [algebraic-graphs]
  18647. 1194.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  18648. 1194.36 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  18649. 1196.64 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  18650. 1196.64 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  18651. 1196.64 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  18652. 1196.64 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18653. 1196.64 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  18654. 1196.64 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  18655. 1196.64 s [algebraic-graphs]
  18656. 1196.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  18657. 1196.64 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  18658. 1196.64 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18659. 1196.64 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  18660. 1196.64 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  18661. 1196.64 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  18662. 1196.64 s [algebraic-graphs]
  18663. 1196.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  18664. 1196.64 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  18665. 1196.64 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  18666. 1196.64 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  18667. 1196.64 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  18668. 1196.64 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  18669. 1196.64 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  18670. 1196.64 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  18671. 1196.64 s [algebraic-graphs]
  18672. 1196.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  18673. 1196.64 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  18674. 1196.64 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  18675. 1196.64 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  18676. 1196.64 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  18677. 1196.64 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  18678. 1196.64 s [algebraic-graphs]
  18679. 1196.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  18680. 1196.64 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  18681. 1196.64 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  18682. 1196.64 s [algebraic-graphs]
  18683. 1196.64 s [algebraic-graphs] ============ Export.Eq ============
  18684. 1196.64 s [algebraic-graphs] OK: mempty /= literal ""
  18685. 1196.64 s [algebraic-graphs]
  18686. 1196.64 s [algebraic-graphs] ============ Export.Ord ============
  18687. 1196.64 s [algebraic-graphs] OK: mempty < literal ""
  18688. 1196.64 s [algebraic-graphs]
  18689. 1196.64 s [algebraic-graphs] ============ Export.isEmpty ============
  18690. 1196.64 s [algebraic-graphs] OK: isEmpty mempty == True
  18691. 1196.64 s [algebraic-graphs] OK: isEmpty (literal "") == False
  18692. 1196.64 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  18693. 1196.64 s [algebraic-graphs]
  18694. 1196.64 s [algebraic-graphs] ============ Export.literal ============
  18695. 1196.64 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  18696. 1196.64 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  18697. 1196.64 s [algebraic-graphs] OK: render . literal == id
  18698. 1196.64 s [algebraic-graphs]
  18699. 1196.64 s [algebraic-graphs] ============ Export.render ============
  18700. 1196.64 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  18701. 1196.64 s [algebraic-graphs] OK: render mempty == mempty
  18702. 1196.64 s [algebraic-graphs]
  18703. 1196.64 s [algebraic-graphs] ============ Export.<+> ============
  18704. 1196.64 s [algebraic-graphs] OK: x <+> mempty == x
  18705. 1196.64 s [algebraic-graphs] OK: mempty <+> x == x
  18706. 1196.64 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  18707. 1196.64 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  18708. 1196.64 s [algebraic-graphs]
  18709. 1196.64 s [algebraic-graphs] ============ Export.brackets ============
  18710. 1196.64 s [algebraic-graphs] OK: brackets "i" == "[i]"
  18711. 1196.64 s [algebraic-graphs] OK: brackets mempty == "[]"
  18712. 1196.64 s [algebraic-graphs]
  18713. 1196.64 s [algebraic-graphs] ============ Export.doubleQuotes ============
  18714. 1196.64 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  18715. 1196.64 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  18716. 1196.64 s [algebraic-graphs]
  18717. 1196.64 s [algebraic-graphs] ============ Export.indent ============
  18718. 1196.64 s [algebraic-graphs] OK: indent 0 == id
  18719. 1196.64 s [algebraic-graphs] OK: indent 1 mempty == " "
  18720. 1196.64 s [algebraic-graphs]
  18721. 1196.64 s [algebraic-graphs] ============ Export.unlines ============
  18722. 1196.64 s [algebraic-graphs] OK: unlines [] == mempty
  18723. 1196.64 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  18724. 1196.64 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  18725. 1196.64 s [algebraic-graphs]
  18726. 1196.64 s [algebraic-graphs] ============ Export.export ============
  18727. 1196.64 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  18728. 1196.64 s [algebraic-graphs]
  18729. 1196.64 s [algebraic-graphs] ============ Export.Dot.export ============
  18730. 1196.64 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18731. 1196.64 s [algebraic-graphs]
  18732. 1196.64 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  18733. 1196.64 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18734. 1196.64 s [algebraic-graphs]
  18735. 1196.64 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  18736. 1196.64 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  18737. 1196.64 s [algebraic-graphs]
  18738. 1196.64 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  18739. 1196.64 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  18740. 1196.64 s [algebraic-graphs]
  18741. 1196.64 s [algebraic-graphs] ============ Graph ============
  18742. 1196.64 s [algebraic-graphs] OK: Axioms of graphs
  18743. 1196.64 s [algebraic-graphs] OK: Theorems of graphs
  18744. 1196.64 s [algebraic-graphs]
  18745. 1196.64 s [algebraic-graphs] ============ Graph.Ord ============
  18746. 1196.64 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18747. 1196.64 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18748. 1196.64 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18749. 1196.64 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18750. 1196.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18751. 1196.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18752. 1196.64 s [algebraic-graphs] OK: x <= x + y
  18753. 1196.64 s [algebraic-graphs] OK: x + y <= x * y
  18754. 1196.64 s [algebraic-graphs]
  18755. 1196.64 s [algebraic-graphs] ============ Graph.empty ============
  18756. 1196.64 s [algebraic-graphs] OK: isEmpty empty == True
  18757. 1196.64 s [algebraic-graphs] OK: hasVertex x empty == False
  18758. 1196.64 s [algebraic-graphs] OK: vertexCount empty == 0
  18759. 1196.64 s [algebraic-graphs] OK: edgeCount empty == 0
  18760. 1196.64 s [algebraic-graphs]
  18761. 1196.64 s [algebraic-graphs] ============ Graph.vertex ============
  18762. 1196.64 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18763. 1196.64 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18764. 1196.64 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18765. 1196.64 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18766. 1196.64 s [algebraic-graphs]
  18767. 1196.64 s [algebraic-graphs] ============ Graph.edge ============
  18768. 1196.64 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18769. 1196.64 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18770. 1196.64 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18771. 1196.64 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18772. 1196.64 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18773. 1196.64 s [algebraic-graphs]
  18774. 1196.64 s [algebraic-graphs] ============ Graph.overlay ============
  18775. 1196.64 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18776. 1196.64 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18777. 1196.64 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18778. 1196.64 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18779. 1196.64 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18780. 1196.64 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18781. 1196.64 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18782. 1196.64 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18783. 1196.64 s [algebraic-graphs]
  18784. 1196.64 s [algebraic-graphs] ============ Graph.connect ============
  18785. 1196.64 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18786. 1196.64 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18787. 1196.64 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18788. 1196.64 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18789. 1196.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18790. 1196.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18791. 1196.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18792. 1196.64 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18793. 1196.64 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18794. 1196.64 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18795. 1196.64 s [algebraic-graphs]
  18796. 1196.64 s [algebraic-graphs] ============ Graph.vertices ============
  18797. 1196.64 s [algebraic-graphs] OK: vertices [] == empty
  18798. 1196.64 s [algebraic-graphs] OK: vertices [x] == vertex x
  18799. 1196.64 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18800. 1196.64 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18801. 1196.64 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18802. 1196.64 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18803. 1196.64 s [algebraic-graphs]
  18804. 1196.64 s [algebraic-graphs] ============ Graph.edges ============
  18805. 1196.64 s [algebraic-graphs] OK: edges [] == empty
  18806. 1196.64 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18807. 1196.64 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18808. 1196.64 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18809. 1196.64 s [algebraic-graphs]
  18810. 1196.64 s [algebraic-graphs] ============ Graph.overlays ============
  18811. 1196.64 s [algebraic-graphs] OK: overlays [] == empty
  18812. 1196.64 s [algebraic-graphs] OK: overlays [x] == x
  18813. 1196.64 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18814. 1196.64 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18815. 1196.64 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18816. 1196.64 s [algebraic-graphs]
  18817. 1196.64 s [algebraic-graphs] ============ Graph.connects ============
  18818. 1196.64 s [algebraic-graphs] OK: connects [] == empty
  18819. 1196.64 s [algebraic-graphs] OK: connects [x] == x
  18820. 1196.64 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18821. 1196.64 s [algebraic-graphs] OK: connects == foldr connect empty
  18822. 1196.64 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18823. 1196.64 s [algebraic-graphs]
  18824. 1196.64 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  18825. 1196.64 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18826. 1196.64 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18827. 1196.64 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18828. 1196.64 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18829. 1196.64 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18830. 1196.64 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18831. 1196.64 s [algebraic-graphs]
  18832. 1196.64 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  18833. 1196.64 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18834. 1196.64 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18835. 1196.64 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18836. 1196.64 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18837. 1196.64 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18838. 1196.64 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18839. 1196.64 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18840. 1196.64 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18841. 1196.64 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18842. 1197.34 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18843. 1197.34 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18844. 1197.34 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18845. 1197.34 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18846. 1197.34 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18847. 1197.34 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18848. 1197.34 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18849. 1197.34 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18850. 1197.34 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18851. 1197.34 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18852. 1197.34 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18853. 1197.34 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18854. 1197.34 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18855. 1197.34 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18856. 1197.34 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18857. 1197.34 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18858. 1197.34 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18859. 1197.34 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18860. 1197.34 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18861. 1197.34 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18862. 1197.34 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18863. 1197.34 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18864. 1197.34 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18865. 1197.34 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18866. 1197.34 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18867. 1197.34 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18868. 1197.34 s [algebraic-graphs]
  18869. 1197.34 s [algebraic-graphs] ============ Graph.foldg ============
  18870. 1197.34 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18871. 1197.34 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18872. 1197.34 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18873. 1197.34 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18874. 1197.34 s [algebraic-graphs]
  18875. 1197.34 s [algebraic-graphs] ============ Graph.isEmpty ============
  18876. 1197.34 s [algebraic-graphs] OK: isEmpty empty == True
  18877. 1197.34 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18878. 1197.34 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18879. 1197.34 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18880. 1197.34 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18881. 1197.34 s [algebraic-graphs]
  18882. 1197.34 s [algebraic-graphs] ============ Graph.hasVertex ============
  18883. 1197.34 s [algebraic-graphs] OK: hasVertex x empty == False
  18884. 1197.34 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18885. 1197.34 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18886. 1197.34 s [algebraic-graphs]
  18887. 1197.34 s [algebraic-graphs] ============ Graph.hasEdge ============
  18888. 1197.34 s [algebraic-graphs] OK: hasEdge x y empty == False
  18889. 1197.34 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18890. 1197.34 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18891. 1197.34 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18892. 1197.34 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18893. 1197.34 s [algebraic-graphs]
  18894. 1197.34 s [algebraic-graphs] ============ Graph.vertexCount ============
  18895. 1197.34 s [algebraic-graphs] OK: vertexCount empty == 0
  18896. 1197.35 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18897. 1197.35 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18898. 1197.35 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18899. 1197.35 s [algebraic-graphs]
  18900. 1197.35 s [algebraic-graphs] ============ Graph.edgeCount ============
  18901. 1197.35 s [algebraic-graphs] OK: edgeCount empty == 0
  18902. 1197.35 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18903. 1197.35 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18904. 1197.35 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18905. 1197.35 s [algebraic-graphs]
  18906. 1197.35 s [algebraic-graphs] ============ Graph.vertexList ============
  18907. 1197.35 s [algebraic-graphs] OK: vertexList empty == []
  18908. 1197.35 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18909. 1197.35 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18910. 1197.35 s [algebraic-graphs]
  18911. 1197.35 s [algebraic-graphs] ============ Graph.vertexSet ============
  18912. 1197.35 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18913. 1197.35 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18914. 1197.35 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18915. 1197.35 s [algebraic-graphs]
  18916. 1197.35 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  18917. 1197.35 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18918. 1197.35 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18919. 1197.35 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18920. 1197.35 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18921. 1197.35 s [algebraic-graphs]
  18922. 1197.35 s [algebraic-graphs] ============ Graph.edgeList ============
  18923. 1197.35 s [algebraic-graphs] OK: edgeList empty == []
  18924. 1197.35 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18925. 1197.35 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18926. 1197.35 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18927. 1197.35 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18928. 1197.35 s [algebraic-graphs]
  18929. 1197.35 s [algebraic-graphs] ============ Graph.edgeSet ============
  18930. 1197.35 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18931. 1197.35 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18932. 1197.35 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18933. 1197.35 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18934. 1197.35 s [algebraic-graphs]
  18935. 1197.35 s [algebraic-graphs] ============ Graph.adjacencyList ============
  18936. 1197.35 s [algebraic-graphs] OK: adjacencyList empty == []
  18937. 1197.35 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18938. 1197.35 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18939. 1197.35 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18940. 1197.35 s [algebraic-graphs]
  18941. 1197.35 s [algebraic-graphs] ============ Graph.preSet ============
  18942. 1197.35 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18943. 1197.35 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18944. 1197.35 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18945. 1197.35 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18946. 1197.35 s [algebraic-graphs]
  18947. 1197.35 s [algebraic-graphs] ============ Graph.preIntSet ============
  18948. 1197.35 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18949. 1197.35 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18950. 1197.35 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18951. 1197.35 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18952. 1197.35 s [algebraic-graphs]
  18953. 1197.35 s [algebraic-graphs] ============ Graph.postSet ============
  18954. 1197.35 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18955. 1197.35 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18956. 1197.35 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18957. 1197.35 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18958. 1197.35 s [algebraic-graphs]
  18959. 1197.35 s [algebraic-graphs] ============ Graph.postIntSet ============
  18960. 1197.35 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18961. 1197.35 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18962. 1197.35 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18963. 1197.35 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18964. 1197.35 s [algebraic-graphs]
  18965. 1197.35 s [algebraic-graphs] ============ Graph.size ============
  18966. 1197.35 s [algebraic-graphs] OK: size empty == 1
  18967. 1197.35 s [algebraic-graphs] OK: size (vertex x) == 1
  18968. 1197.35 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  18969. 1197.35 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  18970. 1197.35 s [algebraic-graphs] OK: size x >= 1
  18971. 1197.35 s [algebraic-graphs] OK: size x >= vertexCount x
  18972. 1197.35 s [algebraic-graphs]
  18973. 1197.35 s [algebraic-graphs] ============ Graph.path ============
  18974. 1197.35 s [algebraic-graphs] OK: path [] == empty
  18975. 1197.35 s [algebraic-graphs] OK: path [x] == vertex x
  18976. 1197.35 s [algebraic-graphs] OK: path [x,y] == edge x y
  18977. 1197.35 s [algebraic-graphs]
  18978. 1197.35 s [algebraic-graphs] ============ Graph.circuit ============
  18979. 1197.35 s [algebraic-graphs] OK: circuit [] == empty
  18980. 1197.35 s [algebraic-graphs] OK: circuit [x] == edge x x
  18981. 1197.35 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18982. 1197.35 s [algebraic-graphs]
  18983. 1197.35 s [algebraic-graphs] ============ Graph.clique ============
  18984. 1197.35 s [algebraic-graphs] OK: clique [] == empty
  18985. 1197.35 s [algebraic-graphs] OK: clique [x] == vertex x
  18986. 1197.35 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18987. 1197.35 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18988. 1197.35 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18989. 1197.35 s [algebraic-graphs]
  18990. 1197.35 s [algebraic-graphs] ============ Graph.biclique ============
  18991. 1197.35 s [algebraic-graphs] OK: biclique [] [] == empty
  18992. 1197.35 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18993. 1197.35 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18994. 1197.35 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18995. 1197.35 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18996. 1197.35 s [algebraic-graphs]
  18997. 1197.35 s [algebraic-graphs] ============ Graph.star ============
  18998. 1197.35 s [algebraic-graphs] OK: star x [] == vertex x
  18999. 1197.35 s [algebraic-graphs] OK: star x [y] == edge x y
  19000. 1197.35 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19001. 1197.35 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19002. 1197.35 s [algebraic-graphs]
  19003. 1197.35 s [algebraic-graphs] ============ Graph.stars ============
  19004. 1197.35 s [algebraic-graphs] OK: stars [] == empty
  19005. 1197.35 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19006. 1197.35 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19007. 1197.35 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19008. 1197.35 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19009. 1197.35 s [algebraic-graphs] OK: stars . adjacencyList == id
  19010. 1197.35 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19011. 1197.35 s [algebraic-graphs]
  19012. 1197.35 s [algebraic-graphs] ============ Graph.tree ============
  19013. 1197.35 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19014. 1197.35 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19015. 1197.35 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19016. 1197.35 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19017. 1197.35 s [algebraic-graphs]
  19018. 1197.35 s [algebraic-graphs] ============ Graph.forest ============
  19019. 1197.35 s [algebraic-graphs] OK: forest [] == empty
  19020. 1197.35 s [algebraic-graphs] OK: forest [x] == tree x
  19021. 1197.35 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19022. 1197.35 s [algebraic-graphs] OK: forest == overlays . map tree
  19023. 1197.35 s [algebraic-graphs]
  19024. 1197.35 s [algebraic-graphs] ============ Graph.removeVertex ============
  19025. 1200.95 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19026. 1200.95 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19027. 1200.95 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19028. 1201.08 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19029. 1201.08 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19030. 1201.08 s [algebraic-graphs]
  19031. 1201.08 s [algebraic-graphs] ============ Graph.removeEdge ============
  19032. 1201.08 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19033. 1201.08 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19034. 1201.08 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19035. 1201.08 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19036. 1201.08 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19037. 1201.08 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19038. 1201.08 s [algebraic-graphs]
  19039. 1201.08 s [algebraic-graphs] ============ Graph.replaceVertex ============
  19040. 1201.08 s [algebraic-graphs] OK: replaceVertex x x == id
  19041. 1201.08 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19042. 1201.08 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19043. 1201.08 s [algebraic-graphs]
  19044. 1201.08 s [algebraic-graphs] ============ Graph.mergeVertices ============
  19045. 1201.08 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19046. 1201.08 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19047. 1201.08 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19048. 1201.08 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19049. 1201.08 s [algebraic-graphs]
  19050. 1201.08 s [algebraic-graphs] ============ Graph.transpose ============
  19051. 1201.08 s [algebraic-graphs] OK: transpose empty == empty
  19052. 1201.08 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19053. 1201.08 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19054. 1201.08 s [algebraic-graphs] OK: transpose . transpose == id
  19055. 1201.08 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19056. 1201.08 s [algebraic-graphs]
  19057. 1201.08 s [algebraic-graphs] ============ Graph.gmap ============
  19058. 1201.08 s [algebraic-graphs] OK: gmap f empty == empty
  19059. 1201.08 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19060. 1201.08 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19061. 1201.08 s [algebraic-graphs] OK: gmap id == id
  19062. 1201.08 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19063. 1201.08 s [algebraic-graphs]
  19064. 1201.08 s [algebraic-graphs] ============ Graph.induce ============
  19065. 1201.08 s [algebraic-graphs] OK: induce (const True ) x == x
  19066. 1201.08 s [algebraic-graphs] OK: induce (const False) x == empty
  19067. 1201.08 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19068. 1201.08 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19069. 1201.08 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19070. 1201.08 s [algebraic-graphs]
  19071. 1201.08 s [algebraic-graphs] ============ Graph.induceJust ============
  19072. 1201.08 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19073. 1201.08 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19074. 1201.08 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19075. 1201.08 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19076. 1201.08 s [algebraic-graphs]
  19077. 1201.08 s [algebraic-graphs] ============ Graph.compose ============
  19078. 1201.08 s [algebraic-graphs] OK: compose empty x == empty
  19079. 1201.08 s [algebraic-graphs] OK: compose x empty == empty
  19080. 1201.08 s [algebraic-graphs] OK: compose (vertex x) y == empty
  19081. 1201.08 s [algebraic-graphs] OK: compose x (vertex y) == empty
  19082. 1201.08 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  19083. 1201.08 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  19084. 1201.08 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  19085. 1201.08 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  19086. 1201.08 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  19087. 1201.08 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  19088. 1201.08 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  19089. 1201.08 s [algebraic-graphs]
  19090. 1201.08 s [algebraic-graphs] ============ Graph.(===) ============
  19091. 1201.08 s [algebraic-graphs] OK: x === x == True
  19092. 1201.09 s [algebraic-graphs] OK: x === x + empty == False
  19093. 1201.09 s [algebraic-graphs] OK: x + y === x + y == True
  19094. 1201.09 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19095. 1201.09 s [algebraic-graphs] OK: x + y === x * y == False
  19096. 1201.09 s [algebraic-graphs]
  19097. 1201.09 s [algebraic-graphs] ============ Graph.mesh ============
  19098. 1201.09 s [algebraic-graphs] OK: mesh xs [] == empty
  19099. 1201.09 s [algebraic-graphs] OK: mesh [] ys == empty
  19100. 1201.09 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  19101. 1201.09 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  19102. 1201.09 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  19103. 1201.09 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19104. 1201.09 s [algebraic-graphs]
  19105. 1201.09 s [algebraic-graphs] ============ Graph.torus ============
  19106. 1201.09 s [algebraic-graphs] OK: torus xs [] == empty
  19107. 1201.09 s [algebraic-graphs] OK: torus [] ys == empty
  19108. 1201.09 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  19109. 1201.09 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  19110. 1201.09 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  19111. 1201.09 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  19112. 1201.09 s [algebraic-graphs]
  19113. 1201.09 s [algebraic-graphs] ============ Graph.deBruijn ============
  19114. 1201.09 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  19115. 1201.09 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  19116. 1201.09 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  19117. 1201.09 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  19118. 1201.09 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  19119. 1201.09 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  19120. 1201.09 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  19121. 1201.09 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  19122. 1201.09 s [algebraic-graphs]
  19123. 1201.09 s [algebraic-graphs] ============ Graph.splitVertex ============
  19124. 1201.09 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  19125. 1201.09 s [algebraic-graphs] OK: splitVertex x [x] == id
  19126. 1201.09 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  19127. 1201.09 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19128. 1201.09 s [algebraic-graphs]
  19129. 1201.09 s [algebraic-graphs] ============ Graph.bind ============
  19130. 1201.09 s [algebraic-graphs] OK: bind empty f == empty
  19131. 1201.09 s [algebraic-graphs] OK: bind (vertex x) f == f x
  19132. 1201.09 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  19133. 1201.09 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  19134. 1201.09 s [algebraic-graphs] OK: bind x (const empty) == empty
  19135. 1201.09 s [algebraic-graphs] OK: bind x vertex == x
  19136. 1201.09 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  19137. 1201.09 s [algebraic-graphs]
  19138. 1201.09 s [algebraic-graphs] ============ Graph.simplify ============
  19139. 1201.09 s [algebraic-graphs] OK: simplify == id
  19140. 1201.09 s [algebraic-graphs] OK: size (simplify x) <= size x
  19141. 1201.09 s [algebraic-graphs]
  19142. 1201.09 s [algebraic-graphs] ============ Graph.box ============
  19143. 1201.09 s [algebraic-graphs] OK: box x y ~~ box y x
  19144. 1201.09 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19145. 1201.09 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19146. 1201.09 s [algebraic-graphs] OK: box x empty ~~ empty
  19147. 1201.09 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19148. 1201.09 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19149. 1201.09 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19150. 1201.09 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19151. 1201.09 s [algebraic-graphs]
  19152. 1201.09 s [algebraic-graphs] ============ Graph.sparsify ============
  19153. 1201.09 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19154. 1201.09 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19155. 1201.09 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19156. 1201.09 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19157. 1201.09 s [algebraic-graphs]
  19158. 1201.09 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  19159. 1201.09 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19160. 1201.09 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19161. 1201.09 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19162. 1201.09 s [algebraic-graphs]
  19163. 1201.09 s [algebraic-graphs] ============ Graph.context ============
  19164. 1201.09 s [algebraic-graphs] OK: context (const False) x == Nothing
  19165. 1201.09 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  19166. 1201.09 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  19167. 1201.09 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  19168. 1201.09 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  19169. 1201.09 s [algebraic-graphs]
  19170. 1201.09 s [algebraic-graphs] ============ Graph.buildg ============
  19171. 1201.09 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  19172. 1201.09 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  19173. 1201.09 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
  19174. 1201.09 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
  19175. 1201.09 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  19176. 1201.09 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  19177. 1201.09 s [algebraic-graphs]
  19178. 1201.09 s [algebraic-graphs] ============ Internal.List ============
  19179. 1201.09 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  19180. 1201.09 s [algebraic-graphs]
  19181. 1201.09 s [algebraic-graphs] ============ Graph.Label ============
  19182. 1201.09 s [algebraic-graphs]
  19183. 1201.09 s [algebraic-graphs] ============ Any: instances ============
  19184. 1201.09 s [algebraic-graphs] OK: Semiring
  19185. 1201.09 s [algebraic-graphs] OK: StarSemiring
  19186. 1201.09 s [algebraic-graphs] OK: Dioid
  19187. 1201.09 s [algebraic-graphs]
  19188. 1201.09 s [algebraic-graphs] ============ Distance Int: instances ============
  19189. 1201.09 s [algebraic-graphs] OK: Semiring
  19190. 1201.09 s [algebraic-graphs] OK: StarSemiring
  19191. 1201.09 s [algebraic-graphs] OK: Dioid
  19192. 1201.09 s [algebraic-graphs]
  19193. 1201.09 s [algebraic-graphs] ============ Capacity Int: instances ============
  19194. 1201.09 s [algebraic-graphs] OK: Semiring
  19195. 1201.09 s [algebraic-graphs] OK: StarSemiring
  19196. 1201.09 s [algebraic-graphs] OK: Dioid
  19197. 1201.09 s [algebraic-graphs]
  19198. 1201.09 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  19199. 1201.09 s [algebraic-graphs] OK: LeftNearRing
  19200. 1201.09 s [algebraic-graphs]
  19201. 1201.09 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  19202. 1201.09 s [algebraic-graphs] OK: Semiring
  19203. 1201.09 s [algebraic-graphs] OK: Dioid
  19204. 1201.09 s [algebraic-graphs]
  19205. 1201.09 s [algebraic-graphs] ============ Count Int: instances ============
  19206. 1201.09 s [algebraic-graphs] OK: Semiring
  19207. 1201.09 s [algebraic-graphs] OK: StarSemiring
  19208. 1201.09 s [algebraic-graphs]
  19209. 1201.09 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  19210. 1201.09 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  19211. 1201.09 s [algebraic-graphs] OK: empty
  19212. 1201.09 s [algebraic-graphs] OK: vertex
  19213. 1201.09 s [algebraic-graphs] OK: edge
  19214. 1201.09 s [algebraic-graphs] OK: overlay
  19215. 1201.09 s [algebraic-graphs] OK: connect
  19216. 1201.09 s [algebraic-graphs] OK: vertices
  19217. 1201.09 s [algebraic-graphs] OK: edges
  19218. 1201.09 s [algebraic-graphs] OK: overlays
  19219. 1201.09 s [algebraic-graphs] OK: fromAdjacencyMaps
  19220. 1201.09 s [algebraic-graphs] OK: removeVertex
  19221. 1201.09 s [algebraic-graphs] OK: removeEdge
  19222. 1201.09 s [algebraic-graphs] OK: replaceVertex
  19223. 1201.09 s [algebraic-graphs] OK: replaceEdge
  19224. 1201.09 s [algebraic-graphs] OK: transpose
  19225. 1201.09 s [algebraic-graphs] OK: gmap
  19226. 1201.09 s [algebraic-graphs] OK: emap
  19227. 1201.09 s [algebraic-graphs] OK: induce
  19228. 1201.09 s [algebraic-graphs] OK: closure
  19229. 1201.09 s [algebraic-graphs] OK: reflexiveClosure
  19230. 1201.09 s [algebraic-graphs] OK: symmetricClosure
  19231. 1201.09 s [algebraic-graphs] OK: transitiveClosure
  19232. 1201.09 s [algebraic-graphs]
  19233. 1201.09 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  19234. 1201.09 s [algebraic-graphs] OK: isEmpty empty == True
  19235. 1201.09 s [algebraic-graphs] OK: hasVertex x empty == False
  19236. 1201.09 s [algebraic-graphs] OK: vertexCount empty == 0
  19237. 1201.09 s [algebraic-graphs] OK: edgeCount empty == 0
  19238. 1201.09 s [algebraic-graphs]
  19239. 1201.09 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  19240. 1201.09 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19241. 1201.09 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19242. 1201.09 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19243. 1201.09 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19244. 1201.09 s [algebraic-graphs]
  19245. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  19246. 1203.37 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19247. 1203.37 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19248. 1203.37 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19249. 1203.37 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19250. 1203.37 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19251. 1203.37 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19252. 1203.37 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19253. 1203.37 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19254. 1203.37 s [algebraic-graphs]
  19255. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  19256. 1203.37 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19257. 1203.37 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19258. 1203.37 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19259. 1203.37 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19260. 1203.37 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19261. 1203.37 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19262. 1203.37 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19263. 1203.37 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19264. 1203.37 s [algebraic-graphs]
  19265. 1203.37 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19266. 1203.37 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19267. 1203.37 s [algebraic-graphs]
  19268. 1203.37 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19269. 1203.37 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19270. 1203.37 s [algebraic-graphs]
  19271. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  19272. 1203.37 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19273. 1203.37 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19274. 1203.37 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19275. 1203.37 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19276. 1203.37 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19277. 1203.37 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19278. 1203.37 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19279. 1203.37 s [algebraic-graphs]
  19280. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  19281. 1203.37 s [algebraic-graphs] OK: vertices [] == empty
  19282. 1203.37 s [algebraic-graphs] OK: vertices [x] == vertex x
  19283. 1203.37 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19284. 1203.37 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19285. 1203.37 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19286. 1203.37 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19287. 1203.37 s [algebraic-graphs]
  19288. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  19289. 1203.37 s [algebraic-graphs] OK: edges [] == empty
  19290. 1203.37 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19291. 1203.37 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19292. 1203.37 s [algebraic-graphs]
  19293. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  19294. 1203.37 s [algebraic-graphs] OK: overlays [] == empty
  19295. 1203.37 s [algebraic-graphs] OK: overlays [x] == x
  19296. 1203.37 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19297. 1203.37 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19298. 1203.37 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19299. 1203.37 s [algebraic-graphs]
  19300. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  19301. 1203.37 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  19302. 1203.37 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  19303. 1203.37 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  19304. 1203.37 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  19305. 1203.37 s [algebraic-graphs]
  19306. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  19307. 1203.37 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19308. 1203.37 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19309. 1203.37 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19310. 1203.37 s [algebraic-graphs]
  19311. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  19312. 1203.37 s [algebraic-graphs] OK: isEmpty empty == True
  19313. 1203.37 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19314. 1203.37 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19315. 1203.37 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19316. 1203.37 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19317. 1203.37 s [algebraic-graphs]
  19318. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  19319. 1203.37 s [algebraic-graphs] OK: hasVertex x empty == False
  19320. 1203.37 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19321. 1203.37 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19322. 1203.37 s [algebraic-graphs]
  19323. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  19324. 1203.37 s [algebraic-graphs] OK: hasEdge x y empty == False
  19325. 1203.37 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19326. 1203.37 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19327. 1203.37 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19328. 1203.37 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19329. 1203.37 s [algebraic-graphs]
  19330. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  19331. 1203.37 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19332. 1203.37 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19333. 1203.37 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19334. 1203.37 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19335. 1203.37 s [algebraic-graphs]
  19336. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  19337. 1203.37 s [algebraic-graphs] OK: vertexCount empty == 0
  19338. 1203.37 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19339. 1203.37 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19340. 1203.37 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19341. 1203.37 s [algebraic-graphs]
  19342. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  19343. 1203.37 s [algebraic-graphs] OK: edgeCount empty == 0
  19344. 1203.37 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19345. 1203.37 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19346. 1203.37 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19347. 1203.37 s [algebraic-graphs]
  19348. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  19349. 1203.37 s [algebraic-graphs] OK: vertexList empty == []
  19350. 1203.37 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19351. 1203.37 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19352. 1203.37 s [algebraic-graphs]
  19353. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  19354. 1203.37 s [algebraic-graphs] OK: edgeList empty == []
  19355. 1203.37 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19356. 1203.37 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19357. 1203.37 s [algebraic-graphs]
  19358. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  19359. 1203.37 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19360. 1203.37 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19361. 1203.37 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19362. 1203.37 s [algebraic-graphs]
  19363. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  19364. 1203.37 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19365. 1203.37 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19366. 1203.37 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19367. 1203.37 s [algebraic-graphs]
  19368. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  19369. 1203.37 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19370. 1203.37 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19371. 1203.37 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19372. 1203.37 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19373. 1203.37 s [algebraic-graphs]
  19374. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  19375. 1203.37 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19376. 1203.37 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19377. 1203.37 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19378. 1203.37 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19379. 1203.37 s [algebraic-graphs]
  19380. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  19381. 1203.37 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  19382. 1203.37 s [algebraic-graphs]
  19383. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  19384. 1203.37 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19385. 1203.37 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19386. 1203.37 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19387. 1203.37 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19388. 1203.37 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19389. 1203.37 s [algebraic-graphs]
  19390. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  19391. 1203.37 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19392. 1203.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19393. 1203.37 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19394. 1203.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19395. 1203.37 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19396. 1203.37 s [algebraic-graphs]
  19397. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  19398. 1203.37 s [algebraic-graphs] OK: replaceVertex x x == id
  19399. 1203.37 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19400. 1203.37 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  19401. 1203.37 s [algebraic-graphs]
  19402. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  19403. 1203.37 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19404. 1203.37 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19405. 1203.37 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19406. 1203.37 s [algebraic-graphs]
  19407. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  19408. 1203.37 s [algebraic-graphs] OK: transpose empty == empty
  19409. 1203.37 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19410. 1203.37 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19411. 1203.37 s [algebraic-graphs] OK: transpose . transpose == id
  19412. 1203.37 s [algebraic-graphs]
  19413. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  19414. 1203.37 s [algebraic-graphs] OK: gmap f empty == empty
  19415. 1203.37 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19416. 1203.37 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  19417. 1203.37 s [algebraic-graphs] OK: gmap id == id
  19418. 1203.37 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19419. 1203.37 s [algebraic-graphs]
  19420. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  19421. 1203.37 s [algebraic-graphs] OK: emap h empty == empty
  19422. 1203.37 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19423. 1203.37 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19424. 1203.37 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19425. 1203.37 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19426. 1203.37 s [algebraic-graphs] OK: emap id == id
  19427. 1203.37 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19428. 1203.37 s [algebraic-graphs]
  19429. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  19430. 1203.37 s [algebraic-graphs] OK: induce (const True ) x == x
  19431. 1203.37 s [algebraic-graphs] OK: induce (const False) x == empty
  19432. 1203.37 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19433. 1203.37 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19434. 1203.37 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19435. 1203.37 s [algebraic-graphs]
  19436. 1203.37 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  19437. 1204.49 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19438. 1204.49 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19439. 1204.49 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19440. 1204.49 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19441. 1204.49 s [algebraic-graphs]
  19442. 1204.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  19443. 1204.49 s [algebraic-graphs] OK: closure empty == empty
  19444. 1204.49 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19445. 1204.49 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19446. 1204.49 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19447. 1204.49 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19448. 1204.49 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19449. 1204.49 s [algebraic-graphs] OK: closure . closure == closure
  19450. 1204.49 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19451. 1204.49 s [algebraic-graphs]
  19452. 1204.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  19453. 1204.49 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19454. 1204.49 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19455. 1204.49 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19456. 1204.49 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19457. 1204.49 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19458. 1204.49 s [algebraic-graphs]
  19459. 1204.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  19460. 1204.49 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19461. 1204.49 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19462. 1204.49 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19463. 1204.49 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19464. 1204.49 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19465. 1204.49 s [algebraic-graphs]
  19466. 1204.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  19467. 1204.49 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19468. 1204.49 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19469. 1204.49 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19470. 1204.49 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19471. 1204.49 s [algebraic-graphs]
  19472. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  19473. 1204.49 s [algebraic-graphs] OK: isEmpty empty == True
  19474. 1204.49 s [algebraic-graphs] OK: hasVertex x empty == False
  19475. 1204.49 s [algebraic-graphs] OK: vertexCount empty == 0
  19476. 1204.49 s [algebraic-graphs] OK: edgeCount empty == 0
  19477. 1204.49 s [algebraic-graphs]
  19478. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  19479. 1204.49 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19480. 1204.49 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19481. 1204.49 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19482. 1204.49 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19483. 1204.49 s [algebraic-graphs]
  19484. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  19485. 1204.49 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19486. 1204.49 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19487. 1204.49 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19488. 1204.49 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19489. 1204.49 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19490. 1204.49 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19491. 1204.49 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19492. 1204.49 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19493. 1204.49 s [algebraic-graphs]
  19494. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  19495. 1204.49 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19496. 1204.49 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19497. 1204.49 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19498. 1204.49 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19499. 1204.49 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19500. 1204.49 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19501. 1204.49 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19502. 1204.49 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19503. 1204.49 s [algebraic-graphs]
  19504. 1204.49 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19505. 1204.49 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19506. 1204.49 s [algebraic-graphs]
  19507. 1204.49 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19508. 1204.49 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19509. 1204.49 s [algebraic-graphs]
  19510. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  19511. 1204.49 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19512. 1204.49 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19513. 1204.49 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19514. 1204.49 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19515. 1204.49 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19516. 1204.49 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19517. 1204.49 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19518. 1204.49 s [algebraic-graphs]
  19519. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  19520. 1204.49 s [algebraic-graphs] OK: vertices [] == empty
  19521. 1204.49 s [algebraic-graphs] OK: vertices [x] == vertex x
  19522. 1204.49 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19523. 1204.49 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19524. 1204.49 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19525. 1204.49 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19526. 1204.49 s [algebraic-graphs]
  19527. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  19528. 1204.49 s [algebraic-graphs] OK: edges [] == empty
  19529. 1204.49 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19530. 1204.49 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19531. 1204.49 s [algebraic-graphs]
  19532. 1204.49 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  19533. 1204.49 s [algebraic-graphs] OK: overlays [] == empty
  19534. 1204.49 s [algebraic-graphs] OK: overlays [x] == x
  19535. 1204.49 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19536. 1204.49 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19537. 1204.49 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19538. 1204.49 s [algebraic-graphs]
  19539. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  19540. 1204.50 s [algebraic-graphs] OK: foldg empty vertex connect == id
  19541. 1204.50 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  19542. 1204.50 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  19543. 1204.50 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  19544. 1204.50 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  19545. 1204.50 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  19546. 1204.50 s [algebraic-graphs]
  19547. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  19548. 1204.50 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  19549. 1204.50 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  19550. 1204.50 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  19551. 1204.50 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  19552. 1204.50 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  19553. 1204.50 s [algebraic-graphs]
  19554. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  19555. 1204.50 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19556. 1204.50 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19557. 1204.50 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19558. 1204.50 s [algebraic-graphs]
  19559. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  19560. 1204.50 s [algebraic-graphs] OK: isEmpty empty == True
  19561. 1204.50 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19562. 1204.50 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19563. 1204.50 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19564. 1204.50 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19565. 1204.50 s [algebraic-graphs]
  19566. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.size ============
  19567. 1204.50 s [algebraic-graphs] OK: size empty == 1
  19568. 1204.50 s [algebraic-graphs] OK: size (vertex x) == 1
  19569. 1204.50 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19570. 1204.50 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19571. 1204.50 s [algebraic-graphs] OK: size x >= 1
  19572. 1204.50 s [algebraic-graphs] OK: size x >= vertexCount x
  19573. 1204.50 s [algebraic-graphs]
  19574. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  19575. 1204.50 s [algebraic-graphs] OK: hasVertex x empty == False
  19576. 1204.50 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19577. 1204.50 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19578. 1204.50 s [algebraic-graphs]
  19579. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  19580. 1204.50 s [algebraic-graphs] OK: hasEdge x y empty == False
  19581. 1204.50 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19582. 1204.50 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19583. 1204.50 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19584. 1204.50 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19585. 1204.50 s [algebraic-graphs]
  19586. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  19587. 1204.50 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19588. 1204.50 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19589. 1204.50 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19590. 1204.50 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19591. 1204.50 s [algebraic-graphs]
  19592. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  19593. 1204.50 s [algebraic-graphs] OK: vertexCount empty == 0
  19594. 1204.50 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19595. 1204.50 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19596. 1204.50 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19597. 1204.50 s [algebraic-graphs]
  19598. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  19599. 1204.50 s [algebraic-graphs] OK: edgeCount empty == 0
  19600. 1204.50 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19601. 1204.50 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19602. 1204.50 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19603. 1204.50 s [algebraic-graphs]
  19604. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  19605. 1204.50 s [algebraic-graphs] OK: vertexList empty == []
  19606. 1204.50 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19607. 1204.50 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19608. 1204.50 s [algebraic-graphs]
  19609. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  19610. 1204.50 s [algebraic-graphs] OK: edgeList empty == []
  19611. 1204.50 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19612. 1204.50 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19613. 1204.50 s [algebraic-graphs]
  19614. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  19615. 1204.50 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19616. 1204.50 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19617. 1204.50 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19618. 1204.50 s [algebraic-graphs]
  19619. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  19620. 1204.50 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19621. 1204.50 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19622. 1204.50 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19623. 1204.50 s [algebraic-graphs]
  19624. 1204.50 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  19625. 1204.50 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19626. 1204.50 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19627. 1207.02 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19628. 1207.16 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19629. 1207.16 s [algebraic-graphs]
  19630. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  19631. 1207.16 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19632. 1207.16 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19633. 1207.16 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19634. 1207.16 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19635. 1207.16 s [algebraic-graphs]
  19636. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  19637. 1207.16 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19638. 1207.16 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19639. 1207.16 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19640. 1207.16 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19641. 1207.16 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19642. 1207.16 s [algebraic-graphs]
  19643. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  19644. 1207.16 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19645. 1207.16 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19646. 1207.16 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19647. 1207.16 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19648. 1207.16 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19649. 1207.16 s [algebraic-graphs]
  19650. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  19651. 1207.16 s [algebraic-graphs] OK: replaceVertex x x == id
  19652. 1207.16 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19653. 1207.16 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  19654. 1207.16 s [algebraic-graphs]
  19655. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  19656. 1207.16 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19657. 1207.16 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19658. 1207.16 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19659. 1207.16 s [algebraic-graphs]
  19660. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  19661. 1207.16 s [algebraic-graphs] OK: transpose empty == empty
  19662. 1207.16 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19663. 1207.16 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19664. 1207.16 s [algebraic-graphs] OK: transpose . transpose == id
  19665. 1207.16 s [algebraic-graphs]
  19666. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  19667. 1207.16 s [algebraic-graphs] OK: fmap f empty == empty
  19668. 1207.16 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19669. 1207.16 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  19670. 1207.16 s [algebraic-graphs] OK: fmap id == id
  19671. 1207.16 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19672. 1207.16 s [algebraic-graphs]
  19673. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  19674. 1207.16 s [algebraic-graphs] OK: emap h empty == empty
  19675. 1207.16 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19676. 1207.16 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19677. 1207.16 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19678. 1207.16 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19679. 1207.16 s [algebraic-graphs] OK: emap id == id
  19680. 1207.16 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19681. 1207.16 s [algebraic-graphs]
  19682. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  19683. 1207.16 s [algebraic-graphs] OK: induce (const True ) x == x
  19684. 1207.16 s [algebraic-graphs] OK: induce (const False) x == empty
  19685. 1207.16 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19686. 1207.16 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19687. 1207.16 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19688. 1207.16 s [algebraic-graphs]
  19689. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  19690. 1207.16 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19691. 1207.16 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19692. 1207.16 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19693. 1207.16 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19694. 1207.16 s [algebraic-graphs]
  19695. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  19696. 1207.16 s [algebraic-graphs] OK: closure empty == empty
  19697. 1207.16 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19698. 1207.16 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19699. 1207.16 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19700. 1207.16 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19701. 1207.16 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19702. 1207.16 s [algebraic-graphs] OK: closure . closure == closure
  19703. 1207.16 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19704. 1207.16 s [algebraic-graphs]
  19705. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  19706. 1207.16 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19707. 1207.16 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19708. 1207.16 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19709. 1207.16 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19710. 1207.16 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19711. 1207.16 s [algebraic-graphs]
  19712. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  19713. 1207.16 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19714. 1207.16 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19715. 1207.16 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19716. 1207.16 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19717. 1207.16 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19718. 1207.16 s [algebraic-graphs]
  19719. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  19720. 1207.16 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19721. 1207.16 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19722. 1207.16 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19723. 1207.16 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19724. 1207.16 s [algebraic-graphs]
  19725. 1207.16 s [algebraic-graphs] ============ Labelled.Graph.context ============
  19726. 1207.16 s [algebraic-graphs] OK: context (const False) x == Nothing
  19727. 1207.16 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  19728. 1207.16 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  19729. 1207.16 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  19730. 1207.16 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  19731. 1207.16 s [algebraic-graphs]
  19732. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  19733. 1207.16 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19734. 1207.16 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19735. 1207.16 s [algebraic-graphs]
  19736. 1207.16 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  19737. 1207.16 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19738. 1207.16 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19739. 1207.16 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19740. 1207.16 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19741. 1207.16 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19742. 1207.16 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19743. 1207.16 s [algebraic-graphs] OK: x <= x + y
  19744. 1207.16 s [algebraic-graphs] OK: x + y <= x * y
  19745. 1207.16 s [algebraic-graphs]
  19746. 1207.16 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  19747. 1207.16 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  19748. 1207.16 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  19749. 1207.16 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  19750. 1207.16 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  19751. 1207.16 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  19752. 1207.16 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  19753. 1207.16 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  19754. 1207.16 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  19755. 1207.16 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  19756. 1207.16 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  19757. 1207.16 s [algebraic-graphs]
  19758. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  19759. 1207.16 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19760. 1207.16 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  19761. 1207.16 s [algebraic-graphs]
  19762. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  19763. 1207.16 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  19764. 1207.16 s [algebraic-graphs]
  19765. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  19766. 1207.16 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19767. 1207.16 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19768. 1207.16 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19769. 1207.16 s [algebraic-graphs]
  19770. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  19771. 1207.16 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19772. 1207.16 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19773. 1207.16 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19774. 1207.16 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19775. 1207.16 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19776. 1207.16 s [algebraic-graphs]
  19777. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  19778. 1207.16 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19779. 1207.16 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19780. 1207.16 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19781. 1207.16 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19782. 1207.16 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19783. 1207.16 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19784. 1207.16 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19785. 1207.16 s [algebraic-graphs]
  19786. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  19787. 1207.16 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19788. 1207.16 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19789. 1207.16 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19790. 1207.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19791. 1207.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19792. 1207.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19793. 1207.16 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19794. 1207.16 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19795. 1207.16 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19796. 1207.16 s [algebraic-graphs]
  19797. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  19798. 1207.16 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19799. 1207.16 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19800. 1207.16 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19801. 1207.16 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19802. 1207.16 s [algebraic-graphs]
  19803. 1207.16 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  19804. 1207.16 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19805. 1207.16 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19806. 1207.16 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19807. 1207.16 s [algebraic-graphs]
  19808. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  19809. 1209.77 s [algebraic-graphs] OK: overlays1 [x] == x
  19810. 1209.77 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19811. 1209.77 s [algebraic-graphs]
  19812. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  19813. 1209.77 s [algebraic-graphs] OK: connects1 [x] == x
  19814. 1209.77 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19815. 1209.77 s [algebraic-graphs]
  19816. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  19817. 1209.77 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19818. 1209.77 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19819. 1209.77 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19820. 1209.77 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19821. 1209.77 s [algebraic-graphs]
  19822. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  19823. 1209.77 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19824. 1209.77 s [algebraic-graphs]
  19825. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  19826. 1209.77 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19827. 1209.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19828. 1209.77 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19829. 1209.77 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19830. 1209.77 s [algebraic-graphs]
  19831. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  19832. 1209.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19833. 1209.77 s [algebraic-graphs] OK: vertexCount x >= 1
  19834. 1209.77 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19835. 1209.77 s [algebraic-graphs]
  19836. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  19837. 1209.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19838. 1209.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19839. 1209.77 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19840. 1209.77 s [algebraic-graphs]
  19841. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  19842. 1209.77 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19843. 1209.77 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19844. 1209.77 s [algebraic-graphs]
  19845. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  19846. 1209.77 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19847. 1209.77 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19848. 1209.77 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19849. 1209.77 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19850. 1209.77 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19851. 1209.77 s [algebraic-graphs]
  19852. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  19853. 1209.77 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19854. 1209.77 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19855. 1209.77 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19856. 1209.77 s [algebraic-graphs]
  19857. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  19858. 1209.77 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19859. 1209.77 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19860. 1209.77 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19861. 1209.77 s [algebraic-graphs]
  19862. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  19863. 1209.77 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19864. 1209.77 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19865. 1209.77 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19866. 1209.77 s [algebraic-graphs]
  19867. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  19868. 1209.77 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19869. 1209.77 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19870. 1209.77 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19871. 1209.77 s [algebraic-graphs]
  19872. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  19873. 1209.77 s [algebraic-graphs] OK: path1 [x] == vertex x
  19874. 1209.77 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19875. 1209.77 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19876. 1209.77 s [algebraic-graphs]
  19877. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  19878. 1209.77 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19879. 1209.77 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19880. 1209.77 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19881. 1209.77 s [algebraic-graphs]
  19882. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  19883. 1209.77 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19884. 1209.77 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19885. 1209.77 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19886. 1209.77 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19887. 1209.77 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19888. 1209.77 s [algebraic-graphs]
  19889. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  19890. 1209.77 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19891. 1209.77 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19892. 1209.77 s [algebraic-graphs]
  19893. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  19894. 1209.77 s [algebraic-graphs] OK: star x [] == vertex x
  19895. 1209.77 s [algebraic-graphs] OK: star x [y] == edge x y
  19896. 1209.77 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19897. 1209.77 s [algebraic-graphs]
  19898. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  19899. 1209.77 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  19900. 1209.77 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  19901. 1209.77 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  19902. 1209.77 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  19903. 1209.77 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  19904. 1209.77 s [algebraic-graphs]
  19905. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  19906. 1209.77 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19907. 1209.77 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  19908. 1209.77 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19909. 1209.77 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  19910. 1209.77 s [algebraic-graphs]
  19911. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  19912. 1209.77 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  19913. 1209.77 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  19914. 1209.77 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  19915. 1209.77 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  19916. 1209.77 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  19917. 1209.77 s [algebraic-graphs]
  19918. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  19919. 1209.77 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  19920. 1209.77 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19921. 1209.77 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19922. 1209.77 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19923. 1209.77 s [algebraic-graphs]
  19924. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  19925. 1209.77 s [algebraic-graphs] OK: replaceVertex x x == id
  19926. 1209.77 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19927. 1209.77 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19928. 1209.77 s [algebraic-graphs]
  19929. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  19930. 1209.77 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19931. 1209.77 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19932. 1209.77 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19933. 1209.77 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19934. 1209.77 s [algebraic-graphs]
  19935. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  19936. 1209.77 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19937. 1209.77 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19938. 1209.77 s [algebraic-graphs] OK: transpose . transpose == id
  19939. 1209.77 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19940. 1209.77 s [algebraic-graphs]
  19941. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  19942. 1209.77 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19943. 1209.77 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19944. 1209.77 s [algebraic-graphs] OK: gmap id == id
  19945. 1209.77 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19946. 1209.77 s [algebraic-graphs]
  19947. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  19948. 1209.77 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  19949. 1209.77 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  19950. 1209.77 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  19951. 1209.77 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  19952. 1209.77 s [algebraic-graphs]
  19953. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  19954. 1209.77 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  19955. 1209.77 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  19956. 1209.77 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  19957. 1209.77 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  19958. 1209.77 s [algebraic-graphs]
  19959. 1209.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  19960. 1209.77 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  19961. 1209.77 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  19962. 1209.77 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19963. 1209.77 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  19964. 1209.77 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19965. 1209.78 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19966. 1209.78 s [algebraic-graphs] OK: closure . closure == closure
  19967. 1209.78 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19968. 1209.78 s [algebraic-graphs]
  19969. 1209.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  19970. 1209.78 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  19971. 1209.78 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  19972. 1209.78 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19973. 1209.78 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19974. 1209.78 s [algebraic-graphs]
  19975. 1209.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  19976. 1209.78 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19977. 1209.78 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  19978. 1209.78 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19979. 1209.78 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19980. 1209.78 s [algebraic-graphs]
  19981. 1209.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  19982. 1209.78 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19983. 1209.78 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  19984. 1209.78 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  19985. 1209.78 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19986. 1209.78 s [algebraic-graphs]
  19987. 1209.78 s [algebraic-graphs] ============ NonEmpty.Graph.============
  19988. 1209.78 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19989. 1209.78 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19990. 1209.78 s [algebraic-graphs]
  19991. 1209.78 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  19992. 1209.78 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19993. 1209.78 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19994. 1209.78 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19995. 1209.78 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19996. 1209.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19997. 1209.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19998. 1209.78 s [algebraic-graphs] OK: x <= x + y
  19999. 1209.78 s [algebraic-graphs] OK: x + y <= x * y
  20000. 1209.78 s [algebraic-graphs]
  20001. 1209.78 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  20002. 1209.78 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20003. 1209.78 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  20004. 1209.78 s [algebraic-graphs] OK: fmap id == id
  20005. 1209.78 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20006. 1209.78 s [algebraic-graphs]
  20007. 1209.78 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  20008. 1209.78 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  20009. 1211.29 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  20010. 1211.29 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  20011. 1211.29 s [algebraic-graphs] OK: (x >>= vertex) == x
  20012. 1211.29 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  20013. 1211.29 s [algebraic-graphs]
  20014. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  20015. 1211.29 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20016. 1211.29 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  20017. 1211.29 s [algebraic-graphs]
  20018. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  20019. 1211.29 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20020. 1211.29 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20021. 1211.29 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20022. 1211.29 s [algebraic-graphs] OK: size (vertex x) == 1
  20023. 1211.29 s [algebraic-graphs]
  20024. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  20025. 1211.29 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20026. 1211.29 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20027. 1211.29 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20028. 1211.29 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20029. 1211.29 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20030. 1211.29 s [algebraic-graphs]
  20031. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  20032. 1211.29 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20033. 1211.29 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20034. 1211.29 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20035. 1211.29 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20036. 1211.29 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20037. 1211.29 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20038. 1211.29 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20039. 1211.29 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20040. 1211.29 s [algebraic-graphs]
  20041. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  20042. 1211.29 s [algebraic-graphs] OK: overlay1 empty x == x
  20043. 1211.29 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  20044. 1211.29 s [algebraic-graphs]
  20045. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  20046. 1211.29 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20047. 1211.29 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20048. 1211.29 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20049. 1211.29 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20050. 1211.29 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20051. 1211.29 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20052. 1211.29 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20053. 1211.29 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20054. 1211.29 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20055. 1211.29 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20056. 1211.29 s [algebraic-graphs]
  20057. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  20058. 1211.29 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20059. 1211.29 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20060. 1211.29 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20061. 1211.29 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20062. 1211.29 s [algebraic-graphs]
  20063. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  20064. 1211.29 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20065. 1211.29 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20066. 1211.29 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20067. 1211.29 s [algebraic-graphs]
  20068. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  20069. 1211.29 s [algebraic-graphs] OK: overlays1 [x] == x
  20070. 1211.29 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20071. 1211.29 s [algebraic-graphs]
  20072. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  20073. 1211.29 s [algebraic-graphs] OK: connects1 [x] == x
  20074. 1211.29 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20075. 1211.29 s [algebraic-graphs]
  20076. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  20077. 1211.29 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  20078. 1211.29 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  20079. 1211.29 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  20080. 1211.29 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  20081. 1211.29 s [algebraic-graphs]
  20082. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  20083. 1211.29 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20084. 1211.29 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20085. 1211.29 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20086. 1211.29 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20087. 1211.29 s [algebraic-graphs]
  20088. 1211.29 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  20089. 1211.29 s [algebraic-graphs] OK: x === x == True
  20090. 1211.30 s [algebraic-graphs] OK: x + y === x + y == True
  20091. 1211.30 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  20092. 1211.30 s [algebraic-graphs] OK: x + y === x * y == False
  20093. 1211.30 s [algebraic-graphs]
  20094. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  20095. 1211.30 s [algebraic-graphs] OK: size (vertex x) == 1
  20096. 1211.30 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20097. 1211.30 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20098. 1211.30 s [algebraic-graphs] OK: size x >= 1
  20099. 1211.30 s [algebraic-graphs] OK: size x >= vertexCount x
  20100. 1211.30 s [algebraic-graphs]
  20101. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  20102. 1211.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20103. 1211.30 s [algebraic-graphs]
  20104. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  20105. 1211.30 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20106. 1211.30 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20107. 1211.30 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20108. 1211.30 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20109. 1211.30 s [algebraic-graphs]
  20110. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  20111. 1211.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20112. 1211.30 s [algebraic-graphs] OK: vertexCount x >= 1
  20113. 1211.30 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20114. 1211.30 s [algebraic-graphs]
  20115. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  20116. 1211.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20117. 1211.30 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20118. 1211.30 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20119. 1211.30 s [algebraic-graphs]
  20120. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  20121. 1211.30 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20122. 1211.30 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20123. 1211.30 s [algebraic-graphs]
  20124. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  20125. 1211.30 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20126. 1211.30 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20127. 1211.30 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20128. 1211.30 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20129. 1211.30 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20130. 1211.30 s [algebraic-graphs]
  20131. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  20132. 1211.30 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20133. 1211.30 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20134. 1211.30 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20135. 1211.30 s [algebraic-graphs]
  20136. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  20137. 1211.30 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20138. 1211.30 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20139. 1211.30 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20140. 1211.30 s [algebraic-graphs]
  20141. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  20142. 1211.30 s [algebraic-graphs] OK: path1 [x] == vertex x
  20143. 1211.30 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20144. 1211.30 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20145. 1211.30 s [algebraic-graphs]
  20146. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  20147. 1211.30 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20148. 1211.30 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20149. 1211.30 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20150. 1211.30 s [algebraic-graphs]
  20151. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  20152. 1211.30 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20153. 1211.30 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20154. 1211.30 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20155. 1211.30 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20156. 1211.30 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20157. 1211.30 s [algebraic-graphs]
  20158. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  20159. 1211.30 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20160. 1211.30 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20161. 1211.30 s [algebraic-graphs]
  20162. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  20163. 1211.30 s [algebraic-graphs] OK: star x [] == vertex x
  20164. 1211.30 s [algebraic-graphs] OK: star x [y] == edge x y
  20165. 1211.30 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20166. 1211.30 s [algebraic-graphs]
  20167. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  20168. 1211.30 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20169. 1211.30 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20170. 1211.30 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20171. 1211.30 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20172. 1211.30 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20173. 1211.30 s [algebraic-graphs]
  20174. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  20175. 1211.30 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20176. 1211.30 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20177. 1211.30 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20178. 1211.30 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20179. 1211.30 s [algebraic-graphs]
  20180. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  20181. 1211.30 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  20182. 1211.30 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  20183. 1211.30 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  20184. 1211.30 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  20185. 1211.30 s [algebraic-graphs]
  20186. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  20187. 1211.30 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  20188. 1211.30 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  20189. 1211.30 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  20190. 1211.30 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  20191. 1211.30 s [algebraic-graphs]
  20192. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  20193. 1211.30 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20194. 1211.30 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20195. 1211.30 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20196. 1211.30 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20197. 1211.30 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20198. 1211.30 s [algebraic-graphs]
  20199. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  20200. 1211.30 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20201. 1211.30 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20202. 1211.30 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20203. 1211.30 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20204. 1211.30 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  20205. 1211.30 s [algebraic-graphs]
  20206. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  20207. 1211.30 s [algebraic-graphs] OK: replaceVertex x x == id
  20208. 1211.30 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20209. 1211.30 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20210. 1211.30 s [algebraic-graphs]
  20211. 1211.30 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  20212. 1211.30 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20213. 1217.14 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20214. 1217.14 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20215. 1217.18 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20216. 1217.18 s [algebraic-graphs]
  20217. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  20218. 1217.18 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  20219. 1217.18 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  20220. 1217.18 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  20221. 1217.18 s [algebraic-graphs]
  20222. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  20223. 1217.18 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20224. 1217.18 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20225. 1217.18 s [algebraic-graphs] OK: transpose . transpose == id
  20226. 1217.18 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20227. 1217.18 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20228. 1217.18 s [algebraic-graphs]
  20229. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  20230. 1217.18 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20231. 1217.18 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20232. 1217.18 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20233. 1217.18 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20234. 1217.18 s [algebraic-graphs]
  20235. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  20236. 1217.18 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20237. 1217.18 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20238. 1217.18 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  20239. 1217.18 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  20240. 1217.18 s [algebraic-graphs]
  20241. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  20242. 1217.18 s [algebraic-graphs] OK: simplify == id
  20243. 1217.18 s [algebraic-graphs] OK: size (simplify x) <= size x
  20244. 1217.18 s [algebraic-graphs] OK: simplify 1 === 1
  20245. 1217.18 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  20246. 1217.18 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  20247. 1217.18 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  20248. 1217.18 s [algebraic-graphs]
  20249. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  20250. 1217.18 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  20251. 1217.18 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  20252. 1217.18 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  20253. 1217.18 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  20254. 1217.18 s [algebraic-graphs]
  20255. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  20256. 1217.18 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  20257. 1217.18 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  20258. 1217.18 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  20259. 1217.18 s [algebraic-graphs]
  20260. 1217.18 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  20261. 1217.18 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  20262. 1217.18 s [algebraic-graphs] OK: box x y ~~ box y x
  20263. 1217.18 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20264. 1217.18 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20265. 1217.18 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20266. 1217.18 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20267. 1217.18 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20268. 1217.18 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20269. 1217.18 s [algebraic-graphs]
  20270. 1217.18 s [algebraic-graphs] ============ Relation ============
  20271. 1217.18 s [algebraic-graphs] OK: Axioms of graphs
  20272. 1217.18 s [algebraic-graphs]
  20273. 1217.18 s [algebraic-graphs] ============ Relation.consistent ============
  20274. 1217.18 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20275. 1217.18 s [algebraic-graphs]
  20276. 1217.18 s [algebraic-graphs] OK: consistent empty == True
  20277. 1217.18 s [algebraic-graphs] OK: consistent (vertex x) == True
  20278. 1217.18 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20279. 1217.18 s [algebraic-graphs] OK: consistent (connect x y) == True
  20280. 1217.18 s [algebraic-graphs] OK: consistent (edge x y) == True
  20281. 1217.18 s [algebraic-graphs] OK: consistent (edges xs) == True
  20282. 1217.18 s [algebraic-graphs] OK: consistent (stars xs) == True
  20283. 1217.18 s [algebraic-graphs]
  20284. 1217.18 s [algebraic-graphs] ============ Relation.Show ============
  20285. 1217.18 s [algebraic-graphs] OK: show (empty ) == "empty"
  20286. 1217.18 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20287. 1217.18 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20288. 1217.18 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20289. 1217.18 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20290. 1217.18 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20291. 1217.18 s [algebraic-graphs]
  20292. 1217.18 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20293. 1217.18 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20294. 1217.18 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20295. 1217.18 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20296. 1217.18 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20297. 1217.18 s [algebraic-graphs]
  20298. 1217.18 s [algebraic-graphs] ============ Relation.Ord ============
  20299. 1217.18 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20300. 1217.18 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20301. 1217.18 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20302. 1217.18 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20303. 1217.18 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20304. 1217.18 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20305. 1217.18 s [algebraic-graphs] OK: x <= x + y
  20306. 1217.18 s [algebraic-graphs] OK: x + y <= x * y
  20307. 1217.18 s [algebraic-graphs]
  20308. 1217.18 s [algebraic-graphs] ============ Relation.empty ============
  20309. 1217.18 s [algebraic-graphs] OK: isEmpty empty == True
  20310. 1217.18 s [algebraic-graphs] OK: hasVertex x empty == False
  20311. 1217.18 s [algebraic-graphs] OK: vertexCount empty == 0
  20312. 1217.18 s [algebraic-graphs] OK: edgeCount empty == 0
  20313. 1217.18 s [algebraic-graphs]
  20314. 1217.18 s [algebraic-graphs] ============ Relation.vertex ============
  20315. 1217.18 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20316. 1217.18 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20317. 1217.18 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20318. 1217.18 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20319. 1217.18 s [algebraic-graphs]
  20320. 1217.18 s [algebraic-graphs] ============ Relation.edge ============
  20321. 1217.18 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20322. 1217.18 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20323. 1217.18 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20324. 1217.18 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20325. 1217.18 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20326. 1217.18 s [algebraic-graphs]
  20327. 1217.18 s [algebraic-graphs] ============ Relation.overlay ============
  20328. 1217.18 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20329. 1217.18 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20330. 1217.18 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20331. 1217.18 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20332. 1217.18 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20333. 1217.18 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20334. 1217.18 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20335. 1217.18 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20336. 1217.18 s [algebraic-graphs]
  20337. 1217.18 s [algebraic-graphs] ============ Relation.connect ============
  20338. 1217.18 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20339. 1217.18 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20340. 1217.18 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20341. 1217.18 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20342. 1217.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20343. 1217.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20344. 1217.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20345. 1217.18 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20346. 1217.18 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20347. 1217.18 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20348. 1217.18 s [algebraic-graphs]
  20349. 1217.18 s [algebraic-graphs] ============ Relation.vertices ============
  20350. 1217.18 s [algebraic-graphs] OK: vertices [] == empty
  20351. 1217.18 s [algebraic-graphs] OK: vertices [x] == vertex x
  20352. 1217.18 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20353. 1217.18 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20354. 1217.18 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20355. 1217.18 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20356. 1217.18 s [algebraic-graphs]
  20357. 1217.18 s [algebraic-graphs] ============ Relation.edges ============
  20358. 1217.18 s [algebraic-graphs] OK: edges [] == empty
  20359. 1217.18 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20360. 1217.18 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20361. 1217.18 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20362. 1217.18 s [algebraic-graphs]
  20363. 1217.18 s [algebraic-graphs] ============ Relation.overlays ============
  20364. 1217.18 s [algebraic-graphs] OK: overlays [] == empty
  20365. 1217.18 s [algebraic-graphs] OK: overlays [x] == x
  20366. 1217.18 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20367. 1217.18 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20368. 1217.18 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20369. 1217.18 s [algebraic-graphs]
  20370. 1217.18 s [algebraic-graphs] ============ Relation.connects ============
  20371. 1217.18 s [algebraic-graphs] OK: connects [] == empty
  20372. 1217.18 s [algebraic-graphs] OK: connects [x] == x
  20373. 1217.18 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20374. 1217.18 s [algebraic-graphs] OK: connects == foldr connect empty
  20375. 1217.18 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20376. 1217.18 s [algebraic-graphs]
  20377. 1217.18 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  20378. 1217.18 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20379. 1217.18 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20380. 1217.18 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20381. 1217.18 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20382. 1217.18 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20383. 1217.18 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20384. 1217.18 s [algebraic-graphs]
  20385. 1217.18 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  20386. 1217.18 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20387. 1217.18 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20388. 1217.18 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20389. 1217.18 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20390. 1217.18 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20391. 1217.18 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20392. 1217.18 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20393. 1217.18 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20394. 1217.18 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20395. 1217.18 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20396. 1217.18 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20397. 1217.18 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20398. 1217.18 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20399. 1217.18 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20400. 1217.18 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20401. 1217.18 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20402. 1217.18 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20403. 1220.06 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20404. 1220.06 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20405. 1220.06 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20406. 1220.06 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20407. 1220.06 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20408. 1220.06 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20409. 1220.06 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20410. 1220.06 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20411. 1220.06 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20412. 1220.06 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20413. 1220.06 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20414. 1220.06 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20415. 1220.06 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20416. 1220.06 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20417. 1220.06 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20418. 1220.06 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20419. 1220.06 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20420. 1220.06 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20421. 1220.06 s [algebraic-graphs]
  20422. 1220.06 s [algebraic-graphs] ============ Relation.foldg ============
  20423. 1220.06 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20424. 1220.06 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20425. 1220.06 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20426. 1220.06 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20427. 1220.06 s [algebraic-graphs]
  20428. 1220.06 s [algebraic-graphs] ============ Relation.isEmpty ============
  20429. 1220.06 s [algebraic-graphs] OK: isEmpty empty == True
  20430. 1220.06 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20431. 1220.06 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20432. 1220.06 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20433. 1220.06 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20434. 1220.06 s [algebraic-graphs]
  20435. 1220.06 s [algebraic-graphs] ============ Relation.hasVertex ============
  20436. 1220.06 s [algebraic-graphs] OK: hasVertex x empty == False
  20437. 1220.06 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20438. 1220.06 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20439. 1220.06 s [algebraic-graphs]
  20440. 1220.06 s [algebraic-graphs] ============ Relation.hasEdge ============
  20441. 1220.06 s [algebraic-graphs] OK: hasEdge x y empty == False
  20442. 1220.06 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20443. 1220.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20444. 1220.06 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20445. 1220.06 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20446. 1220.06 s [algebraic-graphs]
  20447. 1220.06 s [algebraic-graphs] ============ Relation.vertexCount ============
  20448. 1220.06 s [algebraic-graphs] OK: vertexCount empty == 0
  20449. 1220.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20450. 1220.06 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20451. 1220.06 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20452. 1220.06 s [algebraic-graphs]
  20453. 1220.06 s [algebraic-graphs] ============ Relation.edgeCount ============
  20454. 1220.06 s [algebraic-graphs] OK: edgeCount empty == 0
  20455. 1220.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20456. 1220.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20457. 1220.06 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20458. 1220.06 s [algebraic-graphs]
  20459. 1220.06 s [algebraic-graphs] ============ Relation.vertexList ============
  20460. 1220.06 s [algebraic-graphs] OK: vertexList empty == []
  20461. 1220.06 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20462. 1220.06 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20463. 1220.06 s [algebraic-graphs]
  20464. 1220.06 s [algebraic-graphs] ============ Relation.vertexSet ============
  20465. 1220.06 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20466. 1220.06 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20467. 1220.06 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20468. 1220.06 s [algebraic-graphs]
  20469. 1220.06 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  20470. 1220.06 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20471. 1220.06 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20472. 1220.06 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20473. 1220.06 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20474. 1220.06 s [algebraic-graphs]
  20475. 1220.06 s [algebraic-graphs] ============ Relation.edgeList ============
  20476. 1220.06 s [algebraic-graphs] OK: edgeList empty == []
  20477. 1220.06 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20478. 1220.06 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20479. 1220.06 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20480. 1220.06 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20481. 1220.06 s [algebraic-graphs]
  20482. 1220.06 s [algebraic-graphs] ============ Relation.edgeSet ============
  20483. 1220.06 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20484. 1220.06 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20485. 1220.06 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20486. 1220.06 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20487. 1220.06 s [algebraic-graphs]
  20488. 1220.06 s [algebraic-graphs] ============ Relation.adjacencyList ============
  20489. 1220.06 s [algebraic-graphs] OK: adjacencyList empty == []
  20490. 1220.06 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20491. 1220.06 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20492. 1220.06 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20493. 1220.06 s [algebraic-graphs]
  20494. 1220.06 s [algebraic-graphs] ============ Relation.preSet ============
  20495. 1220.06 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20496. 1220.06 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20497. 1220.06 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20498. 1220.06 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20499. 1220.06 s [algebraic-graphs]
  20500. 1220.06 s [algebraic-graphs] ============ Relation.preIntSet ============
  20501. 1220.06 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20502. 1220.06 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20503. 1220.06 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20504. 1220.06 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20505. 1220.06 s [algebraic-graphs]
  20506. 1220.06 s [algebraic-graphs] ============ Relation.postSet ============
  20507. 1220.06 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20508. 1220.06 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20509. 1220.06 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20510. 1220.06 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20511. 1220.06 s [algebraic-graphs]
  20512. 1220.06 s [algebraic-graphs] ============ Relation.postIntSet ============
  20513. 1220.06 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20514. 1220.06 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20515. 1220.06 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20516. 1220.06 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20517. 1220.06 s [algebraic-graphs]
  20518. 1220.06 s [algebraic-graphs] ============ Relation.path ============
  20519. 1220.06 s [algebraic-graphs] OK: path [] == empty
  20520. 1220.06 s [algebraic-graphs] OK: path [x] == vertex x
  20521. 1220.06 s [algebraic-graphs] OK: path [x,y] == edge x y
  20522. 1220.06 s [algebraic-graphs]
  20523. 1220.06 s [algebraic-graphs] ============ Relation.circuit ============
  20524. 1220.06 s [algebraic-graphs] OK: circuit [] == empty
  20525. 1220.06 s [algebraic-graphs] OK: circuit [x] == edge x x
  20526. 1220.06 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20527. 1220.06 s [algebraic-graphs]
  20528. 1220.06 s [algebraic-graphs] ============ Relation.clique ============
  20529. 1220.06 s [algebraic-graphs] OK: clique [] == empty
  20530. 1220.06 s [algebraic-graphs] OK: clique [x] == vertex x
  20531. 1220.06 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20532. 1220.06 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20533. 1220.06 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20534. 1220.06 s [algebraic-graphs]
  20535. 1220.06 s [algebraic-graphs] ============ Relation.biclique ============
  20536. 1220.06 s [algebraic-graphs] OK: biclique [] [] == empty
  20537. 1220.06 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20538. 1220.06 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20539. 1220.06 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20540. 1220.06 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20541. 1220.06 s [algebraic-graphs]
  20542. 1220.06 s [algebraic-graphs] ============ Relation.star ============
  20543. 1220.06 s [algebraic-graphs] OK: star x [] == vertex x
  20544. 1220.06 s [algebraic-graphs] OK: star x [y] == edge x y
  20545. 1220.06 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20546. 1220.06 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20547. 1220.06 s [algebraic-graphs]
  20548. 1220.06 s [algebraic-graphs] ============ Relation.stars ============
  20549. 1220.06 s [algebraic-graphs] OK: stars [] == empty
  20550. 1220.06 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20551. 1220.06 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20552. 1220.06 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20553. 1220.06 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20554. 1220.06 s [algebraic-graphs] OK: stars . adjacencyList == id
  20555. 1220.06 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20556. 1220.06 s [algebraic-graphs]
  20557. 1220.06 s [algebraic-graphs] ============ Relation.tree ============
  20558. 1220.06 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20559. 1220.06 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20560. 1220.06 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20561. 1220.06 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20562. 1220.06 s [algebraic-graphs]
  20563. 1220.06 s [algebraic-graphs] ============ Relation.forest ============
  20564. 1220.06 s [algebraic-graphs] OK: forest [] == empty
  20565. 1220.06 s [algebraic-graphs] OK: forest [x] == tree x
  20566. 1220.06 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20567. 1220.06 s [algebraic-graphs] OK: forest == overlays . map tree
  20568. 1220.06 s [algebraic-graphs]
  20569. 1220.06 s [algebraic-graphs] ============ Relation.removeVertex ============
  20570. 1220.06 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20571. 1220.06 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20572. 1220.06 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20573. 1220.07 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20574. 1220.07 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20575. 1220.07 s [algebraic-graphs]
  20576. 1220.07 s [algebraic-graphs] ============ Relation.removeEdge ============
  20577. 1220.07 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20578. 1220.07 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20579. 1220.07 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20580. 1220.07 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20581. 1220.07 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20582. 1220.07 s [algebraic-graphs]
  20583. 1220.07 s [algebraic-graphs] ============ Relation.replaceVertex ============
  20584. 1220.07 s [algebraic-graphs] OK: replaceVertex x x == id
  20585. 1220.07 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20586. 1220.07 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20587. 1220.07 s [algebraic-graphs]
  20588. 1220.07 s [algebraic-graphs] ============ Relation.mergeVertices ============
  20589. 1220.07 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20590. 1238.71 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20591. 1238.71 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20592. 1238.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20593. 1238.74 s [algebraic-graphs]
  20594. 1238.74 s [algebraic-graphs] ============ Relation.transpose ============
  20595. 1238.74 s [algebraic-graphs] OK: transpose empty == empty
  20596. 1238.74 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20597. 1238.74 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20598. 1238.74 s [algebraic-graphs] OK: transpose . transpose == id
  20599. 1238.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20600. 1238.74 s [algebraic-graphs]
  20601. 1238.74 s [algebraic-graphs] ============ Relation.gmap ============
  20602. 1238.74 s [algebraic-graphs] OK: gmap f empty == empty
  20603. 1238.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20604. 1238.74 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20605. 1238.74 s [algebraic-graphs] OK: gmap id == id
  20606. 1238.74 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20607. 1238.74 s [algebraic-graphs]
  20608. 1238.74 s [algebraic-graphs] ============ Relation.induce ============
  20609. 1238.74 s [algebraic-graphs] OK: induce (const True ) x == x
  20610. 1238.74 s [algebraic-graphs] OK: induce (const False) x == empty
  20611. 1238.74 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20612. 1238.74 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20613. 1238.74 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20614. 1238.74 s [algebraic-graphs]
  20615. 1238.74 s [algebraic-graphs] ============ Relation.compose ============
  20616. 1238.74 s [algebraic-graphs] OK: compose empty x == empty
  20617. 1238.74 s [algebraic-graphs] OK: compose x empty == empty
  20618. 1238.74 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20619. 1238.74 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20620. 1238.74 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20621. 1238.74 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20622. 1238.74 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20623. 1238.75 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20624. 1238.75 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20625. 1238.75 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20626. 1238.75 s [algebraic-graphs]
  20627. 1238.75 s [algebraic-graphs] ============ Relation.closure ============
  20628. 1238.75 s [algebraic-graphs] OK: closure empty == empty
  20629. 1238.75 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20630. 1238.75 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20631. 1238.75 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20632. 1238.75 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20633. 1238.75 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20634. 1238.75 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20635. 1238.75 s [algebraic-graphs] OK: closure . closure == closure
  20636. 1238.75 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20637. 1238.75 s [algebraic-graphs]
  20638. 1238.75 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  20639. 1238.75 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20640. 1238.75 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20641. 1238.75 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20642. 1238.75 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20643. 1238.75 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20644. 1238.75 s [algebraic-graphs]
  20645. 1238.75 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  20646. 1238.75 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20647. 1238.75 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20648. 1238.75 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20649. 1238.75 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20650. 1238.75 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20651. 1238.75 s [algebraic-graphs]
  20652. 1238.75 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  20653. 1238.75 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20654. 1238.75 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20655. 1238.75 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20656. 1238.75 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20657. 1238.75 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20658. 1238.75 s [algebraic-graphs]
  20659. 1238.75 s [algebraic-graphs] ============ Relation.induceJust ============
  20660. 1238.75 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20661. 1238.75 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20662. 1238.75 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20663. 1238.75 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20664. 1238.75 s [algebraic-graphs]
  20665. 1238.75 s [algebraic-graphs] ============ ReflexiveRelation ============
  20666. 1238.75 s [algebraic-graphs] OK: Axioms of reflexive graphs
  20667. 1238.75 s [algebraic-graphs]
  20668. 1238.75 s [algebraic-graphs] ============ TransitiveRelation ============
  20669. 1238.75 s [algebraic-graphs] OK: Axioms of transitive graphs
  20670. 1238.75 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  20671. 1238.75 s [algebraic-graphs]
  20672. 1238.75 s [algebraic-graphs] ============ PreorderRelation ============
  20673. 1238.75 s [algebraic-graphs] OK: Axioms of preorder graphs
  20674. 1238.75 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  20675. 1238.75 s [algebraic-graphs]
  20676. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation ============
  20677. 1238.75 s [algebraic-graphs] OK: Axioms of undirected graphs
  20678. 1238.75 s [algebraic-graphs]
  20679. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  20680. 1238.75 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20681. 1238.75 s [algebraic-graphs]
  20682. 1238.75 s [algebraic-graphs] OK: consistent empty == True
  20683. 1238.75 s [algebraic-graphs] OK: consistent (vertex x) == True
  20684. 1238.75 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20685. 1238.75 s [algebraic-graphs] OK: consistent (connect x y) == True
  20686. 1238.75 s [algebraic-graphs] OK: consistent (edge x y) == True
  20687. 1238.75 s [algebraic-graphs] OK: consistent (edges xs) == True
  20688. 1238.75 s [algebraic-graphs] OK: consistent (stars xs) == True
  20689. 1238.75 s [algebraic-graphs]
  20690. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  20691. 1238.75 s [algebraic-graphs] OK: show (empty ) == "empty"
  20692. 1238.75 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20693. 1238.75 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20694. 1238.75 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20695. 1238.75 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20696. 1238.75 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20697. 1238.75 s [algebraic-graphs]
  20698. 1238.75 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20699. 1238.75 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20700. 1238.75 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20701. 1238.75 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20702. 1238.75 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20703. 1238.75 s [algebraic-graphs]
  20704. 1238.75 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20705. 1238.75 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20706. 1238.75 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20707. 1238.75 s [algebraic-graphs]
  20708. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  20709. 1238.75 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  20710. 1238.75 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  20711. 1238.75 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  20712. 1238.75 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  20713. 1238.75 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  20714. 1238.75 s [algebraic-graphs]
  20715. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  20716. 1238.75 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  20717. 1238.75 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  20718. 1238.75 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  20719. 1238.75 s [algebraic-graphs]
  20720. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  20721. 1238.75 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20722. 1238.75 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20723. 1238.75 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20724. 1238.75 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20725. 1238.75 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20726. 1238.75 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20727. 1238.75 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20728. 1238.75 s [algebraic-graphs] OK: x <= x + y
  20729. 1238.75 s [algebraic-graphs] OK: x + y <= x * y
  20730. 1238.75 s [algebraic-graphs]
  20731. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  20732. 1238.75 s [algebraic-graphs] OK: isEmpty empty == True
  20733. 1238.75 s [algebraic-graphs] OK: hasVertex x empty == False
  20734. 1238.75 s [algebraic-graphs] OK: vertexCount empty == 0
  20735. 1238.75 s [algebraic-graphs] OK: edgeCount empty == 0
  20736. 1238.75 s [algebraic-graphs]
  20737. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  20738. 1238.75 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20739. 1238.75 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20740. 1238.75 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20741. 1238.75 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20742. 1238.75 s [algebraic-graphs]
  20743. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  20744. 1238.75 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20745. 1238.75 s [algebraic-graphs] OK: edge x y == edge y x
  20746. 1238.75 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20747. 1238.75 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20748. 1238.75 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20749. 1238.75 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20750. 1238.75 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20751. 1238.75 s [algebraic-graphs]
  20752. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  20753. 1238.75 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20754. 1238.75 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20755. 1238.75 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20756. 1238.75 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20757. 1238.75 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20758. 1238.75 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20759. 1238.75 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20760. 1238.75 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20761. 1238.75 s [algebraic-graphs]
  20762. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  20763. 1238.75 s [algebraic-graphs] OK: connect x y == connect y x
  20764. 1238.75 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20765. 1238.75 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20766. 1238.75 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20767. 1238.75 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20768. 1238.75 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20769. 1238.75 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20770. 1238.75 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20771. 1238.75 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20772. 1238.75 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20773. 1238.75 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20774. 1238.75 s [algebraic-graphs]
  20775. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  20776. 1238.75 s [algebraic-graphs] OK: vertices [] == empty
  20777. 1238.75 s [algebraic-graphs] OK: vertices [x] == vertex x
  20778. 1238.75 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20779. 1238.75 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20780. 1238.75 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20781. 1238.75 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20782. 1238.75 s [algebraic-graphs]
  20783. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  20784. 1238.75 s [algebraic-graphs] OK: edges [] == empty
  20785. 1238.75 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20786. 1238.75 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20787. 1238.75 s [algebraic-graphs]
  20788. 1238.75 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  20789. 1238.75 s [algebraic-graphs] OK: overlays [] == empty
  20790. 1248.94 s [algebraic-graphs] OK: overlays [x] == x
  20791. 1248.98 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20792. 1248.98 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20793. 1248.98 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20794. 1248.98 s [algebraic-graphs]
  20795. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  20796. 1248.98 s [algebraic-graphs] OK: connects [] == empty
  20797. 1248.98 s [algebraic-graphs] OK: connects [x] == x
  20798. 1248.98 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20799. 1248.98 s [algebraic-graphs] OK: connects == foldr connect empty
  20800. 1248.98 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20801. 1248.98 s [algebraic-graphs] OK: connects == connects . reverse
  20802. 1248.98 s [algebraic-graphs]
  20803. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  20804. 1248.98 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20805. 1248.98 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20806. 1248.98 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20807. 1248.98 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20808. 1248.98 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20809. 1248.98 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20810. 1248.98 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20811. 1248.98 s [algebraic-graphs]
  20812. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  20813. 1248.98 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20814. 1248.98 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20815. 1248.98 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20816. 1248.98 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20817. 1248.98 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20818. 1248.98 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20819. 1248.98 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20820. 1248.98 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20821. 1248.98 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20822. 1248.98 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20823. 1248.98 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20824. 1248.98 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20825. 1248.98 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20826. 1248.98 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20827. 1248.98 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20828. 1248.98 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20829. 1248.98 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20830. 1248.98 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20831. 1248.98 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20832. 1248.98 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20833. 1248.98 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20834. 1248.98 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20835. 1248.98 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20836. 1248.98 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20837. 1248.98 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20838. 1248.98 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20839. 1248.98 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20840. 1248.98 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20841. 1248.98 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20842. 1248.98 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20843. 1248.98 s [algebraic-graphs]
  20844. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  20845. 1248.98 s [algebraic-graphs] OK: isEmpty empty == True
  20846. 1248.98 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20847. 1248.98 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20848. 1248.98 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20849. 1248.98 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20850. 1248.98 s [algebraic-graphs]
  20851. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  20852. 1248.98 s [algebraic-graphs] OK: hasVertex x empty == False
  20853. 1248.98 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20854. 1248.98 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20855. 1248.98 s [algebraic-graphs]
  20856. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  20857. 1248.98 s [algebraic-graphs] OK: hasEdge x y empty == False
  20858. 1248.98 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20859. 1248.98 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20860. 1248.98 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  20861. 1248.98 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20862. 1248.98 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  20863. 1248.98 s [algebraic-graphs]
  20864. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  20865. 1248.98 s [algebraic-graphs] OK: vertexCount empty == 0
  20866. 1248.98 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20867. 1248.98 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20868. 1248.98 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20869. 1248.98 s [algebraic-graphs]
  20870. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  20871. 1248.98 s [algebraic-graphs] OK: edgeCount empty == 0
  20872. 1248.98 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20873. 1248.98 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20874. 1248.98 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20875. 1248.98 s [algebraic-graphs]
  20876. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  20877. 1248.98 s [algebraic-graphs] OK: vertexList empty == []
  20878. 1248.98 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20879. 1248.98 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20880. 1248.98 s [algebraic-graphs]
  20881. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  20882. 1248.98 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20883. 1248.98 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20884. 1248.98 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20885. 1248.98 s [algebraic-graphs]
  20886. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  20887. 1248.98 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20888. 1248.98 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20889. 1248.98 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20890. 1248.98 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20891. 1248.98 s [algebraic-graphs]
  20892. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  20893. 1248.98 s [algebraic-graphs] OK: edgeList empty == []
  20894. 1248.98 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20895. 1248.98 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  20896. 1248.98 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  20897. 1248.98 s [algebraic-graphs]
  20898. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  20899. 1248.98 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20900. 1248.98 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20901. 1248.98 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  20902. 1248.98 s [algebraic-graphs]
  20903. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  20904. 1248.98 s [algebraic-graphs] OK: adjacencyList empty == []
  20905. 1248.98 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20906. 1248.98 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  20907. 1248.98 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  20908. 1248.98 s [algebraic-graphs]
  20909. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  20910. 1248.98 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  20911. 1248.98 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  20912. 1248.98 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  20913. 1248.98 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  20914. 1248.98 s [algebraic-graphs]
  20915. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  20916. 1248.98 s [algebraic-graphs] OK: path [] == empty
  20917. 1248.98 s [algebraic-graphs] OK: path [x] == vertex x
  20918. 1248.98 s [algebraic-graphs] OK: path [x,y] == edge x y
  20919. 1248.98 s [algebraic-graphs] OK: path == path . reverse
  20920. 1248.98 s [algebraic-graphs]
  20921. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  20922. 1248.98 s [algebraic-graphs] OK: circuit [] == empty
  20923. 1248.98 s [algebraic-graphs] OK: circuit [x] == edge x x
  20924. 1248.98 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20925. 1248.98 s [algebraic-graphs] OK: circuit == circuit . reverse
  20926. 1248.98 s [algebraic-graphs]
  20927. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  20928. 1248.98 s [algebraic-graphs] OK: clique [] == empty
  20929. 1248.98 s [algebraic-graphs] OK: clique [x] == vertex x
  20930. 1248.98 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20931. 1248.98 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20932. 1248.98 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20933. 1248.98 s [algebraic-graphs] OK: clique == clique . reverse
  20934. 1248.98 s [algebraic-graphs]
  20935. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  20936. 1248.98 s [algebraic-graphs] OK: biclique [] [] == empty
  20937. 1248.98 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20938. 1248.98 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20939. 1248.98 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20940. 1248.98 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20941. 1248.98 s [algebraic-graphs]
  20942. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  20943. 1248.98 s [algebraic-graphs] OK: star x [] == vertex x
  20944. 1248.98 s [algebraic-graphs] OK: star x [y] == edge x y
  20945. 1248.98 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20946. 1248.98 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20947. 1248.98 s [algebraic-graphs]
  20948. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  20949. 1248.98 s [algebraic-graphs] OK: stars [] == empty
  20950. 1248.98 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20951. 1248.98 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20952. 1248.98 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20953. 1248.98 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20954. 1248.98 s [algebraic-graphs] OK: stars . adjacencyList == id
  20955. 1248.98 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20956. 1248.98 s [algebraic-graphs]
  20957. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  20958. 1248.98 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20959. 1248.98 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20960. 1248.98 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20961. 1248.98 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20962. 1248.98 s [algebraic-graphs]
  20963. 1248.98 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  20964. 1248.98 s [algebraic-graphs] OK: forest [] == empty
  20965. 1255.76 s [algebraic-graphs] OK: forest [x] == tree x
  20966. 1255.76 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20967. 1255.80 s [algebraic-graphs] OK: forest == overlays . map tree
  20968. 1255.80 s [algebraic-graphs]
  20969. 1255.80 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  20970. 1255.80 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20971. 1255.80 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20972. 1255.80 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20973. 1255.80 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20974. 1255.80 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20975. 1255.80 s [algebraic-graphs]
  20976. 1255.80 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  20977. 1255.80 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20978. 1255.80 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20979. 1255.80 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20980. 1255.80 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20981. 1255.80 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20982. 1255.80 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  20983. 1255.80 s [algebraic-graphs]
  20984. 1255.80 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  20985. 1255.80 s [algebraic-graphs] OK: replaceVertex x x == id
  20986. 1255.80 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20987. 1255.80 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20988. 1255.80 s [algebraic-graphs]
  20989. 1255.80 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  20990. 1255.80 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20991. 1255.80 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20992. 1255.80 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20993. 1255.80 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20994. 1255.80 s [algebraic-graphs]
  20995. 1255.80 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  20996. 1255.80 s [algebraic-graphs] OK: gmap f empty == empty
  20997. 1255.80 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20998. 1255.80 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20999. 1255.80 s [algebraic-graphs] OK: gmap id == id
  21000. 1255.80 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21001. 1255.80 s [algebraic-graphs]
  21002. 1255.80 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  21003. 1255.80 s [algebraic-graphs] OK: induce (const True ) x == x
  21004. 1255.80 s [algebraic-graphs] OK: induce (const False) x == empty
  21005. 1255.80 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21006. 1255.80 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21007. 1255.80 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21008. 1255.80 s [algebraic-graphs]
  21009. 1255.80 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  21010. 1255.80 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21011. 1255.80 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21012. 1255.80 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21013. 1255.80 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21014. 1255.80 s [algebraic-graphs]
  21015. 1255.80 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  21016. 1255.80 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  21017. 1255.80 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  21018. 1255.80 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  21019. 1255.80 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  21020. 1255.80 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  21021. 1255.80 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  21022. 1255.80 s [algebraic-graphs]
  21023. 1255.80 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  21024. 1255.80 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  21025. 1255.80 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  21026. 1255.80 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  21027. 1255.80 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  21028. 1255.80 s [algebraic-graphs]
  21029. 1255.80 s [algebraic-graphs] ============ Typed ============
  21030. 1255.80 s [algebraic-graphs]
  21031. 1255.80 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  21032. 1255.80 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21033. 1255.80 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21034. 1255.80 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  21035. 1255.80 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21036. 1255.80 s [algebraic-graphs]
  21037. 1255.80 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  21038. 1255.80 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21039. 1255.80 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21040. 1255.80 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  21041. 1255.80 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21042. 1255.80 s [algebraic-graphs]
  21043. 1255.80 s [algebraic-graphs] ============ Typed.dfsForest ============
  21044. 1255.80 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  21045. 1255.80 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  21046. 1255.80 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  21047. 1255.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  21048. 1255.80 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  21049. 1255.80 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  21050. 1255.80 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  21051. 1255.80 s [algebraic-graphs]
  21052. 1255.80 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  21053. 1255.80 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  21054. 1255.80 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  21055. 1255.80 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  21056. 1255.80 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  21057. 1255.80 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  21058. 1255.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  21059. 1255.80 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  21060. 1255.80 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  21061. 1255.80 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  21062. 1255.80 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  21063. 1255.80 s [algebraic-graphs]
  21064. 1255.80 s [algebraic-graphs] ============ Typed.dfs ============
  21065. 1255.80 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  21066. 1255.80 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  21067. 1255.80 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  21068. 1255.80 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  21069. 1255.80 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  21070. 1255.80 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  21071. 1255.80 s [algebraic-graphs] OK: dfs % x $ [] == []
  21072. 1255.80 s [algebraic-graphs]
  21073. 1255.80 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  21074. 1255.80 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  21075. 1255.80 s [algebraic-graphs]
  21076. 1255.80 s [algebraic-graphs] ============ Typed.topSort ============
  21077. 1255.80 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  21078. 1255.80 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  21079. 1255.80 s [algebraic-graphs]
  21080. 1255.80 s [algebraic-graphs] ============ Graph.Undirected ============
  21081. 1255.80 s [algebraic-graphs] OK: Axioms of undirected graphs
  21082. 1255.80 s [algebraic-graphs]
  21083. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  21084. 1255.80 s [algebraic-graphs] OK: show (empty ) == "empty"
  21085. 1255.80 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21086. 1255.80 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21087. 1255.80 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21088. 1255.80 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21089. 1255.80 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21090. 1255.80 s [algebraic-graphs]
  21091. 1255.80 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21092. 1255.80 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21093. 1255.80 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21094. 1255.80 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21095. 1255.80 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21096. 1255.80 s [algebraic-graphs]
  21097. 1255.80 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21098. 1255.80 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21099. 1255.80 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21100. 1255.80 s [algebraic-graphs]
  21101. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  21102. 1255.80 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  21103. 1255.80 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21104. 1255.80 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  21105. 1255.80 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  21106. 1255.80 s [algebraic-graphs]
  21107. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  21108. 1255.80 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  21109. 1255.80 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21110. 1255.80 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  21111. 1255.80 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  21112. 1255.80 s [algebraic-graphs]
  21113. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  21114. 1255.80 s [algebraic-graphs] OK: complement empty == empty
  21115. 1255.80 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  21116. 1255.80 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  21117. 1255.80 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  21118. 1255.80 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  21119. 1255.80 s [algebraic-graphs] OK: complement . complement == id
  21120. 1255.80 s [algebraic-graphs]
  21121. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  21122. 1255.80 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21123. 1255.80 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21124. 1255.80 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21125. 1255.80 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21126. 1255.80 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21127. 1255.80 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21128. 1255.80 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21129. 1255.80 s [algebraic-graphs] OK: x <= x + y
  21130. 1255.80 s [algebraic-graphs] OK: x + y <= x * y
  21131. 1255.80 s [algebraic-graphs]
  21132. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  21133. 1255.80 s [algebraic-graphs] OK: isEmpty empty == True
  21134. 1255.80 s [algebraic-graphs] OK: hasVertex x empty == False
  21135. 1255.80 s [algebraic-graphs] OK: vertexCount empty == 0
  21136. 1255.80 s [algebraic-graphs] OK: edgeCount empty == 0
  21137. 1255.80 s [algebraic-graphs]
  21138. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  21139. 1255.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21140. 1255.80 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21141. 1255.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21142. 1255.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21143. 1255.80 s [algebraic-graphs]
  21144. 1255.80 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  21145. 1255.80 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21146. 1255.80 s [algebraic-graphs] OK: edge x y == edge y x
  21147. 1264.48 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21148. 1264.48 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21149. 1264.48 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21150. 1264.53 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21151. 1264.53 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21152. 1264.53 s [algebraic-graphs]
  21153. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  21154. 1264.53 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21155. 1264.53 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21156. 1264.53 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21157. 1264.53 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21158. 1264.53 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21159. 1264.53 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21160. 1264.53 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21161. 1264.53 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21162. 1264.53 s [algebraic-graphs]
  21163. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  21164. 1264.53 s [algebraic-graphs] OK: connect x y == connect y x
  21165. 1264.53 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21166. 1264.53 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21167. 1264.53 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21168. 1264.53 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21169. 1264.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21170. 1264.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21171. 1264.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21172. 1264.53 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21173. 1264.53 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21174. 1264.53 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21175. 1264.53 s [algebraic-graphs]
  21176. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  21177. 1264.53 s [algebraic-graphs] OK: vertices [] == empty
  21178. 1264.53 s [algebraic-graphs] OK: vertices [x] == vertex x
  21179. 1264.53 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21180. 1264.53 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21181. 1264.53 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21182. 1264.53 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21183. 1264.53 s [algebraic-graphs]
  21184. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  21185. 1264.53 s [algebraic-graphs] OK: edges [] == empty
  21186. 1264.53 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21187. 1264.53 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21188. 1264.53 s [algebraic-graphs]
  21189. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  21190. 1264.53 s [algebraic-graphs] OK: overlays [] == empty
  21191. 1264.53 s [algebraic-graphs] OK: overlays [x] == x
  21192. 1264.53 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21193. 1264.53 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21194. 1264.53 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21195. 1264.53 s [algebraic-graphs]
  21196. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  21197. 1264.53 s [algebraic-graphs] OK: connects [] == empty
  21198. 1264.53 s [algebraic-graphs] OK: connects [x] == x
  21199. 1264.53 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21200. 1264.53 s [algebraic-graphs] OK: connects == foldr connect empty
  21201. 1264.53 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21202. 1264.53 s [algebraic-graphs] OK: connects == connects . reverse
  21203. 1264.53 s [algebraic-graphs]
  21204. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  21205. 1264.53 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21206. 1264.53 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21207. 1264.53 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21208. 1264.53 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21209. 1264.53 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21210. 1264.53 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21211. 1264.53 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21212. 1264.53 s [algebraic-graphs]
  21213. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.path ============
  21214. 1264.53 s [algebraic-graphs] OK: path [] == empty
  21215. 1264.53 s [algebraic-graphs] OK: path [x] == vertex x
  21216. 1264.53 s [algebraic-graphs] OK: path [x,y] == edge x y
  21217. 1264.53 s [algebraic-graphs] OK: path == path . reverse
  21218. 1264.53 s [algebraic-graphs]
  21219. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  21220. 1264.53 s [algebraic-graphs] OK: circuit [] == empty
  21221. 1264.53 s [algebraic-graphs] OK: circuit [x] == edge x x
  21222. 1264.53 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21223. 1264.53 s [algebraic-graphs] OK: circuit == circuit . reverse
  21224. 1264.53 s [algebraic-graphs]
  21225. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  21226. 1264.53 s [algebraic-graphs] OK: clique [] == empty
  21227. 1264.53 s [algebraic-graphs] OK: clique [x] == vertex x
  21228. 1264.53 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21229. 1264.53 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21230. 1264.53 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21231. 1264.53 s [algebraic-graphs] OK: clique == clique . reverse
  21232. 1264.53 s [algebraic-graphs]
  21233. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  21234. 1264.53 s [algebraic-graphs] OK: biclique [] [] == empty
  21235. 1264.53 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21236. 1264.53 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21237. 1264.53 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21238. 1264.53 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21239. 1264.53 s [algebraic-graphs]
  21240. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.star ============
  21241. 1264.53 s [algebraic-graphs] OK: star x [] == vertex x
  21242. 1264.53 s [algebraic-graphs] OK: star x [y] == edge x y
  21243. 1264.53 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21244. 1264.53 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21245. 1264.53 s [algebraic-graphs]
  21246. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  21247. 1264.53 s [algebraic-graphs] OK: stars [] == empty
  21248. 1264.53 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21249. 1264.53 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21250. 1264.53 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21251. 1264.53 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21252. 1264.53 s [algebraic-graphs] OK: stars . adjacencyList == id
  21253. 1264.53 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21254. 1264.53 s [algebraic-graphs]
  21255. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  21256. 1264.53 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21257. 1264.53 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21258. 1264.53 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21259. 1264.53 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21260. 1264.53 s [algebraic-graphs]
  21261. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  21262. 1264.53 s [algebraic-graphs] OK: forest [] == empty
  21263. 1264.53 s [algebraic-graphs] OK: forest [x] == tree x
  21264. 1264.53 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21265. 1264.53 s [algebraic-graphs] OK: forest == overlays . map tree
  21266. 1264.53 s [algebraic-graphs]
  21267. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  21268. 1264.53 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21269. 1264.53 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21270. 1264.53 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21271. 1264.53 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21272. 1264.53 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21273. 1264.53 s [algebraic-graphs]
  21274. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  21275. 1264.53 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21276. 1264.53 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21277. 1264.53 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21278. 1264.53 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21279. 1264.53 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21280. 1264.53 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21281. 1264.53 s [algebraic-graphs]
  21282. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  21283. 1264.53 s [algebraic-graphs] OK: replaceVertex x x == id
  21284. 1264.53 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21285. 1264.53 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21286. 1264.53 s [algebraic-graphs]
  21287. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  21288. 1264.53 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21289. 1264.53 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21290. 1264.53 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21291. 1264.53 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21292. 1264.53 s [algebraic-graphs]
  21293. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  21294. 1264.53 s [algebraic-graphs] OK: gmap f empty == empty
  21295. 1264.53 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21296. 1264.53 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21297. 1264.53 s [algebraic-graphs] OK: gmap id == id
  21298. 1264.53 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21299. 1264.53 s [algebraic-graphs]
  21300. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  21301. 1264.53 s [algebraic-graphs] OK: induce (const True ) x == x
  21302. 1264.53 s [algebraic-graphs] OK: induce (const False) x == empty
  21303. 1264.53 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21304. 1264.53 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21305. 1264.53 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21306. 1264.53 s [algebraic-graphs]
  21307. 1264.53 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  21308. 1264.53 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21309. 1264.53 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21310. 1264.54 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21311. 1264.54 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21312. 1264.54 s [algebraic-graphs] Test suite main: PASS
  21313. 1264.54 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  21314. 1264.54 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  21315. 1264.54 s [algebraic-graphs] checkPhase completed in 1 minutes 54 seconds
  21316. 1264.54 s [algebraic-graphs] Phase: haddockPhase
  21317. 1264.63 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  21318. 1264.64 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  21319. 1264.68 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  21320. 1264.81 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  21321. 1265.11 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  21322. 1265.18 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  21323. 1265.23 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  21324. 1265.28 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  21325. 1265.53 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  21326. 1265.58 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  21327. 1265.77 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  21328. 1265.93 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  21329. 1266.20 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  21330. 1266.28 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  21331. 1266.40 s [algebraic-graphs]
  21332. 1266.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  21333. 1266.40 s [algebraic-graphs] In the use of ‘head’
  21334. 1266.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21335. 1266.40 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."
  21336. 1266.40 s [algebraic-graphs] |
  21337. 1266.40 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  21338. 1266.40 s [algebraic-graphs] | ^^^^
  21339. 1266.40 s [algebraic-graphs]
  21340. 1266.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  21341. 1266.40 s [algebraic-graphs] In the use of ‘tail’
  21342. 1266.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21343. 1266.40 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."
  21344. 1266.40 s [algebraic-graphs] |
  21345. 1266.40 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  21346. 1266.40 s [algebraic-graphs] | ^^^^
  21347. 1266.40 s [algebraic-graphs]
  21348. 1266.41 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  21349. 1266.41 s [algebraic-graphs] In the use of ‘head’
  21350. 1266.41 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21351. 1266.41 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."
  21352. 1266.41 s [algebraic-graphs] |
  21353. 1266.41 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  21354. 1266.41 s [algebraic-graphs] | ^^^^
  21355. 1266.41 s [algebraic-graphs]
  21356. 1266.41 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  21357. 1266.41 s [algebraic-graphs] In the use of ‘tail’
  21358. 1266.41 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21359. 1266.41 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."
  21360. 1266.41 s [algebraic-graphs] |
  21361. 1266.41 s [algebraic-graphs] 397 | bnd' = tail bnd
  21362. 1266.41 s [algebraic-graphs] | ^^^^
  21363. 1266.41 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  21364. 1266.46 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  21365. 1266.60 s [algebraic-graphs]
  21366. 1266.60 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21367. 1266.60 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21368. 1266.60 s [algebraic-graphs] will become an error in a future GHC release.
  21369. 1266.60 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21370. 1266.60 s [algebraic-graphs] |
  21371. 1266.60 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  21372. 1266.60 s [algebraic-graphs] | ^
  21373. 1266.60 s [algebraic-graphs]
  21374. 1266.60 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21375. 1266.60 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21376. 1266.60 s [algebraic-graphs] will become an error in a future GHC release.
  21377. 1266.60 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21378. 1266.60 s [algebraic-graphs] |
  21379. 1266.60 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21380. 1266.60 s [algebraic-graphs] | ^
  21381. 1266.60 s [algebraic-graphs]
  21382. 1266.60 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21383. 1266.60 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21384. 1266.60 s [algebraic-graphs] will become an error in a future GHC release.
  21385. 1266.60 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21386. 1266.60 s [algebraic-graphs] |
  21387. 1266.60 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21388. 1266.60 s [algebraic-graphs] | ^
  21389. 1266.60 s [algebraic-graphs]
  21390. 1266.60 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21391. 1266.60 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21392. 1266.60 s [algebraic-graphs] will become an error in a future GHC release.
  21393. 1266.60 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21394. 1266.60 s [algebraic-graphs] |
  21395. 1266.61 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21396. 1266.61 s [algebraic-graphs] | ^
  21397. 1266.61 s [algebraic-graphs]
  21398. 1266.61 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21399. 1266.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21400. 1266.61 s [algebraic-graphs] will become an error in a future GHC release.
  21401. 1266.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21402. 1266.61 s [algebraic-graphs] |
  21403. 1266.61 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21404. 1266.61 s [algebraic-graphs] | ^
  21405. 1266.61 s [algebraic-graphs]
  21406. 1266.61 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21407. 1266.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21408. 1266.61 s [algebraic-graphs] will become an error in a future GHC release.
  21409. 1266.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21410. 1266.61 s [algebraic-graphs] |
  21411. 1266.61 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21412. 1266.61 s [algebraic-graphs] | ^
  21413. 1266.61 s [algebraic-graphs]
  21414. 1266.61 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21415. 1266.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21416. 1266.61 s [algebraic-graphs] will become an error in a future GHC release.
  21417. 1266.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21418. 1266.61 s [algebraic-graphs] |
  21419. 1266.61 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21420. 1266.61 s [algebraic-graphs] | ^
  21421. 1266.62 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  21422. 1266.71 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  21423. 1266.78 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  21424. 1266.95 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  21425. 1267.09 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  21426. 1267.30 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  21427. 1267.31 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  21428. 1267.33 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  21429. 1267.35 s [algebraic-graphs]
  21430. 1267.35 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21431. 1267.35 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21432. 1267.35 s [algebraic-graphs] will become an error in a future GHC release.
  21433. 1267.35 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21434. 1267.35 s [algebraic-graphs] |
  21435. 1267.35 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  21436. 1267.35 s [algebraic-graphs] | ^
  21437. 1267.35 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  21438. 1267.37 s [algebraic-graphs]
  21439. 1267.38 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21440. 1267.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21441. 1267.38 s [algebraic-graphs] will become an error in a future GHC release.
  21442. 1267.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21443. 1267.38 s [algebraic-graphs] |
  21444. 1267.38 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  21445. 1267.38 s [algebraic-graphs] | ^
  21446. 1267.38 s [algebraic-graphs]
  21447. 1267.38 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21448. 1267.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21449. 1267.38 s [algebraic-graphs] will become an error in a future GHC release.
  21450. 1267.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21451. 1267.38 s [algebraic-graphs] |
  21452. 1267.38 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  21453. 1267.38 s [algebraic-graphs] | ^
  21454. 1267.38 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  21455. 1267.47 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  21456. 1267.55 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  21457. 1267.56 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  21458. 1267.58 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  21459. 1267.59 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  21460. 1267.61 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  21461. 1267.75 s [algebraic-graphs] Haddock coverage:
  21462. 1267.75 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21463. 1267.75 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21464. 1267.75 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21465. 1267.75 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21466. 1267.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21467. 1267.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21468. 1267.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21469. 1267.76 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  21470. 1267.76 s [algebraic-graphs] * in ‘GHC.Base’
  21471. 1267.76 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  21472. 1267.76 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21473. 1267.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21474. 1267.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21475. 1267.76 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21476. 1267.76 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  21477. 1267.76 s [algebraic-graphs] * in ‘Data.Foldable’
  21478. 1267.76 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21479. 1267.76 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21480. 1267.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21481. 1267.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21482. 1267.76 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21483. 1267.77 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  21484. 1267.77 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21485. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  21486. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21487. 1267.77 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21488. 1267.77 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21489. 1267.77 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21490. 1267.77 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  21491. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  21492. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  21493. 1267.77 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21494. 1267.77 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21495. 1267.77 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:270:1
  21496. 1267.77 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  21497. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  21498. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  21499. 1267.77 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21500. 1267.77 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21501. 1267.77 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:292:1
  21502. 1267.77 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21503. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21504. 1267.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21505. 1267.77 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21506. 1267.77 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21507. 1267.77 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21508. 1267.77 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21509. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21510. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21511. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21512. 1267.78 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21513. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  21514. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21515. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21516. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21517. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21518. 1267.78 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  21519. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  21520. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  21521. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21522. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21523. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:366:1
  21524. 1267.78 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  21525. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
  21526. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:611:1
  21527. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21528. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21529. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:611:1
  21530. 1267.78 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  21531. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
  21532. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  21533. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21534. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21535. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
  21536. 1267.78 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  21537. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  21538. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  21539. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21540. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21541. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:390:1
  21542. 1267.78 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21543. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  21544. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21545. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21546. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21547. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21548. 1267.78 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21549. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  21550. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21551. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21552. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21553. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21554. 1267.78 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21555. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  21556. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21557. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21558. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21559. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21560. 1267.78 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  21561. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  21562. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  21563. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21564. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21565. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:336:1
  21566. 1267.78 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  21567. 1267.78 s [algebraic-graphs] * in ‘GHC.Base’
  21568. 1267.78 s [algebraic-graphs] * in ‘Data.IntMap.Strict.Internal’
  21569. 1267.78 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21570. 1267.78 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  21571. 1267.78 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21572. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21573. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21574. 1267.78 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21575. 1267.78 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  21576. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  21577. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  21578. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21579. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21580. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:454:1
  21581. 1267.78 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  21582. 1267.78 s [algebraic-graphs] * in ‘Data.Foldable’
  21583. 1267.78 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21584. 1267.78 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21585. 1267.78 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21586. 1267.78 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21587. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21588. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21589. 1267.78 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21590. 1267.78 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  21591. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  21592. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  21593. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21594. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21595. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:529:1
  21596. 1267.78 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  21597. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  21598. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  21599. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21600. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21601. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:543:1
  21602. 1267.78 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  21603. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
  21604. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  21605. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21606. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21607. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
  21608. 1267.78 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  21609. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  21610. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  21611. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21612. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21613. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:679:1
  21614. 1267.78 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  21615. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  21616. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  21617. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21618. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21619. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
  21620. 1267.78 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21621. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  21622. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21623. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21624. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21625. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21626. 1267.78 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  21627. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  21628. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  21629. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21630. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21631. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:592:1
  21632. 1267.78 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  21633. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  21634. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  21635. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21636. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21637. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:323:1
  21638. 1267.78 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  21639. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
  21640. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  21641. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21642. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21643. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:717:1
  21644. 1267.78 s [algebraic-graphs] Warning: 'clique' is ambiguous. It is defined
  21645. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:570:1
  21646. 1267.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:558:1
  21647. 1267.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21648. 1267.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21649. 1267.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:558:1
  21650. 1267.79 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  21651. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
  21652. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:491:1
  21653. 1267.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21654. 1267.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21655. 1267.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:491:1
  21656. 1267.79 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  21657. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  21658. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  21659. 1267.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21660. 1267.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21661. 1267.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:639:1
  21662. 1267.79 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  21663. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  21664. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  21665. 1267.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21666. 1267.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21667. 1267.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:691:1
  21668. 1267.79 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  21669. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  21670. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  21671. 1267.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21672. 1267.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21673. 1267.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:704:1
  21674. 1267.79 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  21675. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:834:1
  21676. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:873:1
  21677. 1267.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21678. 1267.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21679. 1267.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:873:1
  21680. 1267.79 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  21681. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:861:1
  21682. 1267.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  21683. 1267.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21684. 1267.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21685. 1267.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:900:1
  21686. 1267.80 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  21687. 1267.80 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21688. 1267.80 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21689. 1267.80 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21690. 1267.80 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21691. 1267.80 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21692. 1267.80 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21693. 1267.80 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21694. 1267.80 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  21695. 1267.80 s [algebraic-graphs] * in ‘GHC.Base’
  21696. 1267.80 s [algebraic-graphs] * in ‘Data.IntMap.Strict.Internal’
  21697. 1267.80 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21698. 1267.80 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21699. 1267.80 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21700. 1267.80 s [algebraic-graphs] Defaulting to the one defined in ‘Data.IntSet.Internal’
  21701. 1267.80 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  21702. 1267.80 s [algebraic-graphs] * in ‘Data.Foldable’
  21703. 1267.80 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21704. 1267.80 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21705. 1267.80 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21706. 1267.80 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21707. 1267.80 s [algebraic-graphs] Defaulting to the one defined in ‘Data.IntSet.Internal’
  21708. 1267.81 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  21709. 1267.81 s [algebraic-graphs] Missing documentation for:
  21710. 1267.81 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  21711. 1267.81 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  21712. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  21713. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  21714. 1267.81 s [algebraic-graphs] * in ‘GHC.Types’
  21715. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21716. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21717. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  21718. 1267.81 s [algebraic-graphs] Warning: 'toList' is ambiguous. It is defined
  21719. 1267.81 s [algebraic-graphs] * in ‘Data.Foldable’
  21720. 1267.81 s [algebraic-graphs] * in ‘GHC.IsList’
  21721. 1267.81 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21722. 1267.81 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21723. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21724. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21725. 1267.81 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21726. 1267.81 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  21727. 1267.81 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  21728. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  21729. 1267.81 s [algebraic-graphs] * in ‘Data.Graph’
  21730. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21731. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21732. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:183:1
  21733. 1267.81 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21734. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  21735. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  21736. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21737. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21738. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  21739. 1267.81 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21740. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  21741. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21742. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21743. 1267.81 s [algebraic-graphs] * in ‘GHC.Base’
  21744. 1267.81 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21745. 1267.81 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21746. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21747. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21748. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21749. 1267.81 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21750. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  21751. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  21752. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21753. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21754. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21755. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21756. 1267.81 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  21757. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  21758. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  21759. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  21760. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21761. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21762. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:270:1
  21763. 1267.81 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  21764. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  21765. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  21766. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  21767. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21768. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21769. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:292:1
  21770. 1267.81 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21771. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  21772. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  21773. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21774. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21775. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21776. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21777. 1267.81 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21778. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  21779. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  21780. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21781. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21782. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21783. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21784. 1267.81 s [algebraic-graphs] Warning: 'size' is ambiguous. It is defined
  21785. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:602:1
  21786. 1267.81 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21787. 1267.81 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21788. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21789. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21790. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:602:1
  21791. 1267.81 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21792. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  21793. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  21794. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21795. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21796. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21797. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21798. 1267.81 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  21799. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  21800. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  21801. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  21802. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21803. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21804. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:366:1
  21805. 1267.81 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  21806. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  21807. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
  21808. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  21809. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21810. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21811. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
  21812. 1267.81 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  21813. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  21814. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  21815. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  21816. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21817. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21818. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:390:1
  21819. 1267.81 s [algebraic-graphs] Warning: 'Vertex' is ambiguous. It is defined
  21820. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:184:16
  21821. 1267.81 s [algebraic-graphs] * in ‘Data.Graph’
  21822. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21823. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21824. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:184:16
  21825. 1267.81 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21826. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  21827. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  21828. 1267.81 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21829. 1267.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21830. 1267.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21831. 1267.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21832. 1267.82 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  21833. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  21834. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  21835. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  21836. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21837. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21838. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:336:1
  21839. 1267.82 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  21840. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  21841. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  21842. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21843. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21844. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:466:1
  21845. 1267.82 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  21846. 1267.82 s [algebraic-graphs] * in ‘GHC.Base’
  21847. 1267.82 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21848. 1267.82 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21849. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21850. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21851. 1267.82 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21852. 1267.82 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  21853. 1267.82 s [algebraic-graphs] * in ‘Data.Foldable’
  21854. 1267.82 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21855. 1267.82 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21856. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21857. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21858. 1267.82 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21859. 1267.82 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  21860. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:1145:1
  21861. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
  21862. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  21863. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21864. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21865. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:717:1
  21866. 1267.82 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21867. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  21868. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  21869. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21870. 1267.82 s [algebraic-graphs] * in ‘Data.Graph’
  21871. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21872. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21873. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21874. 1267.82 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  21875. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  21876. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  21877. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  21878. 1267.82 s [algebraic-graphs] * in ‘Data.Graph’
  21879. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21880. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21881. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:529:1
  21882. 1267.82 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  21883. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  21884. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  21885. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  21886. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21887. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21888. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:543:1
  21889. 1267.82 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  21890. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  21891. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
  21892. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  21893. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21894. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21895. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
  21896. 1267.82 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  21897. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  21898. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  21899. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  21900. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21901. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21902. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:679:1
  21903. 1267.82 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  21904. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  21905. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  21906. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  21907. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21908. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21909. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:454:1
  21910. 1267.82 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  21911. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  21912. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  21913. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  21914. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21915. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21916. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
  21917. 1267.82 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  21918. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  21919. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  21920. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  21921. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21922. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21923. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:592:1
  21924. 1267.82 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  21925. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  21926. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  21927. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  21928. 1267.82 s [algebraic-graphs] * in ‘Data.Graph’
  21929. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21930. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21931. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:323:1
  21932. 1267.82 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  21933. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:937:1
  21934. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
  21935. 1267.82 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:611:1
  21936. 1267.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21937. 1267.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21938. 1267.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:611:1
  21939. 1267.83 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  21940. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph.hs:805:1
  21941. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
  21942. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:491:1
  21943. 1267.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21944. 1267.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21945. 1267.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:491:1
  21946. 1267.83 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  21947. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  21948. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  21949. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  21950. 1267.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21951. 1267.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21952. 1267.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:639:1
  21953. 1267.83 s [algebraic-graphs] Warning: 'box' is ambiguous. It is defined
  21954. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph.hs:1287:1
  21955. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:835:1
  21956. 1267.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21957. 1267.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21958. 1267.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:835:1
  21959. 1267.83 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  21960. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  21961. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  21962. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  21963. 1267.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21964. 1267.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21965. 1267.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:691:1
  21966. 1267.83 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  21967. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  21968. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  21969. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  21970. 1267.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21971. 1267.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21972. 1267.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:704:1
  21973. 1267.83 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  21974. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph.hs:1163:1
  21975. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
  21976. 1267.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  21977. 1267.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21978. 1267.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21979. 1267.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:763:1
  21980. 1267.84 s [algebraic-graphs] Warning: 'filter' is ambiguous. It is defined
  21981. 1267.84 s [algebraic-graphs] * in ‘GHC.List’
  21982. 1267.84 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21983. 1267.84 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21984. 1267.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21985. 1267.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21986. 1267.84 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  21987. 1267.84 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  21988. 1267.84 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  21989. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  21990. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:120:1
  21991. 1267.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21992. 1267.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21993. 1267.84 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:120:1
  21994. 1267.84 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21995. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  21996. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:129:1
  21997. 1267.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21998. 1267.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21999. 1267.84 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:129:1
  22000. 1267.84 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  22001. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  22002. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:122:5
  22003. 1267.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22004. 1267.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22005. 1267.84 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:122:5
  22006. 1267.84 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22007. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  22008. 1267.84 s [algebraic-graphs] * in ‘GHC.Base’
  22009. 1267.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22010. 1267.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22011. 1267.84 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  22012. 1267.84 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  22013. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  22014. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:133:1
  22015. 1267.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22016. 1267.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22017. 1267.84 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:133:1
  22018. 1267.84 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  22019. 1267.84 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22020. 1267.84 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  22021. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  22022. 1267.84 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:228:1
  22023. 1267.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22024. 1267.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22025. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:228:1
  22026. 1267.85 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22027. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  22028. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:186:1
  22029. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22030. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22031. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:186:1
  22032. 1267.85 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  22033. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  22034. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:265:1
  22035. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22036. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22037. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:265:1
  22038. 1267.85 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  22039. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  22040. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:289:1
  22041. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22042. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22043. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:289:1
  22044. 1267.85 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  22045. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  22046. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:303:1
  22047. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22048. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22049. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:303:1
  22050. 1267.85 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  22051. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  22052. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:214:1
  22053. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22054. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22055. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:214:1
  22056. 1267.85 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  22057. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  22058. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:201:1
  22059. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22060. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22061. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:201:1
  22062. 1267.85 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  22063. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  22064. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:347:1
  22065. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22066. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22067. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:347:1
  22068. 1267.85 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  22069. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  22070. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:378:1
  22071. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22072. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22073. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:378:1
  22074. 1267.85 s [algebraic-graphs] Warning: 'mesh' is ambiguous. It is defined
  22075. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:981:1
  22076. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:408:1
  22077. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22078. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22079. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:408:1
  22080. 1267.85 s [algebraic-graphs] Warning: 'torus' is ambiguous. It is defined
  22081. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:1007:1
  22082. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:433:1
  22083. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22084. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22085. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:433:1
  22086. 1267.85 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  22087. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  22088. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:490:1
  22089. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22090. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22091. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:490:1
  22092. 1267.85 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  22093. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  22094. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:502:1
  22095. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22096. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22097. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:502:1
  22098. 1267.85 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  22099. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  22100. 1267.85 s [algebraic-graphs] * at src/Algebra/Graph/HigherKinded/Class.hs:515:1
  22101. 1267.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22102. 1267.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22103. 1267.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:515:1
  22104. 1267.86 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  22105. 1267.86 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  22106. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  22107. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
  22108. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22109. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22110. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
  22111. 1267.86 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  22112. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  22113. 1267.86 s [algebraic-graphs] * in ‘Data.Tuple’
  22114. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22115. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22116. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  22117. 1267.86 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  22118. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  22119. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22120. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
  22121. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22122. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22123. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
  22124. 1267.86 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22125. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  22126. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  22127. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
  22128. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22129. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22130. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
  22131. 1267.86 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  22132. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  22133. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  22134. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:312:1
  22135. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22136. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22137. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:312:1
  22138. 1267.86 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  22139. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  22140. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  22141. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:337:1
  22142. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22143. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22144. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:337:1
  22145. 1267.86 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22146. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  22147. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22148. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22149. 1267.86 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22150. 1267.86 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22151. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22152. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22153. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22154. 1267.86 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  22155. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  22156. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  22157. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:499:1
  22158. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22159. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22160. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:499:1
  22161. 1267.86 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  22162. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  22163. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  22164. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:531:1
  22165. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22166. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22167. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:531:1
  22168. 1267.86 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  22169. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  22170. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  22171. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:544:1
  22172. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22173. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22174. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:544:1
  22175. 1267.86 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22176. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  22177. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22178. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
  22179. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22180. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22181. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
  22182. 1267.86 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22183. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  22184. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22185. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:594:1
  22186. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22187. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22188. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:594:1
  22189. 1267.86 s [algebraic-graphs] Warning: 'biclique' is ambiguous. It is defined
  22190. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:895:1
  22191. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:575:1
  22192. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
  22193. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22194. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22195. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
  22196. 1267.86 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  22197. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  22198. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  22199. 1267.86 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:390:1
  22200. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22201. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22202. 1267.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:390:1
  22203. 1267.86 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  22204. 1267.86 s [algebraic-graphs] * in ‘GHC.Base’
  22205. 1267.86 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  22206. 1267.86 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22207. 1267.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22208. 1267.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22209. 1267.86 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22210. 1267.87 s [algebraic-graphs] Warning: 'nub' is out of scope.
  22211. 1267.87 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22212. 1267.87 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  22213. 1267.87 s [algebraic-graphs] * in ‘Data.Foldable’
  22214. 1267.87 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22215. 1267.87 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22216. 1267.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22217. 1267.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22218. 1267.87 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22219. 1267.87 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  22220. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  22221. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  22222. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
  22223. 1267.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22224. 1267.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22225. 1267.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
  22226. 1267.87 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  22227. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  22228. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  22229. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:630:1
  22230. 1267.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22231. 1267.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22232. 1267.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:630:1
  22233. 1267.87 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22234. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  22235. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22236. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:283:1
  22237. 1267.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22238. 1267.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22239. 1267.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:283:1
  22240. 1267.87 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  22241. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  22242. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  22243. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:642:1
  22244. 1267.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22245. 1267.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22246. 1267.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:642:1
  22247. 1267.87 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  22248. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  22249. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  22250. 1267.87 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
  22251. 1267.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22252. 1267.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22253. 1267.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
  22254. 1267.88 s [algebraic-graphs] Warning: 'box' is ambiguous. It is defined
  22255. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph.hs:1287:1
  22256. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:835:1
  22257. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:934:1
  22258. 1267.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22259. 1267.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22260. 1267.88 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:934:1
  22261. 1267.88 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  22262. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  22263. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  22264. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
  22265. 1267.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22266. 1267.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22267. 1267.88 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
  22268. 1267.88 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  22269. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  22270. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  22271. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
  22272. 1267.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22273. 1267.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22274. 1267.88 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
  22275. 1267.88 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  22276. 1267.88 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  22277. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  22278. 1267.88 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
  22279. 1267.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22280. 1267.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22281. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
  22282. 1267.89 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22283. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22284. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22285. 1267.89 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22286. 1267.89 s [algebraic-graphs] * in ‘Data.Sequence.Internal’
  22287. 1267.89 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22288. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22289. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22290. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22291. 1267.89 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22292. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  22293. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
  22294. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22295. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22296. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
  22297. 1267.89 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  22298. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  22299. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
  22300. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22301. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22302. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
  22303. 1267.89 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  22304. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  22305. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
  22306. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22307. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22308. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
  22309. 1267.89 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  22310. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22311. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
  22312. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22313. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22314. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
  22315. 1267.89 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  22316. 1267.89 s [algebraic-graphs] * in ‘GHC.Base’
  22317. 1267.89 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  22318. 1267.89 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22319. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22320. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22321. 1267.89 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22322. 1267.89 s [algebraic-graphs] Warning: 'biclique' is ambiguous. It is defined
  22323. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:575:1
  22324. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
  22325. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22326. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22327. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
  22328. 1267.89 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  22329. 1267.89 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22330. 1267.89 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  22331. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  22332. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  22333. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22334. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22335. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  22336. 1267.89 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  22337. 1267.89 s [algebraic-graphs] * in ‘Data.Foldable’
  22338. 1267.89 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22339. 1267.89 s [algebraic-graphs] * in ‘Data.Sequence.Internal’
  22340. 1267.89 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22341. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22342. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22343. 1267.89 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22344. 1267.89 s [algebraic-graphs] Warning: 'length' is ambiguous. It is defined
  22345. 1267.89 s [algebraic-graphs] * in ‘Data.Foldable’
  22346. 1267.89 s [algebraic-graphs] * in ‘Data.Sequence.Internal’
  22347. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22348. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22349. 1267.89 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Sequence.Internal’
  22350. 1267.89 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  22351. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  22352. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
  22353. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22354. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22355. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
  22356. 1267.89 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  22357. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  22358. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
  22359. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22360. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22361. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
  22362. 1267.89 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22363. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22364. 1267.89 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
  22365. 1267.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22366. 1267.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22367. 1267.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
  22368. 1267.90 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  22369. 1267.90 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  22370. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  22371. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  22372. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22373. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22374. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  22375. 1267.90 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  22376. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  22377. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  22378. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22379. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22380. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  22381. 1267.90 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  22382. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  22383. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  22384. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22385. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22386. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  22387. 1267.90 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  22388. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  22389. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  22390. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22391. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22392. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  22393. 1267.90 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  22394. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  22395. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  22396. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22397. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22398. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  22399. 1267.90 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  22400. 1267.90 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  22401. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  22402. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22403. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22404. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22405. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22406. 1267.90 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22407. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22408. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22409. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22410. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22411. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22412. 1267.90 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  22413. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  22414. 1267.90 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:253:1
  22415. 1267.90 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22416. 1267.90 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22417. 1267.90 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:253:1
  22418. 1267.90 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  22419. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  22420. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:274:1
  22421. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22422. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22423. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:274:1
  22424. 1267.91 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22425. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  22426. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22427. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22428. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22429. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22430. 1267.91 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  22431. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  22432. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  22433. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22434. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22435. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  22436. 1267.91 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  22437. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  22438. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  22439. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22440. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22441. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  22442. 1267.91 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22443. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22444. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
  22445. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22446. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22447. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
  22448. 1267.91 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22449. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22450. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
  22451. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22452. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22453. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
  22454. 1267.91 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  22455. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  22456. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:356:1
  22457. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22458. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22459. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:356:1
  22460. 1267.91 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22461. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22462. 1267.91 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22463. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22464. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22465. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22466. 1267.91 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  22467. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  22468. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  22469. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22470. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22471. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  22472. 1267.91 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  22473. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  22474. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
  22475. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22476. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22477. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
  22478. 1267.91 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  22479. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  22480. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
  22481. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22482. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22483. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
  22484. 1267.91 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  22485. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  22486. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:503:1
  22487. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22488. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22489. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:503:1
  22490. 1267.91 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  22491. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  22492. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
  22493. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22494. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22495. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
  22496. 1267.91 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  22497. 1267.91 s [algebraic-graphs] * in ‘GHC.Base’
  22498. 1267.91 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22499. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22500. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22501. 1267.91 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22502. 1267.91 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  22503. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  22504. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
  22505. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22506. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22507. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
  22508. 1267.91 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  22509. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  22510. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
  22511. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22512. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22513. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
  22514. 1267.92 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  22515. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  22516. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  22517. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22518. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22519. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  22520. 1267.92 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  22521. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:873:1
  22522. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
  22523. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22524. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22525. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
  22526. 1267.92 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  22527. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  22528. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  22529. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22530. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22531. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  22532. 1267.92 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  22533. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  22534. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
  22535. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22536. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22537. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
  22538. 1267.92 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  22539. 1267.92 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22540. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  22541. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22542. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22543. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22544. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22545. 1267.92 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22546. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22547. 1267.92 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22548. 1267.92 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22549. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22550. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22551. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22552. 1267.92 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22553. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22554. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22555. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22556. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22557. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22558. 1267.92 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  22559. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  22560. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  22561. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22562. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22563. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  22564. 1267.92 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  22565. 1267.92 s [algebraic-graphs] * in ‘GHC.Base’
  22566. 1267.92 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  22567. 1267.92 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22568. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22569. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22570. 1267.92 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22571. 1267.93 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  22572. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  22573. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  22574. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22575. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22576. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  22577. 1267.93 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  22578. 1267.93 s [algebraic-graphs] * in ‘Data.Foldable’
  22579. 1267.93 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22580. 1267.93 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22581. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22582. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22583. 1267.93 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22584. 1267.93 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  22585. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  22586. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  22587. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22588. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22589. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  22590. 1267.93 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  22591. 1267.93 s [algebraic-graphs] Missing documentation for:
  22592. 1267.93 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  22593. 1267.93 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  22594. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:96:1
  22595. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  22596. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22597. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22598. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22599. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22600. 1267.93 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  22601. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:198:1
  22602. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  22603. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  22604. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22605. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22606. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  22607. 1267.93 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22608. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  22609. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22610. 1267.93 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22611. 1267.93 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22612. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22613. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22614. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22615. 1267.93 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22616. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  22617. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22618. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22619. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22620. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22621. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22622. 1267.93 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22623. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  22624. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22625. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
  22626. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22627. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22628. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
  22629. 1267.94 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22630. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  22631. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22632. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
  22633. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22634. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22635. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
  22636. 1267.94 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  22637. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:210:1
  22638. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  22639. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22640. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22641. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
  22642. 1267.94 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  22643. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:221:1
  22644. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  22645. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  22646. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22647. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22648. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  22649. 1267.94 s [algebraic-graphs] Warning: 'length' is ambiguous. It is defined
  22650. 1267.94 s [algebraic-graphs] * in ‘Data.Foldable’
  22651. 1267.94 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  22652. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22653. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22654. 1267.94 s [algebraic-graphs] Defaulting to the one defined in ‘Data.List.NonEmpty’
  22655. 1267.94 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  22656. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:303:1
  22657. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  22658. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  22659. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22660. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22661. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  22662. 1267.94 s [algebraic-graphs] Warning: 'edgeSet' is ambiguous. It is defined
  22663. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:314:1
  22664. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:478:1
  22665. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
  22666. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22667. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22668. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
  22669. 1267.94 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  22670. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:390:1
  22671. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  22672. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22673. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22674. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:763:1
  22675. 1267.94 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  22676. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:440:1
  22677. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  22678. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  22679. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22680. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22681. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  22682. 1267.94 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  22683. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:352:1
  22684. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  22685. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22686. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22687. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
  22688. 1267.94 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  22689. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:364:1
  22690. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  22691. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
  22692. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22693. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22694. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
  22695. 1267.94 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  22696. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:281:1
  22697. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  22698. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
  22699. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22700. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22701. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
  22702. 1267.94 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  22703. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:269:1
  22704. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  22705. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22706. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22707. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
  22708. 1267.94 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  22709. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  22710. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22711. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22712. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22713. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22714. 1267.94 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  22715. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:376:1
  22716. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  22717. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
  22718. 1267.94 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  22719. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22720. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22721. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
  22722. 1267.94 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  22723. 1267.94 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  22724. 1267.94 s [algebraic-graphs] * in ‘GHC.Base’
  22725. 1267.94 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22726. 1267.94 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22727. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22728. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22729. 1267.94 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22730. 1267.94 s [algebraic-graphs] Warning: 'scc' is ambiguous. It is defined
  22731. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:471:1
  22732. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
  22733. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22734. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22735. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
  22736. 1267.94 s [algebraic-graphs] Warning: 'union' is ambiguous. It is defined
  22737. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
  22738. 1267.94 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22739. 1267.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22740. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22741. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22742. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
  22743. 1267.95 s [algebraic-graphs] Warning: 'box' is ambiguous. It is defined
  22744. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:428:1
  22745. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:835:1
  22746. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22747. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22748. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:835:1
  22749. 1267.95 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  22750. 1267.95 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  22751. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  22752. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  22753. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22754. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22755. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  22756. 1267.95 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  22757. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  22758. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  22759. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  22760. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  22761. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22762. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22763. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  22764. 1267.95 s [algebraic-graphs] Warning: 'edgeSet' is ambiguous. It is defined
  22765. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph.hs:783:1
  22766. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:489:1
  22767. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:478:1
  22768. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
  22769. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:179:5
  22770. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22771. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22772. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:179:5
  22773. 1267.95 s [algebraic-graphs] Warning: 'preSet' is ambiguous. It is defined
  22774. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:503:1
  22775. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:434:1
  22776. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:187:5
  22777. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22778. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22779. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:187:5
  22780. 1267.95 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  22781. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  22782. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
  22783. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:205:5
  22784. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22785. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22786. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
  22787. 1267.95 s [algebraic-graphs] Warning: 'adjacencyMap' is ambiguous. It is defined
  22788. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:167:5
  22789. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:443:1
  22790. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22791. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22792. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:443:1
  22793. 1267.95 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  22794. 1267.95 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  22795. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  22796. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  22797. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22798. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22799. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  22800. 1267.96 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22801. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  22802. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  22803. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22804. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  22805. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22806. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22807. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
  22808. 1267.96 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  22809. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  22810. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  22811. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  22812. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:283:1
  22813. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22814. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22815. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:283:1
  22816. 1267.96 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  22817. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  22818. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  22819. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  22820. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:304:1
  22821. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22822. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22823. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:304:1
  22824. 1267.96 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22825. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  22826. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  22827. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22828. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  22829. 1267.96 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  22830. 1267.96 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22831. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22832. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22833. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  22834. 1267.96 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22835. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  22836. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  22837. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  22838. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:266:1
  22839. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22840. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22841. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:266:1
  22842. 1267.96 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  22843. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  22844. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  22845. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  22846. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:373:1
  22847. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22848. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22849. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:373:1
  22850. 1267.96 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  22851. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  22852. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
  22853. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  22854. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:387:1
  22855. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  22856. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22857. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22858. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  22859. 1267.96 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  22860. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  22861. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  22862. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  22863. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:398:1
  22864. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  22865. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22866. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22867. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  22868. 1267.96 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22869. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  22870. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  22871. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22872. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  22873. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  22874. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22875. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22876. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  22877. 1267.96 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22878. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  22879. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  22880. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22881. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  22882. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  22883. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22884. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22885. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  22886. 1267.96 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  22887. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  22888. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  22889. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  22890. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:411:1
  22891. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  22892. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22893. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22894. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  22895. 1267.96 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  22896. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  22897. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  22898. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  22899. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:345:1
  22900. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22901. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22902. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:345:1
  22903. 1267.96 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  22904. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  22905. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  22906. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:471:1
  22907. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  22908. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22909. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22910. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  22911. 1267.96 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  22912. 1267.96 s [algebraic-graphs] * in ‘GHC.Base’
  22913. 1267.96 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  22914. 1267.96 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22915. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22916. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22917. 1267.96 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22918. 1267.96 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  22919. 1267.96 s [algebraic-graphs] * in ‘Data.Foldable’
  22920. 1267.96 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  22921. 1267.96 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22922. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22923. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22924. 1267.96 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  22925. 1267.96 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  22926. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  22927. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  22928. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  22929. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  22930. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22931. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22932. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
  22933. 1267.96 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  22934. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  22935. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  22936. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  22937. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:554:1
  22938. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22939. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22940. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:554:1
  22941. 1267.96 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  22942. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  22943. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
  22944. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  22945. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:663:1
  22946. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22947. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22948. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:663:1
  22949. 1267.96 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  22950. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  22951. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  22952. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  22953. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:678:1
  22954. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22955. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22956. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:678:1
  22957. 1267.96 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  22958. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  22959. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  22960. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  22961. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:460:1
  22962. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  22963. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22964. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22965. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  22966. 1267.96 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  22967. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  22968. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  22969. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  22970. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:446:1
  22971. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  22972. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22973. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22974. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  22975. 1267.96 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  22976. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  22977. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  22978. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22979. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:320:1
  22980. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22981. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22982. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:320:1
  22983. 1267.96 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  22984. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  22985. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  22986. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  22987. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:603:1
  22988. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22989. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22990. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:603:1
  22991. 1267.96 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  22992. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  22993. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  22994. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  22995. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:332:1
  22996. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22997. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22998. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:332:1
  22999. 1267.96 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  23000. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:1145:1
  23001. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
  23002. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  23003. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:716:1
  23004. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23005. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23006. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:716:1
  23007. 1267.97 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  23008. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:937:1
  23009. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
  23010. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:611:1
  23011. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:621:1
  23012. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23013. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23014. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:621:1
  23015. 1267.97 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  23016. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:805:1
  23017. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
  23018. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:491:1
  23019. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:496:1
  23020. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:223:5
  23021. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23022. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23023. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
  23024. 1267.97 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  23025. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  23026. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  23027. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  23028. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:636:1
  23029. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23030. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23031. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:636:1
  23032. 1267.97 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  23033. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  23034. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  23035. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  23036. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:690:1
  23037. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23038. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23039. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:690:1
  23040. 1267.97 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  23041. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  23042. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  23043. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  23044. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:703:1
  23045. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23046. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23047. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:703:1
  23048. 1267.97 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  23049. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
  23050. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  23051. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:731:1
  23052. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23053. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23054. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:731:1
  23055. 1267.97 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  23056. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:1163:1
  23057. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
  23058. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  23059. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:745:1
  23060. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23061. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23062. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:745:1
  23063. 1267.97 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  23064. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:834:1
  23065. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:873:1
  23066. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:823:1
  23067. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23068. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23069. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:823:1
  23070. 1267.97 s [algebraic-graphs] Warning: 'clique' is ambiguous. It is defined
  23071. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:878:1
  23072. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:570:1
  23073. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:558:1
  23074. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:569:1
  23075. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23076. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23077. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
  23078. 1267.97 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  23079. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:861:1
  23080. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  23081. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:850:1
  23082. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23083. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23084. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:850:1
  23085. 1267.97 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  23086. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  23087. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:528:1
  23088. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:205:5
  23089. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23090. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23091. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
  23092. 1267.98 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  23093. 1267.98 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  23094. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  23095. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:104:1
  23096. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23097. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23098. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:104:1
  23099. 1267.98 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  23100. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  23101. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  23102. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  23103. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:304:1
  23104. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  23105. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23106. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23107. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  23108. 1267.98 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  23109. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  23110. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  23111. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  23112. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  23113. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  23114. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23115. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23116. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  23117. 1267.98 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  23118. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  23119. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  23120. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  23121. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:266:1
  23122. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  23123. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23124. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23125. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  23126. 1267.98 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  23127. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  23128. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  23129. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  23130. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:373:1
  23131. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  23132. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23133. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23134. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  23135. 1267.98 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  23136. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  23137. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  23138. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  23139. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:283:1
  23140. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  23141. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23142. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23143. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  23144. 1267.98 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  23145. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  23146. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  23147. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  23148. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  23149. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  23150. 1267.98 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23151. 1267.98 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23152. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23153. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23154. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  23155. 1267.98 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  23156. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  23157. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  23158. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  23159. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  23160. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  23161. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  23162. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23163. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23164. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  23165. 1267.98 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  23166. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  23167. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  23168. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  23169. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  23170. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  23171. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  23172. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23173. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23174. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  23175. 1267.98 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  23176. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  23177. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
  23178. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  23179. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:387:1
  23180. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
  23181. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  23182. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23183. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23184. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  23185. 1267.98 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  23186. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  23187. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  23188. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  23189. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:398:1
  23190. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
  23191. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  23192. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23193. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23194. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  23195. 1267.98 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  23196. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  23197. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  23198. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  23199. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:332:1
  23200. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  23201. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23202. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23203. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  23204. 1267.98 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  23205. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  23206. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  23207. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  23208. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:411:1
  23209. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
  23210. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  23211. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23212. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23213. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  23214. 1267.98 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  23215. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  23216. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  23217. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  23218. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:345:1
  23219. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  23220. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23221. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23222. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  23223. 1267.98 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  23224. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  23225. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  23226. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:471:1
  23227. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
  23228. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  23229. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23230. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23231. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  23232. 1267.99 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  23233. 1267.99 s [algebraic-graphs] * in ‘Data.Foldable’
  23234. 1267.99 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23235. 1267.99 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23236. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23237. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23238. 1267.99 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23239. 1267.99 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  23240. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  23241. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  23242. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  23243. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  23244. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  23245. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23246. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23247. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  23248. 1267.99 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  23249. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  23250. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  23251. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  23252. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:554:1
  23253. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  23254. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23255. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23256. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  23257. 1267.99 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  23258. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  23259. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
  23260. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  23261. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:663:1
  23262. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
  23263. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23264. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23265. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:571:1
  23266. 1267.99 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  23267. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  23268. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  23269. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  23270. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:678:1
  23271. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
  23272. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23273. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23274. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:585:1
  23275. 1267.99 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  23276. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  23277. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  23278. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  23279. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:460:1
  23280. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
  23281. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  23282. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23283. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23284. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  23285. 1267.99 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  23286. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  23287. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  23288. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  23289. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:446:1
  23290. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
  23291. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  23292. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23293. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23294. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  23295. 1267.99 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  23296. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  23297. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  23298. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  23299. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:320:1
  23300. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  23301. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23302. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23303. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  23304. 1267.99 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  23305. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  23306. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  23307. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  23308. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:603:1
  23309. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  23310. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23311. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23312. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  23313. 1267.99 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  23314. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:937:1
  23315. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
  23316. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:611:1
  23317. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:621:1
  23318. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
  23319. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23320. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23321. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:534:1
  23322. 1267.99 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  23323. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:805:1
  23324. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
  23325. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:491:1
  23326. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:496:1
  23327. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
  23328. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:223:5
  23329. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23330. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23331. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
  23332. 1267.99 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  23333. 1267.99 s [algebraic-graphs] * in ‘GHC.Base’
  23334. 1267.99 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23335. 1267.99 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23336. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23337. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23338. 1267.99 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23339. 1267.99 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  23340. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  23341. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  23342. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  23343. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:636:1
  23344. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  23345. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23346. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23347. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  23348. 1267.99 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  23349. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  23350. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  23351. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  23352. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:690:1
  23353. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
  23354. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23355. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23356. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:597:1
  23357. 1268.00 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  23358. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  23359. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  23360. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  23361. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:703:1
  23362. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
  23363. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23364. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23365. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:610:1
  23366. 1268.00 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  23367. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
  23368. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  23369. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:731:1
  23370. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:625:1
  23371. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23372. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23373. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:625:1
  23374. 1268.00 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  23375. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:1163:1
  23376. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
  23377. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  23378. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:745:1
  23379. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
  23380. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23381. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23382. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:639:1
  23383. 1268.00 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  23384. 1268.00 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  23385. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  23386. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:164:1
  23387. 1268.00 s [algebraic-graphs] * in ‘Data.Graph’
  23388. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23389. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23390. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:1
  23391. 1268.00 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  23392. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  23393. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  23394. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  23395. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:257:1
  23396. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23397. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23398. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:257:1
  23399. 1268.00 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  23400. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  23401. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  23402. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  23403. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:287:1
  23404. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23405. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23406. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:287:1
  23407. 1268.00 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  23408. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  23409. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  23410. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  23411. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:322:1
  23412. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23413. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23414. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:322:1
  23415. 1268.00 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  23416. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  23417. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  23418. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  23419. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:490:1
  23420. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  23421. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23422. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23423. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  23424. 1268.00 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  23425. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  23426. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  23427. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  23428. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:508:1
  23429. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  23430. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23431. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23432. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  23433. 1268.00 s [algebraic-graphs] Warning: 'size' is ambiguous. It is defined
  23434. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:602:1
  23435. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:447:1
  23436. 1268.00 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23437. 1268.00 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23438. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23439. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23440. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:447:1
  23441. 1268.00 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  23442. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  23443. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  23444. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  23445. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:270:1
  23446. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23447. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23448. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:270:1
  23449. 1268.00 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  23450. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  23451. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  23452. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  23453. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:410:1
  23454. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23455. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23456. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:410:1
  23457. 1268.01 s [algebraic-graphs] Warning: 'Vertex' is ambiguous. It is defined
  23458. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:184:16
  23459. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:164:16
  23460. 1268.01 s [algebraic-graphs] * in ‘Data.Graph’
  23461. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23462. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23463. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:16
  23464. 1268.01 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  23465. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  23466. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  23467. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  23468. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:456:1
  23469. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  23470. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23471. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23472. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  23473. 1268.01 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  23474. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  23475. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  23476. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  23477. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:470:1
  23478. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  23479. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23480. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23481. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  23482. 1268.01 s [algebraic-graphs] Warning: 'Overlay' is ambiguous. It is defined
  23483. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:185:16
  23484. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:165:16
  23485. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23486. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23487. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:165:16
  23488. 1268.01 s [algebraic-graphs] Warning: 'Connect' is ambiguous. It is defined
  23489. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:186:16
  23490. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:166:16
  23491. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23492. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23493. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:166:16
  23494. 1268.01 s [algebraic-graphs] Warning: 'length' is ambiguous. It is defined
  23495. 1268.01 s [algebraic-graphs] * in ‘Data.Foldable’
  23496. 1268.01 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  23497. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23498. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23499. 1268.01 s [algebraic-graphs] Defaulting to the one defined in ‘Data.List.NonEmpty’
  23500. 1268.01 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  23501. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  23502. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  23503. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:561:1
  23504. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  23505. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23506. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23507. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  23508. 1268.01 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  23509. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:1145:1
  23510. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
  23511. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  23512. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:809:1
  23513. 1268.01 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  23514. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23515. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23516. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:809:1
  23517. 1268.01 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  23518. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  23519. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  23520. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  23521. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:747:1
  23522. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23523. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23524. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:747:1
  23525. 1268.01 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  23526. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  23527. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  23528. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  23529. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:544:1
  23530. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  23531. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23532. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23533. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  23534. 1268.01 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  23535. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  23536. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  23537. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  23538. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  23539. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23540. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23541. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  23542. 1268.01 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  23543. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  23544. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  23545. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  23546. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:639:1
  23547. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23548. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23549. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:639:1
  23550. 1268.01 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  23551. 1268.01 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  23552. 1268.01 s [algebraic-graphs] * in ‘GHC.Base’
  23553. 1268.01 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23554. 1268.01 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23555. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23556. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23557. 1268.01 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23558. 1268.02 s [algebraic-graphs] Warning: 'box' is ambiguous. It is defined
  23559. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:1287:1
  23560. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:835:1
  23561. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:909:1
  23562. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23563. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23564. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:909:1
  23565. 1268.02 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  23566. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  23567. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  23568. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  23569. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:768:1
  23570. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23571. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23572. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:768:1
  23573. 1268.02 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  23574. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  23575. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  23576. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  23577. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:782:1
  23578. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23579. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23580. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:782:1
  23581. 1268.02 s [algebraic-graphs] Warning: '===' is ambiguous. It is defined
  23582. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:562:17
  23583. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:428:17
  23584. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23585. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23586. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:428:17
  23587. 1268.02 s [algebraic-graphs] Warning: 'filter' is ambiguous. It is defined
  23588. 1268.02 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  23589. 1268.02 s [algebraic-graphs] * in ‘GHC.List’
  23590. 1268.02 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23591. 1268.02 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23592. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23593. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23594. 1268.02 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23595. 1268.03 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  23596. 1268.03 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  23597. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  23598. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
  23599. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23600. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23601. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
  23602. 1268.03 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  23603. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  23604. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
  23605. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  23606. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23607. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23608. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  23609. 1268.03 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  23610. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  23611. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
  23612. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  23613. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23614. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23615. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  23616. 1268.03 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  23617. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  23618. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:403:1
  23619. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  23620. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23621. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23622. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  23623. 1268.03 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  23624. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  23625. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:415:1
  23626. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  23627. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23628. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23629. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  23630. 1268.03 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  23631. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  23632. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  23633. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23634. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23635. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  23636. 1268.03 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  23637. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  23638. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  23639. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23640. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23641. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  23642. 1268.03 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  23643. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  23644. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  23645. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23646. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23647. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  23648. 1268.03 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  23649. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  23650. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  23651. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  23652. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23653. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23654. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  23655. 1268.03 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  23656. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  23657. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  23658. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23659. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23660. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  23661. 1268.03 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  23662. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  23663. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  23664. 1268.03 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23665. 1268.03 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23666. 1268.03 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23667. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23668. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23669. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  23670. 1268.03 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  23671. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  23672. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  23673. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23674. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23675. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  23676. 1268.03 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  23677. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  23678. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  23679. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23680. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23681. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  23682. 1268.03 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  23683. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  23684. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  23685. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23686. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23687. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  23688. 1268.03 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  23689. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  23690. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
  23691. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  23692. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23693. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23694. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  23695. 1268.03 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  23696. 1268.03 s [algebraic-graphs] * in ‘GHC.Base’
  23697. 1268.03 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23698. 1268.03 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  23699. 1268.03 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23700. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23701. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23702. 1268.03 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23703. 1268.03 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  23704. 1268.03 s [algebraic-graphs] * in ‘Data.Foldable’
  23705. 1268.03 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23706. 1268.03 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23707. 1268.03 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23708. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23709. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23710. 1268.03 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23711. 1268.03 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  23712. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  23713. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  23714. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23715. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23716. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  23717. 1268.04 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  23718. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  23719. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  23720. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23721. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23722. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  23723. 1268.04 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  23724. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  23725. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  23726. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23727. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23728. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  23729. 1268.04 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  23730. 1268.04 s [algebraic-graphs] * in ‘Data.Foldable’
  23731. 1268.04 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23732. 1268.04 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23733. 1268.04 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23734. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23735. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23736. 1268.04 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23737. 1268.04 s [algebraic-graphs] Warning: 'filter' is ambiguous. It is defined
  23738. 1268.04 s [algebraic-graphs] * in ‘GHC.List’
  23739. 1268.04 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23740. 1268.04 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23741. 1268.04 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23742. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23743. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23744. 1268.04 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23745. 1268.04 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  23746. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  23747. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
  23748. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  23749. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23750. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23751. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  23752. 1268.04 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  23753. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  23754. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:426:1
  23755. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  23756. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23757. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23758. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  23759. 1268.04 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  23760. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  23761. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  23762. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23763. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23764. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  23765. 1268.04 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  23766. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  23767. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
  23768. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23769. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23770. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
  23771. 1268.04 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  23772. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  23773. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  23774. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23775. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23776. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  23777. 1268.04 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  23778. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  23779. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  23780. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23781. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23782. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  23783. 1268.04 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  23784. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:873:1
  23785. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  23786. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23787. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23788. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  23789. 1268.04 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  23790. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  23791. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:486:1
  23792. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:205:5
  23793. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23794. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23795. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
  23796. 1268.04 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  23797. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  23798. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  23799. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23800. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23801. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  23802. 1268.05 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  23803. 1268.05 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  23804. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  23805. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  23806. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23807. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23808. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  23809. 1268.05 s [algebraic-graphs] Warning: 'size' is ambiguous. It is defined
  23810. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:357:1
  23811. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23812. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23813. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23814. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23815. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23816. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:357:1
  23817. 1268.05 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  23818. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  23819. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  23820. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23821. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23822. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23823. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23824. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23825. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  23826. 1268.05 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  23827. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:203:1
  23828. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  23829. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23830. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23831. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  23832. 1268.05 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  23833. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:288:1
  23834. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  23835. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23836. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23837. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  23838. 1268.05 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  23839. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:496:1
  23840. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  23841. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23842. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23843. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  23844. 1268.05 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  23845. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:342:1
  23846. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
  23847. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  23848. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23849. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23850. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  23851. 1268.05 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  23852. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:368:1
  23853. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
  23854. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  23855. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23856. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23857. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  23858. 1268.05 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  23859. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:424:1
  23860. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
  23861. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  23862. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23863. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23864. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  23865. 1268.05 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  23866. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:145:1
  23867. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  23868. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23869. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23870. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  23871. 1268.05 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  23872. 1268.05 s [algebraic-graphs] * in ‘Data.Foldable’
  23873. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23874. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23875. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23876. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23877. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23878. 1268.05 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23879. 1268.05 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  23880. 1268.05 s [algebraic-graphs] * in ‘GHC.Base’
  23881. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23882. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23883. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23884. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23885. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23886. 1268.05 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23887. 1268.05 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  23888. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:303:1
  23889. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  23890. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23891. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23892. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  23893. 1268.05 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  23894. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:180:1
  23895. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  23896. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23897. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23898. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  23899. 1268.05 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  23900. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:270:1
  23901. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  23902. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23903. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23904. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  23905. 1268.05 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  23906. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:381:1
  23907. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  23908. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  23909. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23910. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23911. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  23912. 1268.05 s [algebraic-graphs] Warning: 'edgeLabel' is ambiguous. It is defined
  23913. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:385:1
  23914. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
  23915. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23916. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23917. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
  23918. 1268.05 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  23919. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:217:1
  23920. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  23921. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23922. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23923. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  23924. 1268.05 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  23925. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:619:1
  23926. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  23927. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23928. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23929. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  23930. 1268.05 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  23931. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:329:1
  23932. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  23933. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23934. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23935. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  23936. 1268.06 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  23937. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:448:1
  23938. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  23939. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23940. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23941. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  23942. 1268.06 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  23943. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:461:1
  23944. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  23945. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23946. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23947. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  23948. 1268.06 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  23949. 1268.06 s [algebraic-graphs] * in ‘Data.Foldable’
  23950. 1268.06 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23951. 1268.06 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23952. 1268.06 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23953. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23954. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23955. 1268.06 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23956. 1268.06 s [algebraic-graphs] Warning: 'filter' is ambiguous. It is defined
  23957. 1268.06 s [algebraic-graphs] * in ‘GHC.List’
  23958. 1268.06 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  23959. 1268.06 s [algebraic-graphs] * in ‘Data.Map.Internal’
  23960. 1268.06 s [algebraic-graphs] * in ‘Data.Set.Internal’
  23961. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23962. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23963. 1268.06 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  23964. 1268.06 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  23965. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:413:1
  23966. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
  23967. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  23968. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23969. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23970. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  23971. 1268.06 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  23972. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:473:1
  23973. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  23974. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23975. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23976. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  23977. 1268.06 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  23978. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:545:1
  23979. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  23980. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23981. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23982. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  23983. 1268.06 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  23984. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:315:1
  23985. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  23986. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23987. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23988. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  23989. 1268.06 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  23990. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:592:1
  23991. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  23992. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23993. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  23994. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  23995. 1268.06 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  23996. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  23997. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  23998. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  23999. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24000. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  24001. 1268.06 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24002. 1268.07 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24003. 1268.07 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24004. 1268.07 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  24005. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  24006. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  24007. 1268.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24008. 1268.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24009. 1268.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  24010. 1268.07 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24011. 1268.07 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  24012. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  24013. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  24014. 1268.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24015. 1268.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24016. 1268.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  24017. 1268.07 s [algebraic-graphs] Warning: 'export' is ambiguous. It is defined
  24018. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:186:1
  24019. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:122:1
  24020. 1268.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24021. 1268.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24022. 1268.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:122:1
  24023. 1268.07 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24024. 1268.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24025. 1268.08 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24026. 1268.08 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  24027. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  24028. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  24029. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:325:1
  24030. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24031. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24032. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
  24033. 1268.08 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  24034. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  24035. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:178:1
  24036. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24037. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24038. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
  24039. 1268.08 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24040. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24041. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24042. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24043. 1268.08 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24044. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24045. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24046. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24047. 1268.08 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24048. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  24049. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  24050. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:266:1
  24051. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24052. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24053. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
  24054. 1268.08 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  24055. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  24056. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  24057. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:300:1
  24058. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24059. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24060. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
  24061. 1268.08 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24062. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  24063. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24064. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:505:1
  24065. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24066. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24067. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:505:1
  24068. 1268.08 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24069. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  24070. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24071. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:519:1
  24072. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24073. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24074. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:519:1
  24075. 1268.08 s [algebraic-graphs] Warning: 'size' is ambiguous. It is defined
  24076. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:602:1
  24077. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:462:1
  24078. 1268.08 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24079. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24080. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24081. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:462:1
  24082. 1268.08 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24083. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  24084. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  24085. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:281:1
  24086. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24087. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24088. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
  24089. 1268.08 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  24090. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  24091. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  24092. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:424:1
  24093. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24094. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24095. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
  24096. 1268.08 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  24097. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  24098. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
  24099. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:446:1
  24100. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24101. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24102. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:446:1
  24103. 1268.08 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  24104. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  24105. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
  24106. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:474:1
  24107. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24108. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24109. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:474:1
  24110. 1268.08 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  24111. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  24112. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  24113. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:354:1
  24114. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24115. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24116. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
  24117. 1268.08 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  24118. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  24119. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
  24120. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:491:1
  24121. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24122. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24123. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:491:1
  24124. 1268.08 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  24125. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  24126. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  24127. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:369:1
  24128. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24129. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24130. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
  24131. 1268.09 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  24132. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  24133. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
  24134. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:557:1
  24135. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24136. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24137. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:557:1
  24138. 1268.09 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  24139. 1268.09 s [algebraic-graphs] * in ‘Data.Foldable’
  24140. 1268.09 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24141. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24142. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24143. 1268.09 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  24144. 1268.09 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  24145. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  24146. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  24147. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:610:1
  24148. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24149. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24150. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
  24151. 1268.09 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  24152. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  24153. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  24154. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:624:1
  24155. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24156. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24157. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
  24158. 1268.09 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  24159. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  24160. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
  24161. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:729:1
  24162. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24163. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24164. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:729:1
  24165. 1268.09 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  24166. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  24167. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
  24168. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:746:1
  24169. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24170. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24171. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:746:1
  24172. 1268.09 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  24173. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  24174. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
  24175. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:545:1
  24176. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24177. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24178. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:545:1
  24179. 1268.09 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  24180. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  24181. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
  24182. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:531:1
  24183. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24184. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24185. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:531:1
  24186. 1268.09 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24187. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  24188. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  24189. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:341:1
  24190. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24191. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24192. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
  24193. 1268.09 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  24194. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  24195. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  24196. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:669:1
  24197. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24198. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24199. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
  24200. 1268.09 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  24201. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:937:1
  24202. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
  24203. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:687:1
  24204. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24205. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24206. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:687:1
  24207. 1268.09 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  24208. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:805:1
  24209. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
  24210. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:583:1
  24211. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24212. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24213. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:583:1
  24214. 1268.09 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  24215. 1268.09 s [algebraic-graphs] * in ‘GHC.Base’
  24216. 1268.09 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24217. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24218. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24219. 1268.09 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  24220. 1268.09 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  24221. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  24222. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  24223. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:701:1
  24224. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24225. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24226. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
  24227. 1268.09 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  24228. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  24229. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
  24230. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:760:1
  24231. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24232. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24233. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:760:1
  24234. 1268.09 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  24235. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  24236. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
  24237. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:775:1
  24238. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24239. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24240. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:775:1
  24241. 1268.10 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  24242. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:1163:1
  24243. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
  24244. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:791:1
  24245. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24246. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24247. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:791:1
  24248. 1268.10 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24249. 1268.10 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  24250. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  24251. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:109:1
  24252. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:66:1
  24253. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:178:1
  24254. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24255. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24256. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
  24257. 1268.10 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  24258. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  24259. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  24260. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  24261. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:119:5
  24262. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:288:1
  24263. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  24264. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:304:1
  24265. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  24266. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:325:1
  24267. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24268. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24269. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
  24270. 1268.10 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  24271. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  24272. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  24273. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  24274. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:117:5
  24275. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:270:1
  24276. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  24277. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:283:1
  24278. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  24279. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:300:1
  24280. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24281. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24282. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
  24283. 1268.10 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24284. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24285. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24286. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24287. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:113:5
  24288. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  24289. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24290. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24291. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24292. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24293. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24294. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24295. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24296. 1268.10 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24297. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  24298. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  24299. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24300. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:115:5
  24301. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:203:1
  24302. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  24303. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  24304. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  24305. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:266:1
  24306. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24307. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24308. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
  24309. 1268.10 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  24310. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  24311. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  24312. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  24313. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:325:1
  24314. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:329:1
  24315. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  24316. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:345:1
  24317. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  24318. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:369:1
  24319. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24320. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24321. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
  24322. 1268.10 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24323. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  24324. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  24325. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  24326. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:289:1
  24327. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:217:1
  24328. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  24329. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:266:1
  24330. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  24331. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:281:1
  24332. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24333. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24334. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
  24335. 1268.10 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  24336. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  24337. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  24338. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  24339. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:361:1
  24340. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:180:1
  24341. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  24342. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:373:1
  24343. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  24344. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:424:1
  24345. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24346. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24347. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
  24348. 1268.10 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  24349. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  24350. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  24351. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  24352. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:373:1
  24353. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  24354. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  24355. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:610:1
  24356. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24357. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24358. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
  24359. 1268.11 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  24360. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  24361. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  24362. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  24363. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:387:1
  24364. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:554:1
  24365. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  24366. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:624:1
  24367. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24368. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24369. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
  24370. 1268.11 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  24371. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  24372. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  24373. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  24374. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:312:1
  24375. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:315:1
  24376. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  24377. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:332:1
  24378. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  24379. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:354:1
  24380. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24381. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24382. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
  24383. 1268.11 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24384. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  24385. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  24386. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24387. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:301:1
  24388. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:303:1
  24389. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  24390. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:320:1
  24391. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  24392. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:341:1
  24393. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24394. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24395. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
  24396. 1268.11 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  24397. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  24398. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  24399. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  24400. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:431:1
  24401. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:603:1
  24402. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  24403. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:669:1
  24404. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24405. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24406. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
  24407. 1268.11 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  24408. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  24409. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  24410. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  24411. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:445:1
  24412. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:636:1
  24413. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  24414. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:701:1
  24415. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24416. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24417. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
  24418. 1268.11 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24419. 1268.11 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  24420. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  24421. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24422. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24423. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24424. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24425. 1268.11 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24426. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:113:5
  24427. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24428. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24429. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24430. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24431. 1268.11 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  24432. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:373:1
  24433. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  24434. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24435. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24436. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
  24437. 1268.11 s [algebraic-graphs] Warning: 'clique' is ambiguous. It is defined
  24438. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:402:1
  24439. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:569:1
  24440. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24441. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24442. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
  24443. 1268.11 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24444. 1268.11 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  24445. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  24446. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24447. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24448. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24449. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24450. 1268.11 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24451. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:115:5
  24452. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  24453. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24454. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24455. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
  24456. 1268.11 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24457. 1268.11 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  24458. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  24459. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24460. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24461. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24462. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24463. 1268.11 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24464. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:115:5
  24465. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  24466. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24467. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24468. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
  24469. 1268.11 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24470. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:113:5
  24471. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24472. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24473. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24474. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24475. 1268.11 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  24476. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:373:1
  24477. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  24478. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24479. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24480. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
  24481. 1268.11 s [algebraic-graphs] Warning: 'clique' is ambiguous. It is defined
  24482. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:402:1
  24483. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:569:1
  24484. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24485. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24486. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
  24487. 1268.11 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24488. 1268.11 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24489. 1268.11 s [algebraic-graphs] Missing documentation for:
  24490. 1268.11 s [algebraic-graphs] Module header
  24491. 1268.11 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24492. 1268.11 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  24493. 1268.11 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  24494. 1268.11 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  24495. 1268.11 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  24496. 1268.11 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  24497. 1268.11 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  24498. 1268.11 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  24499. 1268.11 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  24500. 1268.11 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  24501. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24502. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24503. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  24504. 1268.11 s [algebraic-graphs] Warning: 'array' is out of scope.
  24505. 1268.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24506. 1268.12 s [algebraic-graphs] Warning: 'fromAdjacencyMap' is ambiguous. It is defined
  24507. 1268.12 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:222:1
  24508. 1268.12 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:60:1
  24509. 1268.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24510. 1268.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24511. 1268.12 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:60:1
  24512. 1268.12 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  24513. 1268.12 s [algebraic-graphs] * in ‘GHC.Base’
  24514. 1268.12 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  24515. 1268.12 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24516. 1268.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24517. 1268.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24518. 1268.12 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  24519. 1268.12 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24520. 1268.12 s [algebraic-graphs] Missing documentation for:
  24521. 1268.12 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  24522. 1268.43 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  24523. 1268.43 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  24524. 1268.43 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24525. 1268.43 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24526. 1268.44 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  24527. 1268.44 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  24528. 1268.44 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24529. 1268.44 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24530. 1268.44 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  24531. 1268.44 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  24532. 1268.45 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  24533. 1268.45 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  24534. 1268.45 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24535. 1268.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24536. 1268.46 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  24537. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  24538. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  24539. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  24540. 1268.46 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  24541. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  24542. 1268.46 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  24543. 1268.46 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  24544. 1268.46 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  24545. 1268.47 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  24546. 1268.47 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  24547. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24548. 1268.47 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  24549. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24550. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24551. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24552. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24553. 1268.47 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24554. 1268.47 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24555. 1268.47 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24556. 1268.47 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24557. 1268.47 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24558. 1268.48 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  24559. 1268.48 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24560. 1268.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24561. 1268.48 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  24562. 1268.48 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24563. 1268.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24564. 1268.49 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  24565. 1268.49 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24566. 1268.49 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  24567. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24568. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  24569. 1268.49 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24570. 1268.49 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24571. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24572. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  24573. 1268.49 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24574. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  24575. 1268.50 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  24576. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24577. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  24578. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  24579. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  24580. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  24581. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  24582. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  24583. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24584. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24585. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24586. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24587. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24588. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24589. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24590. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24591. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24592. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24593. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24594. 1268.50 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24595. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  24596. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24597. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  24598. 1268.51 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24599. 1268.51 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  24600. 1268.51 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24601. 1268.51 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  24602. 1268.51 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24603. 1271.86 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  24604. 1272.29 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24605. 1272.29 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24606. 1272.29 s [algebraic-graphs] Phase: installPhase
  24607. 1272.29 s [algebraic-graphs] Installing library in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  24608. 1272.66 s [algebraic-graphs] Phase: fixupPhase
  24609. 1272.68 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  24610. 1272.70 s [algebraic-graphs] shrinking /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSalgebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd-ghc9.8.1.so
  24611. 1272.71 s [algebraic-graphs] checking for references to /build/ in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7...
  24612. 1272.74 s [algebraic-graphs] patching script interpreter paths in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  24613. 1272.74 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib
  24614. 1273.01 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc
  24615. 1273.03 s [algebraic-graphs] checking for references to /build/ in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc...
  24616. 1273.05 s [algebraic-graphs] patching script interpreter paths in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc
  24617. 1273.21 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  24618. 1273.66 s [algebraic-graphs:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  24619. 1273.66 s [algebraic-graphs:post-build]
  24620. 1274.03 s [algebraic-graphs:post-build] Pushing /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc (10.46 MiB)
  24621. 1274.09 s [algebraic-graphs:post-build] Pushing /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7 (24.51 MiB)
  24622. 1275.29 s [algebraic-graphs:post-build]
  24623. 1275.29 s [algebraic-graphs:post-build] All done.
  24624. 1275.31 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  24625. 1275.36 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24626. 1275.37 s [algebraic-graphs:post-build] copying 2 paths...
  24627. 1275.37 s [algebraic-graphs:post-build] copying path '/nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24628. 1277.46 s [algebraic-graphs:post-build] copying path '/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24629. 1285.45 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24630. 1285.73 s [algebraic-graphs:post-build] copying 1 paths...
  24631. 1285.77 s [algebraic-graphs:post-build] copying path '/nix/store/95fb9gb6crg1i0pfri43y25jsra3fcj4-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  24632. 1286.40 s Progress: 41 of 46 built
  24633. 1286.44 s Building /nix/store/vd1nbpw17vdqfdymk5kgg64cavs7xqx8-algebraic-graph-duoids-0.0.1.0.drv
  24634. 1286.59 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  24635. 1286.60 s [algebraic-graph-duoids] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  24636. 1286.80 s [algebraic-graph-duoids] Phase: unpackPhase
  24637. 1286.81 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  24638. 1286.82 s [algebraic-graph-duoids] source root is algebraic-graphs
  24639. 1286.83 s [algebraic-graph-duoids] Phase: patchPhase
  24640. 1286.83 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  24641. 1286.84 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.dyirN2rqFf/setup-package.conf.d -threaded
  24642. 1286.89 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.dyirN2rqFf/Main.o )
  24643. 1286.94 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  24644. 1288.35 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  24645. 1288.36 s [algebraic-graph-duoids] Phase: configurePhase
  24646. 1288.36 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.dyirN2rqFf/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
  24647. 1288.37 s [algebraic-graph-duoids] Using Parsec parser
  24648. 1288.37 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  24649. 1288.67 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  24650. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24651. 1288.89 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24652. 1288.89 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.0.0
  24653. 1288.89 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  24654. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24655. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24656. 1288.89 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24657. 1288.89 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.0.0
  24658. 1288.89 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  24659. 1288.89 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  24660. 1288.89 s [algebraic-graph-duoids] hedgehog-1.5
  24661. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24662. 1288.89 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24663. 1288.89 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.0.0
  24664. 1288.89 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  24665. 1288.89 s [algebraic-graph-duoids] <0.25: using doctest-0.22.6
  24666. 1288.89 s [algebraic-graph-duoids] Source component graph:
  24667. 1288.89 s [algebraic-graph-duoids] component lib
  24668. 1288.89 s [algebraic-graph-duoids] component test:doctests dependency lib
  24669. 1288.89 s [algebraic-graph-duoids] component test:laws dependency lib
  24670. 1288.89 s [algebraic-graph-duoids] Configured component graph:
  24671. 1288.89 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24672. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  24673. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  24674. 1288.89 s [algebraic-graph-duoids] include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  24675. 1288.89 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
  24676. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24677. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  24678. 1288.89 s [algebraic-graph-duoids] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  24679. 1288.89 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
  24680. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24681. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  24682. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  24683. 1288.89 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  24684. 1288.89 s [algebraic-graph-duoids] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  24685. 1288.89 s [algebraic-graph-duoids] Linked component graph:
  24686. 1288.89 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24687. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  24688. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  24689. 1288.89 s [algebraic-graph-duoids] include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  24690. 1288.89 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev:Algebra.Graph.Duoid.Orphans
  24691. 1288.89 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
  24692. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24693. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  24694. 1288.89 s [algebraic-graph-duoids] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  24695. 1288.89 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
  24696. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24697. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  24698. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  24699. 1288.89 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  24700. 1288.89 s [algebraic-graph-duoids] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  24701. 1288.89 s [algebraic-graph-duoids] Ready component graph:
  24702. 1288.89 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24703. 1288.89 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  24704. 1288.89 s [algebraic-graph-duoids] depends base-4.19.0.0-b960
  24705. 1288.89 s [algebraic-graph-duoids] depends duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  24706. 1288.89 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
  24707. 1288.89 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24708. 1288.89 s [algebraic-graph-duoids] depends base-4.19.0.0-b960
  24709. 1288.89 s [algebraic-graph-duoids] depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  24710. 1288.89 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
  24711. 1288.89 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24712. 1288.89 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  24713. 1288.89 s [algebraic-graph-duoids] depends base-4.19.0.0-b960
  24714. 1288.89 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  24715. 1288.89 s [algebraic-graph-duoids] depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  24716. 1288.89 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.8
  24717. 1288.89 s [algebraic-graph-duoids] Using compiler: ghc-9.8.1
  24718. 1288.89 s [algebraic-graph-duoids] Using install prefix:
  24719. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
  24720. 1288.89 s [algebraic-graph-duoids] Executables installed in:
  24721. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/bin
  24722. 1288.89 s [algebraic-graph-duoids] Libraries installed in:
  24723. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24724. 1288.89 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  24725. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
  24726. 1288.89 s [algebraic-graph-duoids] Private executables installed in:
  24727. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0
  24728. 1288.89 s [algebraic-graph-duoids] Data files installed in:
  24729. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0
  24730. 1288.89 s [algebraic-graph-duoids] Documentation installed in:
  24731. 1288.89 s [algebraic-graph-duoids] /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  24732. 1288.89 s [algebraic-graph-duoids] Configuration files installed in:
  24733. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/etc
  24734. 1288.89 s [algebraic-graph-duoids] No alex found
  24735. 1288.89 s [algebraic-graph-duoids] Using ar found on system at:
  24736. 1288.89 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  24737. 1288.89 s [algebraic-graph-duoids] No c2hs found
  24738. 1288.89 s [algebraic-graph-duoids] No cpphs found
  24739. 1288.89 s [algebraic-graph-duoids] Using doctest version 0.22.6 found on system at:
  24740. 1288.89 s [algebraic-graph-duoids] /nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
  24741. 1288.89 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  24742. 1288.89 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  24743. 1288.89 s [algebraic-graph-duoids] Using ghc version 9.8.1 found on system at:
  24744. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  24745. 1288.89 s [algebraic-graph-duoids] Using ghc-pkg version 9.8.1 found on system at:
  24746. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  24747. 1288.89 s [algebraic-graph-duoids] No ghcjs found
  24748. 1288.89 s [algebraic-graph-duoids] No ghcjs-pkg found
  24749. 1288.89 s [algebraic-graph-duoids] No greencard found
  24750. 1288.89 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  24751. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  24752. 1288.89 s [algebraic-graph-duoids] No happy found
  24753. 1288.89 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  24754. 1288.89 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  24755. 1288.89 s [algebraic-graph-duoids] No hmake found
  24756. 1288.89 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  24757. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  24758. 1288.89 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  24759. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  24760. 1288.89 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  24761. 1288.89 s [algebraic-graph-duoids] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  24762. 1288.89 s [algebraic-graph-duoids] No jhc found
  24763. 1288.89 s [algebraic-graph-duoids] Using ld found on system at:
  24764. 1288.89 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  24765. 1288.89 s [algebraic-graph-duoids] No pkg-config found
  24766. 1288.89 s [algebraic-graph-duoids] Using runghc version 9.8.1 found on system at:
  24767. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  24768. 1288.89 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  24769. 1288.89 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  24770. 1288.89 s [algebraic-graph-duoids] Using tar found on system at:
  24771. 1288.89 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  24772. 1288.89 s [algebraic-graph-duoids] No uhc found
  24773. 1289.02 s [algebraic-graph-duoids] Phase: buildPhase
  24774. 1289.36 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24775. 1289.36 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  24776. 1289.42 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  24777. 1289.52 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  24778. 1290.46 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  24779. 1290.62 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  24780. 1292.55 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24781. 1292.55 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24782. 1292.64 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  24783. 1292.97 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  24784. 1293.31 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  24785. 1296.97 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24786. 1296.97 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24787. 1297.02 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  24788. 1297.36 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  24789. 1298.30 s [algebraic-graph-duoids] Phase: checkPhase
  24790. 1298.56 s [algebraic-graph-duoids] Running 2 test suites...
  24791. 1298.56 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  24792. 1298.96 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  24793. 1298.99 s [algebraic-graph-duoids] Test suite doctests: PASS
  24794. 1298.99 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  24795. 1298.99 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  24796. 1298.99 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  24797. 1299.00 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  24798. 1299.01 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  24799. 1299.01 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  24800. 1299.01 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  24801. 1299.01 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  24802. 1299.01 s [algebraic-graph-duoids] ✓ 5 succeeded.
  24803. 1299.01 s [algebraic-graph-duoids] Test suite laws: PASS
  24804. 1299.01 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  24805. 1299.01 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  24806. 1299.02 s [algebraic-graph-duoids] Phase: haddockPhase
  24807. 1299.14 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24808. 1299.14 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  24809. 1299.26 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  24810. 1299.28 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  24811. 1299.40 s [algebraic-graph-duoids] Haddock coverage:
  24812. 1299.40 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  24813. 1299.40 s [algebraic-graph-duoids] Missing documentation for:
  24814. 1299.40 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:24)
  24815. 1299.40 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27)
  24816. 1299.40 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:30)
  24817. 1299.40 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:33)
  24818. 1299.40 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  24819. 1301.81 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  24820. 1301.81 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  24821. 1301.87 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24822. 1301.87 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24823. 1301.87 s [algebraic-graph-duoids] Phase: installPhase
  24824. 1301.94 s [algebraic-graph-duoids] Installing library in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  24825. 1302.14 s [algebraic-graph-duoids] Phase: fixupPhase
  24826. 1302.16 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
  24827. 1302.16 s [algebraic-graph-duoids] shrinking /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSalgebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev-ghc9.8.1.so
  24828. 1302.17 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0...
  24829. 1302.17 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
  24830. 1302.18 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib
  24831. 1302.22 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  24832. 1302.22 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc...
  24833. 1302.23 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  24834. 1302.34 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  24835. 1302.81 s [algebraic-graph-duoids:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  24836. 1302.81 s [algebraic-graph-duoids:post-build]
  24837. 1303.17 s [algebraic-graph-duoids:post-build] Pushing /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 (1.17 MiB)
  24838. 1303.25 s [algebraic-graph-duoids:post-build] Pushing /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc (523.23 KiB)
  24839. 1304.35 s [algebraic-graph-duoids:post-build]
  24840. 1304.35 s [algebraic-graph-duoids:post-build] All done.
  24841. 1304.38 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  24842. 1304.43 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24843. 1304.45 s [algebraic-graph-duoids:post-build] copying 2 paths...
  24844. 1304.45 s [algebraic-graph-duoids:post-build] copying path '/nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  24845. 1304.88 s [algebraic-graph-duoids:post-build] copying path '/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  24846. 1305.44 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24847. 1305.71 s [algebraic-graph-duoids:post-build] copying 1 paths...
  24848. 1305.71 s [algebraic-graph-duoids:post-build] copying path '/nix/store/vd1nbpw17vdqfdymk5kgg64cavs7xqx8-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  24849. 1306.06 s Progress: 42 of 46 built
  24850. 1306.11 s Building /nix/store/azlq3lij05jhzf277wwsgpv2b517ygd8-ghc-9.8.1-with-packages.drv
  24851. 1306.16 s [ghc-9.8.1-with-packages] /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/nix-support:
  24852. 1306.16 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24853. 1306.17 s [ghc-9.8.1-with-packages] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/nix-support:
  24854. 1306.17 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24855. 1306.17 s [ghc-9.8.1-with-packages] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/nix-support:
  24856. 1306.17 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24857. 1306.18 s [ghc-9.8.1-with-packages] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/nix-support:
  24858. 1306.18 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24859. 1306.18 s [ghc-9.8.1-with-packages] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/nix-support:
  24860. 1306.18 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24861. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/nix-support:
  24862. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24863. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/b3f8c6alnwzazpxal53mis3355qcpfs6-ansi-terminal-1.1.2/nix-support:
  24864. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24865. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/b3f8c6alnwzazpxal53mis3355qcpfs6-ansi-terminal-1.1.2/nix-support:
  24866. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24867. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/yffb2fyahw5l2b1spp6qzixkkq4qccny-async-2.2.5/nix-support:
  24868. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24869. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/yffb2fyahw5l2b1spp6qzixkkq4qccny-async-2.2.5/nix-support:
  24870. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24871. 1306.20 s [ghc-9.8.1-with-packages] /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/nix-support:
  24872. 1306.20 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24873. 1306.20 s [ghc-9.8.1-with-packages] /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/nix-support:
  24874. 1306.20 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24875. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/nix-support:
  24876. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24877. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/nix-support:
  24878. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24879. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/nix-support:
  24880. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24881. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/nix-support:
  24882. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24883. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/chsh8byjnibabpdjikj6klc0mcfg7h51-mmorph-1.2.0/nix-support:
  24884. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24885. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/chsh8byjnibabpdjikj6klc0mcfg7h51-mmorph-1.2.0/nix-support:
  24886. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24887. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/nix-support:
  24888. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24889. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/nix-support:
  24890. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24891. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/f74gslln4agdd8q1m0yl10f9blclxwa5-pretty-show-1.10/nix-support:
  24892. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24893. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/f74gslln4agdd8q1m0yl10f9blclxwa5-pretty-show-1.10/nix-support:
  24894. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24895. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/hvypiz5gf5afp4rscfw2z76yvnh5a2vy-primitive-0.9.1.0/nix-support:
  24896. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24897. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/hvypiz5gf5afp4rscfw2z76yvnh5a2vy-primitive-0.9.1.0/nix-support:
  24898. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24899. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/zl44xqm0pxy2zbkr4xqgfmb0ijrhmmlh-random-1.2.1.3/nix-support:
  24900. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24901. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/zl44xqm0pxy2zbkr4xqgfmb0ijrhmmlh-random-1.2.1.3/nix-support:
  24902. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24903. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/nix-support:
  24904. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24905. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/nix-support:
  24906. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24907. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/nix-support:
  24908. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24909. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/nix-support:
  24910. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24911. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/nix-support:
  24912. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24913. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/nix-support:
  24914. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24915. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/nix-support:
  24916. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24917. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/nix-support:
  24918. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24919. 1306.25 s [ghc-9.8.1-with-packages] /nix/store/v12w7ab6kncc5ipndqxa6fcrybrszlfx-ansi-terminal-types-1.1/nix-support:
  24920. 1306.25 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24921. 1306.25 s [ghc-9.8.1-with-packages] /nix/store/v12w7ab6kncc5ipndqxa6fcrybrszlfx-ansi-terminal-types-1.1/nix-support:
  24922. 1306.25 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24923. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/xcphpq6p9nzaw7jfppn10cqi7vpg7min-hashable-1.4.7.0/nix-support:
  24924. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24925. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/xcphpq6p9nzaw7jfppn10cqi7vpg7min-hashable-1.4.7.0/nix-support:
  24926. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24927. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/nix-support:
  24928. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24929. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/nix-support:
  24930. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24931. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/b01ixa73fb5yvc1yghs9jc3fsxk1p52q-constraints-0.14.2/nix-support:
  24932. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24933. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/b01ixa73fb5yvc1yghs9jc3fsxk1p52q-constraints-0.14.2/nix-support:
  24934. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24935. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/nix-support:
  24936. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24937. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/nix-support:
  24938. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24939. 1306.28 s [ghc-9.8.1-with-packages] /nix/store/nnn8i7zj6v0jk9yzk9cblqz689wl4r98-transformers-compat-0.7.2/nix-support:
  24940. 1306.28 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24941. 1306.28 s [ghc-9.8.1-with-packages] /nix/store/nnn8i7zj6v0jk9yzk9cblqz689wl4r98-transformers-compat-0.7.2/nix-support:
  24942. 1306.28 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24943. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/f03a08rpf8c4ha3iwv37h6a5aj3pnim5-splitmix-0.1.1/nix-support:
  24944. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24945. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/f03a08rpf8c4ha3iwv37h6a5aj3pnim5-splitmix-0.1.1/nix-support:
  24946. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24947. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/a93x45v7px1mi26b5bdqa6w7kfg0xjqf-unliftio-core-0.2.1.0/nix-support:
  24948. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24949. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/a93x45v7px1mi26b5bdqa6w7kfg0xjqf-unliftio-core-0.2.1.0/nix-support:
  24950. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24951. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/nix-support:
  24952. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24953. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/nix-support:
  24954. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24955. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/1pdz8ayjwx6x3qqn2pbp4g83dzrv1v7a-os-string-2.0.7/nix-support:
  24956. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24957. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/1pdz8ayjwx6x3qqn2pbp4g83dzrv1v7a-os-string-2.0.7/nix-support:
  24958. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24959. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/nyyds8a3nis8rpi8prn83l69mgfhz5sj-tagged-0.8.8/nix-support:
  24960. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24961. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/nyyds8a3nis8rpi8prn83l69mgfhz5sj-tagged-0.8.8/nix-support:
  24962. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24963. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/sg5m2ghn81wwf9af7yq2r5hs50n74r88-boring-0.2.2/nix-support:
  24964. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24965. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/sg5m2ghn81wwf9af7yq2r5hs50n74r88-boring-0.2.2/nix-support:
  24966. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24967. 1306.94 s [ghc-9.8.1-with-packages] Warning: include-dirs: /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages/lib/ghc-9.8.1/lib/../lib/x86_64-linux-ghc-9.8.1/directory-1.3.8.1-6a8e/include doesn't exist or isn't a directory
  24968. 1308.10 s [ghc-9.8.1-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages
  24969. 1308.86 s [ghc-9.8.1-with-packages:post-build] Pushing 1 paths (140 are already present) using zstd to cache sellout ⏳
  24970. 1308.86 s [ghc-9.8.1-with-packages:post-build]
  24971. 1309.21 s [ghc-9.8.1-with-packages:post-build] Pushing /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages (4.32 MiB)
  24972. 1310.98 s [ghc-9.8.1-with-packages:post-build]
  24973. 1311.06 s [ghc-9.8.1-with-packages:post-build] All done.
  24974. 1311.06 s [ghc-9.8.1-with-packages:post-build] Uploading to the NixCI cache: /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages
  24975. 1311.09 s [ghc-9.8.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24976. 1311.42 s [ghc-9.8.1-with-packages:post-build] copying 1 paths...
  24977. 1311.42 s [ghc-9.8.1-with-packages:post-build] copying path '/nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages' to 'https://cache.nix-ci.com'...
  24978. 1312.91 s [ghc-9.8.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1313.18 s [ghc-9.8.1-with-packages:post-build] copying 1 paths...
  24980. 1313.18 s [ghc-9.8.1-with-packages:post-build] copying path '/nix/store/azlq3lij05jhzf277wwsgpv2b517ygd8-ghc-9.8.1-with-packages.drv' to 'https://cache.nix-ci.com'...
  24981. 1313.46 s Progress: 43 of 45 built
  24982. 1313.51 s Building /nix/store/h2krq8wfacscrny1i2gxiwk8cdrj957m-all-packages.drv
  24983. 1313.58 s [all-packages] created 3 symlinks in user environment
  24984. 1313.62 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages
  24985. 1314.11 s [all-packages:post-build] Pushing 1 paths (141 are already present) using zstd to cache sellout ⏳
  24986. 1314.11 s [all-packages:post-build]
  24987. 1314.46 s [all-packages:post-build] Pushing /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages (872.00 B)
  24988. 1315.44 s [all-packages:post-build]
  24989. 1315.44 s [all-packages:post-build] All done.
  24990. 1315.46 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages
  24991. 1315.51 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1315.88 s [all-packages:post-build] copying 1 paths...
  24993. 1315.88 s [all-packages:post-build] copying path '/nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages' to 'https://cache.nix-ci.com'...
  24994. 1316.33 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1316.63 s [all-packages:post-build] copying 1 paths...
  24996. 1316.63 s [all-packages:post-build] copying path '/nix/store/h2krq8wfacscrny1i2gxiwk8cdrj957m-all-packages.drv' to 'https://cache.nix-ci.com'...
  24997. 1317.01 s Progress: 44 of 45 built
  24998. 1317.01 s Progress: 45 of 45 built
  24999. 1317.01 s /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages
  25000. 1317.09 s Build succeeded.
Tail Raw Logs