build packages.x86_64-linux.ghc9103_all

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

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0c653c76-7e0a-47a0-9ffd-b5d237c9cac2/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0c653c76-7e0a-47a0-9ffd-b5d237c9cac2/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0c653c76-7e0a-47a0-9ffd-b5d237c9cac2/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0c653c76-7e0a-47a0-9ffd-b5d237c9cac2/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/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0c653c76-7e0a-47a0-9ffd-b5d237c9cac2/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0c653c76-7e0a-47a0-9ffd-b5d237c9cac2/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 .