build packages.x86_64-linux.ghc9122_all

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

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/973b7efb-e7ee-4eea-a72a-a3c4e43adf96/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/973b7efb-e7ee-4eea-a72a-a3c4e43adf96/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/973b7efb-e7ee-4eea-a72a-a3c4e43adf96/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/973b7efb-e7ee-4eea-a72a-a3c4e43adf96/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/973b7efb-e7ee-4eea-a72a-a3c4e43adf96/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 .