build packages.x86_64-linux.default

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

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/aef7f273-618e-4d11-a96a-6c851df5fca4/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/aef7f273-618e-4d11-a96a-6c851df5fca4/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/aef7f273-618e-4d11-a96a-6c851df5fca4/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/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/aef7f273-618e-4d11-a96a-6c851df5fca4/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/aef7f273-618e-4d11-a96a-6c851df5fca4/repro

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