build devShells.x86_64-linux.ghc9122

Reproduce this run
  1. 1427.41 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  2. 1427.41 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  3. 1427.41 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  4. 1427.41 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  5. 1427.41 s [algebraic-graphs]
  6. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  7. 1430.15 s [algebraic-graphs] OK: overlays1 [x] == x
  8. 1430.15 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  9. 1430.15 s [algebraic-graphs]
  10. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  11. 1430.15 s [algebraic-graphs] OK: connects1 [x] == x
  12. 1430.15 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  13. 1430.15 s [algebraic-graphs]
  14. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  15. 1430.15 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  16. 1430.15 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17. 1430.15 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  18. 1430.15 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19. 1430.15 s [algebraic-graphs]
  20. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  21. 1430.15 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22. 1430.15 s [algebraic-graphs]
  23. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  24. 1430.15 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  25. 1430.15 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  26. 1430.15 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  27. 1430.15 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  28. 1430.15 s [algebraic-graphs]
  29. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  30. 1430.15 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  31. 1430.15 s [algebraic-graphs] OK: vertexCount x >= 1
  32. 1430.15 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  33. 1430.15 s [algebraic-graphs]
  34. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  35. 1430.15 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  36. 1430.15 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  37. 1430.15 s [algebraic-graphs] OK: edgeCount == length . edgeList
  38. 1430.15 s [algebraic-graphs]
  39. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  40. 1430.15 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  41. 1430.15 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  42. 1430.15 s [algebraic-graphs]
  43. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  44. 1430.15 s [algebraic-graphs] OK: edgeList (vertex x) == []
  45. 1430.15 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  46. 1430.15 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  47. 1430.15 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  48. 1430.15 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  49. 1430.15 s [algebraic-graphs]
  50. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  51. 1430.15 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  52. 1430.15 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  53. 1430.15 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  54. 1430.15 s [algebraic-graphs]
  55. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  56. 1430.15 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  57. 1430.15 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  58. 1430.15 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  59. 1430.15 s [algebraic-graphs]
  60. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  61. 1430.15 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  62. 1430.15 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  63. 1430.15 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  64. 1430.15 s [algebraic-graphs]
  65. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  66. 1430.15 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  67. 1430.15 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  68. 1430.15 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  69. 1430.15 s [algebraic-graphs]
  70. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  71. 1430.15 s [algebraic-graphs] OK: path1 [x] == vertex x
  72. 1430.15 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  73. 1430.15 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  74. 1430.15 s [algebraic-graphs]
  75. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  76. 1430.15 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  77. 1430.15 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  78. 1430.15 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  79. 1430.15 s [algebraic-graphs]
  80. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  81. 1430.15 s [algebraic-graphs] OK: clique1 [x] == vertex x
  82. 1430.15 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  83. 1430.15 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  84. 1430.15 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  85. 1430.15 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  86. 1430.15 s [algebraic-graphs]
  87. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  88. 1430.15 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  89. 1430.15 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  90. 1430.15 s [algebraic-graphs]
  91. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  92. 1430.15 s [algebraic-graphs] OK: star x [] == vertex x
  93. 1430.15 s [algebraic-graphs] OK: star x [y] == edge x y
  94. 1430.15 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  95. 1430.15 s [algebraic-graphs]
  96. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  97. 1430.15 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  98. 1430.15 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  99. 1430.15 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  100. 1430.15 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  101. 1430.15 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  102. 1430.15 s [algebraic-graphs]
  103. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  104. 1430.15 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  105. 1430.15 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  106. 1430.15 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  107. 1430.15 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  108. 1430.15 s [algebraic-graphs]
  109. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  110. 1430.15 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  111. 1430.15 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  112. 1430.15 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  113. 1430.15 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  114. 1430.15 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  115. 1430.15 s [algebraic-graphs]
  116. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  117. 1430.15 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  118. 1430.15 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  119. 1430.15 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  120. 1430.15 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  121. 1430.15 s [algebraic-graphs]
  122. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  123. 1430.15 s [algebraic-graphs] OK: replaceVertex x x == id
  124. 1430.15 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  125. 1430.15 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  126. 1430.15 s [algebraic-graphs]
  127. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  128. 1430.15 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  129. 1430.15 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  130. 1430.15 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  131. 1430.15 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  132. 1430.15 s [algebraic-graphs]
  133. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  134. 1430.15 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  135. 1430.15 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  136. 1430.15 s [algebraic-graphs] OK: transpose . transpose == id
  137. 1430.15 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  138. 1430.15 s [algebraic-graphs]
  139. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  140. 1430.15 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  141. 1430.15 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  142. 1430.15 s [algebraic-graphs] OK: gmap id == id
  143. 1430.15 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  144. 1430.15 s [algebraic-graphs]
  145. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  146. 1430.15 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  147. 1430.15 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  148. 1430.15 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  149. 1430.15 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  150. 1430.15 s [algebraic-graphs]
  151. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  152. 1430.15 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  153. 1430.15 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  154. 1430.15 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  155. 1430.15 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  156. 1430.15 s [algebraic-graphs]
  157. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  158. 1430.15 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  159. 1430.15 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  160. 1430.15 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  161. 1430.15 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  162. 1430.15 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  163. 1430.15 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  164. 1430.15 s [algebraic-graphs] OK: closure . closure == closure
  165. 1430.15 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  166. 1430.15 s [algebraic-graphs]
  167. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  168. 1430.15 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  169. 1430.15 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  170. 1430.15 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  171. 1430.15 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  172. 1430.15 s [algebraic-graphs]
  173. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  174. 1430.15 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  175. 1430.15 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  176. 1430.15 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  177. 1430.15 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  178. 1430.15 s [algebraic-graphs]
  179. 1430.15 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  180. 1430.15 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  181. 1430.15 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  182. 1430.15 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  183. 1430.15 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  184. 1430.15 s [algebraic-graphs]
  185. 1430.15 s [algebraic-graphs] ============ NonEmpty.Graph.============
  186. 1430.15 s [algebraic-graphs] OK: Axioms of non-empty graphs
  187. 1430.15 s [algebraic-graphs] OK: Theorems of non-empty graphs
  188. 1430.15 s [algebraic-graphs]
  189. 1430.15 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  190. 1430.15 s [algebraic-graphs] OK: vertex 1 < vertex 2
  191. 1430.15 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  192. 1430.15 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  193. 1430.15 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  194. 1430.15 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  195. 1430.15 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  196. 1430.15 s [algebraic-graphs] OK: x <= x + y
  197. 1430.15 s [algebraic-graphs] OK: x + y <= x * y
  198. 1430.15 s [algebraic-graphs]
  199. 1430.15 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  200. 1430.15 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  201. 1430.15 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  202. 1430.15 s [algebraic-graphs] OK: fmap id == id
  203. 1430.15 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  204. 1430.15 s [algebraic-graphs]
  205. 1430.15 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  206. 1430.15 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  207. 1431.38 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  208. 1431.38 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  209. 1431.38 s [algebraic-graphs] OK: (x >>= vertex) == x
  210. 1431.38 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  211. 1431.38 s [algebraic-graphs]
  212. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  213. 1431.38 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  214. 1431.38 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  215. 1431.38 s [algebraic-graphs]
  216. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  217. 1431.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  218. 1431.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  219. 1431.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  220. 1431.38 s [algebraic-graphs] OK: size (vertex x) == 1
  221. 1431.38 s [algebraic-graphs]
  222. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  223. 1431.38 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  224. 1431.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  225. 1431.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  226. 1431.38 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  227. 1431.38 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  228. 1431.38 s [algebraic-graphs]
  229. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  230. 1431.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  231. 1431.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  232. 1431.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  233. 1431.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  234. 1431.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  235. 1431.38 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  236. 1431.38 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  237. 1431.38 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  238. 1431.38 s [algebraic-graphs]
  239. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  240. 1431.38 s [algebraic-graphs] OK: overlay1 empty x == x
  241. 1431.38 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  242. 1431.38 s [algebraic-graphs]
  243. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  244. 1431.38 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  245. 1431.38 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  246. 1431.38 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  247. 1431.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  248. 1431.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  249. 1431.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  250. 1431.38 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  251. 1431.38 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  252. 1431.38 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  253. 1431.38 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  254. 1431.38 s [algebraic-graphs]
  255. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  256. 1431.38 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  257. 1431.38 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  258. 1431.38 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  259. 1431.38 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  260. 1431.38 s [algebraic-graphs]
  261. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  262. 1431.38 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  263. 1431.38 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  264. 1431.38 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  265. 1431.38 s [algebraic-graphs]
  266. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  267. 1431.38 s [algebraic-graphs] OK: overlays1 [x] == x
  268. 1431.38 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  269. 1431.38 s [algebraic-graphs]
  270. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  271. 1431.38 s [algebraic-graphs] OK: connects1 [x] == x
  272. 1431.38 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  273. 1431.38 s [algebraic-graphs]
  274. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  275. 1431.38 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  276. 1431.38 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  277. 1431.38 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  278. 1431.38 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  279. 1431.38 s [algebraic-graphs]
  280. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  281. 1431.38 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  282. 1431.38 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  283. 1431.38 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  284. 1431.38 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  285. 1431.38 s [algebraic-graphs]
  286. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  287. 1431.38 s [algebraic-graphs] OK: x === x == True
  288. 1431.38 s [algebraic-graphs] OK: x + y === x + y == True
  289. 1431.38 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  290. 1431.38 s [algebraic-graphs] OK: x + y === x * y == False
  291. 1431.38 s [algebraic-graphs]
  292. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  293. 1431.38 s [algebraic-graphs] OK: size (vertex x) == 1
  294. 1431.38 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  295. 1431.38 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  296. 1431.38 s [algebraic-graphs] OK: size x >= 1
  297. 1431.38 s [algebraic-graphs] OK: size x >= vertexCount x
  298. 1431.38 s [algebraic-graphs]
  299. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  300. 1431.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  301. 1431.38 s [algebraic-graphs]
  302. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  303. 1431.38 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  304. 1431.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  305. 1431.38 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  306. 1431.38 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  307. 1431.38 s [algebraic-graphs]
  308. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  309. 1431.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  310. 1431.38 s [algebraic-graphs] OK: vertexCount x >= 1
  311. 1431.38 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  312. 1431.38 s [algebraic-graphs]
  313. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  314. 1431.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  315. 1431.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  316. 1431.38 s [algebraic-graphs] OK: edgeCount == length . edgeList
  317. 1431.38 s [algebraic-graphs]
  318. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  319. 1431.38 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  320. 1431.38 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  321. 1431.38 s [algebraic-graphs]
  322. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  323. 1431.38 s [algebraic-graphs] OK: edgeList (vertex x) == []
  324. 1431.38 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  325. 1431.38 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  326. 1431.38 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  327. 1431.38 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  328. 1431.38 s [algebraic-graphs]
  329. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  330. 1431.38 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  331. 1431.38 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  332. 1431.38 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  333. 1431.38 s [algebraic-graphs]
  334. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  335. 1431.38 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  336. 1431.38 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  337. 1431.38 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  338. 1431.38 s [algebraic-graphs]
  339. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  340. 1431.38 s [algebraic-graphs] OK: path1 [x] == vertex x
  341. 1431.38 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  342. 1431.38 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  343. 1431.38 s [algebraic-graphs]
  344. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  345. 1431.38 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  346. 1431.38 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  347. 1431.38 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  348. 1431.38 s [algebraic-graphs]
  349. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  350. 1431.38 s [algebraic-graphs] OK: clique1 [x] == vertex x
  351. 1431.38 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  352. 1431.38 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  353. 1431.38 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  354. 1431.38 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  355. 1431.38 s [algebraic-graphs]
  356. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  357. 1431.38 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  358. 1431.38 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  359. 1431.38 s [algebraic-graphs]
  360. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  361. 1431.38 s [algebraic-graphs] OK: star x [] == vertex x
  362. 1431.38 s [algebraic-graphs] OK: star x [y] == edge x y
  363. 1431.38 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  364. 1431.38 s [algebraic-graphs]
  365. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  366. 1431.38 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  367. 1431.38 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  368. 1431.38 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  369. 1431.38 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  370. 1431.38 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  371. 1431.38 s [algebraic-graphs]
  372. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  373. 1431.38 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  374. 1431.38 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  375. 1431.38 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  376. 1431.38 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  377. 1431.38 s [algebraic-graphs]
  378. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  379. 1431.38 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  380. 1431.38 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  381. 1431.38 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  382. 1431.38 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  383. 1431.38 s [algebraic-graphs]
  384. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  385. 1431.38 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  386. 1431.38 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  387. 1431.38 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  388. 1431.38 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  389. 1431.38 s [algebraic-graphs]
  390. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  391. 1431.38 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  392. 1431.38 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  393. 1431.38 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  394. 1431.38 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  395. 1431.38 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  396. 1431.38 s [algebraic-graphs]
  397. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  398. 1431.38 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  399. 1431.38 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  400. 1431.38 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  401. 1431.38 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  402. 1431.38 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  403. 1431.38 s [algebraic-graphs]
  404. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  405. 1431.38 s [algebraic-graphs] OK: replaceVertex x x == id
  406. 1431.38 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  407. 1431.38 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  408. 1431.38 s [algebraic-graphs]
  409. 1431.38 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  410. 1431.38 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  411. 1432.67 s [haskell-language-server] Preprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0...
  412. 1432.67 s [haskell-language-server] Building library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0...
  413. 1432.80 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.Literals ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Literals.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.dyn_o )
  414. 1434.10 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.Conversion ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Conversion.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.dyn_o )
  415. 1434.52 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.AlternateNumberFormat ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/AlternateNumberFormat.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.dyn_o )
  416. 1435.68 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.Literals ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Literals.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.p_o )
  417. 1436.71 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.Conversion ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Conversion.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.p_o )
  418. 1437.00 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  419. 1437.00 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  420. 1437.00 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  421. 1437.00 s [algebraic-graphs]
  422. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  423. 1437.00 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  424. 1437.00 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  425. 1437.00 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  426. 1437.00 s [algebraic-graphs]
  427. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  428. 1437.00 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  429. 1437.00 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  430. 1437.00 s [algebraic-graphs] OK: transpose . transpose == id
  431. 1437.00 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  432. 1437.00 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  433. 1437.00 s [algebraic-graphs]
  434. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  435. 1437.00 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  436. 1437.00 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  437. 1437.00 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  438. 1437.00 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  439. 1437.00 s [algebraic-graphs]
  440. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  441. 1437.00 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  442. 1437.00 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  443. 1437.00 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  444. 1437.00 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  445. 1437.00 s [algebraic-graphs]
  446. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  447. 1437.00 s [algebraic-graphs] OK: simplify == id
  448. 1437.00 s [algebraic-graphs] OK: size (simplify x) <= size x
  449. 1437.00 s [algebraic-graphs] OK: simplify 1 === 1
  450. 1437.00 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  451. 1437.00 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  452. 1437.00 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  453. 1437.00 s [algebraic-graphs]
  454. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  455. 1437.00 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  456. 1437.00 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  457. 1437.00 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  458. 1437.00 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  459. 1437.00 s [algebraic-graphs]
  460. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  461. 1437.00 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  462. 1437.00 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  463. 1437.00 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  464. 1437.00 s [algebraic-graphs]
  465. 1437.00 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  466. 1437.00 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  467. 1437.00 s [algebraic-graphs] OK: box x y ~~ box y x
  468. 1437.00 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  469. 1437.00 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  470. 1437.00 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  471. 1437.00 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  472. 1437.00 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  473. 1437.00 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  474. 1437.00 s [algebraic-graphs]
  475. 1437.00 s [algebraic-graphs] ============ Relation ============
  476. 1437.00 s [algebraic-graphs] OK: Axioms of graphs
  477. 1437.00 s [algebraic-graphs]
  478. 1437.00 s [algebraic-graphs] ============ Relation.consistent ============
  479. 1437.00 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  480. 1437.00 s [algebraic-graphs]
  481. 1437.00 s [algebraic-graphs] OK: consistent empty == True
  482. 1437.00 s [algebraic-graphs] OK: consistent (vertex x) == True
  483. 1437.00 s [algebraic-graphs] OK: consistent (overlay x y) == True
  484. 1437.00 s [algebraic-graphs] OK: consistent (connect x y) == True
  485. 1437.00 s [algebraic-graphs] OK: consistent (edge x y) == True
  486. 1437.00 s [algebraic-graphs] OK: consistent (edges xs) == True
  487. 1437.00 s [algebraic-graphs] OK: consistent (stars xs) == True
  488. 1437.00 s [algebraic-graphs]
  489. 1437.00 s [algebraic-graphs] ============ Relation.Show ============
  490. 1437.00 s [algebraic-graphs] OK: show (empty ) == "empty"
  491. 1437.00 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  492. 1437.00 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  493. 1437.00 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  494. 1437.00 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  495. 1437.00 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  496. 1437.00 s [algebraic-graphs]
  497. 1437.00 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  498. 1437.00 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  499. 1437.00 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  500. 1437.00 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  501. 1437.00 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  502. 1437.00 s [algebraic-graphs]
  503. 1437.00 s [algebraic-graphs] ============ Relation.Ord ============
  504. 1437.00 s [algebraic-graphs] OK: vertex 1 < vertex 2
  505. 1437.00 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  506. 1437.00 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  507. 1437.00 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  508. 1437.00 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  509. 1437.00 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  510. 1437.00 s [algebraic-graphs] OK: x <= x + y
  511. 1437.00 s [algebraic-graphs] OK: x + y <= x * y
  512. 1437.00 s [algebraic-graphs]
  513. 1437.00 s [algebraic-graphs] ============ Relation.empty ============
  514. 1437.00 s [algebraic-graphs] OK: isEmpty empty == True
  515. 1437.00 s [algebraic-graphs] OK: hasVertex x empty == False
  516. 1437.00 s [algebraic-graphs] OK: vertexCount empty == 0
  517. 1437.00 s [algebraic-graphs] OK: edgeCount empty == 0
  518. 1437.00 s [algebraic-graphs]
  519. 1437.00 s [algebraic-graphs] ============ Relation.vertex ============
  520. 1437.00 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  521. 1437.00 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  522. 1437.00 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  523. 1437.00 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  524. 1437.00 s [algebraic-graphs]
  525. 1437.00 s [algebraic-graphs] ============ Relation.edge ============
  526. 1437.00 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  527. 1437.00 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  528. 1437.00 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  529. 1437.00 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  530. 1437.00 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  531. 1437.00 s [algebraic-graphs]
  532. 1437.00 s [algebraic-graphs] ============ Relation.overlay ============
  533. 1437.00 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  534. 1437.00 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  535. 1437.00 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  536. 1437.00 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  537. 1437.00 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  538. 1437.00 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  539. 1437.00 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  540. 1437.00 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  541. 1437.00 s [algebraic-graphs]
  542. 1437.00 s [algebraic-graphs] ============ Relation.connect ============
  543. 1437.00 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  544. 1437.00 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  545. 1437.00 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  546. 1437.00 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  547. 1437.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  548. 1437.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  549. 1437.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  550. 1437.00 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  551. 1437.00 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  552. 1437.00 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  553. 1437.00 s [algebraic-graphs]
  554. 1437.00 s [algebraic-graphs] ============ Relation.vertices ============
  555. 1437.00 s [algebraic-graphs] OK: vertices [] == empty
  556. 1437.00 s [algebraic-graphs] OK: vertices [x] == vertex x
  557. 1437.00 s [algebraic-graphs] OK: vertices == overlays . map vertex
  558. 1437.00 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  559. 1437.00 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  560. 1437.00 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  561. 1437.00 s [algebraic-graphs]
  562. 1437.00 s [algebraic-graphs] ============ Relation.edges ============
  563. 1437.00 s [algebraic-graphs] OK: edges [] == empty
  564. 1437.00 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  565. 1437.00 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  566. 1437.00 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  567. 1437.00 s [algebraic-graphs]
  568. 1437.00 s [algebraic-graphs] ============ Relation.overlays ============
  569. 1437.00 s [algebraic-graphs] OK: overlays [] == empty
  570. 1437.00 s [algebraic-graphs] OK: overlays [x] == x
  571. 1437.00 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  572. 1437.00 s [algebraic-graphs] OK: overlays == foldr overlay empty
  573. 1437.00 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  574. 1437.00 s [algebraic-graphs]
  575. 1437.00 s [algebraic-graphs] ============ Relation.connects ============
  576. 1437.00 s [algebraic-graphs] OK: connects [] == empty
  577. 1437.00 s [algebraic-graphs] OK: connects [x] == x
  578. 1437.00 s [algebraic-graphs] OK: connects [x,y] == connect x y
  579. 1437.00 s [algebraic-graphs] OK: connects == foldr connect empty
  580. 1437.00 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  581. 1437.00 s [algebraic-graphs]
  582. 1437.00 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  583. 1437.00 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  584. 1437.00 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  585. 1437.00 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  586. 1437.00 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  587. 1437.00 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  588. 1437.00 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  589. 1437.00 s [algebraic-graphs]
  590. 1437.00 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  591. 1437.00 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  592. 1437.00 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  593. 1437.00 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  594. 1437.00 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  595. 1437.00 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  596. 1437.00 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  597. 1437.00 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  598. 1437.00 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  599. 1437.00 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  600. 1437.00 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  601. 1437.00 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  602. 1437.00 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  603. 1437.00 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  604. 1437.00 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  605. 1437.00 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  606. 1437.00 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  607. 1437.00 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  608. 1437.23 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.AlternateNumberFormat ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/AlternateNumberFormat.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.p_o )
  609. 1440.15 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  610. 1440.15 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  611. 1440.18 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  612. 1440.18 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  613. 1440.18 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  614. 1440.18 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  615. 1440.18 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  616. 1440.18 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  617. 1440.18 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  618. 1440.18 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  619. 1440.18 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  620. 1440.18 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  621. 1440.18 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  622. 1440.18 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  623. 1440.18 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  624. 1440.18 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  625. 1440.18 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  626. 1440.18 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  627. 1440.18 s [algebraic-graphs]
  628. 1440.18 s [algebraic-graphs] ============ Relation.foldg ============
  629. 1440.18 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  630. 1440.18 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  631. 1440.18 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  632. 1440.18 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  633. 1440.18 s [algebraic-graphs]
  634. 1440.18 s [algebraic-graphs] ============ Relation.isEmpty ============
  635. 1440.18 s [algebraic-graphs] OK: isEmpty empty == True
  636. 1440.18 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  637. 1440.18 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  638. 1440.18 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  639. 1440.18 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  640. 1440.18 s [algebraic-graphs]
  641. 1440.18 s [algebraic-graphs] ============ Relation.hasVertex ============
  642. 1440.18 s [algebraic-graphs] OK: hasVertex x empty == False
  643. 1440.18 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  644. 1440.18 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  645. 1440.18 s [algebraic-graphs]
  646. 1440.18 s [algebraic-graphs] ============ Relation.hasEdge ============
  647. 1440.18 s [algebraic-graphs] OK: hasEdge x y empty == False
  648. 1440.18 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  649. 1440.18 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  650. 1440.18 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  651. 1440.18 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  652. 1440.18 s [algebraic-graphs]
  653. 1440.18 s [algebraic-graphs] ============ Relation.vertexCount ============
  654. 1440.18 s [algebraic-graphs] OK: vertexCount empty == 0
  655. 1440.18 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  656. 1440.18 s [algebraic-graphs] OK: vertexCount == length . vertexList
  657. 1440.18 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  658. 1440.18 s [algebraic-graphs]
  659. 1440.18 s [algebraic-graphs] ============ Relation.edgeCount ============
  660. 1440.18 s [algebraic-graphs] OK: edgeCount empty == 0
  661. 1440.18 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  662. 1440.18 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  663. 1440.18 s [algebraic-graphs] OK: edgeCount == length . edgeList
  664. 1440.18 s [algebraic-graphs]
  665. 1440.18 s [algebraic-graphs] ============ Relation.vertexList ============
  666. 1440.18 s [algebraic-graphs] OK: vertexList empty == []
  667. 1440.18 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  668. 1440.18 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  669. 1440.18 s [algebraic-graphs]
  670. 1440.18 s [algebraic-graphs] ============ Relation.vertexSet ============
  671. 1440.18 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  672. 1440.18 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  673. 1440.18 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  674. 1440.18 s [algebraic-graphs]
  675. 1440.18 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  676. 1440.18 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  677. 1440.18 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  678. 1440.18 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  679. 1440.18 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  680. 1440.18 s [algebraic-graphs]
  681. 1440.18 s [algebraic-graphs] ============ Relation.edgeList ============
  682. 1440.18 s [algebraic-graphs] OK: edgeList empty == []
  683. 1440.18 s [algebraic-graphs] OK: edgeList (vertex x) == []
  684. 1440.18 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  685. 1440.18 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  686. 1440.18 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  687. 1440.18 s [algebraic-graphs]
  688. 1440.18 s [algebraic-graphs] ============ Relation.edgeSet ============
  689. 1440.18 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  690. 1440.18 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  691. 1440.18 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  692. 1440.18 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  693. 1440.18 s [algebraic-graphs]
  694. 1440.18 s [algebraic-graphs] ============ Relation.adjacencyList ============
  695. 1440.18 s [algebraic-graphs] OK: adjacencyList empty == []
  696. 1440.18 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  697. 1440.18 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  698. 1440.18 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  699. 1440.18 s [algebraic-graphs]
  700. 1440.18 s [algebraic-graphs] ============ Relation.preSet ============
  701. 1440.18 s [algebraic-graphs] OK: preSet x empty == Set.empty
  702. 1440.18 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  703. 1440.18 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  704. 1440.19 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  705. 1440.19 s [algebraic-graphs]
  706. 1440.19 s [algebraic-graphs] ============ Relation.preIntSet ============
  707. 1440.19 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  708. 1440.19 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  709. 1440.19 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  710. 1440.19 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  711. 1440.19 s [algebraic-graphs]
  712. 1440.19 s [algebraic-graphs] ============ Relation.postSet ============
  713. 1440.19 s [algebraic-graphs] OK: postSet x empty == Set.empty
  714. 1440.19 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  715. 1440.19 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  716. 1440.19 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  717. 1440.19 s [algebraic-graphs]
  718. 1440.19 s [algebraic-graphs] ============ Relation.postIntSet ============
  719. 1440.19 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  720. 1440.19 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  721. 1440.19 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  722. 1440.19 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  723. 1440.19 s [algebraic-graphs]
  724. 1440.19 s [algebraic-graphs] ============ Relation.path ============
  725. 1440.19 s [algebraic-graphs] OK: path [] == empty
  726. 1440.19 s [algebraic-graphs] OK: path [x] == vertex x
  727. 1440.19 s [algebraic-graphs] OK: path [x,y] == edge x y
  728. 1440.19 s [algebraic-graphs]
  729. 1440.19 s [algebraic-graphs] ============ Relation.circuit ============
  730. 1440.19 s [algebraic-graphs] OK: circuit [] == empty
  731. 1440.19 s [algebraic-graphs] OK: circuit [x] == edge x x
  732. 1440.19 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  733. 1440.19 s [algebraic-graphs]
  734. 1440.19 s [algebraic-graphs] ============ Relation.clique ============
  735. 1440.19 s [algebraic-graphs] OK: clique [] == empty
  736. 1440.19 s [algebraic-graphs] OK: clique [x] == vertex x
  737. 1440.19 s [algebraic-graphs] OK: clique [x,y] == edge x y
  738. 1440.19 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  739. 1440.19 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  740. 1440.19 s [algebraic-graphs]
  741. 1440.19 s [algebraic-graphs] ============ Relation.biclique ============
  742. 1440.19 s [algebraic-graphs] OK: biclique [] [] == empty
  743. 1440.19 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  744. 1440.19 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  745. 1440.19 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  746. 1440.19 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  747. 1440.19 s [algebraic-graphs]
  748. 1440.19 s [algebraic-graphs] ============ Relation.star ============
  749. 1440.19 s [algebraic-graphs] OK: star x [] == vertex x
  750. 1440.19 s [algebraic-graphs] OK: star x [y] == edge x y
  751. 1440.19 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  752. 1440.19 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  753. 1440.19 s [algebraic-graphs]
  754. 1440.19 s [algebraic-graphs] ============ Relation.stars ============
  755. 1440.19 s [algebraic-graphs] OK: stars [] == empty
  756. 1440.19 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  757. 1440.19 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  758. 1440.19 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  759. 1440.19 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  760. 1440.19 s [algebraic-graphs] OK: stars . adjacencyList == id
  761. 1440.19 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  762. 1440.19 s [algebraic-graphs]
  763. 1440.19 s [algebraic-graphs] ============ Relation.tree ============
  764. 1440.19 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  765. 1440.19 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  766. 1440.19 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  767. 1440.19 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  768. 1440.19 s [algebraic-graphs]
  769. 1440.19 s [algebraic-graphs] ============ Relation.forest ============
  770. 1440.19 s [algebraic-graphs] OK: forest [] == empty
  771. 1440.19 s [algebraic-graphs] OK: forest [x] == tree x
  772. 1440.19 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  773. 1440.19 s [algebraic-graphs] OK: forest == overlays . map tree
  774. 1440.19 s [algebraic-graphs]
  775. 1440.19 s [algebraic-graphs] ============ Relation.removeVertex ============
  776. 1440.19 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  777. 1440.19 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  778. 1440.19 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  779. 1440.19 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  780. 1440.19 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  781. 1440.19 s [algebraic-graphs]
  782. 1440.19 s [algebraic-graphs] ============ Relation.removeEdge ============
  783. 1440.19 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  784. 1440.19 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  785. 1440.19 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  786. 1440.19 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  787. 1440.19 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  788. 1440.19 s [algebraic-graphs]
  789. 1440.19 s [algebraic-graphs] ============ Relation.replaceVertex ============
  790. 1440.19 s [algebraic-graphs] OK: replaceVertex x x == id
  791. 1440.19 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  792. 1440.19 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  793. 1440.19 s [algebraic-graphs]
  794. 1440.19 s [algebraic-graphs] ============ Relation.mergeVertices ============
  795. 1440.19 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  796. 1443.66 s [haskell-language-server] Preprocessing library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0...
  797. 1443.66 s [haskell-language-server] Building library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0...
  798. 1443.76 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Fourmolu ( plugins/hls-fourmolu-plugin/src/Ide/Plugin/Fourmolu.hs, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.o, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.dyn_o )
  799. 1446.81 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Fourmolu ( plugins/hls-fourmolu-plugin/src/Ide/Plugin/Fourmolu.hs, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.p_o )
  800. 1457.08 s [haskell-language-server] Preprocessing library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0...
  801. 1457.08 s [haskell-language-server] Building library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0...
  802. 1457.18 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.o, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.dyn_o )
  803. 1458.73 s [haskell-language-server] plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
  804. 1458.73 s [haskell-language-server] The import of ‘System.Directory’ is redundant
  805. 1458.73 s [haskell-language-server] except perhaps to import instances from ‘System.Directory’
  806. 1458.73 s [haskell-language-server] To import instances alone, use: import System.Directory()
  807. 1458.73 s [haskell-language-server] |
  808. 1458.73 s [haskell-language-server] 28 | import System.Directory
  809. 1458.73 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  810. 1458.73 s [haskell-language-server]
  811. 1459.38 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.p_o )
  812. 1459.87 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  813. 1459.87 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  814. 1459.87 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  815. 1459.87 s [algebraic-graphs]
  816. 1459.87 s [algebraic-graphs] ============ Relation.transpose ============
  817. 1459.87 s [algebraic-graphs] OK: transpose empty == empty
  818. 1459.87 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  819. 1459.87 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  820. 1459.87 s [algebraic-graphs] OK: transpose . transpose == id
  821. 1459.87 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  822. 1459.87 s [algebraic-graphs]
  823. 1459.87 s [algebraic-graphs] ============ Relation.gmap ============
  824. 1459.87 s [algebraic-graphs] OK: gmap f empty == empty
  825. 1459.87 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  826. 1459.87 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  827. 1459.87 s [algebraic-graphs] OK: gmap id == id
  828. 1459.87 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  829. 1459.87 s [algebraic-graphs]
  830. 1459.87 s [algebraic-graphs] ============ Relation.induce ============
  831. 1459.87 s [algebraic-graphs] OK: induce (const True ) x == x
  832. 1459.87 s [algebraic-graphs] OK: induce (const False) x == empty
  833. 1459.87 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  834. 1459.87 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  835. 1459.87 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  836. 1459.87 s [algebraic-graphs]
  837. 1459.87 s [algebraic-graphs] ============ Relation.compose ============
  838. 1459.87 s [algebraic-graphs] OK: compose empty x == empty
  839. 1459.87 s [algebraic-graphs] OK: compose x empty == empty
  840. 1459.87 s [algebraic-graphs] OK: compose (vertex x) y == empty
  841. 1459.87 s [algebraic-graphs] OK: compose x (vertex y) == empty
  842. 1459.87 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  843. 1459.87 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  844. 1459.87 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  845. 1459.87 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  846. 1459.87 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  847. 1459.87 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  848. 1459.87 s [algebraic-graphs]
  849. 1459.87 s [algebraic-graphs] ============ Relation.closure ============
  850. 1459.87 s [algebraic-graphs] OK: closure empty == empty
  851. 1459.87 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  852. 1459.87 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  853. 1459.87 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  854. 1459.87 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  855. 1459.87 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  856. 1459.87 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  857. 1459.87 s [algebraic-graphs] OK: closure . closure == closure
  858. 1459.87 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  859. 1459.87 s [algebraic-graphs]
  860. 1459.87 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  861. 1459.87 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  862. 1459.87 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  863. 1459.87 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  864. 1459.87 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  865. 1459.87 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  866. 1459.87 s [algebraic-graphs]
  867. 1459.87 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  868. 1459.87 s [algebraic-graphs] OK: symmetricClosure empty == empty
  869. 1459.87 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  870. 1459.87 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  871. 1459.87 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  872. 1459.87 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  873. 1459.87 s [algebraic-graphs]
  874. 1459.87 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  875. 1459.87 s [algebraic-graphs] OK: transitiveClosure empty == empty
  876. 1459.87 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  877. 1459.87 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  878. 1459.87 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  879. 1459.87 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  880. 1459.87 s [algebraic-graphs]
  881. 1459.87 s [algebraic-graphs] ============ Relation.induceJust ============
  882. 1459.87 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  883. 1459.87 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  884. 1459.87 s [algebraic-graphs] OK: induceJust . gmap Just == id
  885. 1459.87 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  886. 1459.87 s [algebraic-graphs]
  887. 1459.87 s [algebraic-graphs] ============ ReflexiveRelation ============
  888. 1459.87 s [algebraic-graphs] OK: Axioms of reflexive graphs
  889. 1459.87 s [algebraic-graphs]
  890. 1459.87 s [algebraic-graphs] ============ TransitiveRelation ============
  891. 1459.87 s [algebraic-graphs] OK: Axioms of transitive graphs
  892. 1459.87 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  893. 1459.87 s [algebraic-graphs]
  894. 1459.87 s [algebraic-graphs] ============ PreorderRelation ============
  895. 1459.87 s [algebraic-graphs] OK: Axioms of preorder graphs
  896. 1459.87 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  897. 1459.87 s [algebraic-graphs]
  898. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation ============
  899. 1459.87 s [algebraic-graphs] OK: Axioms of undirected graphs
  900. 1459.87 s [algebraic-graphs]
  901. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  902. 1459.87 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  903. 1459.87 s [algebraic-graphs]
  904. 1459.87 s [algebraic-graphs] OK: consistent empty == True
  905. 1459.87 s [algebraic-graphs] OK: consistent (vertex x) == True
  906. 1459.87 s [algebraic-graphs] OK: consistent (overlay x y) == True
  907. 1459.87 s [algebraic-graphs] OK: consistent (connect x y) == True
  908. 1459.87 s [algebraic-graphs] OK: consistent (edge x y) == True
  909. 1459.87 s [algebraic-graphs] OK: consistent (edges xs) == True
  910. 1459.87 s [algebraic-graphs] OK: consistent (stars xs) == True
  911. 1459.87 s [algebraic-graphs]
  912. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  913. 1459.87 s [algebraic-graphs] OK: show (empty ) == "empty"
  914. 1459.87 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  915. 1459.87 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  916. 1459.87 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  917. 1459.87 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  918. 1459.87 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  919. 1459.87 s [algebraic-graphs]
  920. 1459.87 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  921. 1459.87 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  922. 1459.87 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  923. 1459.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  924. 1459.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  925. 1459.87 s [algebraic-graphs]
  926. 1459.87 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  927. 1459.87 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  928. 1459.87 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  929. 1459.87 s [algebraic-graphs]
  930. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  931. 1459.87 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  932. 1459.87 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  933. 1459.87 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  934. 1459.87 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  935. 1459.87 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  936. 1459.87 s [algebraic-graphs]
  937. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  938. 1459.87 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  939. 1459.87 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  940. 1459.87 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  941. 1459.87 s [algebraic-graphs]
  942. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  943. 1459.87 s [algebraic-graphs] OK: vertex 1 < vertex 2
  944. 1459.87 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  945. 1459.87 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  946. 1459.87 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  947. 1459.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  948. 1459.87 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  949. 1459.87 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  950. 1459.87 s [algebraic-graphs] OK: x <= x + y
  951. 1459.87 s [algebraic-graphs] OK: x + y <= x * y
  952. 1459.87 s [algebraic-graphs]
  953. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  954. 1459.87 s [algebraic-graphs] OK: isEmpty empty == True
  955. 1459.87 s [algebraic-graphs] OK: hasVertex x empty == False
  956. 1459.87 s [algebraic-graphs] OK: vertexCount empty == 0
  957. 1459.87 s [algebraic-graphs] OK: edgeCount empty == 0
  958. 1459.87 s [algebraic-graphs]
  959. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  960. 1459.87 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  961. 1459.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  962. 1459.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  963. 1459.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  964. 1459.87 s [algebraic-graphs]
  965. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  966. 1459.87 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  967. 1459.87 s [algebraic-graphs] OK: edge x y == edge y x
  968. 1459.87 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  969. 1459.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  970. 1459.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  971. 1459.87 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  972. 1459.87 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  973. 1459.87 s [algebraic-graphs]
  974. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  975. 1459.87 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  976. 1459.87 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  977. 1459.87 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  978. 1459.87 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  979. 1459.87 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  980. 1459.87 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  981. 1459.87 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  982. 1459.87 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  983. 1459.87 s [algebraic-graphs]
  984. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  985. 1459.87 s [algebraic-graphs] OK: connect x y == connect y x
  986. 1459.87 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  987. 1459.87 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  988. 1459.87 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  989. 1459.87 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  990. 1459.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  991. 1459.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  992. 1459.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  993. 1459.87 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  994. 1459.87 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  995. 1459.87 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  996. 1459.87 s [algebraic-graphs]
  997. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  998. 1459.87 s [algebraic-graphs] OK: vertices [] == empty
  999. 1459.87 s [algebraic-graphs] OK: vertices [x] == vertex x
  1000. 1459.87 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1001. 1459.87 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1002. 1459.87 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1003. 1459.87 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1004. 1459.87 s [algebraic-graphs]
  1005. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  1006. 1459.87 s [algebraic-graphs] OK: edges [] == empty
  1007. 1459.87 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1008. 1459.87 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1009. 1459.87 s [algebraic-graphs]
  1010. 1459.87 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  1011. 1459.87 s [algebraic-graphs] OK: overlays [] == empty
  1012. 1460.56 s [haskell-language-server] plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
  1013. 1460.56 s [haskell-language-server] The import of ‘System.Directory’ is redundant
  1014. 1460.56 s [haskell-language-server] except perhaps to import instances from ‘System.Directory’
  1015. 1460.56 s [haskell-language-server] To import instances alone, use: import System.Directory()
  1016. 1460.56 s [haskell-language-server] |
  1017. 1460.56 s [haskell-language-server] 28 | import System.Directory
  1018. 1460.56 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1019. 1460.56 s [haskell-language-server]
  1020. 1468.78 s [haskell-language-server] Preprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0...
  1021. 1468.79 s [haskell-language-server] Building library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0...
  1022. 1468.88 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.o, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.dyn_o )
  1023. 1470.61 s [algebraic-graphs] OK: overlays [x] == x
  1024. 1470.61 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1025. 1470.61 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1026. 1470.61 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1027. 1470.61 s [algebraic-graphs]
  1028. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  1029. 1470.61 s [algebraic-graphs] OK: connects [] == empty
  1030. 1470.61 s [algebraic-graphs] OK: connects [x] == x
  1031. 1470.61 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1032. 1470.61 s [algebraic-graphs] OK: connects == foldr connect empty
  1033. 1470.61 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1034. 1470.61 s [algebraic-graphs] OK: connects == connects . reverse
  1035. 1470.61 s [algebraic-graphs]
  1036. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  1037. 1470.61 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1038. 1470.61 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1039. 1470.61 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1040. 1470.61 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1041. 1470.61 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1042. 1470.61 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1043. 1470.61 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1044. 1470.61 s [algebraic-graphs]
  1045. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  1046. 1470.61 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  1047. 1470.61 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  1048. 1470.61 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  1049. 1470.61 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  1050. 1470.61 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  1051. 1470.61 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  1052. 1470.61 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  1053. 1470.61 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  1054. 1470.61 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  1055. 1470.61 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1056. 1470.61 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1057. 1470.61 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1058. 1470.61 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1059. 1470.61 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1060. 1470.61 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1061. 1470.61 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1062. 1470.61 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1063. 1470.61 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1064. 1470.61 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1065. 1470.61 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1066. 1470.61 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1067. 1470.61 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1068. 1470.61 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1069. 1470.61 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1070. 1470.61 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1071. 1470.61 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1072. 1470.61 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1073. 1470.61 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1074. 1470.61 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1075. 1470.61 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1076. 1470.61 s [algebraic-graphs]
  1077. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  1078. 1470.61 s [algebraic-graphs] OK: isEmpty empty == True
  1079. 1470.61 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1080. 1470.61 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1081. 1470.61 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1082. 1470.61 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1083. 1470.61 s [algebraic-graphs]
  1084. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  1085. 1470.61 s [algebraic-graphs] OK: hasVertex x empty == False
  1086. 1470.61 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1087. 1470.61 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1088. 1470.61 s [algebraic-graphs]
  1089. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  1090. 1470.61 s [algebraic-graphs] OK: hasEdge x y empty == False
  1091. 1470.61 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1092. 1470.61 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1093. 1470.61 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  1094. 1470.61 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1095. 1470.61 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  1096. 1470.61 s [algebraic-graphs]
  1097. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  1098. 1470.61 s [algebraic-graphs] OK: vertexCount empty == 0
  1099. 1470.61 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1100. 1470.61 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1101. 1470.61 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1102. 1470.61 s [algebraic-graphs]
  1103. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  1104. 1470.61 s [algebraic-graphs] OK: edgeCount empty == 0
  1105. 1470.61 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1106. 1470.61 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1107. 1470.61 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1108. 1470.61 s [algebraic-graphs]
  1109. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  1110. 1470.61 s [algebraic-graphs] OK: vertexList empty == []
  1111. 1470.61 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1112. 1470.61 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1113. 1470.61 s [algebraic-graphs]
  1114. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  1115. 1470.61 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1116. 1470.61 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1117. 1470.61 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1118. 1470.61 s [algebraic-graphs]
  1119. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  1120. 1470.61 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1121. 1470.61 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1122. 1470.61 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1123. 1470.61 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1124. 1470.61 s [algebraic-graphs]
  1125. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  1126. 1470.61 s [algebraic-graphs] OK: edgeList empty == []
  1127. 1470.61 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1128. 1470.61 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  1129. 1470.61 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  1130. 1470.61 s [algebraic-graphs]
  1131. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  1132. 1470.61 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1133. 1470.61 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1134. 1470.61 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  1135. 1470.61 s [algebraic-graphs]
  1136. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  1137. 1470.61 s [algebraic-graphs] OK: adjacencyList empty == []
  1138. 1470.61 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1139. 1470.61 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  1140. 1470.61 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  1141. 1470.61 s [algebraic-graphs]
  1142. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  1143. 1470.61 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  1144. 1470.61 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  1145. 1470.61 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  1146. 1470.61 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  1147. 1470.61 s [algebraic-graphs]
  1148. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  1149. 1470.61 s [algebraic-graphs] OK: path [] == empty
  1150. 1470.61 s [algebraic-graphs] OK: path [x] == vertex x
  1151. 1470.61 s [algebraic-graphs] OK: path [x,y] == edge x y
  1152. 1470.61 s [algebraic-graphs] OK: path == path . reverse
  1153. 1470.61 s [algebraic-graphs]
  1154. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  1155. 1470.61 s [algebraic-graphs] OK: circuit [] == empty
  1156. 1470.61 s [algebraic-graphs] OK: circuit [x] == edge x x
  1157. 1470.61 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1158. 1470.61 s [algebraic-graphs] OK: circuit == circuit . reverse
  1159. 1470.61 s [algebraic-graphs]
  1160. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  1161. 1470.61 s [algebraic-graphs] OK: clique [] == empty
  1162. 1470.61 s [algebraic-graphs] OK: clique [x] == vertex x
  1163. 1470.61 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1164. 1470.61 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1165. 1470.61 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1166. 1470.61 s [algebraic-graphs] OK: clique == clique . reverse
  1167. 1470.61 s [algebraic-graphs]
  1168. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  1169. 1470.61 s [algebraic-graphs] OK: biclique [] [] == empty
  1170. 1470.61 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1171. 1470.61 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1172. 1470.61 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1173. 1470.61 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1174. 1470.61 s [algebraic-graphs]
  1175. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  1176. 1470.61 s [algebraic-graphs] OK: star x [] == vertex x
  1177. 1470.61 s [algebraic-graphs] OK: star x [y] == edge x y
  1178. 1470.61 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1179. 1470.61 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1180. 1470.61 s [algebraic-graphs]
  1181. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  1182. 1470.61 s [algebraic-graphs] OK: stars [] == empty
  1183. 1470.61 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1184. 1470.61 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1185. 1470.61 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1186. 1470.61 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1187. 1470.61 s [algebraic-graphs] OK: stars . adjacencyList == id
  1188. 1470.61 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1189. 1470.61 s [algebraic-graphs]
  1190. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  1191. 1470.61 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1192. 1470.61 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1193. 1470.61 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1194. 1470.61 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1195. 1470.61 s [algebraic-graphs]
  1196. 1470.61 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  1197. 1470.61 s [algebraic-graphs] OK: forest [] == empty
  1198. 1470.86 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.p_o )
  1199. 1476.94 s [algebraic-graphs] OK: forest [x] == tree x
  1200. 1476.94 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1201. 1476.96 s [algebraic-graphs] OK: forest == overlays . map tree
  1202. 1476.96 s [algebraic-graphs]
  1203. 1476.96 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  1204. 1476.96 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1205. 1476.96 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1206. 1476.96 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1207. 1476.96 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1208. 1476.96 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1209. 1476.96 s [algebraic-graphs]
  1210. 1476.96 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  1211. 1476.96 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1212. 1476.96 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1213. 1476.96 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1214. 1476.96 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1215. 1476.96 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1216. 1476.96 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1217. 1476.96 s [algebraic-graphs]
  1218. 1476.96 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  1219. 1476.96 s [algebraic-graphs] OK: replaceVertex x x == id
  1220. 1476.96 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1221. 1476.96 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1222. 1476.96 s [algebraic-graphs]
  1223. 1476.96 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  1224. 1476.96 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1225. 1476.96 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1226. 1476.96 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1227. 1476.96 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1228. 1476.96 s [algebraic-graphs]
  1229. 1476.96 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  1230. 1476.96 s [algebraic-graphs] OK: gmap f empty == empty
  1231. 1476.96 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1232. 1476.96 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1233. 1476.96 s [algebraic-graphs] OK: gmap id == id
  1234. 1476.96 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1235. 1476.96 s [algebraic-graphs]
  1236. 1476.96 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  1237. 1476.96 s [algebraic-graphs] OK: induce (const True ) x == x
  1238. 1476.96 s [algebraic-graphs] OK: induce (const False) x == empty
  1239. 1476.96 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1240. 1476.96 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1241. 1476.96 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1242. 1476.96 s [algebraic-graphs]
  1243. 1476.96 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  1244. 1476.96 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1245. 1476.96 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1246. 1476.96 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1247. 1476.96 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1248. 1476.96 s [algebraic-graphs]
  1249. 1476.96 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  1250. 1476.96 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  1251. 1476.96 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  1252. 1476.96 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  1253. 1476.96 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  1254. 1476.96 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  1255. 1476.96 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  1256. 1476.96 s [algebraic-graphs]
  1257. 1476.96 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  1258. 1476.96 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  1259. 1476.96 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  1260. 1476.96 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  1261. 1476.96 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  1262. 1476.96 s [algebraic-graphs]
  1263. 1476.96 s [algebraic-graphs] ============ Typed ============
  1264. 1476.96 s [algebraic-graphs]
  1265. 1476.96 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  1266. 1476.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1267. 1476.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1268. 1476.96 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  1269. 1476.96 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1270. 1476.96 s [algebraic-graphs]
  1271. 1476.96 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  1272. 1476.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1273. 1476.96 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1274. 1476.96 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  1275. 1476.96 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1276. 1476.96 s [algebraic-graphs]
  1277. 1476.96 s [algebraic-graphs] ============ Typed.dfsForest ============
  1278. 1476.96 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  1279. 1476.96 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  1280. 1476.96 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  1281. 1476.96 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  1282. 1476.96 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  1283. 1476.96 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  1284. 1476.96 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  1285. 1476.96 s [algebraic-graphs]
  1286. 1476.96 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  1287. 1476.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  1288. 1476.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  1289. 1476.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  1290. 1476.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  1291. 1476.96 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  1292. 1476.96 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  1293. 1476.96 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  1294. 1476.96 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  1295. 1476.96 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  1296. 1476.96 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  1297. 1476.96 s [algebraic-graphs]
  1298. 1476.96 s [algebraic-graphs] ============ Typed.dfs ============
  1299. 1476.96 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  1300. 1476.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  1301. 1476.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  1302. 1476.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  1303. 1476.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  1304. 1476.96 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  1305. 1476.96 s [algebraic-graphs] OK: dfs % x $ [] == []
  1306. 1476.96 s [algebraic-graphs]
  1307. 1476.96 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  1308. 1476.96 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  1309. 1476.96 s [algebraic-graphs]
  1310. 1476.96 s [algebraic-graphs] ============ Typed.topSort ============
  1311. 1476.96 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  1312. 1476.96 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  1313. 1476.96 s [algebraic-graphs]
  1314. 1476.96 s [algebraic-graphs] ============ Graph.Undirected ============
  1315. 1476.96 s [algebraic-graphs] OK: Axioms of undirected graphs
  1316. 1476.96 s [algebraic-graphs]
  1317. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  1318. 1476.96 s [algebraic-graphs] OK: show (empty ) == "empty"
  1319. 1476.96 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1320. 1476.96 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1321. 1476.96 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1322. 1476.96 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1323. 1476.96 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1324. 1476.96 s [algebraic-graphs]
  1325. 1476.96 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1326. 1476.96 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1327. 1476.96 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1328. 1476.96 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1329. 1476.96 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1330. 1476.96 s [algebraic-graphs]
  1331. 1476.96 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1332. 1476.96 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1333. 1476.96 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1334. 1476.96 s [algebraic-graphs]
  1335. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  1336. 1476.96 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  1337. 1476.96 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1338. 1476.96 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  1339. 1476.96 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  1340. 1476.96 s [algebraic-graphs]
  1341. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  1342. 1476.96 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  1343. 1476.96 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1344. 1476.96 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  1345. 1476.96 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  1346. 1476.96 s [algebraic-graphs]
  1347. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  1348. 1476.96 s [algebraic-graphs] OK: complement empty == empty
  1349. 1476.96 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  1350. 1476.96 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  1351. 1476.96 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  1352. 1476.96 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  1353. 1476.96 s [algebraic-graphs] OK: complement . complement == id
  1354. 1476.96 s [algebraic-graphs]
  1355. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  1356. 1476.96 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1357. 1476.96 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1358. 1476.96 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1359. 1476.96 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1360. 1476.96 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1361. 1476.96 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1362. 1476.96 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1363. 1476.96 s [algebraic-graphs] OK: x <= x + y
  1364. 1476.96 s [algebraic-graphs] OK: x + y <= x * y
  1365. 1476.96 s [algebraic-graphs]
  1366. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  1367. 1476.96 s [algebraic-graphs] OK: isEmpty empty == True
  1368. 1476.96 s [algebraic-graphs] OK: hasVertex x empty == False
  1369. 1476.96 s [algebraic-graphs] OK: vertexCount empty == 0
  1370. 1476.96 s [algebraic-graphs] OK: edgeCount empty == 0
  1371. 1476.96 s [algebraic-graphs]
  1372. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  1373. 1476.96 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1374. 1476.96 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1375. 1476.96 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1376. 1476.96 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1377. 1476.96 s [algebraic-graphs]
  1378. 1476.96 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  1379. 1476.96 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1380. 1476.96 s [algebraic-graphs] OK: edge x y == edge y x
  1381. 1477.90 s [haskell-language-server] Preprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0...
  1382. 1477.90 s [haskell-language-server] Building library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0...
  1383. 1477.98 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.o, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.dyn_o )
  1384. 1479.65 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.p_o )
  1385. 1484.55 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1386. 1484.55 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1387. 1484.55 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1388. 1484.58 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1389. 1484.58 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1390. 1484.58 s [algebraic-graphs]
  1391. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  1392. 1484.58 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1393. 1484.58 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1394. 1484.58 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1395. 1484.58 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1396. 1484.58 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1397. 1484.58 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1398. 1484.58 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1399. 1484.58 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1400. 1484.58 s [algebraic-graphs]
  1401. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  1402. 1484.58 s [algebraic-graphs] OK: connect x y == connect y x
  1403. 1484.58 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1404. 1484.58 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1405. 1484.58 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1406. 1484.58 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1407. 1484.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1408. 1484.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1409. 1484.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1410. 1484.58 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1411. 1484.58 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1412. 1484.58 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1413. 1484.58 s [algebraic-graphs]
  1414. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  1415. 1484.58 s [algebraic-graphs] OK: vertices [] == empty
  1416. 1484.58 s [algebraic-graphs] OK: vertices [x] == vertex x
  1417. 1484.58 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1418. 1484.58 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1419. 1484.58 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1420. 1484.58 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1421. 1484.58 s [algebraic-graphs]
  1422. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  1423. 1484.58 s [algebraic-graphs] OK: edges [] == empty
  1424. 1484.58 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1425. 1484.58 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1426. 1484.58 s [algebraic-graphs]
  1427. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  1428. 1484.58 s [algebraic-graphs] OK: overlays [] == empty
  1429. 1484.58 s [algebraic-graphs] OK: overlays [x] == x
  1430. 1484.58 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1431. 1484.58 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1432. 1484.58 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1433. 1484.58 s [algebraic-graphs]
  1434. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  1435. 1484.58 s [algebraic-graphs] OK: connects [] == empty
  1436. 1484.58 s [algebraic-graphs] OK: connects [x] == x
  1437. 1484.58 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1438. 1484.58 s [algebraic-graphs] OK: connects == foldr connect empty
  1439. 1484.58 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1440. 1484.58 s [algebraic-graphs] OK: connects == connects . reverse
  1441. 1484.58 s [algebraic-graphs]
  1442. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  1443. 1484.58 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1444. 1484.58 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1445. 1484.58 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1446. 1484.58 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1447. 1484.58 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1448. 1484.58 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1449. 1484.58 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1450. 1484.58 s [algebraic-graphs]
  1451. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.path ============
  1452. 1484.58 s [algebraic-graphs] OK: path [] == empty
  1453. 1484.58 s [algebraic-graphs] OK: path [x] == vertex x
  1454. 1484.58 s [algebraic-graphs] OK: path [x,y] == edge x y
  1455. 1484.58 s [algebraic-graphs] OK: path == path . reverse
  1456. 1484.58 s [algebraic-graphs]
  1457. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  1458. 1484.58 s [algebraic-graphs] OK: circuit [] == empty
  1459. 1484.58 s [algebraic-graphs] OK: circuit [x] == edge x x
  1460. 1484.58 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1461. 1484.58 s [algebraic-graphs] OK: circuit == circuit . reverse
  1462. 1484.58 s [algebraic-graphs]
  1463. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  1464. 1484.58 s [algebraic-graphs] OK: clique [] == empty
  1465. 1484.58 s [algebraic-graphs] OK: clique [x] == vertex x
  1466. 1484.58 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1467. 1484.58 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1468. 1484.58 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1469. 1484.58 s [algebraic-graphs] OK: clique == clique . reverse
  1470. 1484.58 s [algebraic-graphs]
  1471. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  1472. 1484.58 s [algebraic-graphs] OK: biclique [] [] == empty
  1473. 1484.58 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1474. 1484.58 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1475. 1484.58 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1476. 1484.58 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1477. 1484.58 s [algebraic-graphs]
  1478. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.star ============
  1479. 1484.58 s [algebraic-graphs] OK: star x [] == vertex x
  1480. 1484.58 s [algebraic-graphs] OK: star x [y] == edge x y
  1481. 1484.58 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1482. 1484.58 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1483. 1484.58 s [algebraic-graphs]
  1484. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  1485. 1484.58 s [algebraic-graphs] OK: stars [] == empty
  1486. 1484.58 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1487. 1484.58 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1488. 1484.58 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1489. 1484.58 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1490. 1484.58 s [algebraic-graphs] OK: stars . adjacencyList == id
  1491. 1484.58 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1492. 1484.58 s [algebraic-graphs]
  1493. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  1494. 1484.58 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1495. 1484.58 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1496. 1484.58 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1497. 1484.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)]
  1498. 1484.58 s [algebraic-graphs]
  1499. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  1500. 1484.58 s [algebraic-graphs] OK: forest [] == empty
  1501. 1484.58 s [algebraic-graphs] OK: forest [x] == tree x
  1502. 1484.58 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1503. 1484.58 s [algebraic-graphs] OK: forest == overlays . map tree
  1504. 1484.58 s [algebraic-graphs]
  1505. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  1506. 1484.58 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1507. 1484.58 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1508. 1484.58 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1509. 1484.58 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1510. 1484.58 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1511. 1484.58 s [algebraic-graphs]
  1512. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  1513. 1484.58 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1514. 1484.58 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1515. 1484.58 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1516. 1484.58 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1517. 1484.58 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1518. 1484.58 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1519. 1484.58 s [algebraic-graphs]
  1520. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  1521. 1484.58 s [algebraic-graphs] OK: replaceVertex x x == id
  1522. 1484.58 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1523. 1484.58 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1524. 1484.58 s [algebraic-graphs]
  1525. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  1526. 1484.58 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1527. 1484.58 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1528. 1484.58 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1529. 1484.58 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1530. 1484.58 s [algebraic-graphs]
  1531. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  1532. 1484.58 s [algebraic-graphs] OK: gmap f empty == empty
  1533. 1484.58 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1534. 1484.58 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1535. 1484.58 s [algebraic-graphs] OK: gmap id == id
  1536. 1484.58 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1537. 1484.58 s [algebraic-graphs]
  1538. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  1539. 1484.58 s [algebraic-graphs] OK: induce (const True ) x == x
  1540. 1484.58 s [algebraic-graphs] OK: induce (const False) x == empty
  1541. 1484.58 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1542. 1484.58 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1543. 1484.58 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1544. 1484.58 s [algebraic-graphs]
  1545. 1484.58 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  1546. 1484.58 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1547. 1484.58 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1548. 1484.58 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1549. 1484.58 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1550. 1484.58 s [algebraic-graphs] Test suite main: PASS
  1551. 1484.58 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  1552. 1484.58 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  1553. 1484.58 s [algebraic-graphs] checkPhase completed in 1 minutes 45 seconds
  1554. 1484.58 s [algebraic-graphs] Phase: haddockPhase
  1555. 1485.14 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  1556. 1485.14 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  1557. 1485.30 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1558. 1485.53 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [HIE file is missing]
  1559. 1485.59 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [HIE file is missing]
  1560. 1485.68 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [HIE file is missing]
  1561. 1485.71 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [HIE file is missing]
  1562. 1485.88 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [HIE file is missing]
  1563. 1485.91 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1564. 1486.01 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  1565. 1486.21 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [HIE file is missing]
  1566. 1486.53 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1567. 1486.64 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  1568. 1486.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  1569. 1486.78 s [algebraic-graphs] In the use of ‘head’
  1570. 1486.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1571. 1486.78 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"."
  1572. 1486.78 s [algebraic-graphs] |
  1573. 1486.78 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  1574. 1486.78 s [algebraic-graphs] | ^^^^
  1575. 1486.78 s [algebraic-graphs]
  1576. 1486.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  1577. 1486.78 s [algebraic-graphs] In the use of ‘tail’
  1578. 1486.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1579. 1486.78 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"."
  1580. 1486.78 s [algebraic-graphs] |
  1581. 1486.78 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  1582. 1486.78 s [algebraic-graphs] | ^^^^
  1583. 1486.78 s [algebraic-graphs]
  1584. 1486.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  1585. 1486.78 s [algebraic-graphs] In the use of ‘head’
  1586. 1486.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1587. 1486.78 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"."
  1588. 1486.78 s [algebraic-graphs] |
  1589. 1486.78 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  1590. 1486.78 s [algebraic-graphs] | ^^^^
  1591. 1486.78 s [algebraic-graphs]
  1592. 1486.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  1593. 1486.78 s [algebraic-graphs] In the use of ‘tail’
  1594. 1486.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  1595. 1486.78 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"."
  1596. 1486.78 s [algebraic-graphs] |
  1597. 1486.78 s [algebraic-graphs] 397 | bnd' = tail bnd
  1598. 1486.78 s [algebraic-graphs] | ^^^^
  1599. 1486.78 s [algebraic-graphs]
  1600. 1486.79 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1601. 1486.90 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [HIE file is missing]
  1602. 1487.00 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1603. 1487.00 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1604. 1487.00 s [algebraic-graphs] will become an error in a future GHC release.
  1605. 1487.00 s [algebraic-graphs] Suggested fix:
  1606. 1487.00 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1607. 1487.00 s [algebraic-graphs] |
  1608. 1487.00 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  1609. 1487.00 s [algebraic-graphs] | ^
  1610. 1487.00 s [algebraic-graphs]
  1611. 1487.00 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1612. 1487.00 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1613. 1487.00 s [algebraic-graphs] will become an error in a future GHC release.
  1614. 1487.00 s [algebraic-graphs] Suggested fix:
  1615. 1487.00 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1616. 1487.00 s [algebraic-graphs] |
  1617. 1487.00 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1618. 1487.00 s [algebraic-graphs] | ^
  1619. 1487.00 s [algebraic-graphs]
  1620. 1487.00 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1621. 1487.00 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1622. 1487.00 s [algebraic-graphs] will become an error in a future GHC release.
  1623. 1487.00 s [algebraic-graphs] Suggested fix:
  1624. 1487.00 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1625. 1487.00 s [algebraic-graphs] |
  1626. 1487.01 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1627. 1487.01 s [algebraic-graphs] | ^
  1628. 1487.01 s [algebraic-graphs]
  1629. 1487.01 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1630. 1487.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1631. 1487.01 s [algebraic-graphs] will become an error in a future GHC release.
  1632. 1487.01 s [algebraic-graphs] Suggested fix:
  1633. 1487.01 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1634. 1487.01 s [algebraic-graphs] |
  1635. 1487.01 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1636. 1487.01 s [algebraic-graphs] | ^
  1637. 1487.01 s [algebraic-graphs]
  1638. 1487.01 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1639. 1487.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1640. 1487.01 s [algebraic-graphs] will become an error in a future GHC release.
  1641. 1487.01 s [algebraic-graphs] Suggested fix:
  1642. 1487.01 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1643. 1487.01 s [algebraic-graphs] |
  1644. 1487.01 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1645. 1487.01 s [algebraic-graphs] | ^
  1646. 1487.01 s [algebraic-graphs]
  1647. 1487.01 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1648. 1487.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1649. 1487.01 s [algebraic-graphs] will become an error in a future GHC release.
  1650. 1487.01 s [algebraic-graphs] Suggested fix:
  1651. 1487.01 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1652. 1487.01 s [algebraic-graphs] |
  1653. 1487.01 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1654. 1487.01 s [algebraic-graphs] | ^
  1655. 1487.01 s [algebraic-graphs]
  1656. 1487.01 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1657. 1487.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1658. 1487.01 s [algebraic-graphs] will become an error in a future GHC release.
  1659. 1487.01 s [algebraic-graphs] Suggested fix:
  1660. 1487.01 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1661. 1487.01 s [algebraic-graphs] |
  1662. 1487.01 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1663. 1487.01 s [algebraic-graphs] | ^
  1664. 1487.01 s [algebraic-graphs]
  1665. 1487.02 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [HIE file is missing]
  1666. 1487.09 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [HIE file is missing]
  1667. 1487.13 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [HIE file is missing]
  1668. 1487.25 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0...
  1669. 1487.25 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0...
  1670. 1487.28 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [HIE file is missing]
  1671. 1487.37 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [HIE file is missing]
  1672. 1487.46 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  1673. 1487.46 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  1674. 1487.46 s [haskell-language-server] but were not needed for compilation:
  1675. 1487.46 s [haskell-language-server] - ghc-9.12.2 (exposed by flag -package-id ghc-9.12.2-e4b2)
  1676. 1487.46 s [haskell-language-server]
  1677. 1487.47 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  1678. 1487.51 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [HIE file is missing]
  1679. 1487.52 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [HIE file is missing]
  1680. 1487.53 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [HIE file is missing]
  1681. 1487.55 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1682. 1487.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1683. 1487.55 s [algebraic-graphs] will become an error in a future GHC release.
  1684. 1487.55 s [algebraic-graphs] Suggested fix:
  1685. 1487.55 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1686. 1487.55 s [algebraic-graphs] |
  1687. 1487.55 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  1688. 1487.55 s [algebraic-graphs] | ^
  1689. 1487.55 s [algebraic-graphs]
  1690. 1487.55 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [HIE file is missing]
  1691. 1487.57 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1692. 1487.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1693. 1487.57 s [algebraic-graphs] will become an error in a future GHC release.
  1694. 1487.57 s [algebraic-graphs] Suggested fix:
  1695. 1487.57 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1696. 1487.57 s [algebraic-graphs] |
  1697. 1487.57 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  1698. 1487.57 s [algebraic-graphs] | ^
  1699. 1487.57 s [algebraic-graphs]
  1700. 1487.57 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1701. 1487.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1702. 1487.57 s [algebraic-graphs] will become an error in a future GHC release.
  1703. 1487.57 s [algebraic-graphs] Suggested fix:
  1704. 1487.57 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  1705. 1487.57 s [algebraic-graphs] |
  1706. 1487.57 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  1707. 1487.58 s [algebraic-graphs] | ^
  1708. 1487.58 s [algebraic-graphs]
  1709. 1487.58 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [HIE file is missing]
  1710. 1487.66 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [HIE file is missing]
  1711. 1487.79 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [HIE file is missing]
  1712. 1487.81 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [HIE file is missing]
  1713. 1487.82 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [HIE file is missing]
  1714. 1487.84 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [HIE file is missing]
  1715. 1487.86 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) [HIE file is missing]
  1716. 1487.88 s [algebraic-graphs] Haddock coverage:
  1717. 1487.89 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1718. 1487.89 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1719. 1487.89 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1720. 1487.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1721. 1487.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1722. 1487.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1723. 1487.94 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  1724. 1487.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1725. 1487.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  1726. 1487.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1727. 1487.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1728. 1487.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1729. 1487.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  1730. 1487.96 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  1731. 1487.97 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1732. 1487.97 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1733. 1487.97 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1734. 1487.97 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1735. 1487.97 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  1736. 1487.97 s [algebraic-graphs] Missing documentation for:
  1737. 1487.97 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  1738. 1487.97 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  1739. 1487.97 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  1740. 1487.97 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  1741. 1487.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1742. 1487.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1743. 1487.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  1744. 1487.97 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  1745. 1487.97 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1746. 1487.97 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  1747. 1487.98 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  1748. 1487.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  1749. 1487.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  1750. 1487.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1751. 1487.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1752. 1487.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  1753. 1487.98 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1754. 1487.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  1755. 1487.98 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1756. 1487.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1757. 1487.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1758. 1487.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  1759. 1487.99 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  1760. 1488.08 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1761. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1762. 1488.08 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  1763. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1764. 1488.08 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  1765. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1766. 1488.08 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  1767. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1768. 1488.08 s [algebraic-graphs] Warning: 'box' is out of scope.
  1769. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1770. 1488.08 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1771. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1772. 1488.08 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  1773. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1774. 1488.08 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  1775. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1776. 1488.08 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  1777. 1488.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1778. 1488.08 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  1779. 1488.09 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  1780. 1488.09 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  1781. 1488.09 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  1782. 1488.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1783. 1488.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1784. 1488.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  1785. 1488.09 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1786. 1488.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1787. 1488.09 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1788. 1488.09 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1789. 1488.09 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1790. 1488.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1791. 1488.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1792. 1488.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1793. 1488.10 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  1794. 1488.10 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1795. 1488.10 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1796. 1488.10 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1797. 1488.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1798. 1488.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1799. 1488.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  1800. 1488.11 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  1801. 1488.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1802. 1488.11 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  1803. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  1804. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  1805. 1488.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1806. 1488.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1807. 1488.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  1808. 1488.11 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  1809. 1488.11 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  1810. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  1811. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  1812. 1488.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1813. 1488.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1814. 1488.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  1815. 1488.11 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  1816. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  1817. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  1818. 1488.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1819. 1488.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1820. 1488.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  1821. 1488.11 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  1822. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  1823. 1488.11 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  1824. 1488.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1825. 1488.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1826. 1488.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  1827. 1488.12 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  1828. 1488.12 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  1829. 1488.12 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  1830. 1488.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1831. 1488.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1832. 1488.12 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  1833. 1488.12 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  1834. 1488.12 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  1835. 1488.12 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  1836. 1488.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1837. 1488.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1838. 1488.12 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  1839. 1488.12 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  1840. 1488.12 s [algebraic-graphs] Warning: 'empty' is out of scope.
  1841. 1488.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1842. 1488.12 s [algebraic-graphs] Warning: 'edges' is out of scope.
  1843. 1488.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1844. 1488.12 s [algebraic-graphs] Warning: 'stars' is out of scope.
  1845. 1488.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1846. 1488.12 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  1847. 1488.12 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  1848. 1488.12 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  1849. 1488.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1850. 1488.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1851. 1488.12 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  1852. 1488.12 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1853. 1488.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1854. 1488.12 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1855. 1488.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1856. 1488.13 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1857. 1488.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1858. 1488.13 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  1859. 1488.14 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1860. 1488.14 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1861. 1488.14 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  1862. 1488.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1863. 1488.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1864. 1488.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  1865. 1488.14 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  1866. 1488.14 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  1867. 1488.14 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  1868. 1488.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1869. 1488.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1870. 1488.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  1871. 1488.14 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1872. 1488.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1873. 1488.14 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1874. 1488.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1875. 1488.14 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  1876. 1488.14 s [algebraic-graphs] Missing documentation for:
  1877. 1488.14 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  1878. 1488.14 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1879. 1488.14 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  1880. 1488.14 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1881. 1488.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1882. 1488.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1883. 1488.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  1884. 1488.15 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1885. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  1886. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1887. 1488.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1888. 1488.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1889. 1488.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1890. 1488.15 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  1891. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  1892. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  1893. 1488.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1894. 1488.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1895. 1488.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  1896. 1488.15 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  1897. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  1898. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  1899. 1488.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1900. 1488.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1901. 1488.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  1902. 1488.15 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  1903. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  1904. 1488.15 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  1905. 1488.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1906. 1488.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1907. 1488.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  1908. 1488.15 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  1909. 1488.16 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  1910. 1488.16 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  1911. 1488.16 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  1912. 1488.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1913. 1488.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1914. 1488.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  1915. 1488.16 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  1916. 1488.16 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  1917. 1488.16 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  1918. 1488.16 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  1919. 1488.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1920. 1488.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1921. 1488.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  1922. 1488.16 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1923. 1488.16 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  1924. 1488.16 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1925. 1488.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1926. 1488.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1927. 1488.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  1928. 1488.17 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  1929. 1488.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1930. 1488.17 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  1931. 1488.18 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1932. 1488.18 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  1933. 1488.18 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1934. 1488.18 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1935. 1488.18 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1936. 1488.18 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  1937. 1488.19 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  1938. 1488.19 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  1939. 1488.19 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  1940. 1488.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1941. 1488.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1942. 1488.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  1943. 1488.19 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  1944. 1488.19 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  1945. 1488.19 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  1946. 1488.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1947. 1488.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1948. 1488.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  1949. 1488.19 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  1950. 1488.20 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1951. 1488.20 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1952. 1488.21 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  1953. 1488.21 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1954. 1488.21 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1955. 1488.21 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1956. 1488.21 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1957. 1488.21 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1958. 1488.21 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1959. 1488.22 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  1960. 1488.22 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  1961. 1488.22 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  1962. 1488.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1963. 1488.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1964. 1488.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  1965. 1488.22 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  1966. 1488.22 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  1967. 1488.22 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  1968. 1488.22 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  1969. 1488.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1970. 1488.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1971. 1488.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  1972. 1488.22 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1973. 1488.22 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  1974. 1488.22 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1975. 1488.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1976. 1488.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1977. 1488.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  1978. 1488.23 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  1979. 1488.23 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  1980. 1488.23 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  1981. 1488.23 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1982. 1488.23 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1983. 1488.23 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  1984. 1488.23 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  1985. 1488.23 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  1986. 1488.24 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  1987. 1488.24 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  1988. 1488.24 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  1989. 1488.24 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  1990. 1488.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1991. 1488.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1992. 1488.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  1993. 1488.24 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  1994. 1488.24 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  1995. 1488.24 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  1996. 1488.24 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  1997. 1488.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1998. 1488.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1999. 1488.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  2000. 1488.24 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  2001. 1488.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2002. 1488.24 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  2003. 1488.25 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  2004. 1488.25 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  2005. 1488.25 s [algebraic-graphs] * in ‘Data.Set.Internal’
  2006. 1488.25 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2007. 1488.25 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2008. 1488.25 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  2009. 1488.26 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  2010. 1488.27 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  2011. 1488.27 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  2012. 1488.27 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  2013. 1488.27 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  2014. 1488.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2015. 1488.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2016. 1488.27 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  2017. 1488.27 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  2018. 1488.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2019. 1488.27 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  2020. 1488.27 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  2021. 1488.27 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  2022. 1488.27 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  2023. 1488.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2024. 1488.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2025. 1488.27 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  2026. 1488.27 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  2027. 1488.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2028. 1488.27 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  2029. 1488.27 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  2030. 1488.27 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  2031. 1488.27 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  2032. 1488.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2033. 1488.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2034. 1488.27 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  2035. 1488.27 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  2036. 1488.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2037. 1488.27 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  2038. 1488.27 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  2039. 1488.27 s [algebraic-graphs] Missing documentation for:
  2040. 1488.27 s [algebraic-graphs] Module header
  2041. 1488.27 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  2042. 1488.27 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  2043. 1488.27 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  2044. 1488.27 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  2045. 1488.27 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  2046. 1488.27 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  2047. 1488.27 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  2048. 1488.27 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  2049. 1488.27 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  2050. 1488.27 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  2051. 1488.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2052. 1488.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2053. 1488.27 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  2054. 1488.27 s [algebraic-graphs] Warning: 'array' is out of scope.
  2055. 1488.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2056. 1488.28 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  2057. 1488.28 s [algebraic-graphs] Missing documentation for:
  2058. 1488.28 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  2059. 1488.45 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  2060. 1488.45 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  2061. 1488.45 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2062. 1488.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2063. 1488.46 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  2064. 1488.46 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  2065. 1488.46 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2066. 1488.46 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2067. 1488.46 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  2068. 1488.46 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  2069. 1488.46 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  2070. 1488.46 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  2071. 1488.46 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2072. 1488.46 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2073. 1488.47 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  2074. 1488.47 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  2075. 1488.47 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  2076. 1488.47 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  2077. 1488.48 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  2078. 1488.48 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  2079. 1488.48 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  2080. 1488.48 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  2081. 1488.48 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  2082. 1488.49 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  2083. 1488.49 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  2084. 1488.49 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2085. 1488.49 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  2086. 1488.49 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2087. 1488.49 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2088. 1488.49 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2089. 1488.49 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2090. 1488.49 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2091. 1488.49 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2092. 1488.49 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2093. 1488.49 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2094. 1488.50 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2095. 1488.50 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  2096. 1488.50 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2097. 1488.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2098. 1488.50 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  2099. 1488.50 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2100. 1488.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2101. 1488.51 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  2102. 1488.51 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2103. 1488.51 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  2104. 1488.51 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  2105. 1488.51 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2106. 1488.51 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2107. 1488.52 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  2108. 1488.52 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  2109. 1488.52 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2110. 1488.52 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2111. 1488.53 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  2112. 1488.53 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  2113. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2114. 1488.53 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  2115. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2116. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2117. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2118. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  2119. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2120. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2121. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2122. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  2123. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2124. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2125. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  2126. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  2127. 1488.53 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  2128. 1488.53 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2129. 1488.53 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2130. 1488.53 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2131. 1488.53 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2132. 1488.53 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  2133. 1488.53 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2134. 1488.53 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  2135. 1488.53 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2136. 1488.53 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  2137. 1488.53 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2138. 1488.53 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  2139. 1488.53 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2140. 1488.65 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 )
  2141. 1488.65 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 )
  2142. 1489.65 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 )
  2143. 1489.91 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 )
  2144. 1490.74 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2145. 1490.74 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2146. 1490.74 s [haskell-language-server] but were not needed for compilation:
  2147. 1490.74 s [haskell-language-server] - ghc-9.12.2 (exposed by flag -package-id ghc-9.12.2-e4b2)
  2148. 1490.74 s [haskell-language-server]
  2149. 1490.76 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  2150. 1491.94 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 )
  2151. 1491.94 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  2152. 1493.01 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  2153. 1493.09 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs,
  2154. 1493.09 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  2155. 1493.55 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  2156. 1493.71 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  2157. 1493.80 s [algebraic-graphs] Phase: installPhase
  2158. 1493.86 s [algebraic-graphs] Installing library in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  2159. 1494.50 s [algebraic-graphs] Phase: fixupPhase
  2160. 1494.52 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  2161. 1494.52 s [algebraic-graphs] shrinking /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSalgebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x-ghc9.12.2.so
  2162. 1494.56 s [algebraic-graphs] checking for references to /build/ in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7...
  2163. 1494.60 s [algebraic-graphs] patching script interpreter paths in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  2164. 1494.61 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib
  2165. 1494.92 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc
  2166. 1494.94 s [algebraic-graphs] checking for references to /build/ in /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc...
  2167. 1494.97 s [algebraic-graphs] patching script interpreter paths in /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc
  2168. 1495.15 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  2169. 1495.65 s [post-build-hook] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  2170. 1495.65 s [post-build-hook]
  2171. 1496.00 s [post-build-hook] Pushing /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7 (25.73 MiB)
  2172. 1496.05 s [post-build-hook] Pushing /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc (10.41 MiB)
  2173. 1497.36 s [post-build-hook]
  2174. 1497.36 s [post-build-hook] All done.
  2175. 1497.38 s [post-build-hook] Uploading to the NixCI cache: /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  2176. 1497.41 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2177. 1497.42 s [post-build-hook] copying 2 paths...
  2178. 1497.42 s [post-build-hook] copying path '/nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  2179. 1498.63 s [post-build-hook] copying path '/nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  2180. 1504.43 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2181. 1504.63 s [post-build-hook] copying 1 paths...
  2182. 1504.63 s [post-build-hook] copying path '/nix/store/zjchlysmh2pvhrp9q0n4mzr5997n8br3-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  2183. 1504.81 s Progress: 23 of 28 built (1 building), 1181 of 1181 downloaded from cache
  2184. 1504.86 s Building ghc-9.12.2-with-packages
  2185. 1504.86 s [haskell-language-server] Preprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0...
  2186. 1504.86 s [haskell-language-server] Building executable 'haskell-language-server' for haskell-language-server-2.12.0.0...
  2187. 1504.86 s [haskell-language-server] [1 of 1] Compiling Main ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
  2188. 1504.86 s [haskell-language-server] [2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
  2189. 1504.92 s [ghc-9.12.2-with-packages] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/nix-support:
  2190. 1504.92 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2191. 1504.93 s [ghc-9.12.2-with-packages] /nix/store/ss1j3dr9hhfd794ry1lhky68vxdxjcma-ghc-compat-plugin-0.1.0.1/nix-support:
  2192. 1504.93 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2193. 1504.94 s [ghc-9.12.2-with-packages] /nix/store/aqhascsacrlbmj9c0z17lz86fq5m88sq-hedgehog-1.5/nix-support:
  2194. 1504.94 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2195. 1504.97 s [ghc-9.12.2-with-packages] /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0/nix-support:
  2196. 1504.97 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2197. 1504.98 s [ghc-9.12.2-with-packages] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/nix-support:
  2198. 1504.98 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2199. 1505.00 s [ghc-9.12.2-with-packages] /nix/store/g0bzpxgsivgdg8mcp89jasnsj4xywirr-temporary-1.3/nix-support:
  2200. 1505.00 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2201. 1505.00 s [ghc-9.12.2-with-packages] /nix/store/g0bzpxgsivgdg8mcp89jasnsj4xywirr-temporary-1.3/nix-support:
  2202. 1505.00 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2203. 1505.00 s [ghc-9.12.2-with-packages] /nix/store/rdrf9wf8vaw856ms410wd2dkrhs7nk07-ansi-terminal-1.1.3/nix-support:
  2204. 1505.00 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2205. 1505.00 s [ghc-9.12.2-with-packages] /nix/store/rdrf9wf8vaw856ms410wd2dkrhs7nk07-ansi-terminal-1.1.3/nix-support:
  2206. 1505.00 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2207. 1505.00 s [ghc-9.12.2-with-packages] /nix/store/0kcziz05cx0sa6d25jvwx1f80h2hnr85-async-2.2.5/nix-support:
  2208. 1505.00 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2209. 1505.01 s [ghc-9.12.2-with-packages] /nix/store/0kcziz05cx0sa6d25jvwx1f80h2hnr85-async-2.2.5/nix-support:
  2210. 1505.01 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2211. 1505.01 s [ghc-9.12.2-with-packages] /nix/store/y5i90fy047kzypa8livcfy04lwp82594-barbies-2.1.1.0/nix-support:
  2212. 1505.01 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2213. 1505.02 s [ghc-9.12.2-with-packages] /nix/store/y5i90fy047kzypa8livcfy04lwp82594-barbies-2.1.1.0/nix-support:
  2214. 1505.02 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2215. 1505.02 s [ghc-9.12.2-with-packages] /nix/store/nnr0h9v86bz86ca1zsfbi9m0d57v2vmj-concurrent-output-1.10.21/nix-support:
  2216. 1505.02 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2217. 1505.02 s [ghc-9.12.2-with-packages] /nix/store/nnr0h9v86bz86ca1zsfbi9m0d57v2vmj-concurrent-output-1.10.21/nix-support:
  2218. 1505.02 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2219. 1505.03 s [ghc-9.12.2-with-packages] /nix/store/la712y9pixdihfyzny0mizmmawa82wd7-lifted-async-0.10.2.7/nix-support:
  2220. 1505.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2221. 1505.03 s [ghc-9.12.2-with-packages] /nix/store/la712y9pixdihfyzny0mizmmawa82wd7-lifted-async-0.10.2.7/nix-support:
  2222. 1505.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2223. 1505.03 s [ghc-9.12.2-with-packages] /nix/store/gn0swws787bdlynagc22pjnnam68mwsq-mmorph-1.2.1/nix-support:
  2224. 1505.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2225. 1505.03 s [ghc-9.12.2-with-packages] /nix/store/gn0swws787bdlynagc22pjnnam68mwsq-mmorph-1.2.1/nix-support:
  2226. 1505.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2227. 1505.03 s [ghc-9.12.2-with-packages] /nix/store/xqhwh9nazhhvs17x4smcjm70na922gac-monad-control-1.0.3.1/nix-support:
  2228. 1505.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2229. 1505.03 s [ghc-9.12.2-with-packages] /nix/store/xqhwh9nazhhvs17x4smcjm70na922gac-monad-control-1.0.3.1/nix-support:
  2230. 1505.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2231. 1505.04 s [ghc-9.12.2-with-packages] /nix/store/4yh5b7mayccdj8w61h4hf34qz49x0ajs-pretty-show-1.10/nix-support:
  2232. 1505.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2233. 1505.04 s [ghc-9.12.2-with-packages] /nix/store/4yh5b7mayccdj8w61h4hf34qz49x0ajs-pretty-show-1.10/nix-support:
  2234. 1505.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2235. 1505.04 s [ghc-9.12.2-with-packages] /nix/store/vxgfgs1mvp21gl6l47iph3lrpan1rsd4-primitive-0.9.1.0/nix-support:
  2236. 1505.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2237. 1505.04 s [ghc-9.12.2-with-packages] /nix/store/vxgfgs1mvp21gl6l47iph3lrpan1rsd4-primitive-0.9.1.0/nix-support:
  2238. 1505.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2239. 1505.05 s [ghc-9.12.2-with-packages] /nix/store/j42bsxi8bhrkaicyh8an4yx8frakiv3d-random-1.2.1.3/nix-support:
  2240. 1505.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2241. 1505.05 s [ghc-9.12.2-with-packages] /nix/store/j42bsxi8bhrkaicyh8an4yx8frakiv3d-random-1.2.1.3/nix-support:
  2242. 1505.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2243. 1505.05 s [ghc-9.12.2-with-packages] /nix/store/vnf0h1rs116sgy0v0bw6mkjfcpsm0qkx-resourcet-1.3.0/nix-support:
  2244. 1505.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2245. 1505.05 s [ghc-9.12.2-with-packages] /nix/store/vnf0h1rs116sgy0v0bw6mkjfcpsm0qkx-resourcet-1.3.0/nix-support:
  2246. 1505.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2247. 1505.05 s [ghc-9.12.2-with-packages] /nix/store/f4h9q57z55mxmqxk1jajl5mcpw1cq811-safe-exceptions-0.1.7.4/nix-support:
  2248. 1505.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2249. 1505.06 s [ghc-9.12.2-with-packages] /nix/store/f4h9q57z55mxmqxk1jajl5mcpw1cq811-safe-exceptions-0.1.7.4/nix-support:
  2250. 1505.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2251. 1505.06 s [ghc-9.12.2-with-packages] /nix/store/a43444ms5j0gl0y1rk2s3n4bcs8wk84m-transformers-base-0.4.6/nix-support:
  2252. 1505.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2253. 1505.06 s [ghc-9.12.2-with-packages] /nix/store/a43444ms5j0gl0y1rk2s3n4bcs8wk84m-transformers-base-0.4.6/nix-support:
  2254. 1505.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2255. 1505.06 s [ghc-9.12.2-with-packages] /nix/store/j61fzi5z4sk7xzac1k503p538mbyy8xp-wl-pprint-annotated-0.1.0.1/nix-support:
  2256. 1505.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2257. 1505.06 s [ghc-9.12.2-with-packages] /nix/store/j61fzi5z4sk7xzac1k503p538mbyy8xp-wl-pprint-annotated-0.1.0.1/nix-support:
  2258. 1505.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2259. 1505.09 s [ghc-9.12.2-with-packages] /nix/store/bnsivyi6b2pah9rl39fclgmibk2nkbfc-Cabal-syntax-3.12.1.0/nix-support:
  2260. 1505.09 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2261. 1505.10 s [ghc-9.12.2-with-packages] /nix/store/bnsivyi6b2pah9rl39fclgmibk2nkbfc-Cabal-syntax-3.12.1.0/nix-support:
  2262. 1505.10 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2263. 1505.10 s [ghc-9.12.2-with-packages] /nix/store/9b4jlw09ib7h2ncky9vxlzgggj1jl2c6-ansi-terminal-types-1.1.3/nix-support:
  2264. 1505.10 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2265. 1505.10 s [ghc-9.12.2-with-packages] /nix/store/9b4jlw09ib7h2ncky9vxlzgggj1jl2c6-ansi-terminal-types-1.1.3/nix-support:
  2266. 1505.10 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2267. 1505.11 s [ghc-9.12.2-with-packages] /nix/store/zaazzzs7dc11djb0p2i37756as7slpz2-hashable-1.5.0.0/nix-support:
  2268. 1505.11 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2269. 1505.11 s [ghc-9.12.2-with-packages] /nix/store/zaazzzs7dc11djb0p2i37756as7slpz2-hashable-1.5.0.0/nix-support:
  2270. 1505.11 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2271. 1505.11 s [ghc-9.12.2-with-packages] /nix/store/xnqdi5caq1ynkbyg2qfi1b6zhv3fn501-distributive-0.6.2.1/nix-support:
  2272. 1505.11 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2273. 1505.11 s [ghc-9.12.2-with-packages] /nix/store/xnqdi5caq1ynkbyg2qfi1b6zhv3fn501-distributive-0.6.2.1/nix-support:
  2274. 1505.11 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2275. 1505.12 s [ghc-9.12.2-with-packages] /nix/store/bqshylnkz6gcl2zm7s3r5hlp439mrfal-constraints-0.14.2/nix-support:
  2276. 1505.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2277. 1505.12 s [ghc-9.12.2-with-packages] /nix/store/bqshylnkz6gcl2zm7s3r5hlp439mrfal-constraints-0.14.2/nix-support:
  2278. 1505.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2279. 1505.13 s [ghc-9.12.2-with-packages] /nix/store/0p3i1fm1by4kjbcassf6hj7lmpc0bp9c-lifted-base-0.2.3.12/nix-support:
  2280. 1505.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2281. 1505.13 s [ghc-9.12.2-with-packages] /nix/store/0p3i1fm1by4kjbcassf6hj7lmpc0bp9c-lifted-base-0.2.3.12/nix-support:
  2282. 1505.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2283. 1505.13 s [ghc-9.12.2-with-packages] /nix/store/kbxc407a7shgwq4hrmdasaq12n1cmmsf-transformers-compat-0.7.2/nix-support:
  2284. 1505.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2285. 1505.13 s [ghc-9.12.2-with-packages] /nix/store/kbxc407a7shgwq4hrmdasaq12n1cmmsf-transformers-compat-0.7.2/nix-support:
  2286. 1505.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2287. 1505.14 s [ghc-9.12.2-with-packages] /nix/store/jmj6n9l5505xm5pkzp0q5k882rcy6z7q-splitmix-0.1.3.1/nix-support:
  2288. 1505.14 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2289. 1505.14 s [ghc-9.12.2-with-packages] /nix/store/jmj6n9l5505xm5pkzp0q5k882rcy6z7q-splitmix-0.1.3.1/nix-support:
  2290. 1505.14 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2291. 1505.14 s [ghc-9.12.2-with-packages] /nix/store/swra9l1w3ac4rjhjls6rqy8fq6b9jglb-unliftio-core-0.2.1.0/nix-support:
  2292. 1505.14 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2293. 1505.15 s [ghc-9.12.2-with-packages] /nix/store/swra9l1w3ac4rjhjls6rqy8fq6b9jglb-unliftio-core-0.2.1.0/nix-support:
  2294. 1505.15 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2295. 1505.15 s [ghc-9.12.2-with-packages] /nix/store/4xa8hgl67kialh4br8rdba8hr1p0cgng-base-orphans-0.9.3/nix-support:
  2296. 1505.15 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2297. 1505.15 s [ghc-9.12.2-with-packages] /nix/store/4xa8hgl67kialh4br8rdba8hr1p0cgng-base-orphans-0.9.3/nix-support:
  2298. 1505.15 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2299. 1505.15 s [ghc-9.12.2-with-packages] /nix/store/8kai39lr0v65gqyj2dciy46cb0gillpc-tagged-0.8.9/nix-support:
  2300. 1505.15 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2301. 1505.15 s [ghc-9.12.2-with-packages] /nix/store/8kai39lr0v65gqyj2dciy46cb0gillpc-tagged-0.8.9/nix-support:
  2302. 1505.15 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2303. 1505.15 s [ghc-9.12.2-with-packages] /nix/store/0b32nbwf2nzblavd6dx29z6ibyv29snv-boring-0.2.2/nix-support:
  2304. 1505.15 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2305. 1505.15 s [ghc-9.12.2-with-packages] /nix/store/0b32nbwf2nzblavd6dx29z6ibyv29snv-boring-0.2.2/nix-support:
  2306. 1505.15 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2307. 1507.52 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/visrv45dhrq5hx2xiwdksl1vmfbsmch3-ghc-9.12.2-with-packages
  2308. 1520.19 s [post-build-hook] Pushing 1 paths (152 are already present) using zstd to cache sellout ⏳
  2309. 1520.20 s [post-build-hook]
  2310. 1524.00 s [post-build-hook] Pushing /nix/store/visrv45dhrq5hx2xiwdksl1vmfbsmch3-ghc-9.12.2-with-packages (6.77 MiB)
  2311. 1533.64 s [post-build-hook]
  2312. 1533.64 s [post-build-hook] All done.
  2313. 1533.66 s [post-build-hook] Uploading to the NixCI cache: /nix/store/visrv45dhrq5hx2xiwdksl1vmfbsmch3-ghc-9.12.2-with-packages
  2314. 1533.69 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2315. 1533.85 s [post-build-hook] copying 1 paths...
  2316. 1533.85 s [post-build-hook] copying path '/nix/store/visrv45dhrq5hx2xiwdksl1vmfbsmch3-ghc-9.12.2-with-packages' to 'https://cache.nix-ci.com'...
  2317. 1535.01 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2318. 1535.24 s [post-build-hook] copying 1 paths...
  2319. 1535.24 s [post-build-hook] copying path '/nix/store/ix4mn25mnd4zcqxp1rzmrsr0ypivwfka-ghc-9.12.2-with-packages.drv' to 'https://cache.nix-ci.com'...
  2320. 1535.39 s Progress: 24 of 27 built (1 building), 1181 of 1181 downloaded from cache
  2321. 1535.39 s [haskell-language-server] Preprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0...
  2322. 1535.39 s [haskell-language-server] Building executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0...
  2323. 1535.39 s [haskell-language-server] [1 of 2] Compiling Main ( exe/Wrapper.hs, dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper-tmp/Main.dyn_o )
  2324. 1535.39 s [haskell-language-server] [2 of 2] Compiling Paths_haskell_language_server ( dist/build/haskell-language-server-wrapper/autogen/Paths_haskell_language_server.hs, dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper-tmp/Paths_haskell_language_server.dyn_o )
  2325. 1535.39 s [haskell-language-server] [3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
  2326. 1535.39 s [haskell-language-server] buildPhase completed in 7 minutes 11 seconds
  2327. 1535.39 s [haskell-language-server] Phase: haddockPhase
  2328. 1535.39 s [haskell-language-server] Phase: installPhase
  2329. 1535.39 s [haskell-language-server] Installing internal library hls-cabal-fmt-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-ZzWknxDxabLGwYt7VxwmO-hls-cabal-fmt-plugin
  2330. 1535.39 s [haskell-language-server] Installing internal library hls-signature-help-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-WWH4Yk1JVI6Rh2OliRaIl-hls-signature-help-plugin
  2331. 1535.39 s [haskell-language-server] Installing internal library hls-class-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-Lwr0mvbgXanQlJaX71zP2-hls-class-plugin
  2332. 1535.39 s [haskell-language-server] Installing internal library hls-explicit-imports-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-LTilxbjARpFJyj9v4ft0l7-hls-explicit-imports-plugin
  2333. 1535.39 s [haskell-language-server] Installing executable ghcide-test-preprocessor in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2334. 1535.39 s [haskell-language-server] Warning: The directory
  2335. 1535.39 s [haskell-language-server] /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2336. 1535.39 s [haskell-language-server] is not in the system search path.
  2337. 1535.39 s [haskell-language-server] Installing internal library hls-code-range-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-KLcM2tyfGWeIzlW5RXC7Xb-hls-code-range-plugin
  2338. 1535.39 s [haskell-language-server] Installing internal library hls-pragmas-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-JZq62r0DCcy7QhhdCJOSMa-hls-pragmas-plugin
  2339. 1535.39 s [haskell-language-server] Installing internal library hls-refactor-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-HAhNoPVK7Dm1E3K4MlQ38g-hls-refactor-plugin
  2340. 1535.39 s [haskell-language-server] Installing internal library hls-gadt-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-JvdK9k2wnTi8flJTzyfFl2-hls-gadt-plugin
  2341. 1535.39 s [haskell-language-server] Installing internal library hls-cabal-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-H1mm1g4N7t81dfbKs2oW1Y-hls-cabal-plugin
  2342. 1535.39 s [haskell-language-server] Installing internal library hls-eval-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-G5JLzALDgDC20BLmhHMu3S-hls-eval-plugin
  2343. 1535.39 s [haskell-language-server] Installing internal library hls-change-type-signature-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-FOTTTQjVAe5D8nucjL4asx-hls-change-type-signature-plugin
  2344. 1535.39 s [haskell-language-server] Installing internal library hls-cabal-gild-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-EBApHzBBZY2GsX66BDAN9b-hls-cabal-gild-plugin
  2345. 1535.39 s [haskell-language-server] Installing internal library hls-explicit-record-fields-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-DAFvCLoSqjqjW4hNVE53X-hls-explicit-record-fields-plugin
  2346. 1535.39 s [haskell-language-server] Installing internal library hls-notes-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-CpXNrilHexj4e9hC7d49JA-hls-notes-plugin
  2347. 1535.39 s [haskell-language-server] Installing internal library hls-rename-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-CEOARynpSTCA3nNO6C8oEa-hls-rename-plugin
  2348. 1535.39 s [haskell-language-server] Installing internal library ghcide-bench-lib in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-AWHajKn8UpW2ql9aKV5dNT-ghcide-bench-lib
  2349. 1535.39 s [haskell-language-server] Installing internal library hls-call-hierarchy-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-7oiZLsLMd05BTnPMksAI3f-hls-call-hierarchy-plugin
  2350. 1535.39 s [haskell-language-server] Installing internal library hls-explicit-fixity-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-6zSm9klBeYfBOAg7UxMjz7-hls-explicit-fixity-plugin
  2351. 1535.39 s [haskell-language-server] Installing internal library hls-ormolu-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-694OMa68kr99qUo6lkScsN-hls-ormolu-plugin
  2352. 1535.39 s [haskell-language-server] Installing executable ghcide-bench in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2353. 1535.39 s [haskell-language-server] Warning: The directory
  2354. 1535.39 s [haskell-language-server] /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2355. 1535.39 s [haskell-language-server] is not in the system search path.
  2356. 1535.39 s [haskell-language-server] Installing internal library hls-overloaded-record-dot-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-4yqD3DPGri8BmF7HpbZNmM-hls-overloaded-record-dot-plugin
  2357. 1535.39 s [haskell-language-server] Installing internal library hls-semantic-tokens-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-4nm0LlJoBH6DJDSXCg16k6-hls-semantic-tokens-plugin
  2358. 1535.39 s [haskell-language-server] Installing internal library hls-hlint-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-4fy8LFxFNCYWWalgWjiTc-hls-hlint-plugin
  2359. 1535.39 s [haskell-language-server] Installing internal library hls-alternate-number-format-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-3FObWuy3nNfINFA10PNDQa-hls-alternate-number-format-plugin
  2360. 1535.39 s [haskell-language-server] Installing internal library hls-fourmolu-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-37KZwmFWIvWDVv8FgZsb3n-hls-fourmolu-plugin
  2361. 1535.39 s [haskell-language-server] Installing internal library hls-stylish-haskell-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-1yyzI03kgeE2v6RQZASIC7-hls-stylish-haskell-plugin
  2362. 1535.39 s [haskell-language-server] Installing internal library hls-qualify-imported-names-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-1PgGtAEjsssLfCTDfr1uPz-hls-qualify-imported-names-plugin
  2363. 1535.39 s [haskell-language-server] Installing internal library hls-module-name-plugin in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-11G2SX0kcbK7IHgZOsiQ6X-hls-module-name-plugin
  2364. 1535.39 s [haskell-language-server] Installing library in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/haskell-language-server-2.12.0.0-DSXyrScSd679XyQP6Hdovb
  2365. 1535.39 s [haskell-language-server] Installing executable haskell-language-server in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2366. 1535.39 s [haskell-language-server] Warning: The directory
  2367. 1535.39 s [haskell-language-server] /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2368. 1535.39 s [haskell-language-server] is not in the system search path.
  2369. 1535.39 s [haskell-language-server] Installing executable haskell-language-server-wrapper in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2370. 1535.39 s [haskell-language-server] Warning: The directory
  2371. 1535.39 s [haskell-language-server] /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2372. 1535.39 s [haskell-language-server] is not in the system search path.
  2373. 1535.39 s [haskell-language-server] Phase: fixupPhase
  2374. 1535.39 s [haskell-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0
  2375. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-DSXyrScSd679XyQP6Hdovb-ghc9.12.2.so
  2376. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-AWHajKn8UpW2ql9aKV5dNT-ghcide-bench-lib-ghc9.12.2.so
  2377. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-CEOARynpSTCA3nNO6C8oEa-hls-rename-plugin-ghc9.12.2.so
  2378. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-1yyzI03kgeE2v6RQZASIC7-hls-stylish-haskell-plugin-ghc9.12.2.so
  2379. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-KLcM2tyfGWeIzlW5RXC7Xb-hls-code-range-plugin-ghc9.12.2.so
  2380. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-37KZwmFWIvWDVv8FgZsb3n-hls-fourmolu-plugin-ghc9.12.2.so
  2381. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-JvdK9k2wnTi8flJTzyfFl2-hls-gadt-plugin-ghc9.12.2.so
  2382. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-HAhNoPVK7Dm1E3K4MlQ38g-hls-refactor-plugin-ghc9.12.2.so
  2383. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-JZq62r0DCcy7QhhdCJOSMa-hls-pragmas-plugin-ghc9.12.2.so
  2384. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-4yqD3DPGri8BmF7HpbZNmM-hls-overloaded-record-dot-plugin-ghc9.12.2.so
  2385. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-LTilxbjARpFJyj9v4ft0l7-hls-explicit-imports-plugin-ghc9.12.2.so
  2386. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-FOTTTQjVAe5D8nucjL4asx-hls-change-type-signature-plugin-ghc9.12.2.so
  2387. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-Lwr0mvbgXanQlJaX71zP2-hls-class-plugin-ghc9.12.2.so
  2388. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-CpXNrilHexj4e9hC7d49JA-hls-notes-plugin-ghc9.12.2.so
  2389. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-DAFvCLoSqjqjW4hNVE53X-hls-explicit-record-fields-plugin-ghc9.12.2.so
  2390. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-1PgGtAEjsssLfCTDfr1uPz-hls-qualify-imported-names-plugin-ghc9.12.2.so
  2391. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-7oiZLsLMd05BTnPMksAI3f-hls-call-hierarchy-plugin-ghc9.12.2.so
  2392. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-G5JLzALDgDC20BLmhHMu3S-hls-eval-plugin-ghc9.12.2.so
  2393. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-11G2SX0kcbK7IHgZOsiQ6X-hls-module-name-plugin-ghc9.12.2.so
  2394. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-WWH4Yk1JVI6Rh2OliRaIl-hls-signature-help-plugin-ghc9.12.2.so
  2395. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-ZzWknxDxabLGwYt7VxwmO-hls-cabal-fmt-plugin-ghc9.12.2.so
  2396. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-4nm0LlJoBH6DJDSXCg16k6-hls-semantic-tokens-plugin-ghc9.12.2.so
  2397. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-694OMa68kr99qUo6lkScsN-hls-ormolu-plugin-ghc9.12.2.so
  2398. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-EBApHzBBZY2GsX66BDAN9b-hls-cabal-gild-plugin-ghc9.12.2.so
  2399. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-6zSm9klBeYfBOAg7UxMjz7-hls-explicit-fixity-plugin-ghc9.12.2.so
  2400. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-3FObWuy3nNfINFA10PNDQa-hls-alternate-number-format-plugin-ghc9.12.2.so
  2401. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-H1mm1g4N7t81dfbKs2oW1Y-hls-cabal-plugin-ghc9.12.2.so
  2402. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHShaskell-language-server-2.12.0.0-4fy8LFxFNCYWWalgWjiTc-hls-hlint-plugin-ghc9.12.2.so
  2403. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin/ghcide-bench
  2404. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
  2405. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.12.2-unwrapped
  2406. 1535.39 s [haskell-language-server] shrinking /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
  2407. 1535.39 s [haskell-language-server] checking for references to /build/ in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0...
  2408. 1535.39 s [haskell-language-server] patching script interpreter paths in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0
  2409. 1535.39 s [haskell-language-server] /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin/haskell-language-server: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
  2410. 1535.39 s [haskell-language-server] stripping (with command strip and flags -S -p) in /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/lib /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin
  2411. 1535.40 s [haskell-language-server] rewriting symlink /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0/bin/haskell-language-server-9.12.2 to be relative to /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0
  2412. 1538.83 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0
  2413. 1546.31 s [post-build-hook] Pushing 1 paths (581 are already present) using zstd to cache sellout ⏳
  2414. 1546.32 s [post-build-hook]
  2415. 1546.67 s [post-build-hook] Pushing /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0 (105.53 MiB)
  2416. 1548.58 s [post-build-hook]
  2417. 1548.58 s [post-build-hook] All done.
  2418. 1548.60 s [post-build-hook] Uploading to the NixCI cache: /nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0
  2419. 1548.63 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2420. 1548.68 s [post-build-hook] copying 1 paths...
  2421. 1548.68 s [post-build-hook] copying path '/nix/store/fw0vj43xdkdfsw1yin2a02gfz4k5dnnk-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...
  2422. 1567.09 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2423. 1567.42 s [post-build-hook] copying 61 paths...
  2424. 1567.43 s [post-build-hook] copying path '/nix/store/1d930hhcjlghk0x19sgqjysna8sinz33-entropy-0.4.1.11.drv' to 'https://cache.nix-ci.com'...
  2425. 1567.43 s [post-build-hook] copying path '/nix/store/3hi7xldgg98g6hgs5f10vjwsvn2bd7ll-pretty-simple-4.1.4.0.drv' to 'https://cache.nix-ci.com'...
  2426. 1567.43 s [post-build-hook] copying path '/nix/store/4kh9m0q6hm7z57m422iyi4b5knjg7cy7-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...
  2427. 1567.43 s [post-build-hook] copying path '/nix/store/4x2najn46q7h6j59yahzgqc86pfh4rp7-hspec-megaparsec-2.2.1.drv' to 'https://cache.nix-ci.com'...
  2428. 1567.43 s [post-build-hook] copying path '/nix/store/6s2dkcxwjnyhkrl52blga18701w9gpy4-uniplate-1.6.13.drv' to 'https://cache.nix-ci.com'...
  2429. 1567.43 s [post-build-hook] copying path '/nix/store/8jmnl8zp0zn29njqmhm8fb02c4zcnw42-fmlist-0.9.4.drv' to 'https://cache.nix-ci.com'...
  2430. 1567.43 s [post-build-hook] copying path '/nix/store/9j1ffq2l4k06274209nps0qk02k2w7s7-commutative-semigroups-0.2.0.2.drv' to 'https://cache.nix-ci.com'...
  2431. 1567.43 s [post-build-hook] copying path '/nix/store/alrc8l9y5x5zpv7182xhb0dpcyb8zl0a-githash-0.1.7.0.drv' to 'https://cache.nix-ci.com'...
  2432. 1567.43 s [post-build-hook] copying path '/nix/store/c0wm4yj8zihp0fimzbfqbqf81h90n632-colourista-0.1.0.2.drv' to 'https://cache.nix-ci.com'...
  2433. 1567.43 s [post-build-hook] copying path '/nix/store/7vlsgxiqfj901xi696f2dyf6wbidl04y-cabal-doctest-1.0.12.drv' to 'https://cache.nix-ci.com'...
  2434. 1567.43 s [post-build-hook] copying path '/nix/store/g63r8jf0c3iy1kd0sykc53630xiakk0p-HsYAML-0.2.1.5.drv' to 'https://cache.nix-ci.com'...
  2435. 1567.43 s [post-build-hook] copying path '/nix/store/cs0zdmpznh7ng5wmmqpji334m0s3bj88-ghc-lib-parser-9.12.2.20250421.drv' to 'https://cache.nix-ci.com'...
  2436. 1567.43 s [post-build-hook] copying path '/nix/store/7mrbyavz5h4p1x1sbfv288yappwmyi8g-filtrable-0.1.6.0.drv' to 'https://cache.nix-ci.com'...
  2437. 1567.43 s [post-build-hook] copying path '/nix/store/arjdr3dka1a8f7lkdig3wqfkyljpbmqd-path-0.9.6.drv' to 'https://cache.nix-ci.com'...
  2438. 1567.43 s [post-build-hook] copying path '/nix/store/5lljann1x3g7a0ikbsixf05zs7rnfr21-hspec-hedgehog-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  2439. 1567.43 s [post-build-hook] copying path '/nix/store/c4w3j16zi3lr4npsnnh2w7fp39svr71z-newtype-generics-0.6.2.drv' to 'https://cache.nix-ci.com'...
  2440. 1567.59 s [post-build-hook] copying path '/nix/store/giby0gp4j3hys35hib8905w9c1s3lw2z-heaps-0.4.1.drv' to 'https://cache.nix-ci.com'...
  2441. 1567.59 s [post-build-hook] copying path '/nix/store/h5ziqjygsscrdmsxccsbn1ss2fz1whzv-microaeson-0.1.0.3.drv' to 'https://cache.nix-ci.com'...
  2442. 1567.59 s [post-build-hook] copying path '/nix/store/hwp56sfmg2bfvnsm1y894rvpn1wxv37l-refact-0.3.0.2.drv' to 'https://cache.nix-ci.com'...
  2443. 1567.60 s [post-build-hook] copying path '/nix/store/id4289xnnrcyg1p30w74gj0jqq1sbprs-MemoTrie-0.6.11.drv' to 'https://cache.nix-ci.com'...
  2444. 1567.60 s [post-build-hook] copying path '/nix/store/j4abzmwkj69sx7r1hvl2ygqgn7lcnlh8-choice-0.2.4.1.drv' to 'https://cache.nix-ci.com'...
  2445. 1567.60 s [post-build-hook] copying path '/nix/store/lqm2hz98h4p4nswnhd79znpkvl044dxl-clay-0.16.1.drv' to 'https://cache.nix-ci.com'...
  2446. 1567.60 s [post-build-hook] copying path '/nix/store/pfz5fjr02m1cvvvbm4h86w4gd4c3gx1h-deriving-aeson-0.2.10.drv' to 'https://cache.nix-ci.com'...
  2447. 1567.61 s [post-build-hook] copying path '/nix/store/sicgy2865363bcx4hm3wz8kcpk9cl4v3-vector-th-unbox-0.2.2.drv' to 'https://cache.nix-ci.com'...
  2448. 1567.61 s [post-build-hook] copying path '/nix/store/whfh201kfkgbz3vy0gph5abjvn9hd34i-filemanip-0.3.6.3.drv' to 'https://cache.nix-ci.com'...
  2449. 1567.61 s [post-build-hook] copying path '/nix/store/yfpz5p33cy610cfn37qvsgflascmlfcr-primes-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  2450. 1567.62 s [post-build-hook] copying path '/nix/store/yhcasvj7p1qvfdfczzkb10ihrjnhxcrh-HsYAML-aeson-0.2.0.2.drv' to 'https://cache.nix-ci.com'...
  2451. 1567.63 s [post-build-hook] copying path '/nix/store/yirhcxd4v1d22hpmyyqlx5ji0j7qj1bh-blaze-markup-0.8.3.0.drv' to 'https://cache.nix-ci.com'...
  2452. 1567.63 s [post-build-hook] copying path '/nix/store/yl8sq04z7zpz3zg0431xvygw9sbfza35-dir-traverse-0.2.3.0.drv' to 'https://cache.nix-ci.com'...
  2453. 1567.63 s [post-build-hook] copying path '/nix/store/ywh3r026458vsaifs2p5y1xpd220jdrz-relude-1.2.2.2.drv' to 'https://cache.nix-ci.com'...
  2454. 1567.63 s [post-build-hook] copying path '/nix/store/zgf0cdfrz7f7by7jpg9v6s3v5kifnp47-markdown-unlit-0.6.0.drv' to 'https://cache.nix-ci.com'...
  2455. 1567.64 s [post-build-hook] copying path '/nix/store/cn38x81l6cnhhxvyhjj8850jzv4gr8ag-optparse-simple-0.1.1.4.drv' to 'https://cache.nix-ci.com'...
  2456. 1567.74 s [post-build-hook] copying path '/nix/store/bm6sf0yknmfh7xicqj29bf0pj94wdgqr-regex-applicative-0.3.4.drv' to 'https://cache.nix-ci.com'...
  2457. 1567.74 s [post-build-hook] copying path '/nix/store/2p9xsljs8sbfbwzmh3zf79wwncychn6x-ListLike-4.7.8.4.drv' to 'https://cache.nix-ci.com'...
  2458. 1567.75 s [post-build-hook] copying path '/nix/store/5avsjdzi1qcv6pkkcssikbjarw7x8lzw-path-io-1.8.2.drv' to 'https://cache.nix-ci.com'...
  2459. 1567.76 s [post-build-hook] copying path '/nix/store/4z0yfqwyfxck2nhry178s12wnq5qyl17-slist-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  2460. 1567.76 s [post-build-hook] copying path '/nix/store/gcxwlpvpmb87648hdkflsa8awf6wg3hj-trial-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  2461. 1567.76 s [post-build-hook] copying path '/nix/store/gx2xyl638b8mnnha67vqcx8nvp8l6d64-extensions-0.1.1.0.drv' to 'https://cache.nix-ci.com'...
  2462. 1567.76 s [post-build-hook] copying path '/nix/store/j1vs0zd3s8xxwmfyaxnr33kwvhksi8ik-validation-selective-0.2.0.0.drv' to 'https://cache.nix-ci.com'...
  2463. 1567.77 s [post-build-hook] copying path '/nix/store/icnz6j6zhyifsmnbsj1j2sacd20k8y6r-ghc-lib-parser-ex-9.12.0.0.drv' to 'https://cache.nix-ci.com'...
  2464. 1567.77 s [post-build-hook] copying path '/nix/store/db48x44zwvxg06ggx24k4nkzgq9l48vb-pcg-random-0.1.4.0.drv' to 'https://cache.nix-ci.com'...
  2465. 1567.77 s [post-build-hook] copying path '/nix/store/pgngaxnn18qgn5mwfrljdqcbck39p2dn-shake-0.19.8.drv' to 'https://cache.nix-ci.com'...
  2466. 1567.78 s [post-build-hook] copying path '/nix/store/37sd1iq3mgz5bq29gbmdx8qkrhgihjvk-math-functions-0.3.4.4.drv' to 'https://cache.nix-ci.com'...
  2467. 1567.87 s [post-build-hook] copying path '/nix/store/hs99j872s4x1ykrf01nga00dngajsj81-monoid-subclasses-1.2.6.drv' to 'https://cache.nix-ci.com'...
  2468. 1567.88 s [post-build-hook] copying path '/nix/store/fg6lla125n78ppwizm0fpr4jlilvcinm-apply-refact-0.15.0.0.drv' to 'https://cache.nix-ci.com'...
  2469. 1567.88 s [post-build-hook] copying path '/nix/store/ssib190830qz5n50vxhjc0smyl3rn04j-blaze-html-0.9.2.0.drv' to 'https://cache.nix-ci.com'...
  2470. 1567.90 s [post-build-hook] copying path '/nix/store/28wbvr9xvcapgc0z9ip0053w6175hspp-process-extras-0.7.4.drv' to 'https://cache.nix-ci.com'...
  2471. 1567.90 s [post-build-hook] copying path '/nix/store/hzyjcwscz6czc9pqpk8jz4bdmrhcbg9a-th-env-0.1.1.drv' to 'https://cache.nix-ci.com'...
  2472. 1567.91 s [post-build-hook] copying path '/nix/store/k8ldbjc9k1cvdbc51km3idsallqbqhiy-stylish-haskell-0.15.1.0.drv' to 'https://cache.nix-ci.com'...
  2473. 1567.91 s [post-build-hook] copying path '/nix/store/dlnq0kpji4w9nl2g9drczj21frgrg4pg-trial-optparse-applicative-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  2474. 1567.91 s [post-build-hook] copying path '/nix/store/p8rgdas0v32mj4dml58lhqsdbkjlg13g-hlint-3.10.drv' to 'https://cache.nix-ci.com'...
  2475. 1567.92 s [post-build-hook] copying path '/nix/store/n6xvi3km02rnmy9pyd38wps9vfcmqqq5-tomland-1.3.3.3.drv' to 'https://cache.nix-ci.com'...
  2476. 1567.92 s [post-build-hook] copying path '/nix/store/p3f5fnvmcjai9qqw8prh3h4qxmkiq56v-mwc-random-0.15.2.0.drv' to 'https://cache.nix-ci.com'...
  2477. 1568.01 s [post-build-hook] copying path '/nix/store/s7zlpjwjjrj0z9p9xpqbjx732nfrv4lf-fuzzy-0.1.1.0.drv' to 'https://cache.nix-ci.com'...
  2478. 1568.02 s [post-build-hook] copying path '/nix/store/8l45ydlz87gcrd4921cxs8zgbpjqizdb-fourmolu-0.19.0.1.drv' to 'https://cache.nix-ci.com'...
  2479. 1568.02 s [post-build-hook] copying path '/nix/store/sms1pc9swp633817scxmqsg2iyaz0bn7-ormolu-0.8.0.2.drv' to 'https://cache.nix-ci.com'...
  2480. 1568.04 s [post-build-hook] copying path '/nix/store/x4gymql873hbricr5whaij85lc156cfx-random-bytestring-0.1.4.drv' to 'https://cache.nix-ci.com'...
  2481. 1568.05 s [post-build-hook] copying path '/nix/store/b14qf66nql7aa4yvbig063rydzv3nzg4-trial-tomland-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  2482. 1568.16 s [post-build-hook] copying path '/nix/store/5v5x7axfcknj6cc9cg095jmm7qgdh2bs-base64-1.0.drv' to 'https://cache.nix-ci.com'...
  2483. 1568.28 s [post-build-hook] copying path '/nix/store/7g2px84xk271hsb2p1g9qx43ms2ziyjj-stan-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  2484. 1568.40 s [post-build-hook] copying path '/nix/store/q8bdj85y3fw7617h5ahp26dv66hbg263-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  2485. 1568.56 s Progress: 25 of 27 built, 1181 of 1181 downloaded from cache
  2486. 1568.66 s Building ghc-shell-for-packages
  2487. 1569.50 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/g8yc3s5pccc7j33jnn3njmhy10k98m0s-ghc-shell-for-packages-0
  2488. 1570.03 s [post-build-hook] Pushing 1 paths (799 are already present) using zstd to cache sellout ⏳
  2489. 1570.03 s [post-build-hook]
  2490. 1570.40 s [post-build-hook] Pushing /nix/store/g8yc3s5pccc7j33jnn3njmhy10k98m0s-ghc-shell-for-packages-0 (336.00 B)
  2491. 1571.41 s [post-build-hook]
  2492. 1571.41 s [post-build-hook] All done.
  2493. 1571.43 s [post-build-hook] Uploading to the NixCI cache: /nix/store/g8yc3s5pccc7j33jnn3njmhy10k98m0s-ghc-shell-for-packages-0
  2494. 1571.46 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2495. 1571.51 s [post-build-hook] copying 1 paths...
  2496. 1571.51 s [post-build-hook] copying path '/nix/store/g8yc3s5pccc7j33jnn3njmhy10k98m0s-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  2497. 1571.71 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2498. 1571.97 s [post-build-hook] copying 1 paths...
  2499. 1571.97 s [post-build-hook] copying path '/nix/store/avk1pf1p6vyxnh52yv2q7nfm6rfcryj0-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  2500. 1572.11 s Progress: 26 of 27 built, 1181 of 1181 downloaded from cache
More Logs Raw Logs

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/4f8e5e91-ce15-4dd1-9ef7-0126e9e43829/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/4f8e5e91-ce15-4dd1-9ef7-0126e9e43829/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/4f8e5e91-ce15-4dd1-9ef7-0126e9e43829/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/4f8e5e91-ce15-4dd1-9ef7-0126e9e43829/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/4f8e5e91-ce15-4dd1-9ef7-0126e9e43829/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/4f8e5e91-ce15-4dd1-9ef7-0126e9e43829/repro

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