build packages.x86_64-linux.default

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

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/77547ad9-b78b-4467-931e-7c0afa0ab475/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/77547ad9-b78b-4467-931e-7c0afa0ab475/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/77547ad9-b78b-4467-931e-7c0afa0ab475/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/77547ad9-b78b-4467-931e-7c0afa0ab475/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/77547ad9-b78b-4467-931e-7c0afa0ab475/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 .