build packages.x86_64-linux.ghc984_all

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

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b8c15bde-db57-4a9f-9866-cfd89cd966d8/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b8c15bde-db57-4a9f-9866-cfd89cd966d8/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b8c15bde-db57-4a9f-9866-cfd89cd966d8/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b8c15bde-db57-4a9f-9866-cfd89cd966d8/raw-logs

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

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b8c15bde-db57-4a9f-9866-cfd89cd966d8/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b8c15bde-db57-4a9f-9866-cfd89cd966d8/repro

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

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