build devShells.x86_64-linux.ghc9102

Reproduce this run Retry Run
  1. 1689.70 s [algebraic-graphs]
  2. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  3. 1689.70 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  4. 1689.70 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  5. 1689.70 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  6. 1689.70 s [algebraic-graphs]
  7. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  8. 1689.70 s [algebraic-graphs] OK: transpose empty == empty
  9. 1689.70 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  10. 1689.70 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  11. 1689.70 s [algebraic-graphs] OK: transpose . transpose == id
  12. 1689.70 s [algebraic-graphs]
  13. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  14. 1689.70 s [algebraic-graphs] OK: fmap f empty == empty
  15. 1689.70 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  16. 1689.70 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  17. 1689.70 s [algebraic-graphs] OK: fmap id == id
  18. 1689.70 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19. 1689.70 s [algebraic-graphs]
  20. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  21. 1689.70 s [algebraic-graphs] OK: emap h empty == empty
  22. 1689.70 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  23. 1689.70 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  24. 1689.70 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  25. 1689.70 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  26. 1689.70 s [algebraic-graphs] OK: emap id == id
  27. 1689.70 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  28. 1689.70 s [algebraic-graphs]
  29. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  30. 1689.70 s [algebraic-graphs] OK: induce (const True ) x == x
  31. 1689.70 s [algebraic-graphs] OK: induce (const False) x == empty
  32. 1689.70 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  33. 1689.70 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  34. 1689.70 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  35. 1689.70 s [algebraic-graphs]
  36. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  37. 1689.70 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  38. 1689.70 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  39. 1689.70 s [algebraic-graphs] OK: induceJust . gmap Just == id
  40. 1689.70 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  41. 1689.70 s [algebraic-graphs]
  42. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  43. 1689.70 s [algebraic-graphs] OK: closure empty == empty
  44. 1689.70 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  45. 1689.70 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  46. 1689.70 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  47. 1689.70 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  48. 1689.70 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  49. 1689.70 s [algebraic-graphs] OK: closure . closure == closure
  50. 1689.70 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  51. 1689.70 s [algebraic-graphs]
  52. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  53. 1689.70 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  54. 1689.70 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  55. 1689.70 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  56. 1689.70 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  57. 1689.70 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  58. 1689.70 s [algebraic-graphs]
  59. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  60. 1689.70 s [algebraic-graphs] OK: symmetricClosure empty == empty
  61. 1689.70 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  62. 1689.70 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  63. 1689.70 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  64. 1689.70 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  65. 1689.70 s [algebraic-graphs]
  66. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  67. 1689.70 s [algebraic-graphs] OK: transitiveClosure empty == empty
  68. 1689.70 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  69. 1689.70 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  70. 1689.70 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  71. 1689.70 s [algebraic-graphs]
  72. 1689.70 s [algebraic-graphs] ============ Labelled.Graph.context ============
  73. 1689.71 s [algebraic-graphs] OK: context (const False) x == Nothing
  74. 1689.71 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  75. 1689.71 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  76. 1689.71 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  77. 1689.71 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  78. 1689.71 s [algebraic-graphs]
  79. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  80. 1689.71 s [algebraic-graphs] OK: Axioms of non-empty graphs
  81. 1689.71 s [algebraic-graphs] OK: Theorems of non-empty graphs
  82. 1689.71 s [algebraic-graphs]
  83. 1689.71 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  84. 1689.71 s [algebraic-graphs] OK: vertex 1 < vertex 2
  85. 1689.71 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  86. 1689.71 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  87. 1689.71 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  88. 1689.71 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  89. 1689.71 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  90. 1689.71 s [algebraic-graphs] OK: x <= x + y
  91. 1689.71 s [algebraic-graphs] OK: x + y <= x * y
  92. 1689.71 s [algebraic-graphs]
  93. 1689.71 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  94. 1689.71 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  95. 1689.71 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  96. 1689.71 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  97. 1689.71 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  98. 1689.71 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  99. 1689.71 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  100. 1689.71 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  101. 1689.71 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  102. 1689.71 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  103. 1689.71 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  104. 1689.71 s [algebraic-graphs]
  105. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  106. 1689.71 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  107. 1689.71 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  108. 1689.71 s [algebraic-graphs]
  109. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  110. 1689.71 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  111. 1689.71 s [algebraic-graphs]
  112. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  113. 1689.71 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  114. 1689.71 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  115. 1689.71 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  116. 1689.71 s [algebraic-graphs]
  117. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  118. 1689.71 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  119. 1689.71 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  120. 1689.71 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  121. 1689.71 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  122. 1689.71 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  123. 1689.71 s [algebraic-graphs]
  124. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  125. 1689.71 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  126. 1689.71 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  127. 1689.71 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  128. 1689.71 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  129. 1689.71 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  130. 1689.71 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  131. 1689.71 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  132. 1689.71 s [algebraic-graphs]
  133. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  134. 1689.71 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  135. 1689.71 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  136. 1689.71 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  137. 1689.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  138. 1689.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  139. 1689.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  140. 1689.71 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  141. 1689.71 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  142. 1689.71 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  143. 1689.71 s [algebraic-graphs]
  144. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  145. 1689.71 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  146. 1689.71 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  147. 1689.71 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  148. 1689.71 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  149. 1689.71 s [algebraic-graphs]
  150. 1689.71 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  151. 1689.71 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  152. 1689.71 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  153. 1689.71 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  154. 1689.71 s [algebraic-graphs]
  155. 1692.63 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  156. 1692.63 s [algebraic-graphs] OK: overlays1 [x] == x
  157. 1692.74 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  158. 1692.74 s [algebraic-graphs]
  159. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  160. 1692.74 s [algebraic-graphs] OK: connects1 [x] == x
  161. 1692.74 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  162. 1692.74 s [algebraic-graphs]
  163. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  164. 1692.74 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  165. 1692.74 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  166. 1692.74 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  167. 1692.74 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  168. 1692.74 s [algebraic-graphs]
  169. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  170. 1692.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  171. 1692.74 s [algebraic-graphs]
  172. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  173. 1692.74 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  174. 1692.74 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  175. 1692.74 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  176. 1692.74 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  177. 1692.74 s [algebraic-graphs]
  178. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  179. 1692.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  180. 1692.74 s [algebraic-graphs] OK: vertexCount x >= 1
  181. 1692.74 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  182. 1692.74 s [algebraic-graphs]
  183. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  184. 1692.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  185. 1692.74 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  186. 1692.74 s [algebraic-graphs] OK: edgeCount == length . edgeList
  187. 1692.74 s [algebraic-graphs]
  188. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  189. 1692.74 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  190. 1692.74 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  191. 1692.74 s [algebraic-graphs]
  192. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  193. 1692.74 s [algebraic-graphs] OK: edgeList (vertex x) == []
  194. 1692.74 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  195. 1692.74 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  196. 1692.74 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  197. 1692.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  198. 1692.74 s [algebraic-graphs]
  199. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  200. 1692.74 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  201. 1692.74 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  202. 1692.74 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  203. 1692.74 s [algebraic-graphs]
  204. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  205. 1692.74 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  206. 1692.74 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  207. 1692.74 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  208. 1692.74 s [algebraic-graphs]
  209. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  210. 1692.74 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  211. 1692.74 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  212. 1692.74 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  213. 1692.74 s [algebraic-graphs]
  214. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  215. 1692.74 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  216. 1692.74 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  217. 1692.74 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  218. 1692.74 s [algebraic-graphs]
  219. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  220. 1692.74 s [algebraic-graphs] OK: path1 [x] == vertex x
  221. 1692.74 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  222. 1692.74 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  223. 1692.74 s [algebraic-graphs]
  224. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  225. 1692.74 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  226. 1692.74 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  227. 1692.74 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  228. 1692.74 s [algebraic-graphs]
  229. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  230. 1692.74 s [algebraic-graphs] OK: clique1 [x] == vertex x
  231. 1692.74 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  232. 1692.74 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  233. 1692.74 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  234. 1692.74 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  235. 1692.74 s [algebraic-graphs]
  236. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  237. 1692.74 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  238. 1692.74 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  239. 1692.74 s [algebraic-graphs]
  240. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  241. 1692.74 s [algebraic-graphs] OK: star x [] == vertex x
  242. 1692.74 s [algebraic-graphs] OK: star x [y] == edge x y
  243. 1692.74 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  244. 1692.74 s [algebraic-graphs]
  245. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  246. 1692.74 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  247. 1692.74 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  248. 1692.74 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  249. 1692.74 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  250. 1692.74 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  251. 1692.74 s [algebraic-graphs]
  252. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  253. 1692.74 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  254. 1692.74 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  255. 1692.74 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  256. 1692.74 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  257. 1692.74 s [algebraic-graphs]
  258. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  259. 1692.74 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  260. 1692.74 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  261. 1692.74 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  262. 1692.74 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  263. 1692.74 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  264. 1692.74 s [algebraic-graphs]
  265. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  266. 1692.74 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  267. 1692.74 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  268. 1692.74 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  269. 1692.74 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  270. 1692.74 s [algebraic-graphs]
  271. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  272. 1692.74 s [algebraic-graphs] OK: replaceVertex x x == id
  273. 1692.74 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  274. 1692.74 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  275. 1692.74 s [algebraic-graphs]
  276. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  277. 1692.74 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  278. 1692.74 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  279. 1692.74 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  280. 1692.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  281. 1692.74 s [algebraic-graphs]
  282. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  283. 1692.74 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  284. 1692.74 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  285. 1692.74 s [algebraic-graphs] OK: transpose . transpose == id
  286. 1692.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  287. 1692.74 s [algebraic-graphs]
  288. 1692.74 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  289. 1692.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  290. 1692.75 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  291. 1692.75 s [algebraic-graphs] OK: gmap id == id
  292. 1692.75 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  293. 1692.75 s [algebraic-graphs]
  294. 1692.75 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  295. 1692.75 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  296. 1692.75 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  297. 1692.75 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  298. 1692.75 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  299. 1692.75 s [algebraic-graphs]
  300. 1692.75 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  301. 1692.75 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  302. 1692.75 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  303. 1692.75 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  304. 1692.75 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  305. 1692.75 s [algebraic-graphs]
  306. 1692.75 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  307. 1692.75 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  308. 1692.75 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  309. 1692.75 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  310. 1692.75 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  311. 1692.75 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  312. 1692.75 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  313. 1692.75 s [algebraic-graphs] OK: closure . closure == closure
  314. 1692.75 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  315. 1692.75 s [algebraic-graphs]
  316. 1692.75 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  317. 1692.75 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  318. 1692.75 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  319. 1692.75 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  320. 1692.75 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  321. 1692.75 s [algebraic-graphs]
  322. 1692.75 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  323. 1692.75 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  324. 1692.75 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  325. 1692.75 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  326. 1692.75 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  327. 1692.75 s [algebraic-graphs]
  328. 1692.75 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  329. 1692.75 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  330. 1692.75 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  331. 1692.75 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  332. 1692.75 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  333. 1692.75 s [algebraic-graphs]
  334. 1692.75 s [algebraic-graphs] ============ NonEmpty.Graph.============
  335. 1692.75 s [algebraic-graphs] OK: Axioms of non-empty graphs
  336. 1692.75 s [algebraic-graphs] OK: Theorems of non-empty graphs
  337. 1692.75 s [algebraic-graphs]
  338. 1692.75 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  339. 1692.75 s [algebraic-graphs] OK: vertex 1 < vertex 2
  340. 1692.75 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  341. 1692.75 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  342. 1692.75 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  343. 1692.75 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  344. 1692.75 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  345. 1692.75 s [algebraic-graphs] OK: x <= x + y
  346. 1692.75 s [algebraic-graphs] OK: x + y <= x * y
  347. 1692.75 s [algebraic-graphs]
  348. 1692.75 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  349. 1692.75 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  350. 1692.75 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  351. 1692.75 s [algebraic-graphs] OK: fmap id == id
  352. 1692.75 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  353. 1692.75 s [algebraic-graphs]
  354. 1692.75 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  355. 1692.75 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  356. 1693.81 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  357. 1693.81 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  358. 1693.81 s [algebraic-graphs] OK: (x >>= vertex) == x
  359. 1693.81 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  360. 1693.81 s [algebraic-graphs]
  361. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  362. 1693.81 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  363. 1693.81 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  364. 1693.81 s [algebraic-graphs]
  365. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  366. 1693.81 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  367. 1693.81 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  368. 1693.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  369. 1693.81 s [algebraic-graphs] OK: size (vertex x) == 1
  370. 1693.81 s [algebraic-graphs]
  371. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  372. 1693.81 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  373. 1693.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  374. 1693.81 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  375. 1693.81 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  376. 1693.81 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  377. 1693.81 s [algebraic-graphs]
  378. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  379. 1693.81 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  380. 1693.81 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  381. 1693.81 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  382. 1693.81 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  383. 1693.81 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  384. 1693.81 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  385. 1693.81 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  386. 1693.81 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  387. 1693.81 s [algebraic-graphs]
  388. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  389. 1693.81 s [algebraic-graphs] OK: overlay1 empty x == x
  390. 1693.81 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  391. 1693.81 s [algebraic-graphs]
  392. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  393. 1693.81 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  394. 1693.81 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  395. 1693.81 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  396. 1693.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  397. 1693.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  398. 1693.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  399. 1693.81 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  400. 1693.81 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  401. 1693.81 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  402. 1693.81 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  403. 1693.81 s [algebraic-graphs]
  404. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  405. 1693.81 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  406. 1693.81 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  407. 1693.81 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  408. 1693.81 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  409. 1693.81 s [algebraic-graphs]
  410. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  411. 1693.81 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  412. 1693.81 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  413. 1693.81 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  414. 1693.81 s [algebraic-graphs]
  415. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  416. 1693.81 s [algebraic-graphs] OK: overlays1 [x] == x
  417. 1693.81 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  418. 1693.81 s [algebraic-graphs]
  419. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  420. 1693.81 s [algebraic-graphs] OK: connects1 [x] == x
  421. 1693.81 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  422. 1693.81 s [algebraic-graphs]
  423. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  424. 1693.81 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  425. 1693.81 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  426. 1693.81 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  427. 1693.81 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  428. 1693.81 s [algebraic-graphs]
  429. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  430. 1693.81 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  431. 1693.81 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  432. 1693.81 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  433. 1693.81 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  434. 1693.81 s [algebraic-graphs]
  435. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  436. 1693.81 s [algebraic-graphs] OK: x === x == True
  437. 1693.81 s [algebraic-graphs] OK: x + y === x + y == True
  438. 1693.81 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  439. 1693.81 s [algebraic-graphs] OK: x + y === x * y == False
  440. 1693.81 s [algebraic-graphs]
  441. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  442. 1693.81 s [algebraic-graphs] OK: size (vertex x) == 1
  443. 1693.81 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  444. 1693.81 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  445. 1693.81 s [algebraic-graphs] OK: size x >= 1
  446. 1693.81 s [algebraic-graphs] OK: size x >= vertexCount x
  447. 1693.81 s [algebraic-graphs]
  448. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  449. 1693.81 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  450. 1693.81 s [algebraic-graphs]
  451. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  452. 1693.81 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  453. 1693.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  454. 1693.81 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  455. 1693.81 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  456. 1693.81 s [algebraic-graphs]
  457. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  458. 1693.81 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  459. 1693.81 s [algebraic-graphs] OK: vertexCount x >= 1
  460. 1693.81 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  461. 1693.81 s [algebraic-graphs]
  462. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  463. 1693.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  464. 1693.81 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  465. 1693.81 s [algebraic-graphs] OK: edgeCount == length . edgeList
  466. 1693.81 s [algebraic-graphs]
  467. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  468. 1693.81 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  469. 1693.81 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  470. 1693.81 s [algebraic-graphs]
  471. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  472. 1693.81 s [algebraic-graphs] OK: edgeList (vertex x) == []
  473. 1693.81 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  474. 1693.81 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  475. 1693.81 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  476. 1693.81 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  477. 1693.81 s [algebraic-graphs]
  478. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  479. 1693.81 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  480. 1693.81 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  481. 1693.81 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  482. 1693.81 s [algebraic-graphs]
  483. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  484. 1693.81 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  485. 1693.81 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  486. 1693.81 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  487. 1693.81 s [algebraic-graphs]
  488. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  489. 1693.81 s [algebraic-graphs] OK: path1 [x] == vertex x
  490. 1693.81 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  491. 1693.81 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  492. 1693.81 s [algebraic-graphs]
  493. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  494. 1693.81 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  495. 1693.81 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  496. 1693.81 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  497. 1693.81 s [algebraic-graphs]
  498. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  499. 1693.81 s [algebraic-graphs] OK: clique1 [x] == vertex x
  500. 1693.81 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  501. 1693.81 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  502. 1693.81 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  503. 1693.81 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  504. 1693.81 s [algebraic-graphs]
  505. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  506. 1693.81 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  507. 1693.81 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  508. 1693.81 s [algebraic-graphs]
  509. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  510. 1693.81 s [algebraic-graphs] OK: star x [] == vertex x
  511. 1693.81 s [algebraic-graphs] OK: star x [y] == edge x y
  512. 1693.81 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  513. 1693.81 s [algebraic-graphs]
  514. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  515. 1693.81 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  516. 1693.81 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  517. 1693.81 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  518. 1693.81 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  519. 1693.81 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  520. 1693.81 s [algebraic-graphs]
  521. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  522. 1693.81 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  523. 1693.81 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  524. 1693.81 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  525. 1693.81 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  526. 1693.81 s [algebraic-graphs]
  527. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  528. 1693.81 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  529. 1693.81 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  530. 1693.81 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  531. 1693.81 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  532. 1693.81 s [algebraic-graphs]
  533. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  534. 1693.81 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  535. 1693.81 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  536. 1693.81 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  537. 1693.81 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  538. 1693.81 s [algebraic-graphs]
  539. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  540. 1693.81 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  541. 1693.81 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  542. 1693.81 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  543. 1693.81 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  544. 1693.81 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  545. 1693.81 s [algebraic-graphs]
  546. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  547. 1693.81 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  548. 1693.81 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  549. 1693.81 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  550. 1693.81 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  551. 1693.81 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  552. 1693.81 s [algebraic-graphs]
  553. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  554. 1693.81 s [algebraic-graphs] OK: replaceVertex x x == id
  555. 1693.81 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  556. 1693.81 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  557. 1693.81 s [algebraic-graphs]
  558. 1693.81 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  559. 1693.81 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  560. 1695.95 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.p_o )
  561. 1696.50 s [haskell-language-server] [ 7 of 10] Compiling Ide.Plugin.Eval.Parse.Comments ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Comments.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.p_o )
  562. 1699.17 s [haskell-language-server] [ 8 of 10] Compiling Ide.Plugin.Eval.Code ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.p_o )
  563. 1699.29 s [haskell-language-server] plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs:88:18: warning: [GHC-63394] [-Wx-partial]
  564. 1699.29 s [haskell-language-server] In the use of ‘head’
  565. 1699.29 s [haskell-language-server] (imported from Prelude, but defined in GHC.Internal.List):
  566. 1699.29 s [haskell-language-server] "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"."
  567. 1699.29 s [haskell-language-server] |
  568. 1699.29 s [haskell-language-server] 88 | evalPrint <- head <$> runDecls ("evalPrint x = P.writeFile " <> show temp <> " (P.show x)")
  569. 1699.29 s [haskell-language-server] | ^^^^
  570. 1699.29 s [haskell-language-server]
  571. 1699.29 s [haskell-language-server] [ 9 of 10] Compiling Ide.Plugin.Eval.Handlers ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Handlers.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.p_o )
  572. 1699.51 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  573. 1699.51 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  574. 1699.51 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  575. 1699.51 s [algebraic-graphs]
  576. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  577. 1699.51 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  578. 1699.51 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  579. 1699.51 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  580. 1699.51 s [algebraic-graphs]
  581. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  582. 1699.51 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  583. 1699.51 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  584. 1699.51 s [algebraic-graphs] OK: transpose . transpose == id
  585. 1699.51 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  586. 1699.51 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  587. 1699.51 s [algebraic-graphs]
  588. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  589. 1699.51 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  590. 1699.51 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  591. 1699.51 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  592. 1699.51 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  593. 1699.51 s [algebraic-graphs]
  594. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  595. 1699.51 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  596. 1699.51 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  597. 1699.51 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  598. 1699.51 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  599. 1699.51 s [algebraic-graphs]
  600. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  601. 1699.51 s [algebraic-graphs] OK: simplify == id
  602. 1699.51 s [algebraic-graphs] OK: size (simplify x) <= size x
  603. 1699.51 s [algebraic-graphs] OK: simplify 1 === 1
  604. 1699.51 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  605. 1699.51 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  606. 1699.51 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  607. 1699.51 s [algebraic-graphs]
  608. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  609. 1699.51 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  610. 1699.51 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  611. 1699.51 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  612. 1699.51 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  613. 1699.51 s [algebraic-graphs]
  614. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  615. 1699.51 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  616. 1699.51 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  617. 1699.51 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  618. 1699.51 s [algebraic-graphs]
  619. 1699.51 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  620. 1699.51 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  621. 1699.51 s [algebraic-graphs] OK: box x y ~~ box y x
  622. 1699.51 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  623. 1699.51 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  624. 1699.51 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  625. 1699.51 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  626. 1699.51 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  627. 1699.51 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  628. 1699.51 s [algebraic-graphs]
  629. 1699.51 s [algebraic-graphs] ============ Relation ============
  630. 1699.51 s [algebraic-graphs] OK: Axioms of graphs
  631. 1699.51 s [algebraic-graphs]
  632. 1699.51 s [algebraic-graphs] ============ Relation.consistent ============
  633. 1699.51 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  634. 1699.51 s [algebraic-graphs]
  635. 1699.51 s [algebraic-graphs] OK: consistent empty == True
  636. 1699.51 s [algebraic-graphs] OK: consistent (vertex x) == True
  637. 1699.51 s [algebraic-graphs] OK: consistent (overlay x y) == True
  638. 1699.51 s [algebraic-graphs] OK: consistent (connect x y) == True
  639. 1699.51 s [algebraic-graphs] OK: consistent (edge x y) == True
  640. 1699.51 s [algebraic-graphs] OK: consistent (edges xs) == True
  641. 1699.51 s [algebraic-graphs] OK: consistent (stars xs) == True
  642. 1699.51 s [algebraic-graphs]
  643. 1699.51 s [algebraic-graphs] ============ Relation.Show ============
  644. 1699.51 s [algebraic-graphs] OK: show (empty ) == "empty"
  645. 1699.51 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  646. 1699.51 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  647. 1699.51 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  648. 1699.51 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  649. 1699.51 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  650. 1699.51 s [algebraic-graphs]
  651. 1699.51 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  652. 1699.51 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  653. 1699.51 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  654. 1699.51 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  655. 1699.51 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  656. 1699.51 s [algebraic-graphs]
  657. 1699.51 s [algebraic-graphs] ============ Relation.Ord ============
  658. 1699.51 s [algebraic-graphs] OK: vertex 1 < vertex 2
  659. 1699.51 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  660. 1699.51 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  661. 1699.51 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  662. 1699.51 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  663. 1699.51 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  664. 1699.51 s [algebraic-graphs] OK: x <= x + y
  665. 1699.51 s [algebraic-graphs] OK: x + y <= x * y
  666. 1699.51 s [algebraic-graphs]
  667. 1699.51 s [algebraic-graphs] ============ Relation.empty ============
  668. 1699.51 s [algebraic-graphs] OK: isEmpty empty == True
  669. 1699.51 s [algebraic-graphs] OK: hasVertex x empty == False
  670. 1699.51 s [algebraic-graphs] OK: vertexCount empty == 0
  671. 1699.51 s [algebraic-graphs] OK: edgeCount empty == 0
  672. 1699.51 s [algebraic-graphs]
  673. 1699.51 s [algebraic-graphs] ============ Relation.vertex ============
  674. 1699.51 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  675. 1699.51 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  676. 1699.51 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  677. 1699.51 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  678. 1699.51 s [algebraic-graphs]
  679. 1699.51 s [algebraic-graphs] ============ Relation.edge ============
  680. 1699.51 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  681. 1699.51 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  682. 1699.51 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  683. 1699.51 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  684. 1699.51 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  685. 1699.51 s [algebraic-graphs]
  686. 1699.51 s [algebraic-graphs] ============ Relation.overlay ============
  687. 1699.51 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  688. 1699.51 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  689. 1699.51 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  690. 1699.51 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  691. 1699.51 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  692. 1699.51 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  693. 1699.51 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  694. 1699.51 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  695. 1699.51 s [algebraic-graphs]
  696. 1699.51 s [algebraic-graphs] ============ Relation.connect ============
  697. 1699.51 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  698. 1699.51 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  699. 1699.51 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  700. 1699.51 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  701. 1699.51 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  702. 1699.51 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  703. 1699.51 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  704. 1699.51 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  705. 1699.51 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  706. 1699.51 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  707. 1699.51 s [algebraic-graphs]
  708. 1699.51 s [algebraic-graphs] ============ Relation.vertices ============
  709. 1699.51 s [algebraic-graphs] OK: vertices [] == empty
  710. 1699.51 s [algebraic-graphs] OK: vertices [x] == vertex x
  711. 1699.51 s [algebraic-graphs] OK: vertices == overlays . map vertex
  712. 1699.51 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  713. 1699.51 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  714. 1699.51 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  715. 1699.51 s [algebraic-graphs]
  716. 1699.51 s [algebraic-graphs] ============ Relation.edges ============
  717. 1699.51 s [algebraic-graphs] OK: edges [] == empty
  718. 1699.51 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  719. 1699.51 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  720. 1699.51 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  721. 1699.51 s [algebraic-graphs]
  722. 1699.51 s [algebraic-graphs] ============ Relation.overlays ============
  723. 1699.51 s [algebraic-graphs] OK: overlays [] == empty
  724. 1699.51 s [algebraic-graphs] OK: overlays [x] == x
  725. 1699.51 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  726. 1699.51 s [algebraic-graphs] OK: overlays == foldr overlay empty
  727. 1699.51 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  728. 1699.51 s [algebraic-graphs]
  729. 1699.51 s [algebraic-graphs] ============ Relation.connects ============
  730. 1699.51 s [algebraic-graphs] OK: connects [] == empty
  731. 1699.51 s [algebraic-graphs] OK: connects [x] == x
  732. 1699.51 s [algebraic-graphs] OK: connects [x,y] == connect x y
  733. 1699.51 s [algebraic-graphs] OK: connects == foldr connect empty
  734. 1699.51 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  735. 1699.51 s [algebraic-graphs]
  736. 1699.51 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  737. 1699.51 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  738. 1699.51 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  739. 1699.51 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  740. 1699.51 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  741. 1699.51 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  742. 1699.51 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  743. 1699.51 s [algebraic-graphs]
  744. 1699.51 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  745. 1699.51 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  746. 1699.51 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  747. 1699.51 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  748. 1699.51 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  749. 1699.51 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  750. 1699.51 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  751. 1699.51 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  752. 1699.51 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  753. 1699.51 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  754. 1699.51 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  755. 1699.51 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  756. 1699.51 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  757. 1699.51 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  758. 1699.51 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  759. 1699.51 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  760. 1699.51 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  761. 1699.51 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  762. 1700.91 s [haskell-language-server] [10 of 10] Compiling Ide.Plugin.Eval ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval.p_o )
  763. 1702.57 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  764. 1702.57 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  765. 1702.57 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  766. 1702.57 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  767. 1702.57 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  768. 1702.57 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  769. 1702.57 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  770. 1702.57 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  771. 1702.57 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  772. 1702.57 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  773. 1702.57 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  774. 1702.57 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  775. 1702.57 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  776. 1702.57 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  777. 1702.57 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  778. 1702.57 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  779. 1702.57 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  780. 1702.57 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  781. 1702.57 s [algebraic-graphs]
  782. 1702.57 s [algebraic-graphs] ============ Relation.foldg ============
  783. 1702.57 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  784. 1702.57 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  785. 1702.57 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  786. 1702.57 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  787. 1702.57 s [algebraic-graphs]
  788. 1702.57 s [algebraic-graphs] ============ Relation.isEmpty ============
  789. 1702.57 s [algebraic-graphs] OK: isEmpty empty == True
  790. 1702.57 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  791. 1702.57 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  792. 1702.57 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  793. 1702.57 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  794. 1702.57 s [algebraic-graphs]
  795. 1702.57 s [algebraic-graphs] ============ Relation.hasVertex ============
  796. 1702.57 s [algebraic-graphs] OK: hasVertex x empty == False
  797. 1702.57 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  798. 1702.57 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  799. 1702.57 s [algebraic-graphs]
  800. 1702.57 s [algebraic-graphs] ============ Relation.hasEdge ============
  801. 1702.57 s [algebraic-graphs] OK: hasEdge x y empty == False
  802. 1702.57 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  803. 1702.57 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  804. 1702.57 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  805. 1702.57 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  806. 1702.57 s [algebraic-graphs]
  807. 1702.57 s [algebraic-graphs] ============ Relation.vertexCount ============
  808. 1702.57 s [algebraic-graphs] OK: vertexCount empty == 0
  809. 1702.57 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  810. 1702.57 s [algebraic-graphs] OK: vertexCount == length . vertexList
  811. 1702.57 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  812. 1702.57 s [algebraic-graphs]
  813. 1702.57 s [algebraic-graphs] ============ Relation.edgeCount ============
  814. 1702.57 s [algebraic-graphs] OK: edgeCount empty == 0
  815. 1702.57 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  816. 1702.57 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  817. 1702.57 s [algebraic-graphs] OK: edgeCount == length . edgeList
  818. 1702.57 s [algebraic-graphs]
  819. 1702.57 s [algebraic-graphs] ============ Relation.vertexList ============
  820. 1702.57 s [algebraic-graphs] OK: vertexList empty == []
  821. 1702.57 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  822. 1702.57 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  823. 1702.57 s [algebraic-graphs]
  824. 1702.57 s [algebraic-graphs] ============ Relation.vertexSet ============
  825. 1702.57 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  826. 1702.57 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  827. 1702.57 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  828. 1702.57 s [algebraic-graphs]
  829. 1702.57 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  830. 1702.57 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  831. 1702.57 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  832. 1702.57 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  833. 1702.57 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  834. 1702.57 s [algebraic-graphs]
  835. 1702.57 s [algebraic-graphs] ============ Relation.edgeList ============
  836. 1702.57 s [algebraic-graphs] OK: edgeList empty == []
  837. 1702.57 s [algebraic-graphs] OK: edgeList (vertex x) == []
  838. 1702.57 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  839. 1702.57 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  840. 1702.57 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  841. 1702.57 s [algebraic-graphs]
  842. 1702.57 s [algebraic-graphs] ============ Relation.edgeSet ============
  843. 1702.57 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  844. 1702.57 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  845. 1702.57 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  846. 1702.57 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  847. 1702.57 s [algebraic-graphs]
  848. 1702.57 s [algebraic-graphs] ============ Relation.adjacencyList ============
  849. 1702.57 s [algebraic-graphs] OK: adjacencyList empty == []
  850. 1702.57 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  851. 1702.57 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  852. 1702.57 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  853. 1702.57 s [algebraic-graphs]
  854. 1702.57 s [algebraic-graphs] ============ Relation.preSet ============
  855. 1702.57 s [algebraic-graphs] OK: preSet x empty == Set.empty
  856. 1702.57 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  857. 1702.57 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  858. 1702.57 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  859. 1702.57 s [algebraic-graphs]
  860. 1702.57 s [algebraic-graphs] ============ Relation.preIntSet ============
  861. 1702.57 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  862. 1702.57 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  863. 1702.57 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  864. 1702.57 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  865. 1702.57 s [algebraic-graphs]
  866. 1702.57 s [algebraic-graphs] ============ Relation.postSet ============
  867. 1702.57 s [algebraic-graphs] OK: postSet x empty == Set.empty
  868. 1702.57 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  869. 1702.57 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  870. 1702.57 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  871. 1702.57 s [algebraic-graphs]
  872. 1702.57 s [algebraic-graphs] ============ Relation.postIntSet ============
  873. 1702.57 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  874. 1702.57 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  875. 1702.57 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  876. 1702.57 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  877. 1702.57 s [algebraic-graphs]
  878. 1702.57 s [algebraic-graphs] ============ Relation.path ============
  879. 1702.57 s [algebraic-graphs] OK: path [] == empty
  880. 1702.57 s [algebraic-graphs] OK: path [x] == vertex x
  881. 1702.57 s [algebraic-graphs] OK: path [x,y] == edge x y
  882. 1702.57 s [algebraic-graphs]
  883. 1702.57 s [algebraic-graphs] ============ Relation.circuit ============
  884. 1702.57 s [algebraic-graphs] OK: circuit [] == empty
  885. 1702.57 s [algebraic-graphs] OK: circuit [x] == edge x x
  886. 1702.57 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  887. 1702.57 s [algebraic-graphs]
  888. 1702.58 s [algebraic-graphs] ============ Relation.clique ============
  889. 1702.58 s [algebraic-graphs] OK: clique [] == empty
  890. 1702.58 s [algebraic-graphs] OK: clique [x] == vertex x
  891. 1702.58 s [algebraic-graphs] OK: clique [x,y] == edge x y
  892. 1702.58 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  893. 1702.58 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  894. 1702.58 s [algebraic-graphs]
  895. 1702.58 s [algebraic-graphs] ============ Relation.biclique ============
  896. 1702.58 s [algebraic-graphs] OK: biclique [] [] == empty
  897. 1702.58 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  898. 1702.58 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  899. 1702.58 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  900. 1702.58 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  901. 1702.58 s [algebraic-graphs]
  902. 1702.58 s [algebraic-graphs] ============ Relation.star ============
  903. 1702.58 s [algebraic-graphs] OK: star x [] == vertex x
  904. 1702.58 s [algebraic-graphs] OK: star x [y] == edge x y
  905. 1702.58 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  906. 1702.58 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  907. 1702.58 s [algebraic-graphs]
  908. 1702.58 s [algebraic-graphs] ============ Relation.stars ============
  909. 1702.58 s [algebraic-graphs] OK: stars [] == empty
  910. 1702.58 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  911. 1702.58 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  912. 1702.58 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  913. 1702.58 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  914. 1702.58 s [algebraic-graphs] OK: stars . adjacencyList == id
  915. 1702.58 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  916. 1702.58 s [algebraic-graphs]
  917. 1702.58 s [algebraic-graphs] ============ Relation.tree ============
  918. 1702.58 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  919. 1702.58 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  920. 1702.58 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  921. 1702.58 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  922. 1702.58 s [algebraic-graphs]
  923. 1702.58 s [algebraic-graphs] ============ Relation.forest ============
  924. 1702.58 s [algebraic-graphs] OK: forest [] == empty
  925. 1702.58 s [algebraic-graphs] OK: forest [x] == tree x
  926. 1702.58 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  927. 1702.58 s [algebraic-graphs] OK: forest == overlays . map tree
  928. 1702.58 s [algebraic-graphs]
  929. 1702.58 s [algebraic-graphs] ============ Relation.removeVertex ============
  930. 1702.58 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  931. 1702.58 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  932. 1702.58 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  933. 1702.58 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  934. 1702.58 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  935. 1702.58 s [algebraic-graphs]
  936. 1702.58 s [algebraic-graphs] ============ Relation.removeEdge ============
  937. 1702.58 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  938. 1702.58 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  939. 1702.58 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  940. 1702.58 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  941. 1702.58 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  942. 1702.58 s [algebraic-graphs]
  943. 1702.58 s [algebraic-graphs] ============ Relation.replaceVertex ============
  944. 1702.58 s [algebraic-graphs] OK: replaceVertex x x == id
  945. 1702.58 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  946. 1702.58 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  947. 1702.58 s [algebraic-graphs]
  948. 1702.58 s [algebraic-graphs] ============ Relation.mergeVertices ============
  949. 1702.58 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  950. 1707.85 s [haskell-language-server] Preprocessing library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0...
  951. 1707.86 s [haskell-language-server] Building library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0...
  952. 1708.29 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  953. 1708.29 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  954. 1708.29 s [haskell-language-server] but were not needed for compilation:
  955. 1708.29 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-IirkPG3WlKFB1IJ6vX6V2W)
  956. 1708.29 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-D1h7FGYBPxc3G9HA7KuFke)
  957. 1708.29 s [haskell-language-server]
  958. 1708.31 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.dyn_o )
  959. 1708.62 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.dyn_o )
  960. 1713.69 s Waiting for lock on waiting for lock on '/nix/store/0f9vs0llmqh8yip6v421kjy9ldkdn2pq-shellcheck-0.11.0-doc', '/nix/store/hcc1a75b03pjsf9jjyd3zfk3ncrkpbsx-shellcheck-0.11.0', '/nix/store/q46qczdsfm7pa4149jgb7v6xa9zljk5p-shellcheck-0.11.0-bin', '/nix/store/v93xmg5bvf5sj2p5d3fc0pibj69j18d4-shellcheck-0.11.0-man'
  961. 1718.64 s Waiting for lock on waiting for lock on '/nix/store/fcs2clcrs5mnyacfz6zw1npry66gqw0r-bash-language-server
  962. 1722.13 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.dyn_o )
  963. 1722.16 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.dyn_o )
  964. 1722.16 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.dyn_o )
  965. 1722.24 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.dyn_o )
  966. 1723.11 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.dyn_o )
  967. 1724.12 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.dyn_o )
  968. 1724.12 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.dyn_o )
  969. 1724.12 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.dyn_o )
  970. 1724.12 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.dyn_o )
  971. 1724.12 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.dyn_o )
  972. 1724.12 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.dyn_o )
  973. 1725.11 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  974. 1725.11 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  975. 1725.11 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  976. 1725.11 s [algebraic-graphs]
  977. 1725.11 s [algebraic-graphs] ============ Relation.transpose ============
  978. 1725.11 s [algebraic-graphs] OK: transpose empty == empty
  979. 1725.11 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  980. 1725.11 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  981. 1725.11 s [algebraic-graphs] OK: transpose . transpose == id
  982. 1725.11 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  983. 1725.11 s [algebraic-graphs]
  984. 1725.11 s [algebraic-graphs] ============ Relation.gmap ============
  985. 1725.11 s [algebraic-graphs] OK: gmap f empty == empty
  986. 1725.11 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  987. 1725.11 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  988. 1725.11 s [algebraic-graphs] OK: gmap id == id
  989. 1725.11 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  990. 1725.11 s [algebraic-graphs]
  991. 1725.11 s [algebraic-graphs] ============ Relation.induce ============
  992. 1725.11 s [algebraic-graphs] OK: induce (const True ) x == x
  993. 1725.11 s [algebraic-graphs] OK: induce (const False) x == empty
  994. 1725.11 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  995. 1725.11 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  996. 1725.11 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  997. 1725.11 s [algebraic-graphs]
  998. 1725.11 s [algebraic-graphs] ============ Relation.compose ============
  999. 1725.11 s [algebraic-graphs] OK: compose empty x == empty
  1000. 1725.11 s [algebraic-graphs] OK: compose x empty == empty
  1001. 1725.11 s [algebraic-graphs] OK: compose (vertex x) y == empty
  1002. 1725.11 s [algebraic-graphs] OK: compose x (vertex y) == empty
  1003. 1725.11 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  1004. 1725.11 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  1005. 1725.11 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  1006. 1725.11 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  1007. 1725.11 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  1008. 1725.11 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  1009. 1725.11 s [algebraic-graphs]
  1010. 1725.11 s [algebraic-graphs] ============ Relation.closure ============
  1011. 1725.11 s [algebraic-graphs] OK: closure empty == empty
  1012. 1725.11 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  1013. 1725.11 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  1014. 1725.11 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1015. 1725.11 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  1016. 1725.11 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  1017. 1725.11 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  1018. 1725.11 s [algebraic-graphs] OK: closure . closure == closure
  1019. 1725.11 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  1020. 1725.11 s [algebraic-graphs]
  1021. 1725.11 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  1022. 1725.11 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  1023. 1725.11 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  1024. 1725.11 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  1025. 1725.11 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1026. 1725.11 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  1027. 1725.11 s [algebraic-graphs]
  1028. 1725.11 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  1029. 1725.11 s [algebraic-graphs] OK: symmetricClosure empty == empty
  1030. 1725.11 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  1031. 1725.11 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  1032. 1725.11 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  1033. 1725.11 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  1034. 1725.11 s [algebraic-graphs]
  1035. 1725.11 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  1036. 1725.11 s [algebraic-graphs] OK: transitiveClosure empty == empty
  1037. 1725.11 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  1038. 1725.11 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  1039. 1725.11 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  1040. 1725.11 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  1041. 1725.11 s [algebraic-graphs]
  1042. 1725.11 s [algebraic-graphs] ============ Relation.induceJust ============
  1043. 1725.11 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1044. 1725.11 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1045. 1725.11 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1046. 1725.11 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1047. 1725.11 s [algebraic-graphs]
  1048. 1725.11 s [algebraic-graphs] ============ ReflexiveRelation ============
  1049. 1725.11 s [algebraic-graphs] OK: Axioms of reflexive graphs
  1050. 1725.11 s [algebraic-graphs]
  1051. 1725.11 s [algebraic-graphs] ============ TransitiveRelation ============
  1052. 1725.11 s [algebraic-graphs] OK: Axioms of transitive graphs
  1053. 1725.11 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  1054. 1725.11 s [algebraic-graphs]
  1055. 1725.11 s [algebraic-graphs] ============ PreorderRelation ============
  1056. 1725.11 s [algebraic-graphs] OK: Axioms of preorder graphs
  1057. 1725.11 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  1058. 1725.11 s [algebraic-graphs]
  1059. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation ============
  1060. 1725.11 s [algebraic-graphs] OK: Axioms of undirected graphs
  1061. 1725.11 s [algebraic-graphs]
  1062. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  1063. 1725.11 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  1064. 1725.11 s [algebraic-graphs]
  1065. 1725.11 s [algebraic-graphs] OK: consistent empty == True
  1066. 1725.11 s [algebraic-graphs] OK: consistent (vertex x) == True
  1067. 1725.11 s [algebraic-graphs] OK: consistent (overlay x y) == True
  1068. 1725.11 s [algebraic-graphs] OK: consistent (connect x y) == True
  1069. 1725.11 s [algebraic-graphs] OK: consistent (edge x y) == True
  1070. 1725.11 s [algebraic-graphs] OK: consistent (edges xs) == True
  1071. 1725.11 s [algebraic-graphs] OK: consistent (stars xs) == True
  1072. 1725.11 s [algebraic-graphs]
  1073. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  1074. 1725.11 s [algebraic-graphs] OK: show (empty ) == "empty"
  1075. 1725.11 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1076. 1725.11 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1077. 1725.11 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1078. 1725.11 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1079. 1725.11 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1080. 1725.11 s [algebraic-graphs]
  1081. 1725.11 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1082. 1725.11 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1083. 1725.11 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1084. 1725.11 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1085. 1725.11 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1086. 1725.11 s [algebraic-graphs]
  1087. 1725.11 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1088. 1725.11 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1089. 1725.11 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1090. 1725.11 s [algebraic-graphs]
  1091. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  1092. 1725.11 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  1093. 1725.11 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  1094. 1725.11 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  1095. 1725.11 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  1096. 1725.11 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  1097. 1725.11 s [algebraic-graphs]
  1098. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  1099. 1725.11 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  1100. 1725.11 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  1101. 1725.11 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  1102. 1725.11 s [algebraic-graphs]
  1103. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  1104. 1725.11 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1105. 1725.11 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1106. 1725.11 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1107. 1725.11 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1108. 1725.11 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1109. 1725.11 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1110. 1725.11 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1111. 1725.11 s [algebraic-graphs] OK: x <= x + y
  1112. 1725.11 s [algebraic-graphs] OK: x + y <= x * y
  1113. 1725.11 s [algebraic-graphs]
  1114. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  1115. 1725.11 s [algebraic-graphs] OK: isEmpty empty == True
  1116. 1725.11 s [algebraic-graphs] OK: hasVertex x empty == False
  1117. 1725.11 s [algebraic-graphs] OK: vertexCount empty == 0
  1118. 1725.11 s [algebraic-graphs] OK: edgeCount empty == 0
  1119. 1725.11 s [algebraic-graphs]
  1120. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  1121. 1725.11 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1122. 1725.11 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1123. 1725.11 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1124. 1725.11 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1125. 1725.11 s [algebraic-graphs]
  1126. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  1127. 1725.11 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1128. 1725.11 s [algebraic-graphs] OK: edge x y == edge y x
  1129. 1725.11 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1130. 1725.11 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1131. 1725.11 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1132. 1725.11 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1133. 1725.11 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1134. 1725.11 s [algebraic-graphs]
  1135. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  1136. 1725.11 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1137. 1725.11 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1138. 1725.11 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1139. 1725.11 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1140. 1725.11 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1141. 1725.11 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1142. 1725.11 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1143. 1725.11 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1144. 1725.11 s [algebraic-graphs]
  1145. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  1146. 1725.11 s [algebraic-graphs] OK: connect x y == connect y x
  1147. 1725.11 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1148. 1725.11 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1149. 1725.11 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1150. 1725.11 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1151. 1725.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1152. 1725.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1153. 1725.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1154. 1725.11 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1155. 1725.11 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1156. 1725.11 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1157. 1725.11 s [algebraic-graphs]
  1158. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  1159. 1725.11 s [algebraic-graphs] OK: vertices [] == empty
  1160. 1725.11 s [algebraic-graphs] OK: vertices [x] == vertex x
  1161. 1725.11 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1162. 1725.11 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1163. 1725.11 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1164. 1725.11 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1165. 1725.11 s [algebraic-graphs]
  1166. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  1167. 1725.11 s [algebraic-graphs] OK: edges [] == empty
  1168. 1725.11 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1169. 1725.11 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1170. 1725.11 s [algebraic-graphs]
  1171. 1725.11 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  1172. 1725.11 s [algebraic-graphs] OK: overlays [] == empty
  1173. 1731.39 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  1174. 1731.48 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  1175. 1731.48 s [haskell-language-server] but were not needed for compilation:
  1176. 1731.48 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-IirkPG3WlKFB1IJ6vX6V2W)
  1177. 1731.48 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-D1h7FGYBPxc3G9HA7KuFke)
  1178. 1731.48 s [haskell-language-server]
  1179. 1731.48 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.p_o )
  1180. 1731.72 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.p_o )
  1181. 1735.93 s [algebraic-graphs] OK: overlays [x] == x
  1182. 1735.93 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1183. 1735.93 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1184. 1735.93 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1185. 1735.93 s [algebraic-graphs]
  1186. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  1187. 1735.93 s [algebraic-graphs] OK: connects [] == empty
  1188. 1735.93 s [algebraic-graphs] OK: connects [x] == x
  1189. 1735.93 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1190. 1735.93 s [algebraic-graphs] OK: connects == foldr connect empty
  1191. 1735.93 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1192. 1735.93 s [algebraic-graphs] OK: connects == connects . reverse
  1193. 1735.93 s [algebraic-graphs]
  1194. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  1195. 1735.93 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1196. 1735.93 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1197. 1735.93 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1198. 1735.93 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1199. 1735.93 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1200. 1735.93 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1201. 1735.93 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1202. 1735.93 s [algebraic-graphs]
  1203. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  1204. 1735.93 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  1205. 1735.93 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  1206. 1735.93 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  1207. 1735.93 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  1208. 1735.93 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  1209. 1735.93 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  1210. 1735.93 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  1211. 1735.93 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  1212. 1735.93 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  1213. 1735.93 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1214. 1735.93 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1215. 1735.93 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1216. 1735.93 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1217. 1735.93 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1218. 1735.93 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1219. 1735.93 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1220. 1735.93 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1221. 1735.93 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1222. 1735.93 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1223. 1735.93 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1224. 1735.93 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1225. 1735.93 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1226. 1735.93 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1227. 1735.93 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1228. 1735.93 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1229. 1735.93 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1230. 1735.93 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1231. 1735.93 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1232. 1735.93 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1233. 1735.93 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1234. 1735.93 s [algebraic-graphs]
  1235. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  1236. 1735.93 s [algebraic-graphs] OK: isEmpty empty == True
  1237. 1735.93 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1238. 1735.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1239. 1735.93 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1240. 1735.93 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1241. 1735.93 s [algebraic-graphs]
  1242. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  1243. 1735.93 s [algebraic-graphs] OK: hasVertex x empty == False
  1244. 1735.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1245. 1735.93 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1246. 1735.93 s [algebraic-graphs]
  1247. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  1248. 1735.93 s [algebraic-graphs] OK: hasEdge x y empty == False
  1249. 1735.93 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1250. 1735.93 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1251. 1735.93 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  1252. 1735.93 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1253. 1735.93 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  1254. 1735.93 s [algebraic-graphs]
  1255. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  1256. 1735.93 s [algebraic-graphs] OK: vertexCount empty == 0
  1257. 1735.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1258. 1735.93 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1259. 1735.93 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1260. 1735.93 s [algebraic-graphs]
  1261. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  1262. 1735.93 s [algebraic-graphs] OK: edgeCount empty == 0
  1263. 1735.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1264. 1735.93 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1265. 1735.93 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1266. 1735.93 s [algebraic-graphs]
  1267. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  1268. 1735.93 s [algebraic-graphs] OK: vertexList empty == []
  1269. 1735.93 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1270. 1735.93 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1271. 1735.93 s [algebraic-graphs]
  1272. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  1273. 1735.93 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1274. 1735.93 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1275. 1735.93 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1276. 1735.93 s [algebraic-graphs]
  1277. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  1278. 1735.93 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1279. 1735.93 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1280. 1735.93 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1281. 1735.93 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1282. 1735.93 s [algebraic-graphs]
  1283. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  1284. 1735.93 s [algebraic-graphs] OK: edgeList empty == []
  1285. 1735.93 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1286. 1735.93 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  1287. 1735.93 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  1288. 1735.93 s [algebraic-graphs]
  1289. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  1290. 1735.93 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1291. 1735.93 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1292. 1735.93 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  1293. 1735.93 s [algebraic-graphs]
  1294. 1735.93 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  1295. 1735.93 s [algebraic-graphs] OK: adjacencyList empty == []
  1296. 1735.93 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1297. 1735.93 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  1298. 1735.94 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  1299. 1735.94 s [algebraic-graphs]
  1300. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  1301. 1735.94 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  1302. 1735.94 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  1303. 1735.94 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  1304. 1735.94 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  1305. 1735.94 s [algebraic-graphs]
  1306. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  1307. 1735.94 s [algebraic-graphs] OK: path [] == empty
  1308. 1735.94 s [algebraic-graphs] OK: path [x] == vertex x
  1309. 1735.94 s [algebraic-graphs] OK: path [x,y] == edge x y
  1310. 1735.94 s [algebraic-graphs] OK: path == path . reverse
  1311. 1735.94 s [algebraic-graphs]
  1312. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  1313. 1735.94 s [algebraic-graphs] OK: circuit [] == empty
  1314. 1735.94 s [algebraic-graphs] OK: circuit [x] == edge x x
  1315. 1735.94 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1316. 1735.94 s [algebraic-graphs] OK: circuit == circuit . reverse
  1317. 1735.94 s [algebraic-graphs]
  1318. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  1319. 1735.94 s [algebraic-graphs] OK: clique [] == empty
  1320. 1735.94 s [algebraic-graphs] OK: clique [x] == vertex x
  1321. 1735.94 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1322. 1735.94 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1323. 1735.94 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1324. 1735.94 s [algebraic-graphs] OK: clique == clique . reverse
  1325. 1735.94 s [algebraic-graphs]
  1326. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  1327. 1735.94 s [algebraic-graphs] OK: biclique [] [] == empty
  1328. 1735.94 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1329. 1735.94 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1330. 1735.94 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1331. 1735.94 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1332. 1735.94 s [algebraic-graphs]
  1333. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  1334. 1735.94 s [algebraic-graphs] OK: star x [] == vertex x
  1335. 1735.94 s [algebraic-graphs] OK: star x [y] == edge x y
  1336. 1735.94 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1337. 1735.94 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1338. 1735.94 s [algebraic-graphs]
  1339. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  1340. 1735.94 s [algebraic-graphs] OK: stars [] == empty
  1341. 1735.94 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1342. 1735.94 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1343. 1735.94 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1344. 1735.94 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1345. 1735.94 s [algebraic-graphs] OK: stars . adjacencyList == id
  1346. 1735.94 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1347. 1735.94 s [algebraic-graphs]
  1348. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  1349. 1735.94 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1350. 1735.94 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1351. 1735.94 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1352. 1735.94 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1353. 1735.94 s [algebraic-graphs]
  1354. 1735.94 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  1355. 1735.94 s [algebraic-graphs] OK: forest [] == empty
  1356. 1741.92 s [algebraic-graphs] OK: forest [x] == tree x
  1357. 1741.92 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1358. 1741.95 s [algebraic-graphs] OK: forest == overlays . map tree
  1359. 1741.95 s [algebraic-graphs]
  1360. 1741.95 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  1361. 1741.95 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1362. 1741.95 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1363. 1741.95 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1364. 1741.95 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1365. 1741.95 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1366. 1741.95 s [algebraic-graphs]
  1367. 1741.95 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  1368. 1741.95 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1369. 1741.96 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1370. 1741.96 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1371. 1741.96 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1372. 1741.96 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1373. 1741.96 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1374. 1741.96 s [algebraic-graphs]
  1375. 1741.96 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  1376. 1741.96 s [algebraic-graphs] OK: replaceVertex x x == id
  1377. 1741.96 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1378. 1741.96 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1379. 1741.96 s [algebraic-graphs]
  1380. 1741.96 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  1381. 1741.96 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1382. 1741.96 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1383. 1741.96 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1384. 1741.96 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1385. 1741.96 s [algebraic-graphs]
  1386. 1741.96 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  1387. 1741.96 s [algebraic-graphs] OK: gmap f empty == empty
  1388. 1741.96 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1389. 1741.96 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1390. 1741.96 s [algebraic-graphs] OK: gmap id == id
  1391. 1741.96 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1392. 1741.96 s [algebraic-graphs]
  1393. 1741.96 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  1394. 1741.96 s [algebraic-graphs] OK: induce (const True ) x == x
  1395. 1741.96 s [algebraic-graphs] OK: induce (const False) x == empty
  1396. 1741.96 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1397. 1741.96 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1398. 1741.96 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1399. 1741.96 s [algebraic-graphs]
  1400. 1741.96 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  1401. 1741.96 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1402. 1741.96 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1403. 1741.96 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1404. 1741.96 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1405. 1741.96 s [algebraic-graphs]
  1406. 1741.96 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  1407. 1741.96 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  1408. 1741.96 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  1409. 1741.96 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  1410. 1741.96 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  1411. 1741.96 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  1412. 1741.96 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  1413. 1741.96 s [algebraic-graphs]
  1414. 1741.96 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  1415. 1741.96 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  1416. 1741.96 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  1417. 1741.96 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  1418. 1741.96 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  1419. 1741.96 s [algebraic-graphs]
  1420. 1741.96 s [algebraic-graphs] ============ Typed ============
  1421. 1741.96 s [algebraic-graphs]
  1422. 1741.96 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  1423. 1741.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1424. 1741.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1425. 1741.96 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  1426. 1741.96 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1427. 1741.96 s [algebraic-graphs]
  1428. 1741.96 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  1429. 1741.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1430. 1741.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1431. 1741.96 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  1432. 1741.96 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1433. 1741.96 s [algebraic-graphs]
  1434. 1741.96 s [algebraic-graphs] ============ Typed.dfsForest ============
  1435. 1741.96 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  1436. 1741.96 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  1437. 1741.96 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  1438. 1741.96 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  1439. 1741.96 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  1440. 1741.96 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  1441. 1741.96 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  1442. 1741.96 s [algebraic-graphs]
  1443. 1741.96 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  1444. 1741.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  1445. 1741.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  1446. 1741.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  1447. 1741.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  1448. 1741.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  1449. 1741.96 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  1450. 1741.96 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  1451. 1741.96 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  1452. 1741.96 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  1453. 1741.96 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  1454. 1741.96 s [algebraic-graphs]
  1455. 1741.96 s [algebraic-graphs] ============ Typed.dfs ============
  1456. 1741.96 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  1457. 1741.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  1458. 1741.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  1459. 1741.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  1460. 1741.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  1461. 1741.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  1462. 1741.96 s [algebraic-graphs] OK: dfs % x $ [] == []
  1463. 1741.96 s [algebraic-graphs]
  1464. 1741.96 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  1465. 1741.96 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  1466. 1741.96 s [algebraic-graphs]
  1467. 1741.96 s [algebraic-graphs] ============ Typed.topSort ============
  1468. 1741.96 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  1469. 1741.96 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  1470. 1741.96 s [algebraic-graphs]
  1471. 1741.96 s [algebraic-graphs] ============ Graph.Undirected ============
  1472. 1741.96 s [algebraic-graphs] OK: Axioms of undirected graphs
  1473. 1741.96 s [algebraic-graphs]
  1474. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  1475. 1741.96 s [algebraic-graphs] OK: show (empty ) == "empty"
  1476. 1741.96 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1477. 1741.96 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1478. 1741.96 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1479. 1741.96 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1480. 1741.96 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1481. 1741.96 s [algebraic-graphs]
  1482. 1741.96 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1483. 1741.96 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1484. 1741.96 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1485. 1741.96 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1486. 1741.96 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1487. 1741.96 s [algebraic-graphs]
  1488. 1741.96 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1489. 1741.96 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1490. 1741.96 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1491. 1741.96 s [algebraic-graphs]
  1492. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  1493. 1741.96 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  1494. 1741.96 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1495. 1741.96 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  1496. 1741.96 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  1497. 1741.96 s [algebraic-graphs]
  1498. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  1499. 1741.96 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  1500. 1741.96 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1501. 1741.96 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  1502. 1741.96 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  1503. 1741.96 s [algebraic-graphs]
  1504. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  1505. 1741.96 s [algebraic-graphs] OK: complement empty == empty
  1506. 1741.96 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  1507. 1741.96 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  1508. 1741.96 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  1509. 1741.96 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  1510. 1741.96 s [algebraic-graphs] OK: complement . complement == id
  1511. 1741.96 s [algebraic-graphs]
  1512. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  1513. 1741.96 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1514. 1741.96 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1515. 1741.96 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1516. 1741.96 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1517. 1741.96 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1518. 1741.96 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1519. 1741.96 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1520. 1741.96 s [algebraic-graphs] OK: x <= x + y
  1521. 1741.96 s [algebraic-graphs] OK: x + y <= x * y
  1522. 1741.96 s [algebraic-graphs]
  1523. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  1524. 1741.96 s [algebraic-graphs] OK: isEmpty empty == True
  1525. 1741.96 s [algebraic-graphs] OK: hasVertex x empty == False
  1526. 1741.96 s [algebraic-graphs] OK: vertexCount empty == 0
  1527. 1741.96 s [algebraic-graphs] OK: edgeCount empty == 0
  1528. 1741.96 s [algebraic-graphs]
  1529. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  1530. 1741.96 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1531. 1741.96 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1532. 1741.96 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1533. 1741.96 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1534. 1741.96 s [algebraic-graphs]
  1535. 1741.96 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  1536. 1741.96 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1537. 1741.96 s [algebraic-graphs] OK: edge x y == edge y x
  1538. 1743.26 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.p_o )
  1539. 1743.26 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.p_o )
  1540. 1743.26 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.p_o )
  1541. 1743.42 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.p_o )
  1542. 1744.18 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.p_o )
  1543. 1744.95 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.p_o )
  1544. 1744.95 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.p_o )
  1545. 1744.95 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.p_o )
  1546. 1744.95 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.p_o )
  1547. 1744.95 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.p_o )
  1548. 1744.95 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.p_o )
  1549. 1749.56 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1550. 1749.56 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1551. 1749.56 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1552. 1749.82 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1553. 1749.82 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1554. 1749.82 s [algebraic-graphs]
  1555. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  1556. 1749.82 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1557. 1749.82 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1558. 1749.82 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1559. 1749.82 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1560. 1749.82 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1561. 1749.82 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1562. 1749.82 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1563. 1749.82 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1564. 1749.82 s [algebraic-graphs]
  1565. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  1566. 1749.82 s [algebraic-graphs] OK: connect x y == connect y x
  1567. 1749.82 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1568. 1749.82 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1569. 1749.82 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1570. 1749.82 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1571. 1749.82 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1572. 1749.82 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1573. 1749.82 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1574. 1749.82 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1575. 1749.82 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1576. 1749.82 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1577. 1749.82 s [algebraic-graphs]
  1578. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  1579. 1749.82 s [algebraic-graphs] OK: vertices [] == empty
  1580. 1749.82 s [algebraic-graphs] OK: vertices [x] == vertex x
  1581. 1749.82 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1582. 1749.82 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1583. 1749.82 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1584. 1749.82 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1585. 1749.82 s [algebraic-graphs]
  1586. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  1587. 1749.82 s [algebraic-graphs] OK: edges [] == empty
  1588. 1749.82 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1589. 1749.82 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1590. 1749.82 s [algebraic-graphs]
  1591. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  1592. 1749.82 s [algebraic-graphs] OK: overlays [] == empty
  1593. 1749.82 s [algebraic-graphs] OK: overlays [x] == x
  1594. 1749.82 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1595. 1749.82 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1596. 1749.82 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1597. 1749.82 s [algebraic-graphs]
  1598. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  1599. 1749.82 s [algebraic-graphs] OK: connects [] == empty
  1600. 1749.82 s [algebraic-graphs] OK: connects [x] == x
  1601. 1749.82 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1602. 1749.82 s [algebraic-graphs] OK: connects == foldr connect empty
  1603. 1749.82 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1604. 1749.82 s [algebraic-graphs] OK: connects == connects . reverse
  1605. 1749.82 s [algebraic-graphs]
  1606. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  1607. 1749.82 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1608. 1749.82 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1609. 1749.82 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1610. 1749.82 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1611. 1749.82 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1612. 1749.82 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1613. 1749.82 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1614. 1749.82 s [algebraic-graphs]
  1615. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.path ============
  1616. 1749.82 s [algebraic-graphs] OK: path [] == empty
  1617. 1749.82 s [algebraic-graphs] OK: path [x] == vertex x
  1618. 1749.82 s [algebraic-graphs] OK: path [x,y] == edge x y
  1619. 1749.82 s [algebraic-graphs] OK: path == path . reverse
  1620. 1749.82 s [algebraic-graphs]
  1621. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  1622. 1749.82 s [algebraic-graphs] OK: circuit [] == empty
  1623. 1749.82 s [algebraic-graphs] OK: circuit [x] == edge x x
  1624. 1749.82 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1625. 1749.82 s [algebraic-graphs] OK: circuit == circuit . reverse
  1626. 1749.82 s [algebraic-graphs]
  1627. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  1628. 1749.82 s [algebraic-graphs] OK: clique [] == empty
  1629. 1749.82 s [algebraic-graphs] OK: clique [x] == vertex x
  1630. 1749.82 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1631. 1749.82 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1632. 1749.82 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1633. 1749.82 s [algebraic-graphs] OK: clique == clique . reverse
  1634. 1749.82 s [algebraic-graphs]
  1635. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  1636. 1749.82 s [algebraic-graphs] OK: biclique [] [] == empty
  1637. 1749.82 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1638. 1749.82 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1639. 1749.82 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1640. 1749.82 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1641. 1749.82 s [algebraic-graphs]
  1642. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.star ============
  1643. 1749.82 s [algebraic-graphs] OK: star x [] == vertex x
  1644. 1749.82 s [algebraic-graphs] OK: star x [y] == edge x y
  1645. 1749.82 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1646. 1749.82 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1647. 1749.82 s [algebraic-graphs]
  1648. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  1649. 1749.82 s [algebraic-graphs] OK: stars [] == empty
  1650. 1749.82 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1651. 1749.82 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1652. 1749.82 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1653. 1749.82 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1654. 1749.82 s [algebraic-graphs] OK: stars . adjacencyList == id
  1655. 1749.82 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1656. 1749.82 s [algebraic-graphs]
  1657. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  1658. 1749.82 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1659. 1749.82 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1660. 1749.82 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1661. 1749.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)]
  1662. 1749.82 s [algebraic-graphs]
  1663. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  1664. 1749.82 s [algebraic-graphs] OK: forest [] == empty
  1665. 1749.82 s [algebraic-graphs] OK: forest [x] == tree x
  1666. 1749.82 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1667. 1749.82 s [algebraic-graphs] OK: forest == overlays . map tree
  1668. 1749.82 s [algebraic-graphs]
  1669. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  1670. 1749.82 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1671. 1749.82 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1672. 1749.82 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1673. 1749.82 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1674. 1749.82 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1675. 1749.82 s [algebraic-graphs]
  1676. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  1677. 1749.82 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1678. 1749.82 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1679. 1749.82 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1680. 1749.82 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1681. 1749.82 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1682. 1749.82 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1683. 1749.82 s [algebraic-graphs]
  1684. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  1685. 1749.82 s [algebraic-graphs] OK: replaceVertex x x == id
  1686. 1749.82 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1687. 1749.82 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1688. 1749.82 s [algebraic-graphs]
  1689. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  1690. 1749.82 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1691. 1749.82 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1692. 1749.82 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1693. 1749.82 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1694. 1749.82 s [algebraic-graphs]
  1695. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  1696. 1749.82 s [algebraic-graphs] OK: gmap f empty == empty
  1697. 1749.82 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1698. 1749.82 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1699. 1749.82 s [algebraic-graphs] OK: gmap id == id
  1700. 1749.82 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1701. 1749.82 s [algebraic-graphs]
  1702. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  1703. 1749.82 s [algebraic-graphs] OK: induce (const True ) x == x
  1704. 1749.82 s [algebraic-graphs] OK: induce (const False) x == empty
  1705. 1749.82 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1706. 1749.82 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1707. 1749.82 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1708. 1749.82 s [algebraic-graphs]
  1709. 1749.82 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  1710. 1749.82 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1711. 1749.82 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1712. 1749.82 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1713. 1749.82 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1714. 1749.82 s [algebraic-graphs] Test suite main: PASS
  1715. 1749.82 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  1716. 1749.82 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  1717. 1749.82 s [algebraic-graphs] checkPhase completed in 1 minutes 50 seconds
  1718. 1749.82 s [algebraic-graphs] Phase: haddockPhase
  1719. 1749.83 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  1720. 1749.83 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  1721. 1749.83 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  1722. 1750.04 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  1723. 1750.10 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  1724. 1750.19 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  1725. 1750.22 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  1726. 1750.32 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  1727. 1750.40 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  1728. 1750.48 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  1729. 1750.54 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  1730. 1750.72 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  1731. 1750.77 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  1732. 1750.85 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  1733. 1750.85 s [algebraic-graphs] In the use of ‘head’
  1734. 1750.85 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1735. 1750.85 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"."
  1736. 1750.85 s [algebraic-graphs] |
  1737. 1750.85 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  1738. 1750.85 s [algebraic-graphs] | ^^^^
  1739. 1750.85 s [algebraic-graphs]
  1740. 1750.85 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  1741. 1750.85 s [algebraic-graphs] In the use of ‘tail’
  1742. 1750.85 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1743. 1750.85 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"."
  1744. 1750.85 s [algebraic-graphs] |
  1745. 1750.85 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  1746. 1750.85 s [algebraic-graphs] | ^^^^
  1747. 1750.85 s [algebraic-graphs]
  1748. 1750.85 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  1749. 1750.85 s [algebraic-graphs] In the use of ‘head’
  1750. 1750.85 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1751. 1750.85 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"."
  1752. 1750.85 s [algebraic-graphs] |
  1753. 1750.85 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  1754. 1750.85 s [algebraic-graphs] | ^^^^
  1755. 1750.85 s [algebraic-graphs]
  1756. 1750.85 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  1757. 1750.85 s [algebraic-graphs] In the use of ‘tail’
  1758. 1750.85 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1759. 1750.85 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"."
  1760. 1750.86 s [algebraic-graphs] |
  1761. 1750.86 s [algebraic-graphs] 397 | bnd' = tail bnd
  1762. 1750.86 s [algebraic-graphs] | ^^^^
  1763. 1750.86 s [algebraic-graphs]
  1764. 1750.86 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  1765. 1750.89 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  1766. 1751.01 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1767. 1751.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1768. 1751.01 s [algebraic-graphs] will become an error in a future GHC release.
  1769. 1751.01 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1770. 1751.01 s [algebraic-graphs] |
  1771. 1751.01 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  1772. 1751.01 s [algebraic-graphs] | ^
  1773. 1751.01 s [algebraic-graphs]
  1774. 1751.01 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1775. 1751.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1776. 1751.01 s [algebraic-graphs] will become an error in a future GHC release.
  1777. 1751.01 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1778. 1751.01 s [algebraic-graphs] |
  1779. 1751.01 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1780. 1751.01 s [algebraic-graphs] | ^
  1781. 1751.01 s [algebraic-graphs]
  1782. 1751.01 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1783. 1751.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1784. 1751.01 s [algebraic-graphs] will become an error in a future GHC release.
  1785. 1751.01 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1786. 1751.01 s [algebraic-graphs] |
  1787. 1751.02 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1788. 1751.02 s [algebraic-graphs] | ^
  1789. 1751.02 s [algebraic-graphs]
  1790. 1751.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1791. 1751.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1792. 1751.02 s [algebraic-graphs] will become an error in a future GHC release.
  1793. 1751.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1794. 1751.02 s [algebraic-graphs] |
  1795. 1751.02 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1796. 1751.02 s [algebraic-graphs] | ^
  1797. 1751.02 s [algebraic-graphs]
  1798. 1751.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1799. 1751.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1800. 1751.02 s [algebraic-graphs] will become an error in a future GHC release.
  1801. 1751.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1802. 1751.02 s [algebraic-graphs] |
  1803. 1751.02 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1804. 1751.02 s [algebraic-graphs] | ^
  1805. 1751.02 s [algebraic-graphs]
  1806. 1751.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1807. 1751.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1808. 1751.02 s [algebraic-graphs] will become an error in a future GHC release.
  1809. 1751.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1810. 1751.02 s [algebraic-graphs] |
  1811. 1751.02 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1812. 1751.02 s [algebraic-graphs] | ^
  1813. 1751.02 s [algebraic-graphs]
  1814. 1751.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1815. 1751.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1816. 1751.02 s [algebraic-graphs] will become an error in a future GHC release.
  1817. 1751.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1818. 1751.02 s [algebraic-graphs] |
  1819. 1751.02 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1820. 1751.02 s [algebraic-graphs] | ^
  1821. 1751.02 s [algebraic-graphs]
  1822. 1751.03 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  1823. 1751.11 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  1824. 1751.16 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  1825. 1751.32 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  1826. 1751.43 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  1827. 1751.54 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  1828. 1751.67 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  1829. 1751.80 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  1830. 1751.92 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1831. 1751.92 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1832. 1751.92 s [algebraic-graphs] will become an error in a future GHC release.
  1833. 1751.92 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1834. 1751.92 s [algebraic-graphs] |
  1835. 1751.92 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  1836. 1751.92 s [algebraic-graphs] | ^
  1837. 1751.92 s [algebraic-graphs]
  1838. 1751.93 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  1839. 1752.04 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1840. 1752.04 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1841. 1752.04 s [algebraic-graphs] will become an error in a future GHC release.
  1842. 1752.04 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1843. 1752.04 s [algebraic-graphs] |
  1844. 1752.04 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  1845. 1752.04 s [algebraic-graphs] | ^
  1846. 1752.04 s [algebraic-graphs]
  1847. 1752.04 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1848. 1752.04 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1849. 1752.04 s [algebraic-graphs] will become an error in a future GHC release.
  1850. 1752.04 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1851. 1752.04 s [algebraic-graphs] |
  1852. 1752.04 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  1853. 1752.04 s [algebraic-graphs] | ^
  1854. 1752.05 s [algebraic-graphs]
  1855. 1752.05 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  1856. 1752.26 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  1857. 1752.36 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  1858. 1752.37 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  1859. 1752.38 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  1860. 1752.39 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  1861. 1752.40 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  1862. 1752.41 s [algebraic-graphs] Haddock coverage:
  1863. 1752.42 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1864. 1752.42 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1865. 1752.42 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1866. 1752.42 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1867. 1752.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1868. 1752.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1869. 1752.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1870. 1752.44 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  1871. 1752.44 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1872. 1752.44 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  1873. 1752.44 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  1874. 1752.44 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1875. 1752.44 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1876. 1752.44 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1877. 1752.44 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  1878. 1752.46 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  1879. 1752.46 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1880. 1752.46 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1881. 1752.46 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1882. 1752.46 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1883. 1752.47 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  1884. 1752.47 s [algebraic-graphs] Missing documentation for:
  1885. 1752.47 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  1886. 1752.47 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  1887. 1752.47 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  1888. 1752.47 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  1889. 1752.47 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1890. 1752.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1891. 1752.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  1892. 1752.47 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  1893. 1752.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1894. 1752.47 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  1895. 1752.47 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  1896. 1752.47 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  1897. 1752.47 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  1898. 1752.47 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1899. 1752.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1900. 1752.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  1901. 1752.48 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1902. 1752.48 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  1903. 1752.48 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1904. 1752.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1905. 1752.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1906. 1752.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  1907. 1752.49 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  1908. 1752.50 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  1909. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1910. 1752.50 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  1911. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1912. 1752.50 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  1913. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1914. 1752.50 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  1915. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1916. 1752.50 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1917. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1918. 1752.50 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  1919. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1920. 1752.50 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1921. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1922. 1752.50 s [algebraic-graphs] Warning: 'box' is out of scope.
  1923. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1924. 1752.50 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  1925. 1752.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1926. 1752.51 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  1927. 1752.51 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1928. 1752.51 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1929. 1752.51 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1930. 1752.51 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1931. 1752.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1932. 1752.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1933. 1752.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1934. 1752.51 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1935. 1752.51 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1936. 1752.52 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  1937. 1752.52 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  1938. 1752.52 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  1939. 1752.52 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1940. 1752.52 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1941. 1752.52 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  1942. 1752.53 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  1943. 1752.53 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  1944. 1752.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1945. 1752.53 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  1946. 1752.53 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  1947. 1752.53 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  1948. 1752.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1949. 1752.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1950. 1752.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  1951. 1752.53 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1952. 1752.53 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1953. 1752.53 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1954. 1752.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1955. 1752.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1956. 1752.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1957. 1752.54 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  1958. 1752.54 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  1959. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  1960. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  1961. 1752.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1962. 1752.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1963. 1752.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  1964. 1752.54 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  1965. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  1966. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  1967. 1752.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1968. 1752.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1969. 1752.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  1970. 1752.54 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  1971. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  1972. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  1973. 1752.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1974. 1752.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1975. 1752.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  1976. 1752.54 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  1977. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  1978. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  1979. 1752.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1980. 1752.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1981. 1752.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  1982. 1752.54 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  1983. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  1984. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  1985. 1752.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1986. 1752.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1987. 1752.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  1988. 1752.54 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  1989. 1752.54 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  1990. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  1991. 1752.54 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  1992. 1752.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1993. 1752.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1994. 1752.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  1995. 1752.54 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1996. 1752.54 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1997. 1752.54 s [algebraic-graphs] Warning: 'empty' is out of scope.
  1998. 1752.54 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1999. 1752.55 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  2000. 1752.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2001. 1752.55 s [algebraic-graphs] Warning: 'edges' is out of scope.
  2002. 1752.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2003. 1752.55 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  2004. 1752.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2005. 1752.55 s [algebraic-graphs] Warning: 'stars' is out of scope.
  2006. 1752.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2007. 1752.55 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  2008. 1752.56 s [algebraic-graphs] Warning: 'nub' is out of scope.
  2009. 1752.56 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2010. 1752.56 s [algebraic-graphs] Warning: 'sort' is out of scope.
  2011. 1752.56 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2012. 1752.56 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  2013. 1752.56 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  2014. 1752.56 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  2015. 1752.56 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2016. 1752.56 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2017. 1752.56 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  2018. 1752.56 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  2019. 1752.56 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  2020. 1752.56 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  2021. 1752.56 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2022. 1752.56 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2023. 1752.56 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  2024. 1752.56 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  2025. 1752.57 s [algebraic-graphs] Missing documentation for:
  2026. 1752.57 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  2027. 1752.57 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  2028. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  2029. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  2030. 1752.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2031. 1752.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2032. 1752.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  2033. 1752.57 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  2034. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  2035. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  2036. 1752.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2037. 1752.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2038. 1752.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  2039. 1752.57 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  2040. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  2041. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  2042. 1752.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2043. 1752.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2044. 1752.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  2045. 1752.57 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  2046. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  2047. 1752.57 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  2048. 1752.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2049. 1752.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2050. 1752.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  2051. 1752.58 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  2052. 1752.58 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  2053. 1752.58 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  2054. 1752.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2055. 1752.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2056. 1752.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  2057. 1752.58 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  2058. 1752.58 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  2059. 1752.58 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  2060. 1752.58 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  2061. 1752.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2062. 1752.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2063. 1752.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  2064. 1752.58 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  2065. 1752.58 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  2066. 1752.58 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  2067. 1752.58 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  2068. 1752.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2069. 1752.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2070. 1752.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  2071. 1752.59 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  2072. 1752.59 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  2073. 1752.59 s [algebraic-graphs] * in ‘Data.Set.Internal’
  2074. 1752.59 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2075. 1752.59 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2076. 1752.59 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  2077. 1752.59 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  2078. 1752.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2079. 1752.60 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  2080. 1752.60 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  2081. 1752.60 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  2082. 1752.60 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  2083. 1752.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2084. 1752.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2085. 1752.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  2086. 1752.60 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  2087. 1752.60 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  2088. 1752.60 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  2089. 1752.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2090. 1752.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2091. 1752.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  2092. 1752.61 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  2093. 1752.61 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  2094. 1752.61 s [algebraic-graphs] * in ‘Data.Set.Internal’
  2095. 1752.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2096. 1752.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2097. 1752.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  2098. 1752.61 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  2099. 1752.62 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  2100. 1752.62 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2101. 1752.63 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  2102. 1752.64 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  2103. 1752.64 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  2104. 1752.64 s [algebraic-graphs] * in ‘Data.Map.Internal’
  2105. 1752.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2106. 1752.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2107. 1752.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  2108. 1752.64 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  2109. 1752.64 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  2110. 1752.64 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  2111. 1752.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2112. 1752.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2113. 1752.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  2114. 1752.64 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  2115. 1752.65 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  2116. 1752.65 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  2117. 1752.65 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  2118. 1752.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2119. 1752.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2120. 1752.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  2121. 1752.65 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  2122. 1752.65 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  2123. 1752.65 s [algebraic-graphs] * in ‘Data.Set.Internal’
  2124. 1752.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2125. 1752.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2126. 1752.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  2127. 1752.66 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  2128. 1752.66 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  2129. 1752.66 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  2130. 1752.66 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2131. 1752.66 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2132. 1752.66 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  2133. 1752.66 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  2134. 1752.66 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  2135. 1752.66 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  2136. 1752.66 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  2137. 1752.66 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  2138. 1752.66 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  2139. 1752.66 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2140. 1752.66 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2141. 1752.66 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  2142. 1752.66 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  2143. 1752.67 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  2144. 1752.67 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  2145. 1752.67 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  2146. 1752.67 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2147. 1752.67 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2148. 1752.67 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  2149. 1752.67 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  2150. 1752.67 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2151. 1752.67 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  2152. 1752.74 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  2153. 1752.74 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  2154. 1752.74 s [algebraic-graphs] * in ‘Data.Set.Internal’
  2155. 1752.74 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2156. 1752.74 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2157. 1752.74 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  2158. 1752.75 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  2159. 1752.75 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  2160. 1752.75 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  2161. 1752.75 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  2162. 1752.75 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  2163. 1752.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2164. 1752.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2165. 1752.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  2166. 1752.75 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  2167. 1752.75 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2168. 1752.75 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  2169. 1752.75 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  2170. 1752.75 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  2171. 1752.75 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  2172. 1752.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2173. 1752.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2174. 1752.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  2175. 1752.75 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  2176. 1752.75 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2177. 1752.75 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  2178. 1752.75 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  2179. 1752.75 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  2180. 1752.75 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  2181. 1752.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2182. 1752.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2183. 1752.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  2184. 1752.76 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  2185. 1752.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2186. 1752.76 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  2187. 1752.76 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  2188. 1752.76 s [algebraic-graphs] Missing documentation for:
  2189. 1752.76 s [algebraic-graphs] Module header
  2190. 1752.76 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  2191. 1752.76 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  2192. 1752.76 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  2193. 1752.76 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  2194. 1752.76 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  2195. 1752.76 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  2196. 1752.76 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  2197. 1752.76 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  2198. 1752.76 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  2199. 1752.76 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  2200. 1752.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2201. 1752.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2202. 1752.76 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  2203. 1752.76 s [algebraic-graphs] Warning: 'array' is out of scope.
  2204. 1752.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2205. 1752.76 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  2206. 1752.76 s [algebraic-graphs] Missing documentation for:
  2207. 1752.76 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  2208. 1752.90 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  2209. 1752.90 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  2210. 1752.90 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2211. 1752.90 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2212. 1752.90 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  2213. 1752.90 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  2214. 1752.90 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2215. 1752.90 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2216. 1752.90 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  2217. 1752.90 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  2218. 1752.91 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  2219. 1752.91 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  2220. 1752.91 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2221. 1752.91 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2222. 1752.92 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  2223. 1752.92 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  2224. 1752.92 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  2225. 1752.92 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  2226. 1752.92 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  2227. 1752.92 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  2228. 1752.92 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  2229. 1752.92 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  2230. 1752.92 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  2231. 1752.93 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  2232. 1752.93 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  2233. 1752.93 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2234. 1752.94 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  2235. 1752.94 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2236. 1752.94 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2237. 1752.94 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2238. 1752.94 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2239. 1752.94 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2240. 1752.94 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2241. 1752.94 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2242. 1752.94 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2243. 1752.94 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2244. 1752.94 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  2245. 1752.94 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2246. 1752.94 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2247. 1752.95 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  2248. 1752.95 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2249. 1752.95 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2250. 1752.95 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  2251. 1752.95 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2252. 1752.95 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  2253. 1752.95 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2254. 1752.95 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  2255. 1752.95 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2256. 1752.96 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  2257. 1752.96 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2258. 1752.96 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  2259. 1752.96 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2260. 1752.96 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  2261. 1752.97 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  2262. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2263. 1752.97 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  2264. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  2265. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  2266. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  2267. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  2268. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  2269. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2270. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2271. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2272. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2273. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2274. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2275. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2276. 1752.97 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2277. 1752.97 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2278. 1752.97 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2279. 1752.97 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2280. 1752.97 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2281. 1752.97 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  2282. 1752.97 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2283. 1752.97 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  2284. 1752.97 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2285. 1752.97 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  2286. 1752.97 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2287. 1752.97 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  2288. 1752.97 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2289. 1756.56 s [haskell-language-server] Preprocessing library 'hls-rename-plugin' for haskell-language-server-2.12.0.0...
  2290. 1756.72 s [haskell-language-server] Building library 'hls-rename-plugin' for haskell-language-server-2.12.0.0...
  2291. 1756.72 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Rename ( plugins/hls-rename-plugin/src/Ide/Plugin/Rename.hs, dist/build/hls-rename-plugin/Ide/Plugin/Rename.o, dist/build/hls-rename-plugin/Ide/Plugin/Rename.dyn_o )
  2292. 1757.50 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  2293. 1757.50 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  2294. 1757.56 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  2295. 1757.57 s [algebraic-graphs] Phase: installPhase
  2296. 1757.67 s [algebraic-graphs] Installing library in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  2297. 1758.31 s [algebraic-graphs] Phase: fixupPhase
  2298. 1758.33 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7
  2299. 1758.35 s [algebraic-graphs] shrinking /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSalgebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl-ghc9.10.2.so
  2300. 1758.36 s [algebraic-graphs] checking for references to /build/ in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7...
  2301. 1758.39 s [algebraic-graphs] patching script interpreter paths in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7
  2302. 1758.40 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib
  2303. 1758.45 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Rename ( plugins/hls-rename-plugin/src/Ide/Plugin/Rename.hs, dist/build/hls-rename-plugin/Ide/Plugin/Rename.p_o )
  2304. 1758.66 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  2305. 1758.68 s [algebraic-graphs] checking for references to /build/ in /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc...
  2306. 1758.71 s [algebraic-graphs] patching script interpreter paths in /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  2307. 1758.88 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7 /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  2308. 1759.52 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2309. 1759.53 s [post-build-hook] Uploading to the NixCI cache: /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7 /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  2310. 1759.57 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2311. 1759.58 s [post-build-hook] copying 2 paths...
  2312. 1759.58 s [post-build-hook] copying path '/nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  2313. 1760.91 s [post-build-hook] copying path '/nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  2314. 1767.30 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2315. 1767.42 s [post-build-hook] copying 0 paths...
  2316. 1767.46 s Progress: 23 of 28 built (1 building), 948 of 948 downloaded from cache
  2317. 1767.52 s Building ghc-9.10.2-with-packages
  2318. 1767.52 s [haskell-language-server] Preprocessing library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0...
  2319. 1767.52 s [haskell-language-server] Building library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0...
  2320. 1767.52 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.o, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.dyn_o )
  2321. 1767.52 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.GADT ( plugins/hls-gadt-plugin/src/Ide/Plugin/GADT.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.o, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.dyn_o )
  2322. 1767.57 s [ghc-9.10.2-with-packages] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/nix-support:
  2323. 1767.57 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2324. 1767.58 s [ghc-9.10.2-with-packages] /nix/store/i86lkksaflv4r87q0qrwjkzmkxidbkcn-ghc-compat-plugin-0.1.0.1/nix-support:
  2325. 1767.58 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2326. 1767.59 s [ghc-9.10.2-with-packages] /nix/store/4a5757hy61mya8xkrx5rqw899yn4q840-hedgehog-1.5/nix-support:
  2327. 1767.59 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2328. 1767.60 s [ghc-9.10.2-with-packages] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/nix-support:
  2329. 1767.60 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2330. 1767.64 s [ghc-9.10.2-with-packages] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/nix-support:
  2331. 1767.64 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2332. 1767.66 s [ghc-9.10.2-with-packages] /nix/store/wac3lw3kbwavk45qiqj6m9jdkwa8pafh-temporary-1.3/nix-support:
  2333. 1767.66 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2334. 1767.66 s [ghc-9.10.2-with-packages] /nix/store/wac3lw3kbwavk45qiqj6m9jdkwa8pafh-temporary-1.3/nix-support:
  2335. 1767.66 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2336. 1767.67 s [ghc-9.10.2-with-packages] /nix/store/nr8q60a19hzjr68c1nrm5rhf2v2pli7k-ansi-terminal-1.1.3/nix-support:
  2337. 1767.67 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2338. 1767.67 s [ghc-9.10.2-with-packages] /nix/store/nr8q60a19hzjr68c1nrm5rhf2v2pli7k-ansi-terminal-1.1.3/nix-support:
  2339. 1767.67 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2340. 1767.67 s [ghc-9.10.2-with-packages] /nix/store/hrqigzyck2fmrxwd0sbprny1l9dyblbs-async-2.2.5/nix-support:
  2341. 1767.67 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2342. 1767.68 s [ghc-9.10.2-with-packages] /nix/store/hrqigzyck2fmrxwd0sbprny1l9dyblbs-async-2.2.5/nix-support:
  2343. 1767.68 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2344. 1767.68 s [ghc-9.10.2-with-packages] /nix/store/0wv7zyqwf2w1j0wplid6xdb4i67dx30y-barbies-2.1.1.0/nix-support:
  2345. 1767.68 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2346. 1767.68 s [ghc-9.10.2-with-packages] /nix/store/0wv7zyqwf2w1j0wplid6xdb4i67dx30y-barbies-2.1.1.0/nix-support:
  2347. 1767.68 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2348. 1767.69 s [ghc-9.10.2-with-packages] /nix/store/6si8zsjbgams5g95mn38388hi5s0xa2g-concurrent-output-1.10.21/nix-support:
  2349. 1767.69 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2350. 1767.69 s [ghc-9.10.2-with-packages] /nix/store/6si8zsjbgams5g95mn38388hi5s0xa2g-concurrent-output-1.10.21/nix-support:
  2351. 1767.69 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2352. 1767.70 s [ghc-9.10.2-with-packages] /nix/store/vndl7knv97k4cjlfg75znwfdkf5mda5r-lifted-async-0.10.2.7/nix-support:
  2353. 1767.70 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2354. 1767.70 s [ghc-9.10.2-with-packages] /nix/store/vndl7knv97k4cjlfg75znwfdkf5mda5r-lifted-async-0.10.2.7/nix-support:
  2355. 1767.70 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2356. 1767.70 s [ghc-9.10.2-with-packages] /nix/store/mpa3kfhidwczcjf7vy7zhj4288a48z8z-mmorph-1.2.1/nix-support:
  2357. 1767.70 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2358. 1767.70 s [ghc-9.10.2-with-packages] /nix/store/mpa3kfhidwczcjf7vy7zhj4288a48z8z-mmorph-1.2.1/nix-support:
  2359. 1767.70 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2360. 1767.71 s [ghc-9.10.2-with-packages] /nix/store/jc807azqrqjy4m2avrknx9sqm7g51a0n-monad-control-1.0.3.1/nix-support:
  2361. 1767.71 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2362. 1767.71 s [ghc-9.10.2-with-packages] /nix/store/jc807azqrqjy4m2avrknx9sqm7g51a0n-monad-control-1.0.3.1/nix-support:
  2363. 1767.71 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2364. 1767.71 s [ghc-9.10.2-with-packages] /nix/store/jhyi7rbfn0404s8wv41xb5b7zhmpzzsa-pretty-show-1.10/nix-support:
  2365. 1767.71 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2366. 1767.71 s [ghc-9.10.2-with-packages] /nix/store/jhyi7rbfn0404s8wv41xb5b7zhmpzzsa-pretty-show-1.10/nix-support:
  2367. 1767.71 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2368. 1767.71 s [ghc-9.10.2-with-packages] /nix/store/bf54j8c8x307m4wwcsdrnfx4cc1lklwm-primitive-0.9.1.0/nix-support:
  2369. 1767.71 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2370. 1767.72 s [ghc-9.10.2-with-packages] /nix/store/bf54j8c8x307m4wwcsdrnfx4cc1lklwm-primitive-0.9.1.0/nix-support:
  2371. 1767.72 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2372. 1767.72 s [ghc-9.10.2-with-packages] /nix/store/a85wc4mi4wj1kbvlk9wqfdhxmix0j6p7-random-1.2.1.3/nix-support:
  2373. 1767.72 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2374. 1767.72 s [ghc-9.10.2-with-packages] /nix/store/a85wc4mi4wj1kbvlk9wqfdhxmix0j6p7-random-1.2.1.3/nix-support:
  2375. 1767.72 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2376. 1767.72 s [ghc-9.10.2-with-packages] /nix/store/dk6b2s9fjysd0h54dxg9anqjn68wpx8g-resourcet-1.3.0/nix-support:
  2377. 1767.72 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2378. 1767.72 s [ghc-9.10.2-with-packages] /nix/store/dk6b2s9fjysd0h54dxg9anqjn68wpx8g-resourcet-1.3.0/nix-support:
  2379. 1767.72 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2380. 1767.72 s [ghc-9.10.2-with-packages] /nix/store/79g56291kaj7cl3w9df7w0y7fghxcgdc-safe-exceptions-0.1.7.4/nix-support:
  2381. 1767.72 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2382. 1767.73 s [ghc-9.10.2-with-packages] /nix/store/79g56291kaj7cl3w9df7w0y7fghxcgdc-safe-exceptions-0.1.7.4/nix-support:
  2383. 1767.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2384. 1767.73 s [ghc-9.10.2-with-packages] /nix/store/wff8shwfm0b4yj3891jmhh72gasfc2hv-transformers-base-0.4.6/nix-support:
  2385. 1767.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2386. 1767.73 s [ghc-9.10.2-with-packages] /nix/store/wff8shwfm0b4yj3891jmhh72gasfc2hv-transformers-base-0.4.6/nix-support:
  2387. 1767.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2388. 1767.73 s [ghc-9.10.2-with-packages] /nix/store/b8mlz83j47f7y9wdrkymc1kdh1qn6jsm-wl-pprint-annotated-0.1.0.1/nix-support:
  2389. 1767.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2390. 1767.73 s [ghc-9.10.2-with-packages] /nix/store/b8mlz83j47f7y9wdrkymc1kdh1qn6jsm-wl-pprint-annotated-0.1.0.1/nix-support:
  2391. 1767.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2392. 1767.73 s [ghc-9.10.2-with-packages] /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0/nix-support:
  2393. 1767.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2394. 1767.75 s [ghc-9.10.2-with-packages] /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0/nix-support:
  2395. 1767.75 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2396. 1767.76 s [ghc-9.10.2-with-packages] /nix/store/xzlp6bdqcd2jn0c4f2q6hri94a61y6ia-ansi-terminal-types-1.1.3/nix-support:
  2397. 1767.76 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2398. 1767.76 s [ghc-9.10.2-with-packages] /nix/store/xzlp6bdqcd2jn0c4f2q6hri94a61y6ia-ansi-terminal-types-1.1.3/nix-support:
  2399. 1767.76 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2400. 1767.77 s [ghc-9.10.2-with-packages] /nix/store/z4vgh1rmlxkn0msz1j4kza2gl0qnr4ds-hashable-1.5.0.0/nix-support:
  2401. 1767.77 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2402. 1767.77 s [ghc-9.10.2-with-packages] /nix/store/z4vgh1rmlxkn0msz1j4kza2gl0qnr4ds-hashable-1.5.0.0/nix-support:
  2403. 1767.77 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2404. 1767.77 s [ghc-9.10.2-with-packages] /nix/store/zd2ng59x3q2jmvgi3vy8zmidw3p3l0ra-distributive-0.6.2.1/nix-support:
  2405. 1767.77 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2406. 1767.78 s [ghc-9.10.2-with-packages] /nix/store/zd2ng59x3q2jmvgi3vy8zmidw3p3l0ra-distributive-0.6.2.1/nix-support:
  2407. 1767.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2408. 1767.78 s [ghc-9.10.2-with-packages] /nix/store/hra1wy4awflv83lzv92hi4jppzki57kx-constraints-0.14.2/nix-support:
  2409. 1767.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2410. 1767.78 s [ghc-9.10.2-with-packages] /nix/store/hra1wy4awflv83lzv92hi4jppzki57kx-constraints-0.14.2/nix-support:
  2411. 1767.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2412. 1767.78 s [ghc-9.10.2-with-packages] /nix/store/w07ijhjbpgqnni69pjyg36kd62fjzkhh-lifted-base-0.2.3.12/nix-support:
  2413. 1767.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2414. 1767.79 s [ghc-9.10.2-with-packages] /nix/store/w07ijhjbpgqnni69pjyg36kd62fjzkhh-lifted-base-0.2.3.12/nix-support:
  2415. 1767.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2416. 1767.79 s [ghc-9.10.2-with-packages] /nix/store/qwcv9ja2na55pgsnck2sglgi6cfb8mff-transformers-compat-0.7.2/nix-support:
  2417. 1767.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2418. 1767.80 s [ghc-9.10.2-with-packages] /nix/store/qwcv9ja2na55pgsnck2sglgi6cfb8mff-transformers-compat-0.7.2/nix-support:
  2419. 1767.80 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2420. 1767.80 s [ghc-9.10.2-with-packages] /nix/store/3hbwsli9xivm9kfjbap28z7xj7fm1n0f-splitmix-0.1.3.1/nix-support:
  2421. 1767.80 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2422. 1767.80 s [ghc-9.10.2-with-packages] /nix/store/3hbwsli9xivm9kfjbap28z7xj7fm1n0f-splitmix-0.1.3.1/nix-support:
  2423. 1767.80 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2424. 1767.81 s [ghc-9.10.2-with-packages] /nix/store/pphl765d1mv6wx6xky8mysaazarygb8n-unliftio-core-0.2.1.0/nix-support:
  2425. 1767.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2426. 1767.81 s [ghc-9.10.2-with-packages] /nix/store/pphl765d1mv6wx6xky8mysaazarygb8n-unliftio-core-0.2.1.0/nix-support:
  2427. 1767.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2428. 1767.81 s [ghc-9.10.2-with-packages] /nix/store/m2gq7h6h9bpf455qzrpwdjhw9yh9vq1j-base-orphans-0.9.3/nix-support:
  2429. 1767.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2430. 1767.81 s [ghc-9.10.2-with-packages] /nix/store/m2gq7h6h9bpf455qzrpwdjhw9yh9vq1j-base-orphans-0.9.3/nix-support:
  2431. 1767.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2432. 1767.81 s [ghc-9.10.2-with-packages] /nix/store/ank6g1fwv3nyqxpzwr44yg0r7226r6yy-tagged-0.8.9/nix-support:
  2433. 1767.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2434. 1767.81 s [ghc-9.10.2-with-packages] /nix/store/ank6g1fwv3nyqxpzwr44yg0r7226r6yy-tagged-0.8.9/nix-support:
  2435. 1767.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2436. 1767.82 s [ghc-9.10.2-with-packages] /nix/store/gm0vdhnflvssfqbwxxp4qrc2j6i7jhld-boring-0.2.2/nix-support:
  2437. 1767.82 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2438. 1767.82 s [ghc-9.10.2-with-packages] /nix/store/gm0vdhnflvssfqbwxxp4qrc2j6i7jhld-boring-0.2.2/nix-support:
  2439. 1767.82 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2440. 1768.58 s [ghc-9.10.2-with-packages] Warning: include-dirs: /nix/store/kl8vaqw1l390wbpwj6dvbj1h5x4n3lrr-ghc-9.10.2-with-packages/lib/ghc-9.10.2/lib/../lib/x86_64-linux-ghc-9.10.2/directory-1.3.8.5-ad1a/include doesn't exist or isn't a directory
  2441. 1769.80 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/kl8vaqw1l390wbpwj6dvbj1h5x4n3lrr-ghc-9.10.2-with-packages
  2442. 1770.74 s [post-build-hook] Pushing 1 paths (152 are already present) using zstd to cache sellout ⏳
  2443. 1770.74 s [post-build-hook]
  2444. 1771.17 s [post-build-hook] Pushing /nix/store/kl8vaqw1l390wbpwj6dvbj1h5x4n3lrr-ghc-9.10.2-with-packages (5.54 MiB)
  2445. 1772.91 s [post-build-hook]
  2446. 1772.91 s [post-build-hook] All done.
  2447. 1772.93 s [post-build-hook] Uploading to the NixCI cache: /nix/store/kl8vaqw1l390wbpwj6dvbj1h5x4n3lrr-ghc-9.10.2-with-packages
  2448. 1773.01 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2449. 1773.20 s [post-build-hook] copying 18 paths...
  2450. 1773.20 s [post-build-hook] copying path '/nix/store/9am0ii2gi4daa0xa6xbw9p03n0s7k7la-lifted-base-0.2.3.12-doc' to 'https://cache.nix-ci.com'...
  2451. 1773.20 s [post-build-hook] copying path '/nix/store/l8zqgb7chr6cq4lygq2gihwch23gfy58-concurrent-output-1.10.21-doc' to 'https://cache.nix-ci.com'...
  2452. 1773.20 s [post-build-hook] copying path '/nix/store/lrc7ljdmkjr8s2jhccpn57y63xfahn3q-wl-pprint-annotated-0.1.0.1-doc' to 'https://cache.nix-ci.com'...
  2453. 1773.20 s [post-build-hook] copying path '/nix/store/slvwm454bf5nydv2asshi5130xnv4wl2-barbies-2.1.1.0-doc' to 'https://cache.nix-ci.com'...
  2454. 1773.20 s [post-build-hook] copying path '/nix/store/jnrdq2jlpyxb26r5xzkfw540a432pcig-erf-2.0.0.0-doc' to 'https://cache.nix-ci.com'...
  2455. 1773.20 s [post-build-hook] copying path '/nix/store/wj3k3bv2lkgndjkkldx5znb19fv7r07m-pretty-show-1.10-data' to 'https://cache.nix-ci.com'...
  2456. 1773.34 s [post-build-hook] copying path '/nix/store/hm4mnnp154blggdcc7mg6mmbcs6zjp76-pretty-show-1.10-doc' to 'https://cache.nix-ci.com'...
  2457. 1773.35 s [post-build-hook] copying path '/nix/store/z29n10vyzhlh6j6bffhw5w82b9y39h7i-erf-2.0.0.0' to 'https://cache.nix-ci.com'...
  2458. 1773.47 s [post-build-hook] copying path '/nix/store/w07ijhjbpgqnni69pjyg36kd62fjzkhh-lifted-base-0.2.3.12' to 'https://cache.nix-ci.com'...
  2459. 1773.47 s [post-build-hook] copying path '/nix/store/5az5j7n587wamnd5118vwqiq2cwc142y-lifted-async-0.10.2.7-doc' to 'https://cache.nix-ci.com'...
  2460. 1773.47 s [post-build-hook] copying path '/nix/store/b8mlz83j47f7y9wdrkymc1kdh1qn6jsm-wl-pprint-annotated-0.1.0.1' to 'https://cache.nix-ci.com'...
  2461. 1773.49 s [post-build-hook] copying path '/nix/store/6si8zsjbgams5g95mn38388hi5s0xa2g-concurrent-output-1.10.21' to 'https://cache.nix-ci.com'...
  2462. 1773.71 s [post-build-hook] copying path '/nix/store/jhyi7rbfn0404s8wv41xb5b7zhmpzzsa-pretty-show-1.10' to 'https://cache.nix-ci.com'...
  2463. 1773.79 s [post-build-hook] copying path '/nix/store/vndl7knv97k4cjlfg75znwfdkf5mda5r-lifted-async-0.10.2.7' to 'https://cache.nix-ci.com'...
  2464. 1774.01 s [post-build-hook] copying path '/nix/store/0wv7zyqwf2w1j0wplid6xdb4i67dx30y-barbies-2.1.1.0' to 'https://cache.nix-ci.com'...
  2465. 1774.01 s [post-build-hook] copying path '/nix/store/97nw0pcvws89f6mk0rp6cw2my45c740c-hedgehog-1.5-doc' to 'https://cache.nix-ci.com'...
  2466. 1776.22 s [post-build-hook] copying path '/nix/store/4a5757hy61mya8xkrx5rqw899yn4q840-hedgehog-1.5' to 'https://cache.nix-ci.com'...
  2467. 1781.89 s [post-build-hook] copying path '/nix/store/kl8vaqw1l390wbpwj6dvbj1h5x4n3lrr-ghc-9.10.2-with-packages' to 'https://cache.nix-ci.com'...
  2468. 1783.20 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2469. 1783.46 s [post-build-hook] copying 1 paths...
  2470. 1783.46 s [post-build-hook] copying path '/nix/store/vwmzdwddw0avc3i4jch19916d88hhxhb-ghc-9.10.2-with-packages.drv' to 'https://cache.nix-ci.com'...
  2471. 1783.68 s Progress: 24 of 27 built (1 building), 948 of 948 downloaded from cache
  2472. 1783.68 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.p_o )
  2473. 1783.68 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.GADT ( plugins/hls-gadt-plugin/src/Ide/Plugin/GADT.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.p_o )
  2474. 1783.68 s [haskell-language-server] Preprocessing library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0...
  2475. 1783.68 s [haskell-language-server] Building library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0...
  2476. 1783.68 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalGild ( plugins/hls-cabal-gild-plugin/src/Ide/Plugin/CabalGild.hs, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.o, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.dyn_o )
  2477. 1783.68 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalGild ( plugins/hls-cabal-gild-plugin/src/Ide/Plugin/CabalGild.hs, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.p_o )
  2478. 1787.82 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0...
  2479. 1787.82 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0...
  2480. 1788.04 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2481. 1788.04 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2482. 1788.04 s [haskell-language-server] but were not needed for compilation:
  2483. 1788.04 s [haskell-language-server] - ghc-9.10.2 (exposed by flag -package-id ghc-9.10.2-1e2a)
  2484. 1788.04 s [haskell-language-server]
  2485. 1788.06 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  2486. 1789.16 s [haskell-language-server] [2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.o, dist/build/Paths_haskell_language_server.dyn_o )
  2487. 1789.16 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.o, dist/build/Ide/Version.dyn_o )
  2488. 1790.22 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.o, dist/build/Ide/Arguments.dyn_o )
  2489. 1790.49 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.o, dist/build/Ide/Main.dyn_o )
  2490. 1791.31 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2491. 1791.31 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2492. 1791.31 s [haskell-language-server] but were not needed for compilation:
  2493. 1791.31 s [haskell-language-server] - ghc-9.10.2 (exposed by flag -package-id ghc-9.10.2-1e2a)
  2494. 1791.31 s [haskell-language-server]
  2495. 1791.32 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  2496. 1792.29 s [haskell-language-server] [2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.p_o )
  2497. 1792.29 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  2498. 1793.45 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  2499. 1793.98 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  2500. 1800.02 s interrupted by the user
More Logs Raw Logs

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/53ff59e2-d48c-47bf-aa9d-75b0b02cd8e8/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/53ff59e2-d48c-47bf-aa9d-75b0b02cd8e8/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/53ff59e2-d48c-47bf-aa9d-75b0b02cd8e8/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/53ff59e2-d48c-47bf-aa9d-75b0b02cd8e8/raw-logs

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

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/53ff59e2-d48c-47bf-aa9d-75b0b02cd8e8/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/53ff59e2-d48c-47bf-aa9d-75b0b02cd8e8/repro

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