build packages.x86_64-linux.default

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

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/1e79ff21-c312-4d33-90f9-421a2beee8f7/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/1e79ff21-c312-4d33-90f9-421a2beee8f7/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/1e79ff21-c312-4d33-90f9-421a2beee8f7/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/1e79ff21-c312-4d33-90f9-421a2beee8f7/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/1e79ff21-c312-4d33-90f9-421a2beee8f7/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 .