build devShells.x86_64-linux.ghc9122

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

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0007db3e-a6f6-4ba4-89eb-7aef4f90f661/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0007db3e-a6f6-4ba4-89eb-7aef4f90f661/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0007db3e-a6f6-4ba4-89eb-7aef4f90f661/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0007db3e-a6f6-4ba4-89eb-7aef4f90f661/raw-logs

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

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0007db3e-a6f6-4ba4-89eb-7aef4f90f661/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/0007db3e-a6f6-4ba4-89eb-7aef4f90f661/repro

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

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