build packages.x86_64-linux.ghc9121_all

Reproduce this run
  1. 593.14 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  2. 593.14 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  3. 593.14 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  4. 593.14 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  5. 593.14 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  6. 593.14 s [algebraic-graphs]
  7. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  8. 593.14 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  9. 593.14 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  10. 593.14 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  11. 593.14 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  12. 593.14 s [algebraic-graphs]
  13. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  14. 593.14 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  15. 593.14 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  16. 593.14 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  17. 593.14 s [algebraic-graphs]
  18. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  19. 596.02 s [algebraic-graphs] OK: overlays1 [x] == x
  20. 596.02 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  21. 596.02 s [algebraic-graphs]
  22. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  23. 596.02 s [algebraic-graphs] OK: connects1 [x] == x
  24. 596.02 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  25. 596.02 s [algebraic-graphs]
  26. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  27. 596.02 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  28. 596.02 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  29. 596.02 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  30. 596.02 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  31. 596.02 s [algebraic-graphs]
  32. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  33. 596.02 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  34. 596.02 s [algebraic-graphs]
  35. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  36. 596.02 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  37. 596.02 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  38. 596.02 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  39. 596.02 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  40. 596.02 s [algebraic-graphs]
  41. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  42. 596.02 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  43. 596.02 s [algebraic-graphs] OK: vertexCount x >= 1
  44. 596.02 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  45. 596.02 s [algebraic-graphs]
  46. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  47. 596.02 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  48. 596.02 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  49. 596.02 s [algebraic-graphs] OK: edgeCount == length . edgeList
  50. 596.02 s [algebraic-graphs]
  51. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  52. 596.02 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  53. 596.02 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  54. 596.02 s [algebraic-graphs]
  55. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  56. 596.02 s [algebraic-graphs] OK: edgeList (vertex x) == []
  57. 596.02 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  58. 596.02 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  59. 596.02 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  60. 596.02 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  61. 596.02 s [algebraic-graphs]
  62. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  63. 596.02 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  64. 596.02 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  65. 596.02 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  66. 596.02 s [algebraic-graphs]
  67. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  68. 596.02 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  69. 596.02 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  70. 596.02 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  71. 596.02 s [algebraic-graphs]
  72. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  73. 596.02 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  74. 596.02 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  75. 596.02 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  76. 596.02 s [algebraic-graphs]
  77. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  78. 596.02 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  79. 596.02 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  80. 596.02 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  81. 596.02 s [algebraic-graphs]
  82. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  83. 596.02 s [algebraic-graphs] OK: path1 [x] == vertex x
  84. 596.02 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  85. 596.02 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  86. 596.02 s [algebraic-graphs]
  87. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  88. 596.02 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  89. 596.02 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  90. 596.02 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  91. 596.02 s [algebraic-graphs]
  92. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  93. 596.02 s [algebraic-graphs] OK: clique1 [x] == vertex x
  94. 596.02 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  95. 596.02 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  96. 596.02 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  97. 596.02 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  98. 596.02 s [algebraic-graphs]
  99. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  100. 596.02 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  101. 596.02 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  102. 596.02 s [algebraic-graphs]
  103. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  104. 596.02 s [algebraic-graphs] OK: star x [] == vertex x
  105. 596.02 s [algebraic-graphs] OK: star x [y] == edge x y
  106. 596.02 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  107. 596.02 s [algebraic-graphs]
  108. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  109. 596.02 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  110. 596.02 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  111. 596.02 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  112. 596.02 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  113. 596.02 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  114. 596.02 s [algebraic-graphs]
  115. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  116. 596.02 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  117. 596.02 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  118. 596.02 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  119. 596.02 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  120. 596.02 s [algebraic-graphs]
  121. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  122. 596.02 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  123. 596.02 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  124. 596.02 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  125. 596.02 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  126. 596.02 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  127. 596.02 s [algebraic-graphs]
  128. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  129. 596.02 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  130. 596.02 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  131. 596.02 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  132. 596.02 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  133. 596.02 s [algebraic-graphs]
  134. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  135. 596.02 s [algebraic-graphs] OK: replaceVertex x x == id
  136. 596.02 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  137. 596.02 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  138. 596.02 s [algebraic-graphs]
  139. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  140. 596.02 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  141. 596.02 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  142. 596.02 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  143. 596.02 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  144. 596.02 s [algebraic-graphs]
  145. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  146. 596.02 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  147. 596.02 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  148. 596.02 s [algebraic-graphs] OK: transpose . transpose == id
  149. 596.02 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  150. 596.02 s [algebraic-graphs]
  151. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  152. 596.02 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  153. 596.02 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  154. 596.02 s [algebraic-graphs] OK: gmap id == id
  155. 596.02 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  156. 596.02 s [algebraic-graphs]
  157. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  158. 596.02 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  159. 596.02 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  160. 596.02 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  161. 596.02 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  162. 596.02 s [algebraic-graphs]
  163. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  164. 596.02 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  165. 596.02 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  166. 596.02 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  167. 596.02 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  168. 596.02 s [algebraic-graphs]
  169. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  170. 596.02 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  171. 596.02 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  172. 596.02 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  173. 596.02 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  174. 596.02 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  175. 596.02 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  176. 596.02 s [algebraic-graphs] OK: closure . closure == closure
  177. 596.02 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  178. 596.02 s [algebraic-graphs]
  179. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  180. 596.02 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  181. 596.02 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  182. 596.02 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  183. 596.02 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  184. 596.02 s [algebraic-graphs]
  185. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  186. 596.02 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  187. 596.02 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  188. 596.02 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  189. 596.02 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  190. 596.02 s [algebraic-graphs]
  191. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  192. 596.02 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  193. 596.02 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  194. 596.02 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  195. 596.02 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  196. 596.02 s [algebraic-graphs]
  197. 596.02 s [algebraic-graphs] ============ NonEmpty.Graph.============
  198. 596.02 s [algebraic-graphs] OK: Axioms of non-empty graphs
  199. 596.02 s [algebraic-graphs] OK: Theorems of non-empty graphs
  200. 596.02 s [algebraic-graphs]
  201. 596.02 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  202. 596.02 s [algebraic-graphs] OK: vertex 1 < vertex 2
  203. 596.02 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  204. 596.02 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  205. 596.02 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  206. 596.02 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  207. 596.02 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  208. 596.02 s [algebraic-graphs] OK: x <= x + y
  209. 596.02 s [algebraic-graphs] OK: x + y <= x * y
  210. 596.02 s [algebraic-graphs]
  211. 596.02 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  212. 596.02 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  213. 596.02 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  214. 596.02 s [algebraic-graphs] OK: fmap id == id
  215. 596.02 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  216. 596.02 s [algebraic-graphs]
  217. 596.02 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  218. 596.02 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  219. 597.52 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  220. 597.52 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  221. 597.52 s [algebraic-graphs] OK: (x >>= vertex) == x
  222. 597.52 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  223. 597.52 s [algebraic-graphs]
  224. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  225. 597.52 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  226. 597.52 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  227. 597.52 s [algebraic-graphs]
  228. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  229. 597.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  230. 597.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  231. 597.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  232. 597.52 s [algebraic-graphs] OK: size (vertex x) == 1
  233. 597.52 s [algebraic-graphs]
  234. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  235. 597.52 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  236. 597.52 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  237. 597.52 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  238. 597.52 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  239. 597.52 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  240. 597.52 s [algebraic-graphs]
  241. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  242. 597.52 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  243. 597.52 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  244. 597.52 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  245. 597.52 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  246. 597.53 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  247. 597.53 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  248. 597.53 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  249. 597.53 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  250. 597.53 s [algebraic-graphs]
  251. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  252. 597.53 s [algebraic-graphs] OK: overlay1 empty x == x
  253. 597.53 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  254. 597.53 s [algebraic-graphs]
  255. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  256. 597.53 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  257. 597.53 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  258. 597.53 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  259. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  260. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  261. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  262. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  263. 597.53 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  264. 597.53 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  265. 597.53 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  266. 597.53 s [algebraic-graphs]
  267. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  268. 597.53 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  269. 597.53 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  270. 597.53 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  271. 597.53 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  272. 597.53 s [algebraic-graphs]
  273. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  274. 597.53 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  275. 597.53 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  276. 597.53 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  277. 597.53 s [algebraic-graphs]
  278. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  279. 597.53 s [algebraic-graphs] OK: overlays1 [x] == x
  280. 597.53 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  281. 597.53 s [algebraic-graphs]
  282. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  283. 597.53 s [algebraic-graphs] OK: connects1 [x] == x
  284. 597.53 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  285. 597.53 s [algebraic-graphs]
  286. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  287. 597.53 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  288. 597.53 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  289. 597.53 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  290. 597.53 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  291. 597.53 s [algebraic-graphs]
  292. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  293. 597.53 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  294. 597.53 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  295. 597.53 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  296. 597.53 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  297. 597.53 s [algebraic-graphs]
  298. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  299. 597.53 s [algebraic-graphs] OK: x === x == True
  300. 597.53 s [algebraic-graphs] OK: x + y === x + y == True
  301. 597.53 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  302. 597.53 s [algebraic-graphs] OK: x + y === x * y == False
  303. 597.53 s [algebraic-graphs]
  304. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  305. 597.53 s [algebraic-graphs] OK: size (vertex x) == 1
  306. 597.53 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  307. 597.53 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  308. 597.53 s [algebraic-graphs] OK: size x >= 1
  309. 597.53 s [algebraic-graphs] OK: size x >= vertexCount x
  310. 597.53 s [algebraic-graphs]
  311. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  312. 597.53 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  313. 597.53 s [algebraic-graphs]
  314. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  315. 597.53 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  316. 597.53 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  317. 597.53 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  318. 597.53 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  319. 597.53 s [algebraic-graphs]
  320. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  321. 597.53 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  322. 597.53 s [algebraic-graphs] OK: vertexCount x >= 1
  323. 597.53 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  324. 597.53 s [algebraic-graphs]
  325. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  326. 597.53 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  327. 597.53 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  328. 597.53 s [algebraic-graphs] OK: edgeCount == length . edgeList
  329. 597.53 s [algebraic-graphs]
  330. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  331. 597.53 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  332. 597.53 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  333. 597.53 s [algebraic-graphs]
  334. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  335. 597.53 s [algebraic-graphs] OK: edgeList (vertex x) == []
  336. 597.53 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  337. 597.53 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  338. 597.53 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  339. 597.53 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  340. 597.53 s [algebraic-graphs]
  341. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  342. 597.53 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  343. 597.53 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  344. 597.53 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  345. 597.53 s [algebraic-graphs]
  346. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  347. 597.53 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  348. 597.53 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  349. 597.53 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  350. 597.53 s [algebraic-graphs]
  351. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  352. 597.53 s [algebraic-graphs] OK: path1 [x] == vertex x
  353. 597.53 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  354. 597.53 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  355. 597.53 s [algebraic-graphs]
  356. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  357. 597.53 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  358. 597.53 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  359. 597.53 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  360. 597.53 s [algebraic-graphs]
  361. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  362. 597.53 s [algebraic-graphs] OK: clique1 [x] == vertex x
  363. 597.53 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  364. 597.53 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  365. 597.53 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  366. 597.53 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  367. 597.53 s [algebraic-graphs]
  368. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  369. 597.53 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  370. 597.53 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  371. 597.53 s [algebraic-graphs]
  372. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  373. 597.53 s [algebraic-graphs] OK: star x [] == vertex x
  374. 597.53 s [algebraic-graphs] OK: star x [y] == edge x y
  375. 597.53 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  376. 597.53 s [algebraic-graphs]
  377. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  378. 597.53 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  379. 597.53 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  380. 597.53 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  381. 597.53 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  382. 597.53 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  383. 597.53 s [algebraic-graphs]
  384. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  385. 597.53 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  386. 597.53 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  387. 597.53 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  388. 597.53 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  389. 597.53 s [algebraic-graphs]
  390. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  391. 597.53 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  392. 597.53 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  393. 597.53 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  394. 597.53 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  395. 597.53 s [algebraic-graphs]
  396. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  397. 597.53 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  398. 597.53 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  399. 597.53 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  400. 597.53 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  401. 597.53 s [algebraic-graphs]
  402. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  403. 597.53 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  404. 597.53 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  405. 597.53 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  406. 597.53 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  407. 597.53 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  408. 597.53 s [algebraic-graphs]
  409. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  410. 597.53 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  411. 597.53 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  412. 597.53 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  413. 597.53 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  414. 597.53 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  415. 597.53 s [algebraic-graphs]
  416. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  417. 597.53 s [algebraic-graphs] OK: replaceVertex x x == id
  418. 597.53 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  419. 597.53 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  420. 597.53 s [algebraic-graphs]
  421. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  422. 597.53 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  423. 604.83 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  424. 604.83 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  425. 604.87 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  426. 604.87 s [algebraic-graphs]
  427. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  428. 604.87 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  429. 604.87 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  430. 604.87 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  431. 604.87 s [algebraic-graphs]
  432. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  433. 604.87 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  434. 604.87 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  435. 604.87 s [algebraic-graphs] OK: transpose . transpose == id
  436. 604.87 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  437. 604.87 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  438. 604.87 s [algebraic-graphs]
  439. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  440. 604.87 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  441. 604.87 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  442. 604.87 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  443. 604.87 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  444. 604.87 s [algebraic-graphs]
  445. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  446. 604.87 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  447. 604.87 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  448. 604.87 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  449. 604.87 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  450. 604.87 s [algebraic-graphs]
  451. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  452. 604.87 s [algebraic-graphs] OK: simplify == id
  453. 604.87 s [algebraic-graphs] OK: size (simplify x) <= size x
  454. 604.87 s [algebraic-graphs] OK: simplify 1 === 1
  455. 604.87 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  456. 604.87 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  457. 604.87 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  458. 604.87 s [algebraic-graphs]
  459. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  460. 604.87 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  461. 604.87 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  462. 604.87 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  463. 604.87 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  464. 604.87 s [algebraic-graphs]
  465. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  466. 604.87 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  467. 604.87 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  468. 604.87 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  469. 604.87 s [algebraic-graphs]
  470. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  471. 604.87 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  472. 604.87 s [algebraic-graphs] OK: box x y ~~ box y x
  473. 604.87 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  474. 604.87 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  475. 604.87 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  476. 604.87 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  477. 604.87 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  478. 604.87 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  479. 604.87 s [algebraic-graphs]
  480. 604.87 s [algebraic-graphs] ============ Relation ============
  481. 604.87 s [algebraic-graphs] OK: Axioms of graphs
  482. 604.87 s [algebraic-graphs]
  483. 604.87 s [algebraic-graphs] ============ Relation.consistent ============
  484. 604.87 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  485. 604.87 s [algebraic-graphs]
  486. 604.87 s [algebraic-graphs] OK: consistent empty == True
  487. 604.87 s [algebraic-graphs] OK: consistent (vertex x) == True
  488. 604.87 s [algebraic-graphs] OK: consistent (overlay x y) == True
  489. 604.87 s [algebraic-graphs] OK: consistent (connect x y) == True
  490. 604.87 s [algebraic-graphs] OK: consistent (edge x y) == True
  491. 604.87 s [algebraic-graphs] OK: consistent (edges xs) == True
  492. 604.87 s [algebraic-graphs] OK: consistent (stars xs) == True
  493. 604.87 s [algebraic-graphs]
  494. 604.87 s [algebraic-graphs] ============ Relation.Show ============
  495. 604.87 s [algebraic-graphs] OK: show (empty ) == "empty"
  496. 604.87 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  497. 604.87 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  498. 604.87 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  499. 604.87 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  500. 604.87 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  501. 604.87 s [algebraic-graphs]
  502. 604.87 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  503. 604.87 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  504. 604.87 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  505. 604.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  506. 604.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  507. 604.87 s [algebraic-graphs]
  508. 604.87 s [algebraic-graphs] ============ Relation.Ord ============
  509. 604.87 s [algebraic-graphs] OK: vertex 1 < vertex 2
  510. 604.87 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  511. 604.87 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  512. 604.87 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  513. 604.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  514. 604.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  515. 604.87 s [algebraic-graphs] OK: x <= x + y
  516. 604.87 s [algebraic-graphs] OK: x + y <= x * y
  517. 604.87 s [algebraic-graphs]
  518. 604.87 s [algebraic-graphs] ============ Relation.empty ============
  519. 604.87 s [algebraic-graphs] OK: isEmpty empty == True
  520. 604.87 s [algebraic-graphs] OK: hasVertex x empty == False
  521. 604.87 s [algebraic-graphs] OK: vertexCount empty == 0
  522. 604.87 s [algebraic-graphs] OK: edgeCount empty == 0
  523. 604.87 s [algebraic-graphs]
  524. 604.87 s [algebraic-graphs] ============ Relation.vertex ============
  525. 604.87 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  526. 604.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  527. 604.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  528. 604.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  529. 604.87 s [algebraic-graphs]
  530. 604.87 s [algebraic-graphs] ============ Relation.edge ============
  531. 604.87 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  532. 604.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  533. 604.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  534. 604.87 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  535. 604.87 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  536. 604.87 s [algebraic-graphs]
  537. 604.87 s [algebraic-graphs] ============ Relation.overlay ============
  538. 604.87 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  539. 604.87 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  540. 604.87 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  541. 604.87 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  542. 604.87 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  543. 604.87 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  544. 604.87 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  545. 604.87 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  546. 604.87 s [algebraic-graphs]
  547. 604.87 s [algebraic-graphs] ============ Relation.connect ============
  548. 604.87 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  549. 604.87 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  550. 604.87 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  551. 604.87 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  552. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  553. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  554. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  555. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  556. 604.87 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  557. 604.87 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  558. 604.87 s [algebraic-graphs]
  559. 604.87 s [algebraic-graphs] ============ Relation.vertices ============
  560. 604.87 s [algebraic-graphs] OK: vertices [] == empty
  561. 604.87 s [algebraic-graphs] OK: vertices [x] == vertex x
  562. 604.87 s [algebraic-graphs] OK: vertices == overlays . map vertex
  563. 604.87 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  564. 604.87 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  565. 604.87 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  566. 604.87 s [algebraic-graphs]
  567. 604.87 s [algebraic-graphs] ============ Relation.edges ============
  568. 604.87 s [algebraic-graphs] OK: edges [] == empty
  569. 604.87 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  570. 604.87 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  571. 604.87 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  572. 604.87 s [algebraic-graphs]
  573. 604.87 s [algebraic-graphs] ============ Relation.overlays ============
  574. 604.87 s [algebraic-graphs] OK: overlays [] == empty
  575. 604.87 s [algebraic-graphs] OK: overlays [x] == x
  576. 604.87 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  577. 604.87 s [algebraic-graphs] OK: overlays == foldr overlay empty
  578. 604.87 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  579. 604.87 s [algebraic-graphs]
  580. 604.87 s [algebraic-graphs] ============ Relation.connects ============
  581. 604.87 s [algebraic-graphs] OK: connects [] == empty
  582. 604.87 s [algebraic-graphs] OK: connects [x] == x
  583. 604.87 s [algebraic-graphs] OK: connects [x,y] == connect x y
  584. 604.87 s [algebraic-graphs] OK: connects == foldr connect empty
  585. 604.87 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  586. 604.87 s [algebraic-graphs]
  587. 604.87 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  588. 604.87 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  589. 604.87 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  590. 604.87 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  591. 604.87 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  592. 604.87 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  593. 604.87 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  594. 604.87 s [algebraic-graphs]
  595. 604.87 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  596. 604.87 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  597. 604.87 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  598. 604.87 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  599. 604.87 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  600. 604.87 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  601. 604.87 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  602. 604.87 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  603. 604.87 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  604. 604.87 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  605. 604.87 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  606. 604.87 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  607. 604.87 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  608. 604.87 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  609. 604.87 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  610. 604.87 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  611. 604.87 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  612. 604.87 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  613. 608.76 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  614. 608.76 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  615. 608.76 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  616. 608.76 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  617. 608.76 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  618. 608.76 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  619. 608.76 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  620. 608.76 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  621. 608.76 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  622. 608.76 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  623. 608.76 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  624. 608.76 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  625. 608.76 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  626. 608.76 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  627. 608.76 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  628. 608.76 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  629. 608.76 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  630. 608.76 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  631. 608.76 s [algebraic-graphs]
  632. 608.76 s [algebraic-graphs] ============ Relation.foldg ============
  633. 608.76 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  634. 608.76 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  635. 608.76 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  636. 608.76 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  637. 608.76 s [algebraic-graphs]
  638. 608.76 s [algebraic-graphs] ============ Relation.isEmpty ============
  639. 608.76 s [algebraic-graphs] OK: isEmpty empty == True
  640. 608.76 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  641. 608.76 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  642. 608.76 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  643. 608.76 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  644. 608.76 s [algebraic-graphs]
  645. 608.76 s [algebraic-graphs] ============ Relation.hasVertex ============
  646. 608.76 s [algebraic-graphs] OK: hasVertex x empty == False
  647. 608.76 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  648. 608.76 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  649. 608.76 s [algebraic-graphs]
  650. 608.76 s [algebraic-graphs] ============ Relation.hasEdge ============
  651. 608.76 s [algebraic-graphs] OK: hasEdge x y empty == False
  652. 608.76 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  653. 608.76 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  654. 608.76 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  655. 608.76 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  656. 608.76 s [algebraic-graphs]
  657. 608.76 s [algebraic-graphs] ============ Relation.vertexCount ============
  658. 608.76 s [algebraic-graphs] OK: vertexCount empty == 0
  659. 608.76 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  660. 608.76 s [algebraic-graphs] OK: vertexCount == length . vertexList
  661. 608.76 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  662. 608.76 s [algebraic-graphs]
  663. 608.76 s [algebraic-graphs] ============ Relation.edgeCount ============
  664. 608.76 s [algebraic-graphs] OK: edgeCount empty == 0
  665. 608.76 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  666. 608.76 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  667. 608.76 s [algebraic-graphs] OK: edgeCount == length . edgeList
  668. 608.76 s [algebraic-graphs]
  669. 608.76 s [algebraic-graphs] ============ Relation.vertexList ============
  670. 608.76 s [algebraic-graphs] OK: vertexList empty == []
  671. 608.76 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  672. 608.76 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  673. 608.76 s [algebraic-graphs]
  674. 608.76 s [algebraic-graphs] ============ Relation.vertexSet ============
  675. 608.76 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  676. 608.76 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  677. 608.76 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  678. 608.76 s [algebraic-graphs]
  679. 608.76 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  680. 608.76 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  681. 608.76 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  682. 608.76 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  683. 608.76 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  684. 608.76 s [algebraic-graphs]
  685. 608.76 s [algebraic-graphs] ============ Relation.edgeList ============
  686. 608.76 s [algebraic-graphs] OK: edgeList empty == []
  687. 608.76 s [algebraic-graphs] OK: edgeList (vertex x) == []
  688. 608.76 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  689. 608.76 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  690. 608.76 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  691. 608.76 s [algebraic-graphs]
  692. 608.76 s [algebraic-graphs] ============ Relation.edgeSet ============
  693. 608.76 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  694. 608.76 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  695. 608.76 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  696. 608.76 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  697. 608.76 s [algebraic-graphs]
  698. 608.76 s [algebraic-graphs] ============ Relation.adjacencyList ============
  699. 608.76 s [algebraic-graphs] OK: adjacencyList empty == []
  700. 608.76 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  701. 608.76 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  702. 608.76 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  703. 608.76 s [algebraic-graphs]
  704. 608.76 s [algebraic-graphs] ============ Relation.preSet ============
  705. 608.76 s [algebraic-graphs] OK: preSet x empty == Set.empty
  706. 608.76 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  707. 608.76 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  708. 608.76 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  709. 608.76 s [algebraic-graphs]
  710. 608.76 s [algebraic-graphs] ============ Relation.preIntSet ============
  711. 608.76 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  712. 608.76 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  713. 608.76 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  714. 608.76 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  715. 608.76 s [algebraic-graphs]
  716. 608.76 s [algebraic-graphs] ============ Relation.postSet ============
  717. 608.76 s [algebraic-graphs] OK: postSet x empty == Set.empty
  718. 608.76 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  719. 608.76 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  720. 608.76 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  721. 608.76 s [algebraic-graphs]
  722. 608.76 s [algebraic-graphs] ============ Relation.postIntSet ============
  723. 608.76 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  724. 608.76 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  725. 608.76 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  726. 608.76 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  727. 608.76 s [algebraic-graphs]
  728. 608.76 s [algebraic-graphs] ============ Relation.path ============
  729. 608.76 s [algebraic-graphs] OK: path [] == empty
  730. 608.76 s [algebraic-graphs] OK: path [x] == vertex x
  731. 608.76 s [algebraic-graphs] OK: path [x,y] == edge x y
  732. 608.76 s [algebraic-graphs]
  733. 608.76 s [algebraic-graphs] ============ Relation.circuit ============
  734. 608.76 s [algebraic-graphs] OK: circuit [] == empty
  735. 608.76 s [algebraic-graphs] OK: circuit [x] == edge x x
  736. 608.76 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  737. 608.76 s [algebraic-graphs]
  738. 608.76 s [algebraic-graphs] ============ Relation.clique ============
  739. 608.76 s [algebraic-graphs] OK: clique [] == empty
  740. 608.76 s [algebraic-graphs] OK: clique [x] == vertex x
  741. 608.76 s [algebraic-graphs] OK: clique [x,y] == edge x y
  742. 608.76 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  743. 608.76 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  744. 608.76 s [algebraic-graphs]
  745. 608.76 s [algebraic-graphs] ============ Relation.biclique ============
  746. 608.76 s [algebraic-graphs] OK: biclique [] [] == empty
  747. 608.76 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  748. 608.76 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  749. 608.76 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  750. 608.76 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  751. 608.76 s [algebraic-graphs]
  752. 608.76 s [algebraic-graphs] ============ Relation.star ============
  753. 608.76 s [algebraic-graphs] OK: star x [] == vertex x
  754. 608.76 s [algebraic-graphs] OK: star x [y] == edge x y
  755. 608.76 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  756. 608.76 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  757. 608.76 s [algebraic-graphs]
  758. 608.76 s [algebraic-graphs] ============ Relation.stars ============
  759. 608.76 s [algebraic-graphs] OK: stars [] == empty
  760. 608.76 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  761. 608.76 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  762. 608.76 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  763. 608.76 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  764. 608.76 s [algebraic-graphs] OK: stars . adjacencyList == id
  765. 608.76 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  766. 608.76 s [algebraic-graphs]
  767. 608.76 s [algebraic-graphs] ============ Relation.tree ============
  768. 608.76 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  769. 608.76 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  770. 608.76 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  771. 608.76 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  772. 608.76 s [algebraic-graphs]
  773. 608.76 s [algebraic-graphs] ============ Relation.forest ============
  774. 608.76 s [algebraic-graphs] OK: forest [] == empty
  775. 608.76 s [algebraic-graphs] OK: forest [x] == tree x
  776. 608.76 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  777. 608.76 s [algebraic-graphs] OK: forest == overlays . map tree
  778. 608.76 s [algebraic-graphs]
  779. 608.76 s [algebraic-graphs] ============ Relation.removeVertex ============
  780. 608.76 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  781. 608.76 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  782. 608.76 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  783. 608.76 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  784. 608.76 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  785. 608.76 s [algebraic-graphs]
  786. 608.76 s [algebraic-graphs] ============ Relation.removeEdge ============
  787. 608.76 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  788. 608.76 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  789. 608.76 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  790. 608.76 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  791. 608.76 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  792. 608.76 s [algebraic-graphs]
  793. 608.76 s [algebraic-graphs] ============ Relation.replaceVertex ============
  794. 608.76 s [algebraic-graphs] OK: replaceVertex x x == id
  795. 608.76 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  796. 608.76 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  797. 608.76 s [algebraic-graphs]
  798. 608.76 s [algebraic-graphs] ============ Relation.mergeVertices ============
  799. 608.76 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  800. 633.92 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  801. 633.92 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  802. 633.96 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  803. 633.96 s [algebraic-graphs]
  804. 633.96 s [algebraic-graphs] ============ Relation.transpose ============
  805. 633.96 s [algebraic-graphs] OK: transpose empty == empty
  806. 633.96 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  807. 633.96 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  808. 633.96 s [algebraic-graphs] OK: transpose . transpose == id
  809. 633.96 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  810. 633.96 s [algebraic-graphs]
  811. 633.96 s [algebraic-graphs] ============ Relation.gmap ============
  812. 633.96 s [algebraic-graphs] OK: gmap f empty == empty
  813. 633.96 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  814. 633.96 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  815. 633.96 s [algebraic-graphs] OK: gmap id == id
  816. 633.96 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  817. 633.96 s [algebraic-graphs]
  818. 633.96 s [algebraic-graphs] ============ Relation.induce ============
  819. 633.96 s [algebraic-graphs] OK: induce (const True ) x == x
  820. 633.96 s [algebraic-graphs] OK: induce (const False) x == empty
  821. 633.96 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  822. 633.96 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  823. 633.96 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  824. 633.96 s [algebraic-graphs]
  825. 633.96 s [algebraic-graphs] ============ Relation.compose ============
  826. 633.96 s [algebraic-graphs] OK: compose empty x == empty
  827. 633.96 s [algebraic-graphs] OK: compose x empty == empty
  828. 633.96 s [algebraic-graphs] OK: compose (vertex x) y == empty
  829. 633.96 s [algebraic-graphs] OK: compose x (vertex y) == empty
  830. 633.96 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  831. 633.96 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  832. 633.96 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  833. 633.96 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  834. 633.96 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  835. 633.96 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  836. 633.96 s [algebraic-graphs]
  837. 633.96 s [algebraic-graphs] ============ Relation.closure ============
  838. 633.96 s [algebraic-graphs] OK: closure empty == empty
  839. 633.96 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  840. 633.96 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  841. 633.96 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  842. 633.96 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  843. 633.96 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  844. 633.96 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  845. 633.96 s [algebraic-graphs] OK: closure . closure == closure
  846. 633.96 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  847. 633.96 s [algebraic-graphs]
  848. 633.96 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  849. 633.97 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  850. 633.97 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  851. 633.97 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  852. 633.97 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  853. 633.97 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  854. 633.97 s [algebraic-graphs]
  855. 633.97 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  856. 633.97 s [algebraic-graphs] OK: symmetricClosure empty == empty
  857. 633.97 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  858. 633.97 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  859. 633.97 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  860. 633.97 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  861. 633.97 s [algebraic-graphs]
  862. 633.97 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  863. 633.97 s [algebraic-graphs] OK: transitiveClosure empty == empty
  864. 633.97 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  865. 633.97 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  866. 633.97 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  867. 633.97 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  868. 633.97 s [algebraic-graphs]
  869. 633.97 s [algebraic-graphs] ============ Relation.induceJust ============
  870. 633.97 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  871. 633.97 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  872. 633.97 s [algebraic-graphs] OK: induceJust . gmap Just == id
  873. 633.97 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  874. 633.97 s [algebraic-graphs]
  875. 633.97 s [algebraic-graphs] ============ ReflexiveRelation ============
  876. 633.97 s [algebraic-graphs] OK: Axioms of reflexive graphs
  877. 633.97 s [algebraic-graphs]
  878. 633.97 s [algebraic-graphs] ============ TransitiveRelation ============
  879. 633.97 s [algebraic-graphs] OK: Axioms of transitive graphs
  880. 633.97 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  881. 633.97 s [algebraic-graphs]
  882. 633.97 s [algebraic-graphs] ============ PreorderRelation ============
  883. 633.97 s [algebraic-graphs] OK: Axioms of preorder graphs
  884. 633.97 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  885. 633.97 s [algebraic-graphs]
  886. 633.97 s [algebraic-graphs] ============ Symmetric.Relation ============
  887. 633.97 s [algebraic-graphs] OK: Axioms of undirected graphs
  888. 633.97 s [algebraic-graphs]
  889. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  890. 633.97 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  891. 633.97 s [algebraic-graphs]
  892. 633.97 s [algebraic-graphs] OK: consistent empty == True
  893. 633.97 s [algebraic-graphs] OK: consistent (vertex x) == True
  894. 633.97 s [algebraic-graphs] OK: consistent (overlay x y) == True
  895. 633.97 s [algebraic-graphs] OK: consistent (connect x y) == True
  896. 633.97 s [algebraic-graphs] OK: consistent (edge x y) == True
  897. 633.97 s [algebraic-graphs] OK: consistent (edges xs) == True
  898. 633.97 s [algebraic-graphs] OK: consistent (stars xs) == True
  899. 633.97 s [algebraic-graphs]
  900. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  901. 633.97 s [algebraic-graphs] OK: show (empty ) == "empty"
  902. 633.97 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  903. 633.97 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  904. 633.97 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  905. 633.97 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  906. 633.97 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  907. 633.97 s [algebraic-graphs]
  908. 633.97 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  909. 633.97 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  910. 633.97 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  911. 633.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  912. 633.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  913. 633.97 s [algebraic-graphs]
  914. 633.97 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  915. 633.97 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  916. 633.97 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  917. 633.97 s [algebraic-graphs]
  918. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  919. 633.97 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  920. 633.97 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  921. 633.97 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  922. 633.97 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  923. 633.97 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  924. 633.97 s [algebraic-graphs]
  925. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  926. 633.97 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  927. 633.97 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  928. 633.97 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  929. 633.97 s [algebraic-graphs]
  930. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  931. 633.97 s [algebraic-graphs] OK: vertex 1 < vertex 2
  932. 633.97 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  933. 633.97 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  934. 633.97 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  935. 633.97 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  936. 633.97 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  937. 633.97 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  938. 633.97 s [algebraic-graphs] OK: x <= x + y
  939. 633.97 s [algebraic-graphs] OK: x + y <= x * y
  940. 633.97 s [algebraic-graphs]
  941. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  942. 633.97 s [algebraic-graphs] OK: isEmpty empty == True
  943. 633.97 s [algebraic-graphs] OK: hasVertex x empty == False
  944. 633.97 s [algebraic-graphs] OK: vertexCount empty == 0
  945. 633.97 s [algebraic-graphs] OK: edgeCount empty == 0
  946. 633.97 s [algebraic-graphs]
  947. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  948. 633.97 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  949. 633.97 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  950. 633.97 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  951. 633.97 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  952. 633.97 s [algebraic-graphs]
  953. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  954. 633.97 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  955. 633.97 s [algebraic-graphs] OK: edge x y == edge y x
  956. 633.97 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  957. 633.97 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  958. 633.97 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  959. 633.97 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  960. 633.97 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  961. 633.97 s [algebraic-graphs]
  962. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  963. 633.97 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  964. 633.97 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  965. 633.97 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  966. 633.97 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  967. 633.97 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  968. 633.97 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  969. 633.97 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  970. 633.97 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  971. 633.97 s [algebraic-graphs]
  972. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  973. 633.97 s [algebraic-graphs] OK: connect x y == connect y x
  974. 633.97 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  975. 633.97 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  976. 633.97 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  977. 633.97 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  978. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  979. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  980. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  981. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  982. 633.97 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  983. 633.97 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  984. 633.97 s [algebraic-graphs]
  985. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  986. 633.97 s [algebraic-graphs] OK: vertices [] == empty
  987. 633.97 s [algebraic-graphs] OK: vertices [x] == vertex x
  988. 633.97 s [algebraic-graphs] OK: vertices == overlays . map vertex
  989. 633.97 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  990. 633.97 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  991. 633.97 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  992. 633.97 s [algebraic-graphs]
  993. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  994. 633.97 s [algebraic-graphs] OK: edges [] == empty
  995. 633.97 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  996. 633.97 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  997. 633.97 s [algebraic-graphs]
  998. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  999. 633.97 s [algebraic-graphs] OK: overlays [] == empty
  1000. 650.11 s [algebraic-graphs] OK: overlays [x] == x
  1001. 650.14 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1002. 650.14 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1003. 650.14 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1004. 650.14 s [algebraic-graphs]
  1005. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  1006. 650.14 s [algebraic-graphs] OK: connects [] == empty
  1007. 650.14 s [algebraic-graphs] OK: connects [x] == x
  1008. 650.14 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1009. 650.14 s [algebraic-graphs] OK: connects == foldr connect empty
  1010. 650.14 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1011. 650.14 s [algebraic-graphs] OK: connects == connects . reverse
  1012. 650.14 s [algebraic-graphs]
  1013. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  1014. 650.14 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1015. 650.14 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1016. 650.14 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1017. 650.14 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1018. 650.14 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1019. 650.14 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1020. 650.14 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1021. 650.14 s [algebraic-graphs]
  1022. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  1023. 650.14 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  1024. 650.14 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  1025. 650.14 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  1026. 650.14 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  1027. 650.14 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  1028. 650.14 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  1029. 650.14 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  1030. 650.14 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  1031. 650.14 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  1032. 650.14 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1033. 650.14 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1034. 650.14 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1035. 650.14 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1036. 650.14 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1037. 650.14 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1038. 650.14 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1039. 650.14 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1040. 650.14 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1041. 650.14 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1042. 650.14 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1043. 650.14 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1044. 650.14 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1045. 650.14 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1046. 650.14 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1047. 650.14 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1048. 650.14 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1049. 650.14 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1050. 650.14 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1051. 650.14 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1052. 650.14 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1053. 650.14 s [algebraic-graphs]
  1054. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  1055. 650.14 s [algebraic-graphs] OK: isEmpty empty == True
  1056. 650.14 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1057. 650.14 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1058. 650.14 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1059. 650.14 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1060. 650.14 s [algebraic-graphs]
  1061. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  1062. 650.14 s [algebraic-graphs] OK: hasVertex x empty == False
  1063. 650.14 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1064. 650.14 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1065. 650.14 s [algebraic-graphs]
  1066. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  1067. 650.14 s [algebraic-graphs] OK: hasEdge x y empty == False
  1068. 650.14 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1069. 650.14 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1070. 650.14 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  1071. 650.14 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1072. 650.14 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  1073. 650.14 s [algebraic-graphs]
  1074. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  1075. 650.14 s [algebraic-graphs] OK: vertexCount empty == 0
  1076. 650.14 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1077. 650.14 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1078. 650.14 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1079. 650.14 s [algebraic-graphs]
  1080. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  1081. 650.14 s [algebraic-graphs] OK: edgeCount empty == 0
  1082. 650.14 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1083. 650.14 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1084. 650.14 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1085. 650.14 s [algebraic-graphs]
  1086. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  1087. 650.14 s [algebraic-graphs] OK: vertexList empty == []
  1088. 650.14 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1089. 650.14 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1090. 650.14 s [algebraic-graphs]
  1091. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  1092. 650.14 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1093. 650.14 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1094. 650.14 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1095. 650.14 s [algebraic-graphs]
  1096. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  1097. 650.14 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1098. 650.14 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1099. 650.14 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1100. 650.14 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1101. 650.14 s [algebraic-graphs]
  1102. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  1103. 650.14 s [algebraic-graphs] OK: edgeList empty == []
  1104. 650.15 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1105. 650.15 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  1106. 650.15 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  1107. 650.15 s [algebraic-graphs]
  1108. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  1109. 650.15 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1110. 650.15 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1111. 650.15 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  1112. 650.15 s [algebraic-graphs]
  1113. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  1114. 650.15 s [algebraic-graphs] OK: adjacencyList empty == []
  1115. 650.15 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1116. 650.15 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  1117. 650.15 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  1118. 650.15 s [algebraic-graphs]
  1119. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  1120. 650.15 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  1121. 650.15 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  1122. 650.15 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  1123. 650.15 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  1124. 650.15 s [algebraic-graphs]
  1125. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  1126. 650.15 s [algebraic-graphs] OK: path [] == empty
  1127. 650.15 s [algebraic-graphs] OK: path [x] == vertex x
  1128. 650.15 s [algebraic-graphs] OK: path [x,y] == edge x y
  1129. 650.15 s [algebraic-graphs] OK: path == path . reverse
  1130. 650.15 s [algebraic-graphs]
  1131. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  1132. 650.15 s [algebraic-graphs] OK: circuit [] == empty
  1133. 650.15 s [algebraic-graphs] OK: circuit [x] == edge x x
  1134. 650.15 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1135. 650.15 s [algebraic-graphs] OK: circuit == circuit . reverse
  1136. 650.15 s [algebraic-graphs]
  1137. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  1138. 650.15 s [algebraic-graphs] OK: clique [] == empty
  1139. 650.15 s [algebraic-graphs] OK: clique [x] == vertex x
  1140. 650.15 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1141. 650.15 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1142. 650.15 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1143. 650.15 s [algebraic-graphs] OK: clique == clique . reverse
  1144. 650.15 s [algebraic-graphs]
  1145. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  1146. 650.15 s [algebraic-graphs] OK: biclique [] [] == empty
  1147. 650.15 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1148. 650.15 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1149. 650.15 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1150. 650.15 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1151. 650.15 s [algebraic-graphs]
  1152. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  1153. 650.15 s [algebraic-graphs] OK: star x [] == vertex x
  1154. 650.15 s [algebraic-graphs] OK: star x [y] == edge x y
  1155. 650.15 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1156. 650.15 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1157. 650.15 s [algebraic-graphs]
  1158. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  1159. 650.15 s [algebraic-graphs] OK: stars [] == empty
  1160. 650.15 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1161. 650.15 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1162. 650.15 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1163. 650.15 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1164. 650.15 s [algebraic-graphs] OK: stars . adjacencyList == id
  1165. 650.15 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1166. 650.15 s [algebraic-graphs]
  1167. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  1168. 650.15 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1169. 650.15 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1170. 650.15 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1171. 650.15 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1172. 650.15 s [algebraic-graphs]
  1173. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  1174. 650.15 s [algebraic-graphs] OK: forest [] == empty
  1175. 659.67 s [algebraic-graphs] OK: forest [x] == tree x
  1176. 659.67 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1177. 659.70 s [algebraic-graphs] OK: forest == overlays . map tree
  1178. 659.70 s [algebraic-graphs]
  1179. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  1180. 659.70 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1181. 659.70 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1182. 659.70 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1183. 659.70 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1184. 659.70 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1185. 659.70 s [algebraic-graphs]
  1186. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  1187. 659.70 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1188. 659.70 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1189. 659.70 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1190. 659.70 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1191. 659.70 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1192. 659.70 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1193. 659.70 s [algebraic-graphs]
  1194. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  1195. 659.70 s [algebraic-graphs] OK: replaceVertex x x == id
  1196. 659.70 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1197. 659.70 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1198. 659.70 s [algebraic-graphs]
  1199. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  1200. 659.70 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1201. 659.70 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1202. 659.70 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1203. 659.70 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1204. 659.70 s [algebraic-graphs]
  1205. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  1206. 659.70 s [algebraic-graphs] OK: gmap f empty == empty
  1207. 659.70 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1208. 659.70 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1209. 659.70 s [algebraic-graphs] OK: gmap id == id
  1210. 659.70 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1211. 659.70 s [algebraic-graphs]
  1212. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  1213. 659.70 s [algebraic-graphs] OK: induce (const True ) x == x
  1214. 659.70 s [algebraic-graphs] OK: induce (const False) x == empty
  1215. 659.70 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1216. 659.70 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1217. 659.70 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1218. 659.70 s [algebraic-graphs]
  1219. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  1220. 659.70 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1221. 659.70 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1222. 659.70 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1223. 659.70 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1224. 659.70 s [algebraic-graphs]
  1225. 659.70 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  1226. 659.70 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  1227. 659.70 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  1228. 659.71 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  1229. 659.71 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  1230. 659.71 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  1231. 659.71 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  1232. 659.71 s [algebraic-graphs]
  1233. 659.71 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  1234. 659.71 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  1235. 659.71 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  1236. 659.71 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  1237. 659.71 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  1238. 659.71 s [algebraic-graphs]
  1239. 659.71 s [algebraic-graphs] ============ Typed ============
  1240. 659.71 s [algebraic-graphs]
  1241. 659.71 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  1242. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1243. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1244. 659.71 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  1245. 659.71 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1246. 659.71 s [algebraic-graphs]
  1247. 659.71 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  1248. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1249. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1250. 659.71 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  1251. 659.71 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1252. 659.71 s [algebraic-graphs]
  1253. 659.71 s [algebraic-graphs] ============ Typed.dfsForest ============
  1254. 659.71 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  1255. 659.71 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  1256. 659.71 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  1257. 659.71 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  1258. 659.71 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  1259. 659.71 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  1260. 659.71 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  1261. 659.71 s [algebraic-graphs]
  1262. 659.71 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  1263. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  1264. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  1265. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  1266. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  1267. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  1268. 659.71 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  1269. 659.71 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  1270. 659.71 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  1271. 659.71 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  1272. 659.71 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  1273. 659.71 s [algebraic-graphs]
  1274. 659.71 s [algebraic-graphs] ============ Typed.dfs ============
  1275. 659.71 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  1276. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  1277. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  1278. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  1279. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  1280. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  1281. 659.71 s [algebraic-graphs] OK: dfs % x $ [] == []
  1282. 659.71 s [algebraic-graphs]
  1283. 659.71 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  1284. 659.71 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  1285. 659.71 s [algebraic-graphs]
  1286. 659.71 s [algebraic-graphs] ============ Typed.topSort ============
  1287. 659.71 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  1288. 659.71 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  1289. 659.71 s [algebraic-graphs]
  1290. 659.71 s [algebraic-graphs] ============ Graph.Undirected ============
  1291. 659.71 s [algebraic-graphs] OK: Axioms of undirected graphs
  1292. 659.71 s [algebraic-graphs]
  1293. 659.71 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  1294. 659.71 s [algebraic-graphs] OK: show (empty ) == "empty"
  1295. 659.71 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1296. 659.71 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1297. 659.71 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1298. 659.71 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1299. 659.71 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1300. 659.71 s [algebraic-graphs]
  1301. 659.71 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1302. 659.71 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1303. 659.71 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1304. 659.71 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1305. 659.71 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1306. 659.71 s [algebraic-graphs]
  1307. 659.71 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1308. 659.71 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1309. 659.71 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1310. 659.71 s [algebraic-graphs]
  1311. 659.71 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  1312. 659.71 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  1313. 659.71 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1314. 659.71 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  1315. 659.71 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  1316. 659.71 s [algebraic-graphs]
  1317. 659.71 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  1318. 659.71 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  1319. 659.71 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1320. 659.71 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  1321. 659.71 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  1322. 659.71 s [algebraic-graphs]
  1323. 659.71 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  1324. 659.71 s [algebraic-graphs] OK: complement empty == empty
  1325. 659.71 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  1326. 659.71 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  1327. 659.71 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  1328. 659.71 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  1329. 659.71 s [algebraic-graphs] OK: complement . complement == id
  1330. 659.71 s [algebraic-graphs]
  1331. 659.71 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  1332. 659.71 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1333. 659.71 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1334. 659.71 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1335. 659.71 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1336. 659.71 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1337. 659.71 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1338. 659.71 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1339. 659.71 s [algebraic-graphs] OK: x <= x + y
  1340. 659.71 s [algebraic-graphs] OK: x + y <= x * y
  1341. 659.71 s [algebraic-graphs]
  1342. 659.71 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  1343. 659.71 s [algebraic-graphs] OK: isEmpty empty == True
  1344. 659.71 s [algebraic-graphs] OK: hasVertex x empty == False
  1345. 659.71 s [algebraic-graphs] OK: vertexCount empty == 0
  1346. 659.71 s [algebraic-graphs] OK: edgeCount empty == 0
  1347. 659.71 s [algebraic-graphs]
  1348. 659.71 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  1349. 659.71 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1350. 659.71 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1351. 659.71 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1352. 659.71 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1353. 659.71 s [algebraic-graphs]
  1354. 659.71 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  1355. 659.71 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1356. 659.71 s [algebraic-graphs] OK: edge x y == edge y x
  1357. 671.69 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1358. 671.69 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1359. 671.69 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1360. 671.72 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1361. 671.72 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1362. 671.72 s [algebraic-graphs]
  1363. 671.72 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  1364. 671.72 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1365. 671.72 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1366. 671.72 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1367. 671.72 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1368. 671.72 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1369. 671.72 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1370. 671.72 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1371. 671.72 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1372. 671.72 s [algebraic-graphs]
  1373. 671.72 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  1374. 671.72 s [algebraic-graphs] OK: connect x y == connect y x
  1375. 671.72 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1376. 671.72 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1377. 671.72 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1378. 671.72 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1379. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1380. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1381. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1382. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1383. 671.72 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1384. 671.72 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1385. 671.72 s [algebraic-graphs]
  1386. 671.72 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  1387. 671.72 s [algebraic-graphs] OK: vertices [] == empty
  1388. 671.72 s [algebraic-graphs] OK: vertices [x] == vertex x
  1389. 671.72 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1390. 671.72 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1391. 671.72 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1392. 671.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1393. 671.72 s [algebraic-graphs]
  1394. 671.72 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  1395. 671.72 s [algebraic-graphs] OK: edges [] == empty
  1396. 671.72 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1397. 671.72 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1398. 671.72 s [algebraic-graphs]
  1399. 671.73 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  1400. 671.73 s [algebraic-graphs] OK: overlays [] == empty
  1401. 671.73 s [algebraic-graphs] OK: overlays [x] == x
  1402. 671.73 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1403. 671.73 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1404. 671.73 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1405. 671.73 s [algebraic-graphs]
  1406. 671.73 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  1407. 671.73 s [algebraic-graphs] OK: connects [] == empty
  1408. 671.73 s [algebraic-graphs] OK: connects [x] == x
  1409. 671.73 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1410. 671.73 s [algebraic-graphs] OK: connects == foldr connect empty
  1411. 671.73 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1412. 671.73 s [algebraic-graphs] OK: connects == connects . reverse
  1413. 671.73 s [algebraic-graphs]
  1414. 671.73 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  1415. 671.73 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1416. 671.73 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1417. 671.73 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1418. 671.73 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1419. 671.73 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1420. 671.73 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1421. 671.73 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1422. 671.73 s [algebraic-graphs]
  1423. 671.73 s [algebraic-graphs] ============ Graph.Undirected.path ============
  1424. 671.73 s [algebraic-graphs] OK: path [] == empty
  1425. 671.73 s [algebraic-graphs] OK: path [x] == vertex x
  1426. 671.73 s [algebraic-graphs] OK: path [x,y] == edge x y
  1427. 671.73 s [algebraic-graphs] OK: path == path . reverse
  1428. 671.73 s [algebraic-graphs]
  1429. 671.73 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  1430. 671.73 s [algebraic-graphs] OK: circuit [] == empty
  1431. 671.73 s [algebraic-graphs] OK: circuit [x] == edge x x
  1432. 671.73 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1433. 671.73 s [algebraic-graphs] OK: circuit == circuit . reverse
  1434. 671.73 s [algebraic-graphs]
  1435. 671.73 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  1436. 671.73 s [algebraic-graphs] OK: clique [] == empty
  1437. 671.73 s [algebraic-graphs] OK: clique [x] == vertex x
  1438. 671.73 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1439. 671.73 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1440. 671.73 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1441. 671.73 s [algebraic-graphs] OK: clique == clique . reverse
  1442. 671.73 s [algebraic-graphs]
  1443. 671.73 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  1444. 671.73 s [algebraic-graphs] OK: biclique [] [] == empty
  1445. 671.73 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1446. 671.73 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1447. 671.73 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1448. 671.73 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1449. 671.73 s [algebraic-graphs]
  1450. 671.73 s [algebraic-graphs] ============ Graph.Undirected.star ============
  1451. 671.73 s [algebraic-graphs] OK: star x [] == vertex x
  1452. 671.73 s [algebraic-graphs] OK: star x [y] == edge x y
  1453. 671.73 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1454. 671.73 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1455. 671.73 s [algebraic-graphs]
  1456. 671.73 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  1457. 671.73 s [algebraic-graphs] OK: stars [] == empty
  1458. 671.73 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1459. 671.73 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1460. 671.73 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1461. 671.73 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1462. 671.73 s [algebraic-graphs] OK: stars . adjacencyList == id
  1463. 671.73 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1464. 671.73 s [algebraic-graphs]
  1465. 671.73 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  1466. 671.73 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1467. 671.73 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1468. 671.73 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1469. 671.73 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1470. 671.73 s [algebraic-graphs]
  1471. 671.73 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  1472. 671.73 s [algebraic-graphs] OK: forest [] == empty
  1473. 671.73 s [algebraic-graphs] OK: forest [x] == tree x
  1474. 671.73 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1475. 671.73 s [algebraic-graphs] OK: forest == overlays . map tree
  1476. 671.73 s [algebraic-graphs]
  1477. 671.73 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  1478. 671.73 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1479. 671.73 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1480. 671.73 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1481. 671.73 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1482. 671.73 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1483. 671.73 s [algebraic-graphs]
  1484. 671.73 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  1485. 671.73 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1486. 671.73 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1487. 671.73 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1488. 671.73 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1489. 671.73 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1490. 671.73 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1491. 671.73 s [algebraic-graphs]
  1492. 671.73 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  1493. 671.73 s [algebraic-graphs] OK: replaceVertex x x == id
  1494. 671.73 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1495. 671.73 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1496. 671.73 s [algebraic-graphs]
  1497. 671.73 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  1498. 671.73 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1499. 671.73 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1500. 671.73 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1501. 671.73 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1502. 671.73 s [algebraic-graphs]
  1503. 671.73 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  1504. 671.73 s [algebraic-graphs] OK: gmap f empty == empty
  1505. 671.73 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1506. 671.73 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1507. 671.73 s [algebraic-graphs] OK: gmap id == id
  1508. 671.73 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1509. 671.73 s [algebraic-graphs]
  1510. 671.73 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  1511. 671.73 s [algebraic-graphs] OK: induce (const True ) x == x
  1512. 671.73 s [algebraic-graphs] OK: induce (const False) x == empty
  1513. 671.73 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1514. 671.73 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1515. 671.73 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1516. 671.73 s [algebraic-graphs]
  1517. 671.73 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  1518. 671.73 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1519. 671.73 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1520. 671.73 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1521. 671.73 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1522. 671.73 s [algebraic-graphs] Test suite main: PASS
  1523. 671.73 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  1524. 671.73 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  1525. 671.73 s [algebraic-graphs] checkPhase completed in 2 minutes 19 seconds
  1526. 671.73 s [algebraic-graphs] Phase: haddockPhase
  1527. 672.30 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  1528. 672.30 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  1529. 672.54 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1530. 672.92 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [HIE file is missing]
  1531. 673.03 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [HIE file is missing]
  1532. 673.12 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [HIE file is missing]
  1533. 673.27 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [HIE file is missing]
  1534. 673.54 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [HIE file is missing]
  1535. 673.59 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1536. 673.78 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  1537. 674.01 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [HIE file is missing]
  1538. 674.25 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1539. 674.39 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  1540. 674.49 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  1541. 674.49 s [algebraic-graphs] In the use of ‘head’
  1542. 674.49 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1543. 674.49 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1544. 674.49 s [algebraic-graphs] |
  1545. 674.49 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  1546. 674.49 s [algebraic-graphs] | ^^^^
  1547. 674.49 s [algebraic-graphs]
  1548. 674.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  1549. 674.50 s [algebraic-graphs] In the use of ‘tail’
  1550. 674.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1551. 674.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1552. 674.50 s [algebraic-graphs] |
  1553. 674.50 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  1554. 674.50 s [algebraic-graphs] | ^^^^
  1555. 674.50 s [algebraic-graphs]
  1556. 674.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  1557. 674.50 s [algebraic-graphs] In the use of ‘head’
  1558. 674.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1559. 674.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1560. 674.50 s [algebraic-graphs] |
  1561. 674.50 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  1562. 674.50 s [algebraic-graphs] | ^^^^
  1563. 674.50 s [algebraic-graphs]
  1564. 674.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  1565. 674.50 s [algebraic-graphs] In the use of ‘tail’
  1566. 674.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1567. 674.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1568. 674.50 s [algebraic-graphs] |
  1569. 674.50 s [algebraic-graphs] 397 | bnd' = tail bnd
  1570. 674.50 s [algebraic-graphs] | ^^^^
  1571. 674.50 s [algebraic-graphs]
  1572. 674.51 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1573. 674.56 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [HIE file is missing]
  1574. 674.75 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1575. 674.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1576. 674.75 s [algebraic-graphs] will become an error in a future GHC release.
  1577. 674.75 s [algebraic-graphs] Suggested fix:
  1578. 674.75 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1579. 674.75 s [algebraic-graphs] |
  1580. 674.75 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  1581. 674.75 s [algebraic-graphs] | ^
  1582. 674.75 s [algebraic-graphs]
  1583. 674.75 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1584. 674.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1585. 674.75 s [algebraic-graphs] will become an error in a future GHC release.
  1586. 674.75 s [algebraic-graphs] Suggested fix:
  1587. 674.75 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1588. 674.75 s [algebraic-graphs] |
  1589. 674.75 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1590. 674.75 s [algebraic-graphs] | ^
  1591. 674.75 s [algebraic-graphs]
  1592. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1593. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1594. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  1595. 674.76 s [algebraic-graphs] Suggested fix:
  1596. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1597. 674.76 s [algebraic-graphs] |
  1598. 674.76 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1599. 674.76 s [algebraic-graphs] | ^
  1600. 674.76 s [algebraic-graphs]
  1601. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1602. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1603. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  1604. 674.76 s [algebraic-graphs] Suggested fix:
  1605. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1606. 674.76 s [algebraic-graphs] |
  1607. 674.76 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1608. 674.76 s [algebraic-graphs] | ^
  1609. 674.76 s [algebraic-graphs]
  1610. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1611. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1612. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  1613. 674.76 s [algebraic-graphs] Suggested fix:
  1614. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1615. 674.76 s [algebraic-graphs] |
  1616. 674.76 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1617. 674.76 s [algebraic-graphs] | ^
  1618. 674.76 s [algebraic-graphs]
  1619. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1620. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1621. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  1622. 674.76 s [algebraic-graphs] Suggested fix:
  1623. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1624. 674.76 s [algebraic-graphs] |
  1625. 674.76 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1626. 674.76 s [algebraic-graphs] | ^
  1627. 674.76 s [algebraic-graphs]
  1628. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1629. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1630. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  1631. 674.76 s [algebraic-graphs] Suggested fix:
  1632. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1633. 674.76 s [algebraic-graphs] |
  1634. 674.76 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1635. 674.77 s [algebraic-graphs] | ^
  1636. 674.77 s [algebraic-graphs]
  1637. 674.77 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [HIE file is missing]
  1638. 674.93 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [HIE file is missing]
  1639. 675.05 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [HIE file is missing]
  1640. 675.35 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1641. 675.54 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [HIE file is missing]
  1642. 675.77 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [HIE file is missing]
  1643. 675.79 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [HIE file is missing]
  1644. 675.81 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [HIE file is missing]
  1645. 675.85 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1646. 675.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1647. 675.85 s [algebraic-graphs] will become an error in a future GHC release.
  1648. 675.85 s [algebraic-graphs] Suggested fix:
  1649. 675.85 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1650. 675.85 s [algebraic-graphs] |
  1651. 675.85 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  1652. 675.85 s [algebraic-graphs] | ^
  1653. 675.85 s [algebraic-graphs]
  1654. 675.85 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [HIE file is missing]
  1655. 675.88 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1656. 675.88 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1657. 675.88 s [algebraic-graphs] will become an error in a future GHC release.
  1658. 675.88 s [algebraic-graphs] Suggested fix:
  1659. 675.88 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1660. 675.88 s [algebraic-graphs] |
  1661. 675.88 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  1662. 675.88 s [algebraic-graphs] | ^
  1663. 675.88 s [algebraic-graphs]
  1664. 675.88 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1665. 675.88 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1666. 675.88 s [algebraic-graphs] will become an error in a future GHC release.
  1667. 675.88 s [algebraic-graphs] Suggested fix:
  1668. 675.88 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1669. 675.88 s [algebraic-graphs] |
  1670. 675.88 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  1671. 675.88 s [algebraic-graphs] | ^
  1672. 675.88 s [algebraic-graphs]
  1673. 675.89 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [HIE file is missing]
  1674. 676.01 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [HIE file is missing]
  1675. 676.18 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [HIE file is missing]
  1676. 676.20 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [HIE file is missing]
  1677. 676.22 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [HIE file is missing]
  1678. 676.25 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [HIE file is missing]
  1679. 676.28 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) [HIE file is missing]
  1680. 676.31 s [algebraic-graphs] Haddock coverage:
  1681. 676.32 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1682. 676.32 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1683. 676.32 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1684. 676.32 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1685. 676.32 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1686. 676.32 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1687. 676.44 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  1688. 676.45 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1689. 676.45 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  1690. 676.45 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1691. 676.45 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1692. 676.45 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1693. 676.45 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  1694. 676.46 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  1695. 676.47 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1696. 676.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1697. 676.48 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1698. 676.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1699. 676.48 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  1700. 676.48 s [algebraic-graphs] Missing documentation for:
  1701. 676.48 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  1702. 676.48 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  1703. 676.48 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  1704. 676.48 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  1705. 676.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1706. 676.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1707. 676.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  1708. 676.48 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  1709. 676.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1710. 676.48 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  1711. 676.49 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  1712. 676.49 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  1713. 676.49 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  1714. 676.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1715. 676.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1716. 676.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  1717. 676.49 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1718. 676.49 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  1719. 676.49 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1720. 676.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1721. 676.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1722. 676.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  1723. 676.63 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  1724. 676.63 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1725. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1726. 676.63 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  1727. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1728. 676.63 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  1729. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1730. 676.63 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  1731. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1732. 676.64 s [algebraic-graphs] Warning: 'box' is out of scope.
  1733. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1734. 676.64 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1735. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1736. 676.64 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  1737. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1738. 676.64 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  1739. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1740. 676.64 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  1741. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1742. 676.64 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  1743. 676.65 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  1744. 676.65 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  1745. 676.65 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  1746. 676.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1747. 676.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1748. 676.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  1749. 676.65 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1750. 676.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1751. 676.65 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1752. 676.65 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1753. 676.65 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1754. 676.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1755. 676.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1756. 676.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1757. 676.67 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  1758. 676.67 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1759. 676.67 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1760. 676.67 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1761. 676.67 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1762. 676.67 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1763. 676.67 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1764. 676.67 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  1765. 676.67 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1766. 676.67 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  1767. 676.67 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  1768. 676.67 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  1769. 676.67 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1770. 676.67 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1771. 676.67 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  1772. 676.68 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  1773. 676.68 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  1774. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  1775. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  1776. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1777. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1778. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  1779. 676.68 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  1780. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  1781. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  1782. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1783. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1784. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  1785. 676.68 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  1786. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  1787. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  1788. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1789. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1790. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  1791. 676.68 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  1792. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  1793. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  1794. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1795. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1796. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  1797. 676.68 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  1798. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  1799. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  1800. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1801. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1802. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  1803. 676.68 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  1804. 676.69 s [algebraic-graphs] Warning: 'empty' is out of scope.
  1805. 676.69 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1806. 676.94 s [algebraic-graphs] Warning: 'edges' is out of scope.
  1807. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1808. 676.94 s [algebraic-graphs] Warning: 'stars' is out of scope.
  1809. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1810. 676.94 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  1811. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  1812. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  1813. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1814. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1815. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  1816. 676.94 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1817. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1818. 676.94 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1819. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1820. 676.94 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1821. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1822. 676.94 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  1823. 676.94 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1824. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1825. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  1826. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1827. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1828. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  1829. 676.94 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  1830. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  1831. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  1832. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1833. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1834. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  1835. 676.94 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1836. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1837. 676.94 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1838. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1839. 676.94 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  1840. 676.94 s [algebraic-graphs] Missing documentation for:
  1841. 676.94 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  1842. 676.94 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1843. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  1844. 676.94 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1845. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1846. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1847. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  1848. 676.94 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1849. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  1850. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1851. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1852. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1853. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1854. 676.94 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  1855. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  1856. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  1857. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1858. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1859. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  1860. 676.94 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  1861. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  1862. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  1863. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1864. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1865. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  1866. 676.94 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  1867. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  1868. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  1869. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1870. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1871. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  1872. 676.94 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  1873. 676.94 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  1874. 676.94 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  1875. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  1876. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1877. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1878. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  1879. 676.94 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  1880. 676.94 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  1881. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  1882. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  1883. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1884. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1885. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  1886. 676.94 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1887. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  1888. 676.94 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1889. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1890. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1891. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  1892. 676.95 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  1893. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1894. 676.95 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  1895. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1896. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  1897. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1898. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1899. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1900. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  1901. 676.95 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  1902. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  1903. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  1904. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1905. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1906. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  1907. 676.95 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  1908. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  1909. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  1910. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1911. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1912. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  1913. 676.95 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  1914. 676.95 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1915. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1916. 676.95 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  1917. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1918. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1919. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1920. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1921. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1922. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1923. 676.95 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  1924. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  1925. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  1926. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1927. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1928. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  1929. 676.95 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  1930. 676.95 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  1931. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  1932. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  1933. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1934. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1935. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  1936. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1937. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  1938. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1939. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1940. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1941. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  1942. 676.95 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  1943. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  1944. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  1945. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1946. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1947. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  1948. 676.95 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  1949. 676.95 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  1950. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  1951. 676.95 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  1952. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  1953. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  1954. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1955. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1956. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  1957. 676.95 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  1958. 676.95 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  1959. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  1960. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  1961. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1962. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1963. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  1964. 676.95 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  1965. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1966. 676.95 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  1967. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1968. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  1969. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1970. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1971. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1972. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  1973. 676.95 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  1974. 676.95 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  1975. 676.95 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  1976. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  1977. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  1978. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1979. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1980. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  1981. 676.95 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  1982. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1983. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  1984. 676.95 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  1985. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  1986. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  1987. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1988. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1989. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  1990. 676.95 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  1991. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1992. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  1993. 676.95 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  1994. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  1995. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  1996. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1997. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1998. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  1999. 676.95 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  2000. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2001. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  2002. 676.95 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  2003. 676.95 s [algebraic-graphs] Missing documentation for:
  2004. 676.95 s [algebraic-graphs] Module header
  2005. 676.95 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  2006. 676.95 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  2007. 676.95 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  2008. 676.95 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  2009. 676.95 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  2010. 676.95 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  2011. 676.95 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  2012. 676.95 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  2013. 676.95 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  2014. 676.95 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  2015. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2016. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2017. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  2018. 676.95 s [algebraic-graphs] Warning: 'array' is out of scope.
  2019. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2020. 676.95 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  2021. 676.95 s [algebraic-graphs] Missing documentation for:
  2022. 676.95 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  2023. 677.23 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  2024. 677.23 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  2025. 677.23 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2026. 677.23 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2027. 677.25 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  2028. 677.25 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  2029. 677.25 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2030. 677.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2031. 677.26 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  2032. 677.26 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  2033. 677.28 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  2034. 677.28 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  2035. 677.28 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2036. 677.28 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2037. 677.30 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  2038. 677.30 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  2039. 677.30 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  2040. 677.30 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  2041. 677.31 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  2042. 677.31 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  2043. 677.31 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  2044. 677.31 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  2045. 677.31 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  2046. 677.32 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  2047. 677.32 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  2048. 677.32 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2049. 677.34 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  2050. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2051. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2052. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2053. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2054. 677.34 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2055. 677.34 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2056. 677.34 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2057. 677.34 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2058. 677.34 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2059. 677.36 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  2060. 677.36 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2061. 677.36 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2062. 677.37 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  2063. 677.37 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2064. 677.37 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2065. 677.39 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  2066. 677.39 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2067. 677.40 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  2068. 677.40 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  2069. 677.40 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2070. 677.40 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2071. 677.41 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  2072. 677.41 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  2073. 677.41 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2074. 677.41 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2075. 677.44 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  2076. 677.44 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  2077. 677.44 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2078. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  2079. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2080. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2081. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2082. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  2083. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2084. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2085. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2086. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  2087. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2088. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2089. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  2090. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  2091. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  2092. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2093. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2094. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2095. 677.45 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2096. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  2097. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2098. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  2099. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2100. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  2101. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2102. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  2103. 677.45 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2104. 685.13 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs,
  2105. 685.17 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  2106. 685.82 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  2107. 685.94 s [algebraic-graphs] Phase: installPhase
  2108. 686.04 s [algebraic-graphs] Installing library in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  2109. 686.87 s [algebraic-graphs] Phase: fixupPhase
  2110. 686.89 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  2111. 686.92 s [algebraic-graphs] shrinking /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSalgebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI-ghc9.12.1.so
  2112. 686.92 s [algebraic-graphs] checking for references to /build/ in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7...
  2113. 686.96 s [algebraic-graphs] patching script interpreter paths in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  2114. 686.97 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib
  2115. 687.29 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc
  2116. 687.31 s [algebraic-graphs] checking for references to /build/ in /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc...
  2117. 687.33 s [algebraic-graphs] patching script interpreter paths in /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc
  2118. 687.52 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  2119. 688.06 s [algebraic-graphs:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  2120. 688.06 s [algebraic-graphs:post-build]
  2121. 688.43 s [algebraic-graphs:post-build] Pushing /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc (10.41 MiB)
  2122. 688.50 s [algebraic-graphs:post-build] Pushing /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7 (25.82 MiB)
  2123. 689.78 s [algebraic-graphs:post-build]
  2124. 689.78 s [algebraic-graphs:post-build] All done.
  2125. 689.81 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  2126. 689.87 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2127. 690.11 s [algebraic-graphs:post-build] copying 2 paths...
  2128. 690.11 s [algebraic-graphs:post-build] copying path '/nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  2129. 691.86 s [algebraic-graphs:post-build] copying path '/nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  2130. 700.11 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2131. 700.38 s [algebraic-graphs:post-build] copying 1 paths...
  2132. 700.42 s [algebraic-graphs:post-build] copying path '/nix/store/kvcg0i6hscdsp3k91crm7j0b125q987x-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  2133. 700.63 s Progress: 9 of 14 built, 145 of 145 downloaded from cache
  2134. 700.69 s Building /nix/store/6lsm2jsyhyd8z7j3a6i1zibq5mjbysbx-algebraic-graph-duoids-0.0.1.0.drv
  2135. 700.85 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  2136. 700.86 s [algebraic-graph-duoids] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  2137. 701.11 s [algebraic-graph-duoids] Phase: unpackPhase
  2138. 701.12 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  2139. 701.13 s [algebraic-graph-duoids] source root is algebraic-graphs
  2140. 701.13 s [algebraic-graph-duoids] Phase: patchPhase
  2141. 701.14 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  2142. 701.15 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.ldcV4kdzOo/setup-package.conf.d -threaded
  2143. 701.23 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ldcV4kdzOo/Main.o )
  2144. 701.30 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  2145. 702.75 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  2146. 702.76 s [algebraic-graph-duoids] Phase: configurePhase
  2147. 702.77 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.ldcV4kdzOo/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/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/lib
  2148. 702.78 s [algebraic-graph-duoids] Using Parsec parser
  2149. 702.78 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  2150. 702.81 s [algebraic-graph-duoids] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  2151. 702.81 s [algebraic-graph-duoids] 'ghc' version < 9.12):
  2152. 702.81 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  2153. 702.81 s [algebraic-graph-duoids] 9.12.1
  2154. 703.11 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  2155. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  2156. 703.37 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2157. 703.37 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  2158. 703.37 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2159. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2160. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  2161. 703.37 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2162. 703.37 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  2163. 703.37 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  2164. 703.37 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2165. 703.37 s [algebraic-graph-duoids] hedgehog-1.5
  2166. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2167. 703.37 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2168. 703.37 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  2169. 703.37 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2170. 703.37 s [algebraic-graph-duoids] <0.25: using doctest-0.24.0
  2171. 703.37 s [algebraic-graph-duoids] Source component graph:
  2172. 703.37 s [algebraic-graph-duoids] component lib
  2173. 703.37 s [algebraic-graph-duoids] component test:doctests dependency lib
  2174. 703.37 s [algebraic-graph-duoids] component test:laws dependency lib
  2175. 703.37 s [algebraic-graph-duoids] Configured component graph:
  2176. 703.37 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2177. 703.37 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  2178. 703.37 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  2179. 703.37 s [algebraic-graph-duoids] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  2180. 703.37 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BsCVSspHDmhFjQRvObHyjh-doctests
  2181. 703.37 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2182. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  2183. 703.38 s [algebraic-graph-duoids] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  2184. 703.38 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BLs4stF7Q617YqzZpZPtBo-laws
  2185. 703.38 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2186. 703.38 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  2187. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  2188. 703.38 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  2189. 703.38 s [algebraic-graph-duoids] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  2190. 703.38 s [algebraic-graph-duoids] Linked component graph:
  2191. 703.38 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2192. 703.38 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  2193. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  2194. 703.38 s [algebraic-graph-duoids] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  2195. 703.38 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW:Algebra.Graph.Duoid.Orphans
  2196. 703.38 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BsCVSspHDmhFjQRvObHyjh-doctests
  2197. 703.38 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2198. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  2199. 703.38 s [algebraic-graph-duoids] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  2200. 703.38 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BLs4stF7Q617YqzZpZPtBo-laws
  2201. 703.38 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2202. 703.38 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  2203. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  2204. 703.38 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  2205. 703.38 s [algebraic-graph-duoids] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  2206. 703.38 s [algebraic-graph-duoids] Ready component graph:
  2207. 703.38 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2208. 703.38 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  2209. 703.38 s [algebraic-graph-duoids] depends base-4.21.0.0-f068
  2210. 703.38 s [algebraic-graph-duoids] depends duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  2211. 703.38 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BLs4stF7Q617YqzZpZPtBo-laws
  2212. 703.38 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2213. 703.38 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  2214. 703.38 s [algebraic-graph-duoids] depends base-4.21.0.0-f068
  2215. 703.38 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  2216. 703.38 s [algebraic-graph-duoids] depends hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  2217. 703.38 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BsCVSspHDmhFjQRvObHyjh-doctests
  2218. 703.38 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2219. 703.38 s [algebraic-graph-duoids] depends base-4.21.0.0-f068
  2220. 703.38 s [algebraic-graph-duoids] depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  2221. 703.38 s [algebraic-graph-duoids] Using Cabal-3.14.1.0 compiled by ghc-9.12
  2222. 703.38 s [algebraic-graph-duoids] Using compiler: ghc-9.12.1
  2223. 703.38 s [algebraic-graph-duoids] Using install prefix:
  2224. 703.38 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0
  2225. 703.38 s [algebraic-graph-duoids] Executables installed in:
  2226. 703.38 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/bin
  2227. 703.38 s [algebraic-graph-duoids] Libraries installed in:
  2228. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2229. 703.39 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  2230. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  2231. 703.39 s [algebraic-graph-duoids] Private executables installed in:
  2232. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0
  2233. 703.39 s [algebraic-graph-duoids] Data files installed in:
  2234. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0
  2235. 703.39 s [algebraic-graph-duoids] Documentation installed in:
  2236. 703.39 s [algebraic-graph-duoids] /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  2237. 703.39 s [algebraic-graph-duoids] Configuration files installed in:
  2238. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/etc
  2239. 703.39 s [algebraic-graph-duoids] No alex found
  2240. 703.39 s [algebraic-graph-duoids] Using ar found on system at:
  2241. 703.39 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  2242. 703.39 s [algebraic-graph-duoids] No c2hs found
  2243. 703.39 s [algebraic-graph-duoids] No cpphs found
  2244. 703.39 s [algebraic-graph-duoids] Using doctest version 0.24.0 found on system at:
  2245. 703.39 s [algebraic-graph-duoids] /nix/store/x1z9pyd8hb27z4bhy7lsj2npgsq740xd-doctest-0.24.0/bin/doctest
  2246. 703.39 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  2247. 703.39 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  2248. 703.39 s [algebraic-graph-duoids] Using ghc version 9.12.1 found on system at:
  2249. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  2250. 703.39 s [algebraic-graph-duoids] Using ghc-pkg version 9.12.1 found on system at:
  2251. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  2252. 703.39 s [algebraic-graph-duoids] No ghcjs found
  2253. 703.39 s [algebraic-graph-duoids] No ghcjs-pkg found
  2254. 703.39 s [algebraic-graph-duoids] No greencard found
  2255. 703.39 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  2256. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  2257. 703.39 s [algebraic-graph-duoids] No happy found
  2258. 703.39 s [algebraic-graph-duoids] No haskell-suite found
  2259. 703.39 s [algebraic-graph-duoids] No haskell-suite-pkg found
  2260. 703.39 s [algebraic-graph-duoids] No hmake found
  2261. 703.39 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  2262. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  2263. 703.39 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  2264. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  2265. 703.39 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  2266. 703.39 s [algebraic-graph-duoids] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  2267. 703.39 s [algebraic-graph-duoids] No jhc found
  2268. 703.39 s [algebraic-graph-duoids] Using ld found on system at:
  2269. 703.39 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  2270. 703.39 s [algebraic-graph-duoids] No pkg-config found
  2271. 703.39 s [algebraic-graph-duoids] Using runghc version 9.12.1 found on system at:
  2272. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  2273. 703.39 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  2274. 703.39 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  2275. 703.39 s [algebraic-graph-duoids] Using tar found on system at:
  2276. 703.39 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  2277. 703.39 s [algebraic-graph-duoids] No uhc found
  2278. 703.53 s [algebraic-graph-duoids] Phase: buildPhase
  2279. 703.60 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2280. 703.61 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  2281. 703.67 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 )
  2282. 703.73 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 )
  2283. 704.63 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  2284. 704.77 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 )
  2285. 706.72 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2286. 706.72 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2287. 706.83 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  2288. 707.17 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  2289. 708.13 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2290. 708.13 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2291. 708.21 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 )
  2292. 708.40 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2293. 708.91 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  2294. 713.90 s [algebraic-graph-duoids] Phase: checkPhase
  2295. 714.23 s [algebraic-graph-duoids] Running 2 test suites...
  2296. 714.23 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  2297. 714.27 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  2298. 714.27 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  2299. 714.27 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  2300. 714.27 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  2301. 714.27 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  2302. 714.27 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  2303. 714.27 s [algebraic-graph-duoids] ✓ 5 succeeded.
  2304. 714.27 s [algebraic-graph-duoids] Test suite laws: PASS
  2305. 714.28 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  2306. 714.28 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  2307. 714.77 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2308. 714.81 s [algebraic-graph-duoids] Test suite doctests: PASS
  2309. 714.82 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  2310. 714.82 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  2311. 714.83 s [algebraic-graph-duoids] Phase: haddockPhase
  2312. 715.48 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2313. 715.48 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  2314. 715.74 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing ) [HIE file is missing]
  2315. 715.78 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing ) [HIE file is missing]
  2316. 715.98 s [algebraic-graph-duoids] Haddock coverage:
  2317. 716.13 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  2318. 716.13 s [algebraic-graph-duoids] Missing documentation for:
  2319. 716.13 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:24)
  2320. 716.13 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27)
  2321. 716.13 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:30)
  2322. 716.13 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:33)
  2323. 716.13 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  2324. 720.46 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids,
  2325. 720.50 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  2326. 721.11 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2327. 721.83 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2328. 721.91 s [algebraic-graph-duoids] Phase: installPhase
  2329. 722.01 s [algebraic-graph-duoids] Installing library in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  2330. 722.82 s [algebraic-graph-duoids] Phase: fixupPhase
  2331. 722.93 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0
  2332. 722.94 s [algebraic-graph-duoids] shrinking /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSalgebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW-ghc9.12.1.so
  2333. 722.95 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0...
  2334. 722.98 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0
  2335. 722.99 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib
  2336. 723.18 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  2337. 723.19 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc...
  2338. 723.21 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  2339. 723.51 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  2340. 724.79 s [algebraic-graph-duoids:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  2341. 724.79 s [algebraic-graph-duoids:post-build]
  2342. 725.16 s [algebraic-graph-duoids:post-build] Pushing /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 (1.20 MiB)
  2343. 725.25 s [algebraic-graph-duoids:post-build] Pushing /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc (523.55 KiB)
  2344. 726.26 s [algebraic-graph-duoids:post-build]
  2345. 726.26 s [algebraic-graph-duoids:post-build] All done.
  2346. 726.38 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  2347. 726.86 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2348. 727.04 s [algebraic-graph-duoids:post-build] copying 2 paths...
  2349. 727.04 s [algebraic-graph-duoids:post-build] copying path '/nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2350. 727.58 s [algebraic-graph-duoids:post-build] copying path '/nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  2351. 728.71 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2352. 729.08 s [algebraic-graph-duoids:post-build] copying 1 paths...
  2353. 729.08 s [algebraic-graph-duoids:post-build] copying path '/nix/store/6lsm2jsyhyd8z7j3a6i1zibq5mjbysbx-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  2354. 729.55 s Progress: 10 of 14 built, 145 of 145 downloaded from cache
  2355. 729.68 s Building /nix/store/c6x0ym1al3b7mw9nrjhzph7sc82bfrpc-ghc-9.12.1-with-packages.drv
  2356. 729.88 s [ghc-9.12.1-with-packages] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/nix-support:
  2357. 729.88 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2358. 729.94 s [ghc-9.12.1-with-packages] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/nix-support:
  2359. 729.94 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2360. 729.95 s [ghc-9.12.1-with-packages] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/nix-support:
  2361. 729.95 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2362. 729.97 s [ghc-9.12.1-with-packages] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/nix-support:
  2363. 729.97 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2364. 729.98 s [ghc-9.12.1-with-packages] /nix/store/3rg1ihmrm8ka1zzq6vfqw94rg8gg8is3-hedgehog-1.5/nix-support:
  2365. 729.98 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2366. 730.05 s [ghc-9.12.1-with-packages] /nix/store/3rg1ihmrm8ka1zzq6vfqw94rg8gg8is3-hedgehog-1.5/nix-support:
  2367. 730.06 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2368. 730.07 s [ghc-9.12.1-with-packages] /nix/store/qsv9n4s59sa83q6va9k9jv5k8dmw0p92-ansi-terminal-1.1.2/nix-support:
  2369. 730.07 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2370. 730.08 s [ghc-9.12.1-with-packages] /nix/store/qsv9n4s59sa83q6va9k9jv5k8dmw0p92-ansi-terminal-1.1.2/nix-support:
  2371. 730.08 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2372. 730.09 s [ghc-9.12.1-with-packages] /nix/store/i7lyljfdjjbs28kf5lglymhqpzra03v4-async-2.2.5/nix-support:
  2373. 730.09 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2374. 730.10 s [ghc-9.12.1-with-packages] /nix/store/i7lyljfdjjbs28kf5lglymhqpzra03v4-async-2.2.5/nix-support:
  2375. 730.10 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2376. 730.11 s [ghc-9.12.1-with-packages] /nix/store/ybmpwvkpckiqyia3j9451j8bsm8an2s8-barbies-2.1.1.0/nix-support:
  2377. 730.11 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2378. 730.15 s [ghc-9.12.1-with-packages] /nix/store/ybmpwvkpckiqyia3j9451j8bsm8an2s8-barbies-2.1.1.0/nix-support:
  2379. 730.15 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2380. 730.15 s [ghc-9.12.1-with-packages] /nix/store/r9g9yx0pf4sb0bhg2bgxywlxi2gp7l88-concurrent-output-1.10.21/nix-support:
  2381. 730.15 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2382. 730.15 s [ghc-9.12.1-with-packages] /nix/store/r9g9yx0pf4sb0bhg2bgxywlxi2gp7l88-concurrent-output-1.10.21/nix-support:
  2383. 730.15 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2384. 730.16 s [ghc-9.12.1-with-packages] /nix/store/cf2n41y0xbrif1db9a6k14jplixlj6d0-lifted-async-0.10.2.7/nix-support:
  2385. 730.16 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2386. 730.16 s [ghc-9.12.1-with-packages] /nix/store/cf2n41y0xbrif1db9a6k14jplixlj6d0-lifted-async-0.10.2.7/nix-support:
  2387. 730.17 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2388. 730.18 s [ghc-9.12.1-with-packages] /nix/store/n5bvgmddj1a1vcq81s32i7ccbhx07qb9-mmorph-1.2.0/nix-support:
  2389. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2390. 730.18 s [ghc-9.12.1-with-packages] /nix/store/n5bvgmddj1a1vcq81s32i7ccbhx07qb9-mmorph-1.2.0/nix-support:
  2391. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2392. 730.18 s [ghc-9.12.1-with-packages] /nix/store/ad47csx7c715qbn695fklkmlm60qs2ii-monad-control-1.0.3.1/nix-support:
  2393. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2394. 730.18 s [ghc-9.12.1-with-packages] /nix/store/ad47csx7c715qbn695fklkmlm60qs2ii-monad-control-1.0.3.1/nix-support:
  2395. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2396. 730.19 s [ghc-9.12.1-with-packages] /nix/store/v3hgabkm1a7jvnn4ys4kvqwklwflnqis-pretty-show-1.10/nix-support:
  2397. 730.19 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2398. 730.19 s [ghc-9.12.1-with-packages] /nix/store/v3hgabkm1a7jvnn4ys4kvqwklwflnqis-pretty-show-1.10/nix-support:
  2399. 730.19 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2400. 730.19 s [ghc-9.12.1-with-packages] /nix/store/nz98l6467qac3f3l1jdcf3gmwjc659d3-primitive-0.9.1.0/nix-support:
  2401. 730.19 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2402. 730.21 s [ghc-9.12.1-with-packages] /nix/store/nz98l6467qac3f3l1jdcf3gmwjc659d3-primitive-0.9.1.0/nix-support:
  2403. 730.22 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2404. 730.23 s [ghc-9.12.1-with-packages] /nix/store/2c6rybf8m8jrly84dzbyhv9xxzc81pzs-random-1.2.1.3/nix-support:
  2405. 730.23 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2406. 730.23 s [ghc-9.12.1-with-packages] /nix/store/2c6rybf8m8jrly84dzbyhv9xxzc81pzs-random-1.2.1.3/nix-support:
  2407. 730.23 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2408. 730.25 s [ghc-9.12.1-with-packages] /nix/store/346qzqng2wkldyma6igal0i8w3clp0mw-resourcet-1.3.0/nix-support:
  2409. 730.25 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2410. 730.27 s [ghc-9.12.1-with-packages] /nix/store/346qzqng2wkldyma6igal0i8w3clp0mw-resourcet-1.3.0/nix-support:
  2411. 730.27 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2412. 730.27 s [ghc-9.12.1-with-packages] /nix/store/vqvlw9p3sh64qbc5wmqciiqpsdcacw2z-safe-exceptions-0.1.7.4/nix-support:
  2413. 730.27 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2414. 730.28 s [ghc-9.12.1-with-packages] /nix/store/vqvlw9p3sh64qbc5wmqciiqpsdcacw2z-safe-exceptions-0.1.7.4/nix-support:
  2415. 730.28 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2416. 730.29 s [ghc-9.12.1-with-packages] /nix/store/llbvsa4qwzkpdf064fkxckdymixlssa0-transformers-base-0.4.6/nix-support:
  2417. 730.29 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2418. 730.29 s [ghc-9.12.1-with-packages] /nix/store/llbvsa4qwzkpdf064fkxckdymixlssa0-transformers-base-0.4.6/nix-support:
  2419. 730.29 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2420. 730.29 s [ghc-9.12.1-with-packages] /nix/store/bnca7ki3sf219if16d403g91za6xbmb3-wl-pprint-annotated-0.1.0.1/nix-support:
  2421. 730.29 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2422. 730.30 s [ghc-9.12.1-with-packages] /nix/store/bnca7ki3sf219if16d403g91za6xbmb3-wl-pprint-annotated-0.1.0.1/nix-support:
  2423. 730.30 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2424. 730.31 s [ghc-9.12.1-with-packages] /nix/store/4ddn0biwyk9v185vyl40030qszsja32p-ansi-terminal-types-1.1/nix-support:
  2425. 730.31 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2426. 730.31 s [ghc-9.12.1-with-packages] /nix/store/4ddn0biwyk9v185vyl40030qszsja32p-ansi-terminal-types-1.1/nix-support:
  2427. 730.31 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2428. 730.35 s [ghc-9.12.1-with-packages] /nix/store/cwqwam6n53231bm299x6lmna5rjf1qjz-hashable-1.4.7.0/nix-support:
  2429. 730.35 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2430. 730.37 s [ghc-9.12.1-with-packages] /nix/store/cwqwam6n53231bm299x6lmna5rjf1qjz-hashable-1.4.7.0/nix-support:
  2431. 730.37 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2432. 730.39 s [ghc-9.12.1-with-packages] /nix/store/z3isz5mf07j2ipn8i8lpb1lzxagvarf9-distributive-0.6.2.1/nix-support:
  2433. 730.39 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2434. 730.44 s [ghc-9.12.1-with-packages] /nix/store/z3isz5mf07j2ipn8i8lpb1lzxagvarf9-distributive-0.6.2.1/nix-support:
  2435. 730.44 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2436. 730.48 s [ghc-9.12.1-with-packages] /nix/store/yl6jjm3jvhmgh228fwm119amj2pvywgl-constraints-0.14.2/nix-support:
  2437. 730.48 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2438. 730.48 s [ghc-9.12.1-with-packages] /nix/store/yl6jjm3jvhmgh228fwm119amj2pvywgl-constraints-0.14.2/nix-support:
  2439. 730.48 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2440. 730.50 s [ghc-9.12.1-with-packages] /nix/store/x7azizjy4c52ijqkjcg21bzf9kd2cmrd-lifted-base-0.2.3.12/nix-support:
  2441. 730.50 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2442. 730.54 s [ghc-9.12.1-with-packages] /nix/store/x7azizjy4c52ijqkjcg21bzf9kd2cmrd-lifted-base-0.2.3.12/nix-support:
  2443. 730.54 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2444. 730.57 s [ghc-9.12.1-with-packages] /nix/store/1bzzh814ank4w463vp6nis9hjcsmsv23-transformers-compat-0.7.2/nix-support:
  2445. 730.57 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2446. 730.57 s [ghc-9.12.1-with-packages] /nix/store/1bzzh814ank4w463vp6nis9hjcsmsv23-transformers-compat-0.7.2/nix-support:
  2447. 730.57 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2448. 730.59 s [ghc-9.12.1-with-packages] /nix/store/pdgkv5b35wwazg0rkiblywql74brrybn-splitmix-0.1.1/nix-support:
  2449. 730.59 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2450. 730.60 s [ghc-9.12.1-with-packages] /nix/store/pdgkv5b35wwazg0rkiblywql74brrybn-splitmix-0.1.1/nix-support:
  2451. 730.60 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2452. 730.60 s [ghc-9.12.1-with-packages] /nix/store/9vk33g3cma3g74298czk1gmaimikw3x2-unliftio-core-0.2.1.0/nix-support:
  2453. 730.60 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2454. 730.61 s [ghc-9.12.1-with-packages] /nix/store/9vk33g3cma3g74298czk1gmaimikw3x2-unliftio-core-0.2.1.0/nix-support:
  2455. 730.61 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2456. 730.61 s [ghc-9.12.1-with-packages] /nix/store/6fm6badzwhkjw490cv3n54c1zxpy125j-base-orphans-0.9.3/nix-support:
  2457. 730.61 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2458. 730.62 s [ghc-9.12.1-with-packages] /nix/store/6fm6badzwhkjw490cv3n54c1zxpy125j-base-orphans-0.9.3/nix-support:
  2459. 730.62 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2460. 730.62 s [ghc-9.12.1-with-packages] /nix/store/xaw9bx3il5rk6l5cg6m9rhpq0z4syjs8-tagged-0.8.9/nix-support:
  2461. 730.62 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2462. 730.63 s [ghc-9.12.1-with-packages] /nix/store/xaw9bx3il5rk6l5cg6m9rhpq0z4syjs8-tagged-0.8.9/nix-support:
  2463. 730.63 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2464. 730.64 s [ghc-9.12.1-with-packages] /nix/store/0h7l00ix0g1idvsxi9mvf27z05krln3r-boring-0.2.2/nix-support:
  2465. 730.64 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2466. 730.65 s [ghc-9.12.1-with-packages] /nix/store/0h7l00ix0g1idvsxi9mvf27z05krln3r-boring-0.2.2/nix-support:
  2467. 730.65 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2468. 734.04 s [ghc-9.12.1-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages
  2469. 735.25 s [ghc-9.12.1-with-packages:post-build] Pushing 1 paths (138 are already present) using zstd to cache sellout ⏳
  2470. 735.25 s [ghc-9.12.1-with-packages:post-build]
  2471. 735.63 s [ghc-9.12.1-with-packages:post-build] Pushing /nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages (6.02 MiB)
  2472. 737.67 s [ghc-9.12.1-with-packages:post-build]
  2473. 737.67 s [ghc-9.12.1-with-packages:post-build] All done.
  2474. 737.85 s [ghc-9.12.1-with-packages:post-build] Uploading to the NixCI cache: /nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages
  2475. 738.52 s [ghc-9.12.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2476. 738.86 s [ghc-9.12.1-with-packages:post-build] copying 1 paths...
  2477. 738.86 s [ghc-9.12.1-with-packages:post-build] copying path '/nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages' to 'https://cache.nix-ci.com'...
  2478. 741.26 s [ghc-9.12.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2479. 741.72 s [ghc-9.12.1-with-packages:post-build] copying 1 paths...
  2480. 741.72 s [ghc-9.12.1-with-packages:post-build] copying path '/nix/store/c6x0ym1al3b7mw9nrjhzph7sc82bfrpc-ghc-9.12.1-with-packages.drv' to 'https://cache.nix-ci.com'...
  2481. 742.10 s Progress: 11 of 13 built, 145 of 145 downloaded from cache
  2482. 742.20 s Building /nix/store/yc3zi8pgxawk7h50sk69794w5n8l6ylp-all-packages.drv
  2483. 742.32 s [all-packages] created 3 symlinks in user environment
  2484. 742.48 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages
  2485. 743.57 s [all-packages:post-build] Pushing 1 paths (139 are already present) using zstd to cache sellout ⏳
  2486. 743.57 s [all-packages:post-build]
  2487. 743.97 s [all-packages:post-build] Pushing /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages (872.00 B)
  2488. 745.04 s [all-packages:post-build]
  2489. 745.05 s [all-packages:post-build] All done.
  2490. 745.27 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages
  2491. 745.72 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2492. 746.00 s [all-packages:post-build] copying 1 paths...
  2493. 746.00 s [all-packages:post-build] copying path '/nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages' to 'https://cache.nix-ci.com'...
  2494. 746.88 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2495. 747.26 s [all-packages:post-build] copying 1 paths...
  2496. 747.26 s [all-packages:post-build] copying path '/nix/store/yc3zi8pgxawk7h50sk69794w5n8l6ylp-all-packages.drv' to 'https://cache.nix-ci.com'...
  2497. 747.73 s Progress: 12 of 13 built, 145 of 145 downloaded from cache
  2498. 747.73 s Progress: 13 of 13 built, 145 of 145 downloaded from cache
  2499. 747.73 s /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages
  2500. 747.82 s Build succeeded.
More Logs Raw Logs

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/6605f631-46ae-4275-94ae-a689e8d6d5b7/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/6605f631-46ae-4275-94ae-a689e8d6d5b7/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/6605f631-46ae-4275-94ae-a689e8d6d5b7/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/6605f631-46ae-4275-94ae-a689e8d6d5b7/raw-logs

Content types available for /logs and /tail (use Accept header):

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/6605f631-46ae-4275-94ae-a689e8d6d5b7/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/6605f631-46ae-4275-94ae-a689e8d6d5b7/repro

This page is also available in machine-friendly formats. Request one with the Accept header:

For more instructions, fetch https://nix-ci.com/instructions .