build devShells.x86_64-linux.ghc967

Reproduce this run Original Run
  1. 77.45 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  2. 77.45 s [algebraic-graphs]
  3. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  4. 77.45 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  5. 77.45 s [algebraic-graphs]
  6. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  7. 77.45 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  8. 77.45 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  9. 77.45 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  10. 77.45 s [algebraic-graphs]
  11. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  12. 77.45 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  13. 77.45 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  14. 77.45 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  15. 77.45 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  16. 77.45 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17. 77.45 s [algebraic-graphs]
  18. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  19. 77.45 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20. 77.45 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21. 77.45 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22. 77.45 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23. 77.45 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24. 77.45 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  25. 77.45 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  26. 77.45 s [algebraic-graphs]
  27. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  28. 77.45 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  29. 77.45 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  30. 77.45 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  31. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  32. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  33. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  34. 77.45 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  35. 77.45 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  36. 77.45 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  37. 77.45 s [algebraic-graphs]
  38. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  39. 77.45 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  40. 77.45 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  41. 77.45 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  42. 77.45 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  43. 77.45 s [algebraic-graphs]
  44. 77.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  45. 77.45 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  46. 77.45 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  47. 77.45 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  48. 77.45 s [algebraic-graphs]
  49. 80.28 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  50. 80.28 s [algebraic-graphs] OK: overlays1 [x] == x
  51. 80.40 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  52. 80.40 s [algebraic-graphs]
  53. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  54. 80.40 s [algebraic-graphs] OK: connects1 [x] == x
  55. 80.40 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  56. 80.40 s [algebraic-graphs]
  57. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  58. 80.40 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  59. 80.40 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  60. 80.40 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  61. 80.40 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  62. 80.40 s [algebraic-graphs]
  63. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  64. 80.40 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  65. 80.40 s [algebraic-graphs]
  66. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  67. 80.40 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  68. 80.40 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  69. 80.40 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  70. 80.40 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  71. 80.40 s [algebraic-graphs]
  72. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  73. 80.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  74. 80.40 s [algebraic-graphs] OK: vertexCount x >= 1
  75. 80.40 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  76. 80.40 s [algebraic-graphs]
  77. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  78. 80.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  79. 80.40 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  80. 80.40 s [algebraic-graphs] OK: edgeCount == length . edgeList
  81. 80.40 s [algebraic-graphs]
  82. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  83. 80.40 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  84. 80.40 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  85. 80.40 s [algebraic-graphs]
  86. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  87. 80.40 s [algebraic-graphs] OK: edgeList (vertex x) == []
  88. 80.40 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  89. 80.40 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  90. 80.40 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  91. 80.40 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  92. 80.40 s [algebraic-graphs]
  93. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  94. 80.40 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  95. 80.40 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  96. 80.40 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  97. 80.40 s [algebraic-graphs]
  98. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  99. 80.40 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  100. 80.40 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  101. 80.40 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  102. 80.40 s [algebraic-graphs]
  103. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  104. 80.40 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  105. 80.40 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  106. 80.40 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  107. 80.40 s [algebraic-graphs]
  108. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  109. 80.40 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  110. 80.40 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  111. 80.40 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  112. 80.40 s [algebraic-graphs]
  113. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  114. 80.40 s [algebraic-graphs] OK: path1 [x] == vertex x
  115. 80.40 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  116. 80.40 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  117. 80.40 s [algebraic-graphs]
  118. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  119. 80.40 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  120. 80.40 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  121. 80.40 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  122. 80.40 s [algebraic-graphs]
  123. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  124. 80.40 s [algebraic-graphs] OK: clique1 [x] == vertex x
  125. 80.40 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  126. 80.40 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  127. 80.40 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  128. 80.40 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  129. 80.40 s [algebraic-graphs]
  130. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  131. 80.40 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  132. 80.40 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  133. 80.40 s [algebraic-graphs]
  134. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  135. 80.40 s [algebraic-graphs] OK: star x [] == vertex x
  136. 80.40 s [algebraic-graphs] OK: star x [y] == edge x y
  137. 80.40 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  138. 80.40 s [algebraic-graphs]
  139. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  140. 80.40 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  141. 80.40 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  142. 80.40 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  143. 80.40 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  144. 80.40 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  145. 80.40 s [algebraic-graphs]
  146. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  147. 80.40 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  148. 80.40 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  149. 80.40 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  150. 80.40 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  151. 80.40 s [algebraic-graphs]
  152. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  153. 80.40 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  154. 80.40 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  155. 80.40 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  156. 80.40 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  157. 80.40 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  158. 80.40 s [algebraic-graphs]
  159. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  160. 80.40 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  161. 80.40 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  162. 80.40 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  163. 80.40 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  164. 80.40 s [algebraic-graphs]
  165. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  166. 80.40 s [algebraic-graphs] OK: replaceVertex x x == id
  167. 80.40 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  168. 80.40 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  169. 80.40 s [algebraic-graphs]
  170. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  171. 80.40 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  172. 80.40 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  173. 80.40 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  174. 80.40 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  175. 80.40 s [algebraic-graphs]
  176. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  177. 80.40 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  178. 80.40 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  179. 80.40 s [algebraic-graphs] OK: transpose . transpose == id
  180. 80.40 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  181. 80.40 s [algebraic-graphs]
  182. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  183. 80.40 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  184. 80.40 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  185. 80.40 s [algebraic-graphs] OK: gmap id == id
  186. 80.40 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  187. 80.40 s [algebraic-graphs]
  188. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  189. 80.40 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  190. 80.40 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  191. 80.40 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  192. 80.40 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  193. 80.40 s [algebraic-graphs]
  194. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  195. 80.40 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  196. 80.40 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  197. 80.40 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  198. 80.40 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  199. 80.40 s [algebraic-graphs]
  200. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  201. 80.40 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  202. 80.40 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  203. 80.40 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  204. 80.40 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  205. 80.40 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  206. 80.40 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  207. 80.40 s [algebraic-graphs] OK: closure . closure == closure
  208. 80.40 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  209. 80.40 s [algebraic-graphs]
  210. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  211. 80.40 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  212. 80.40 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  213. 80.40 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  214. 80.40 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  215. 80.40 s [algebraic-graphs]
  216. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  217. 80.40 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  218. 80.40 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  219. 80.40 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  220. 80.40 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  221. 80.40 s [algebraic-graphs]
  222. 80.40 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  223. 80.40 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  224. 80.40 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  225. 80.40 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  226. 80.40 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  227. 80.40 s [algebraic-graphs]
  228. 80.40 s [algebraic-graphs] ============ NonEmpty.Graph.============
  229. 80.40 s [algebraic-graphs] OK: Axioms of non-empty graphs
  230. 80.40 s [algebraic-graphs] OK: Theorems of non-empty graphs
  231. 80.40 s [algebraic-graphs]
  232. 80.40 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  233. 80.40 s [algebraic-graphs] OK: vertex 1 < vertex 2
  234. 80.40 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  235. 80.40 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  236. 80.40 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  237. 80.40 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  238. 80.40 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  239. 80.40 s [algebraic-graphs] OK: x <= x + y
  240. 80.40 s [algebraic-graphs] OK: x + y <= x * y
  241. 80.40 s [algebraic-graphs]
  242. 80.40 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  243. 80.40 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  244. 80.40 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  245. 80.40 s [algebraic-graphs] OK: fmap id == id
  246. 80.40 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  247. 80.40 s [algebraic-graphs]
  248. 80.40 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  249. 80.40 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  250. 81.54 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  251. 81.54 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  252. 81.54 s [algebraic-graphs] OK: (x >>= vertex) == x
  253. 81.54 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  254. 81.54 s [algebraic-graphs]
  255. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  256. 81.54 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  257. 81.54 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  258. 81.54 s [algebraic-graphs]
  259. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  260. 81.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  261. 81.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  262. 81.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  263. 81.54 s [algebraic-graphs] OK: size (vertex x) == 1
  264. 81.54 s [algebraic-graphs]
  265. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  266. 81.54 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  267. 81.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  268. 81.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  269. 81.54 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  270. 81.54 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  271. 81.54 s [algebraic-graphs]
  272. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  273. 81.54 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  274. 81.54 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  275. 81.54 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  276. 81.54 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  277. 81.54 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  278. 81.54 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  279. 81.54 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  280. 81.54 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  281. 81.54 s [algebraic-graphs]
  282. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  283. 81.54 s [algebraic-graphs] OK: overlay1 empty x == x
  284. 81.54 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  285. 81.54 s [algebraic-graphs]
  286. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  287. 81.54 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  288. 81.54 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  289. 81.54 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  290. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  291. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  292. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  293. 81.54 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  294. 81.54 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  295. 81.54 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  296. 81.54 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  297. 81.54 s [algebraic-graphs]
  298. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  299. 81.54 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  300. 81.54 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  301. 81.54 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  302. 81.54 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  303. 81.54 s [algebraic-graphs]
  304. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  305. 81.54 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  306. 81.54 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  307. 81.54 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  308. 81.54 s [algebraic-graphs]
  309. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  310. 81.54 s [algebraic-graphs] OK: overlays1 [x] == x
  311. 81.54 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  312. 81.54 s [algebraic-graphs]
  313. 81.54 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  314. 81.54 s [algebraic-graphs] OK: connects1 [x] == x
  315. 81.54 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  316. 81.54 s [algebraic-graphs]
  317. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  318. 81.55 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  319. 81.55 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  320. 81.55 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  321. 81.55 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  322. 81.55 s [algebraic-graphs]
  323. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  324. 81.55 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  325. 81.55 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  326. 81.55 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  327. 81.55 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  328. 81.55 s [algebraic-graphs]
  329. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  330. 81.55 s [algebraic-graphs] OK: x === x == True
  331. 81.55 s [algebraic-graphs] OK: x + y === x + y == True
  332. 81.55 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  333. 81.55 s [algebraic-graphs] OK: x + y === x * y == False
  334. 81.55 s [algebraic-graphs]
  335. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  336. 81.55 s [algebraic-graphs] OK: size (vertex x) == 1
  337. 81.55 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  338. 81.55 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  339. 81.55 s [algebraic-graphs] OK: size x >= 1
  340. 81.55 s [algebraic-graphs] OK: size x >= vertexCount x
  341. 81.55 s [algebraic-graphs]
  342. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  343. 81.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  344. 81.55 s [algebraic-graphs]
  345. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  346. 81.55 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  347. 81.55 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  348. 81.55 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  349. 81.55 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  350. 81.55 s [algebraic-graphs]
  351. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  352. 81.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  353. 81.55 s [algebraic-graphs] OK: vertexCount x >= 1
  354. 81.55 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  355. 81.55 s [algebraic-graphs]
  356. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  357. 81.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  358. 81.55 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  359. 81.55 s [algebraic-graphs] OK: edgeCount == length . edgeList
  360. 81.55 s [algebraic-graphs]
  361. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  362. 81.55 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  363. 81.55 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  364. 81.55 s [algebraic-graphs]
  365. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  366. 81.55 s [algebraic-graphs] OK: edgeList (vertex x) == []
  367. 81.55 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  368. 81.55 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  369. 81.55 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  370. 81.55 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  371. 81.55 s [algebraic-graphs]
  372. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  373. 81.55 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  374. 81.55 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  375. 81.55 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  376. 81.55 s [algebraic-graphs]
  377. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  378. 81.55 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  379. 81.55 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  380. 81.55 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  381. 81.55 s [algebraic-graphs]
  382. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  383. 81.55 s [algebraic-graphs] OK: path1 [x] == vertex x
  384. 81.55 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  385. 81.55 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  386. 81.55 s [algebraic-graphs]
  387. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  388. 81.55 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  389. 81.55 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  390. 81.55 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  391. 81.55 s [algebraic-graphs]
  392. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  393. 81.55 s [algebraic-graphs] OK: clique1 [x] == vertex x
  394. 81.55 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  395. 81.55 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  396. 81.55 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  397. 81.55 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  398. 81.55 s [algebraic-graphs]
  399. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  400. 81.55 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  401. 81.55 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  402. 81.55 s [algebraic-graphs]
  403. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  404. 81.55 s [algebraic-graphs] OK: star x [] == vertex x
  405. 81.55 s [algebraic-graphs] OK: star x [y] == edge x y
  406. 81.55 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  407. 81.55 s [algebraic-graphs]
  408. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  409. 81.55 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  410. 81.55 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  411. 81.55 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  412. 81.55 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  413. 81.55 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  414. 81.55 s [algebraic-graphs]
  415. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  416. 81.55 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  417. 81.55 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  418. 81.55 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  419. 81.55 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  420. 81.55 s [algebraic-graphs]
  421. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  422. 81.55 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  423. 81.55 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  424. 81.55 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  425. 81.55 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  426. 81.55 s [algebraic-graphs]
  427. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  428. 81.55 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  429. 81.55 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  430. 81.55 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  431. 81.55 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  432. 81.55 s [algebraic-graphs]
  433. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  434. 81.55 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  435. 81.55 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  436. 81.55 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  437. 81.55 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  438. 81.55 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  439. 81.55 s [algebraic-graphs]
  440. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  441. 81.55 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  442. 81.55 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  443. 81.55 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  444. 81.55 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  445. 81.55 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  446. 81.55 s [algebraic-graphs]
  447. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  448. 81.55 s [algebraic-graphs] OK: replaceVertex x x == id
  449. 81.55 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  450. 81.55 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  451. 81.55 s [algebraic-graphs]
  452. 81.55 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  453. 81.55 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  454. 84.71 s [haskell-language-server] Preprocessing library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
  455. 84.71 s [haskell-language-server] Building library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
  456. 84.81 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 )
  457. 86.48 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 )
  458. 86.73 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  459. 86.73 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  460. 86.73 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  461. 86.73 s [algebraic-graphs]
  462. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  463. 86.73 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  464. 86.73 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  465. 86.73 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  466. 86.73 s [algebraic-graphs]
  467. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  468. 86.73 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  469. 86.73 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  470. 86.73 s [algebraic-graphs] OK: transpose . transpose == id
  471. 86.73 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  472. 86.73 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  473. 86.73 s [algebraic-graphs]
  474. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  475. 86.73 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  476. 86.73 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  477. 86.73 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  478. 86.73 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  479. 86.73 s [algebraic-graphs]
  480. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  481. 86.73 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  482. 86.73 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  483. 86.73 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  484. 86.73 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  485. 86.73 s [algebraic-graphs]
  486. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  487. 86.73 s [algebraic-graphs] OK: simplify == id
  488. 86.73 s [algebraic-graphs] OK: size (simplify x) <= size x
  489. 86.73 s [algebraic-graphs] OK: simplify 1 === 1
  490. 86.73 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  491. 86.73 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  492. 86.73 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  493. 86.73 s [algebraic-graphs]
  494. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  495. 86.73 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  496. 86.73 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  497. 86.73 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  498. 86.73 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  499. 86.73 s [algebraic-graphs]
  500. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  501. 86.73 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  502. 86.73 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  503. 86.73 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  504. 86.73 s [algebraic-graphs]
  505. 86.73 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  506. 86.73 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  507. 86.73 s [algebraic-graphs] OK: box x y ~~ box y x
  508. 86.73 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  509. 86.73 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  510. 86.73 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  511. 86.73 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  512. 86.73 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  513. 86.73 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  514. 86.73 s [algebraic-graphs]
  515. 86.73 s [algebraic-graphs] ============ Relation ============
  516. 86.73 s [algebraic-graphs] OK: Axioms of graphs
  517. 86.73 s [algebraic-graphs]
  518. 86.73 s [algebraic-graphs] ============ Relation.consistent ============
  519. 86.73 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  520. 86.73 s [algebraic-graphs]
  521. 86.73 s [algebraic-graphs] OK: consistent empty == True
  522. 86.73 s [algebraic-graphs] OK: consistent (vertex x) == True
  523. 86.73 s [algebraic-graphs] OK: consistent (overlay x y) == True
  524. 86.73 s [algebraic-graphs] OK: consistent (connect x y) == True
  525. 86.73 s [algebraic-graphs] OK: consistent (edge x y) == True
  526. 86.73 s [algebraic-graphs] OK: consistent (edges xs) == True
  527. 86.73 s [algebraic-graphs] OK: consistent (stars xs) == True
  528. 86.73 s [algebraic-graphs]
  529. 86.73 s [algebraic-graphs] ============ Relation.Show ============
  530. 86.73 s [algebraic-graphs] OK: show (empty ) == "empty"
  531. 86.73 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  532. 86.73 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  533. 86.73 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  534. 86.73 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  535. 86.73 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  536. 86.73 s [algebraic-graphs]
  537. 86.73 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  538. 86.73 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  539. 86.73 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  540. 86.73 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  541. 86.73 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  542. 86.73 s [algebraic-graphs]
  543. 86.73 s [algebraic-graphs] ============ Relation.Ord ============
  544. 86.73 s [algebraic-graphs] OK: vertex 1 < vertex 2
  545. 86.73 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  546. 86.73 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  547. 86.73 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  548. 86.73 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  549. 86.73 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  550. 86.73 s [algebraic-graphs] OK: x <= x + y
  551. 86.73 s [algebraic-graphs] OK: x + y <= x * y
  552. 86.73 s [algebraic-graphs]
  553. 86.73 s [algebraic-graphs] ============ Relation.empty ============
  554. 86.73 s [algebraic-graphs] OK: isEmpty empty == True
  555. 86.73 s [algebraic-graphs] OK: hasVertex x empty == False
  556. 86.73 s [algebraic-graphs] OK: vertexCount empty == 0
  557. 86.73 s [algebraic-graphs] OK: edgeCount empty == 0
  558. 86.73 s [algebraic-graphs]
  559. 86.73 s [algebraic-graphs] ============ Relation.vertex ============
  560. 86.73 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  561. 86.73 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  562. 86.73 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  563. 86.73 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  564. 86.73 s [algebraic-graphs]
  565. 86.73 s [algebraic-graphs] ============ Relation.edge ============
  566. 86.73 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  567. 86.73 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  568. 86.73 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  569. 86.73 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  570. 86.73 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  571. 86.73 s [algebraic-graphs]
  572. 86.73 s [algebraic-graphs] ============ Relation.overlay ============
  573. 86.73 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  574. 86.73 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  575. 86.73 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  576. 86.73 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  577. 86.73 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  578. 86.73 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  579. 86.73 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  580. 86.73 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  581. 86.73 s [algebraic-graphs]
  582. 86.73 s [algebraic-graphs] ============ Relation.connect ============
  583. 86.73 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  584. 86.73 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  585. 86.74 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  586. 86.74 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  587. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  588. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  589. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  590. 86.74 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  591. 86.74 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  592. 86.74 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  593. 86.74 s [algebraic-graphs]
  594. 86.74 s [algebraic-graphs] ============ Relation.vertices ============
  595. 86.74 s [algebraic-graphs] OK: vertices [] == empty
  596. 86.74 s [algebraic-graphs] OK: vertices [x] == vertex x
  597. 86.74 s [algebraic-graphs] OK: vertices == overlays . map vertex
  598. 86.74 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  599. 86.74 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  600. 86.74 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  601. 86.74 s [algebraic-graphs]
  602. 86.74 s [algebraic-graphs] ============ Relation.edges ============
  603. 86.74 s [algebraic-graphs] OK: edges [] == empty
  604. 86.74 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  605. 86.74 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  606. 86.74 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  607. 86.74 s [algebraic-graphs]
  608. 86.74 s [algebraic-graphs] ============ Relation.overlays ============
  609. 86.74 s [algebraic-graphs] OK: overlays [] == empty
  610. 86.74 s [algebraic-graphs] OK: overlays [x] == x
  611. 86.74 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  612. 86.74 s [algebraic-graphs] OK: overlays == foldr overlay empty
  613. 86.74 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  614. 86.74 s [algebraic-graphs]
  615. 86.74 s [algebraic-graphs] ============ Relation.connects ============
  616. 86.74 s [algebraic-graphs] OK: connects [] == empty
  617. 86.74 s [algebraic-graphs] OK: connects [x] == x
  618. 86.74 s [algebraic-graphs] OK: connects [x,y] == connect x y
  619. 86.74 s [algebraic-graphs] OK: connects == foldr connect empty
  620. 86.74 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  621. 86.74 s [algebraic-graphs]
  622. 86.74 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  623. 86.74 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  624. 86.74 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  625. 86.74 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  626. 86.74 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  627. 86.74 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  628. 86.74 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  629. 86.74 s [algebraic-graphs]
  630. 86.74 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  631. 86.74 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  632. 86.74 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  633. 86.74 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  634. 86.74 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  635. 86.74 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  636. 86.74 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  637. 86.74 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  638. 86.74 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  639. 86.74 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  640. 86.74 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  641. 86.74 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  642. 86.74 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  643. 86.74 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  644. 86.74 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  645. 86.74 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  646. 86.74 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  647. 86.74 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  648. 87.23 s [haskell-language-server]
  649. 87.23 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  650. 87.23 s [haskell-language-server] Pattern match(es) are non-exhaustive
  651. 87.23 s [haskell-language-server] In a pattern binding:
  652. 87.23 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  653. 87.23 s [haskell-language-server] Failure _
  654. 87.23 s [haskell-language-server] CompletionInvoked _
  655. 87.23 s [haskell-language-server] |
  656. 87.23 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  657. 87.23 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  658. 87.23 s [haskell-language-server]
  659. 87.23 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  660. 87.23 s [haskell-language-server] Pattern match(es) are non-exhaustive
  661. 87.23 s [haskell-language-server] In a lambda abstraction:
  662. 87.23 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  663. 87.23 s [haskell-language-server] ‘ProcessHandle’ not matched:
  664. 87.23 s [haskell-language-server] Nothing _ _ _
  665. 87.23 s [haskell-language-server] (Just _) Nothing _ _
  666. 87.23 s [haskell-language-server] (Just _) (Just _) Nothing _
  667. 87.23 s [haskell-language-server] |
  668. 87.23 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  669. 87.23 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  670. 89.69 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 )
  671. 89.72 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  672. 89.72 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  673. 89.72 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  674. 89.72 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  675. 89.72 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  676. 89.72 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  677. 89.72 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  678. 89.72 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  679. 89.72 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  680. 89.72 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  681. 89.72 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  682. 89.72 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  683. 89.72 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  684. 89.72 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  685. 89.72 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  686. 89.72 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  687. 89.72 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  688. 89.72 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  689. 89.72 s [algebraic-graphs]
  690. 89.72 s [algebraic-graphs] ============ Relation.foldg ============
  691. 89.72 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  692. 89.72 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  693. 89.72 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  694. 89.72 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  695. 89.72 s [algebraic-graphs]
  696. 89.72 s [algebraic-graphs] ============ Relation.isEmpty ============
  697. 89.72 s [algebraic-graphs] OK: isEmpty empty == True
  698. 89.72 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  699. 89.72 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  700. 89.72 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  701. 89.72 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  702. 89.72 s [algebraic-graphs]
  703. 89.72 s [algebraic-graphs] ============ Relation.hasVertex ============
  704. 89.72 s [algebraic-graphs] OK: hasVertex x empty == False
  705. 89.72 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  706. 89.72 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  707. 89.72 s [algebraic-graphs]
  708. 89.72 s [algebraic-graphs] ============ Relation.hasEdge ============
  709. 89.72 s [algebraic-graphs] OK: hasEdge x y empty == False
  710. 89.72 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  711. 89.72 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  712. 89.72 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  713. 89.72 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  714. 89.72 s [algebraic-graphs]
  715. 89.72 s [algebraic-graphs] ============ Relation.vertexCount ============
  716. 89.72 s [algebraic-graphs] OK: vertexCount empty == 0
  717. 89.72 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  718. 89.72 s [algebraic-graphs] OK: vertexCount == length . vertexList
  719. 89.72 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  720. 89.72 s [algebraic-graphs]
  721. 89.72 s [algebraic-graphs] ============ Relation.edgeCount ============
  722. 89.72 s [algebraic-graphs] OK: edgeCount empty == 0
  723. 89.72 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  724. 89.72 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  725. 89.72 s [algebraic-graphs] OK: edgeCount == length . edgeList
  726. 89.72 s [algebraic-graphs]
  727. 89.72 s [algebraic-graphs] ============ Relation.vertexList ============
  728. 89.72 s [algebraic-graphs] OK: vertexList empty == []
  729. 89.72 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  730. 89.72 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  731. 89.72 s [algebraic-graphs]
  732. 89.72 s [algebraic-graphs] ============ Relation.vertexSet ============
  733. 89.72 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  734. 89.72 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  735. 89.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  736. 89.72 s [algebraic-graphs]
  737. 89.72 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  738. 89.72 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  739. 89.72 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  740. 89.72 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  741. 89.72 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  742. 89.72 s [algebraic-graphs]
  743. 89.72 s [algebraic-graphs] ============ Relation.edgeList ============
  744. 89.72 s [algebraic-graphs] OK: edgeList empty == []
  745. 89.72 s [algebraic-graphs] OK: edgeList (vertex x) == []
  746. 89.72 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  747. 89.72 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  748. 89.72 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  749. 89.72 s [algebraic-graphs]
  750. 89.72 s [algebraic-graphs] ============ Relation.edgeSet ============
  751. 89.72 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  752. 89.72 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  753. 89.72 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  754. 89.72 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  755. 89.72 s [algebraic-graphs]
  756. 89.72 s [algebraic-graphs] ============ Relation.adjacencyList ============
  757. 89.72 s [algebraic-graphs] OK: adjacencyList empty == []
  758. 89.72 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  759. 89.72 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  760. 89.72 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  761. 89.72 s [algebraic-graphs]
  762. 89.72 s [algebraic-graphs] ============ Relation.preSet ============
  763. 89.72 s [algebraic-graphs] OK: preSet x empty == Set.empty
  764. 89.72 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  765. 89.72 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  766. 89.72 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  767. 89.72 s [algebraic-graphs]
  768. 89.72 s [algebraic-graphs] ============ Relation.preIntSet ============
  769. 89.72 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  770. 89.72 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  771. 89.72 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  772. 89.72 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  773. 89.72 s [algebraic-graphs]
  774. 89.72 s [algebraic-graphs] ============ Relation.postSet ============
  775. 89.72 s [algebraic-graphs] OK: postSet x empty == Set.empty
  776. 89.72 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  777. 89.72 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  778. 89.72 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  779. 89.72 s [algebraic-graphs]
  780. 89.72 s [algebraic-graphs] ============ Relation.postIntSet ============
  781. 89.72 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  782. 89.72 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  783. 89.72 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  784. 89.72 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  785. 89.72 s [algebraic-graphs]
  786. 89.72 s [algebraic-graphs] ============ Relation.path ============
  787. 89.72 s [algebraic-graphs] OK: path [] == empty
  788. 89.72 s [algebraic-graphs] OK: path [x] == vertex x
  789. 89.72 s [algebraic-graphs] OK: path [x,y] == edge x y
  790. 89.72 s [algebraic-graphs]
  791. 89.72 s [algebraic-graphs] ============ Relation.circuit ============
  792. 89.72 s [algebraic-graphs] OK: circuit [] == empty
  793. 89.72 s [algebraic-graphs] OK: circuit [x] == edge x x
  794. 89.72 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  795. 89.72 s [algebraic-graphs]
  796. 89.72 s [algebraic-graphs] ============ Relation.clique ============
  797. 89.72 s [algebraic-graphs] OK: clique [] == empty
  798. 89.72 s [algebraic-graphs] OK: clique [x] == vertex x
  799. 89.72 s [algebraic-graphs] OK: clique [x,y] == edge x y
  800. 89.72 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  801. 89.72 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  802. 89.72 s [algebraic-graphs]
  803. 89.72 s [algebraic-graphs] ============ Relation.biclique ============
  804. 89.72 s [algebraic-graphs] OK: biclique [] [] == empty
  805. 89.72 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  806. 89.72 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  807. 89.72 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  808. 89.72 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  809. 89.72 s [algebraic-graphs]
  810. 89.72 s [algebraic-graphs] ============ Relation.star ============
  811. 89.72 s [algebraic-graphs] OK: star x [] == vertex x
  812. 89.72 s [algebraic-graphs] OK: star x [y] == edge x y
  813. 89.72 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  814. 89.72 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  815. 89.72 s [algebraic-graphs]
  816. 89.72 s [algebraic-graphs] ============ Relation.stars ============
  817. 89.72 s [algebraic-graphs] OK: stars [] == empty
  818. 89.72 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  819. 89.72 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  820. 89.72 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  821. 89.72 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  822. 89.72 s [algebraic-graphs] OK: stars . adjacencyList == id
  823. 89.72 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  824. 89.72 s [algebraic-graphs]
  825. 89.72 s [algebraic-graphs] ============ Relation.tree ============
  826. 89.72 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  827. 89.72 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  828. 89.72 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  829. 89.72 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  830. 89.72 s [algebraic-graphs]
  831. 89.72 s [algebraic-graphs] ============ Relation.forest ============
  832. 89.72 s [algebraic-graphs] OK: forest [] == empty
  833. 89.72 s [algebraic-graphs] OK: forest [x] == tree x
  834. 89.72 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  835. 89.72 s [algebraic-graphs] OK: forest == overlays . map tree
  836. 89.72 s [algebraic-graphs]
  837. 89.72 s [algebraic-graphs] ============ Relation.removeVertex ============
  838. 89.72 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  839. 89.72 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  840. 89.72 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  841. 89.72 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  842. 89.72 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  843. 89.72 s [algebraic-graphs]
  844. 89.72 s [algebraic-graphs] ============ Relation.removeEdge ============
  845. 89.72 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  846. 89.72 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  847. 89.72 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  848. 89.72 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  849. 89.72 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  850. 89.72 s [algebraic-graphs]
  851. 89.72 s [algebraic-graphs] ============ Relation.replaceVertex ============
  852. 89.72 s [algebraic-graphs] OK: replaceVertex x x == id
  853. 89.72 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  854. 89.72 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  855. 89.72 s [algebraic-graphs]
  856. 89.72 s [algebraic-graphs] ============ Relation.mergeVertices ============
  857. 89.72 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  858. 91.39 s [haskell-language-server] [2 of 2] Compiling Experiments ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.p_o )
  859. 91.96 s [haskell-language-server]
  860. 91.96 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  861. 92.07 s [haskell-language-server] Pattern match(es) are non-exhaustive
  862. 92.07 s [haskell-language-server] In a pattern binding:
  863. 92.07 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  864. 92.07 s [haskell-language-server] Failure _
  865. 92.07 s [haskell-language-server] CompletionInvoked _
  866. 92.07 s [haskell-language-server] |
  867. 92.07 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  868. 92.07 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  869. 92.07 s [haskell-language-server]
  870. 92.07 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  871. 92.07 s [haskell-language-server] Pattern match(es) are non-exhaustive
  872. 92.07 s [haskell-language-server] In a lambda abstraction:
  873. 92.07 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  874. 92.07 s [haskell-language-server] ‘ProcessHandle’ not matched:
  875. 92.07 s [haskell-language-server] Nothing _ _ _
  876. 92.07 s [haskell-language-server] (Just _) Nothing _ _
  877. 92.07 s [haskell-language-server] (Just _) (Just _) Nothing _
  878. 92.07 s [haskell-language-server] |
  879. 92.07 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  880. 92.07 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  881. 100.76 s [haskell-language-server] Preprocessing library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
  882. 100.76 s [haskell-language-server] Building library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
  883. 100.86 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Floskell ( plugins/hls-floskell-plugin/src/Ide/Plugin/Floskell.hs, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.o, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.dyn_o )
  884. 102.36 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Floskell ( plugins/hls-floskell-plugin/src/Ide/Plugin/Floskell.hs, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.p_o )
  885. 108.20 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  886. 108.20 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  887. 108.23 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  888. 108.23 s [algebraic-graphs]
  889. 108.23 s [algebraic-graphs] ============ Relation.transpose ============
  890. 108.23 s [algebraic-graphs] OK: transpose empty == empty
  891. 108.23 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  892. 108.23 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  893. 108.23 s [algebraic-graphs] OK: transpose . transpose == id
  894. 108.23 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  895. 108.23 s [algebraic-graphs]
  896. 108.23 s [algebraic-graphs] ============ Relation.gmap ============
  897. 108.23 s [algebraic-graphs] OK: gmap f empty == empty
  898. 108.23 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  899. 108.23 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  900. 108.23 s [algebraic-graphs] OK: gmap id == id
  901. 108.23 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  902. 108.23 s [algebraic-graphs]
  903. 108.23 s [algebraic-graphs] ============ Relation.induce ============
  904. 108.23 s [algebraic-graphs] OK: induce (const True ) x == x
  905. 108.23 s [algebraic-graphs] OK: induce (const False) x == empty
  906. 108.23 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  907. 108.23 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  908. 108.23 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  909. 108.23 s [algebraic-graphs]
  910. 108.23 s [algebraic-graphs] ============ Relation.compose ============
  911. 108.23 s [algebraic-graphs] OK: compose empty x == empty
  912. 108.23 s [algebraic-graphs] OK: compose x empty == empty
  913. 108.23 s [algebraic-graphs] OK: compose (vertex x) y == empty
  914. 108.23 s [algebraic-graphs] OK: compose x (vertex y) == empty
  915. 108.24 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  916. 108.24 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  917. 108.24 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  918. 108.24 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  919. 108.24 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  920. 108.24 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  921. 108.24 s [algebraic-graphs]
  922. 108.24 s [algebraic-graphs] ============ Relation.closure ============
  923. 108.24 s [algebraic-graphs] OK: closure empty == empty
  924. 108.24 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  925. 108.24 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  926. 108.24 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  927. 108.24 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  928. 108.24 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  929. 108.24 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  930. 108.24 s [algebraic-graphs] OK: closure . closure == closure
  931. 108.24 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  932. 108.24 s [algebraic-graphs]
  933. 108.24 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  934. 108.24 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  935. 108.24 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  936. 108.24 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  937. 108.24 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  938. 108.24 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  939. 108.24 s [algebraic-graphs]
  940. 108.24 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  941. 108.24 s [algebraic-graphs] OK: symmetricClosure empty == empty
  942. 108.24 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  943. 108.24 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  944. 108.24 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  945. 108.24 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  946. 108.24 s [algebraic-graphs]
  947. 108.24 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  948. 108.24 s [algebraic-graphs] OK: transitiveClosure empty == empty
  949. 108.24 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  950. 108.24 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  951. 108.24 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  952. 108.24 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  953. 108.24 s [algebraic-graphs]
  954. 108.24 s [algebraic-graphs] ============ Relation.induceJust ============
  955. 108.24 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  956. 108.24 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  957. 108.24 s [algebraic-graphs] OK: induceJust . gmap Just == id
  958. 108.24 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  959. 108.24 s [algebraic-graphs]
  960. 108.24 s [algebraic-graphs] ============ ReflexiveRelation ============
  961. 108.24 s [algebraic-graphs] OK: Axioms of reflexive graphs
  962. 108.24 s [algebraic-graphs]
  963. 108.24 s [algebraic-graphs] ============ TransitiveRelation ============
  964. 108.24 s [algebraic-graphs] OK: Axioms of transitive graphs
  965. 108.24 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  966. 108.24 s [algebraic-graphs]
  967. 108.24 s [algebraic-graphs] ============ PreorderRelation ============
  968. 108.24 s [algebraic-graphs] OK: Axioms of preorder graphs
  969. 108.24 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  970. 108.24 s [algebraic-graphs]
  971. 108.24 s [algebraic-graphs] ============ Symmetric.Relation ============
  972. 108.24 s [algebraic-graphs] OK: Axioms of undirected graphs
  973. 108.24 s [algebraic-graphs]
  974. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  975. 108.24 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  976. 108.24 s [algebraic-graphs]
  977. 108.24 s [algebraic-graphs] OK: consistent empty == True
  978. 108.24 s [algebraic-graphs] OK: consistent (vertex x) == True
  979. 108.24 s [algebraic-graphs] OK: consistent (overlay x y) == True
  980. 108.24 s [algebraic-graphs] OK: consistent (connect x y) == True
  981. 108.24 s [algebraic-graphs] OK: consistent (edge x y) == True
  982. 108.24 s [algebraic-graphs] OK: consistent (edges xs) == True
  983. 108.24 s [algebraic-graphs] OK: consistent (stars xs) == True
  984. 108.24 s [algebraic-graphs]
  985. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  986. 108.24 s [algebraic-graphs] OK: show (empty ) == "empty"
  987. 108.24 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  988. 108.24 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  989. 108.24 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  990. 108.24 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  991. 108.24 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  992. 108.24 s [algebraic-graphs]
  993. 108.24 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  994. 108.24 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  995. 108.24 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  996. 108.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  997. 108.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  998. 108.24 s [algebraic-graphs]
  999. 108.24 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1000. 108.24 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1001. 108.24 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1002. 108.24 s [algebraic-graphs]
  1003. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  1004. 108.24 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  1005. 108.24 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  1006. 108.24 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  1007. 108.24 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  1008. 108.24 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  1009. 108.24 s [algebraic-graphs]
  1010. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  1011. 108.24 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  1012. 108.24 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  1013. 108.24 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  1014. 108.24 s [algebraic-graphs]
  1015. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  1016. 108.24 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1017. 108.24 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1018. 108.24 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1019. 108.24 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1020. 108.24 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1021. 108.24 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1022. 108.24 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1023. 108.24 s [algebraic-graphs] OK: x <= x + y
  1024. 108.24 s [algebraic-graphs] OK: x + y <= x * y
  1025. 108.24 s [algebraic-graphs]
  1026. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  1027. 108.24 s [algebraic-graphs] OK: isEmpty empty == True
  1028. 108.24 s [algebraic-graphs] OK: hasVertex x empty == False
  1029. 108.24 s [algebraic-graphs] OK: vertexCount empty == 0
  1030. 108.24 s [algebraic-graphs] OK: edgeCount empty == 0
  1031. 108.24 s [algebraic-graphs]
  1032. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  1033. 108.24 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1034. 108.24 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1035. 108.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1036. 108.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1037. 108.24 s [algebraic-graphs]
  1038. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  1039. 108.24 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1040. 108.24 s [algebraic-graphs] OK: edge x y == edge y x
  1041. 108.24 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1042. 108.24 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1043. 108.24 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1044. 108.24 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1045. 108.24 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1046. 108.24 s [algebraic-graphs]
  1047. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  1048. 108.24 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1049. 108.24 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1050. 108.24 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1051. 108.24 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1052. 108.24 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1053. 108.24 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1054. 108.24 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1055. 108.24 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1056. 108.24 s [algebraic-graphs]
  1057. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  1058. 108.24 s [algebraic-graphs] OK: connect x y == connect y x
  1059. 108.24 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1060. 108.24 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1061. 108.24 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1062. 108.24 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1063. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1064. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1065. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1066. 108.24 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1067. 108.24 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1068. 108.24 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1069. 108.24 s [algebraic-graphs]
  1070. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  1071. 108.24 s [algebraic-graphs] OK: vertices [] == empty
  1072. 108.24 s [algebraic-graphs] OK: vertices [x] == vertex x
  1073. 108.24 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1074. 108.24 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1075. 108.24 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1076. 108.24 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1077. 108.24 s [algebraic-graphs]
  1078. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  1079. 108.24 s [algebraic-graphs] OK: edges [] == empty
  1080. 108.24 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1081. 108.24 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1082. 108.24 s [algebraic-graphs]
  1083. 108.24 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  1084. 108.24 s [algebraic-graphs] OK: overlays [] == empty
  1085. 109.21 s [haskell-language-server] Preprocessing library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
  1086. 109.21 s [haskell-language-server] Building library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
  1087. 109.32 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.o, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.dyn_o )
  1088. 111.55 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.p_o )
  1089. 118.11 s [algebraic-graphs] OK: overlays [x] == x
  1090. 118.11 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1091. 118.11 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1092. 118.15 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1093. 118.15 s [algebraic-graphs]
  1094. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  1095. 118.15 s [algebraic-graphs] OK: connects [] == empty
  1096. 118.15 s [algebraic-graphs] OK: connects [x] == x
  1097. 118.15 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1098. 118.15 s [algebraic-graphs] OK: connects == foldr connect empty
  1099. 118.15 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1100. 118.15 s [algebraic-graphs] OK: connects == connects . reverse
  1101. 118.15 s [algebraic-graphs]
  1102. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  1103. 118.15 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1104. 118.15 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1105. 118.15 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1106. 118.15 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1107. 118.15 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1108. 118.15 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1109. 118.15 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1110. 118.15 s [algebraic-graphs]
  1111. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  1112. 118.15 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  1113. 118.15 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  1114. 118.15 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  1115. 118.15 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  1116. 118.15 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  1117. 118.15 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  1118. 118.15 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  1119. 118.15 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  1120. 118.15 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  1121. 118.15 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1122. 118.15 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1123. 118.15 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1124. 118.15 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1125. 118.15 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1126. 118.15 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1127. 118.15 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1128. 118.15 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1129. 118.15 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1130. 118.15 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1131. 118.15 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1132. 118.15 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1133. 118.15 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1134. 118.15 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1135. 118.15 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1136. 118.15 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1137. 118.15 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1138. 118.15 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1139. 118.15 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1140. 118.15 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1141. 118.15 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1142. 118.15 s [algebraic-graphs]
  1143. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  1144. 118.15 s [algebraic-graphs] OK: isEmpty empty == True
  1145. 118.15 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1146. 118.15 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1147. 118.15 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1148. 118.15 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1149. 118.15 s [algebraic-graphs]
  1150. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  1151. 118.15 s [algebraic-graphs] OK: hasVertex x empty == False
  1152. 118.15 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1153. 118.15 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1154. 118.15 s [algebraic-graphs]
  1155. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  1156. 118.15 s [algebraic-graphs] OK: hasEdge x y empty == False
  1157. 118.15 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1158. 118.15 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1159. 118.15 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  1160. 118.15 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1161. 118.15 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  1162. 118.15 s [algebraic-graphs]
  1163. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  1164. 118.15 s [algebraic-graphs] OK: vertexCount empty == 0
  1165. 118.15 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1166. 118.15 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1167. 118.15 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1168. 118.15 s [algebraic-graphs]
  1169. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  1170. 118.15 s [algebraic-graphs] OK: edgeCount empty == 0
  1171. 118.15 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1172. 118.15 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1173. 118.15 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1174. 118.15 s [algebraic-graphs]
  1175. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  1176. 118.15 s [algebraic-graphs] OK: vertexList empty == []
  1177. 118.15 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1178. 118.15 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1179. 118.15 s [algebraic-graphs]
  1180. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  1181. 118.15 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1182. 118.15 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1183. 118.15 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1184. 118.15 s [algebraic-graphs]
  1185. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  1186. 118.15 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1187. 118.15 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1188. 118.15 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1189. 118.15 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1190. 118.15 s [algebraic-graphs]
  1191. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  1192. 118.15 s [algebraic-graphs] OK: edgeList empty == []
  1193. 118.15 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1194. 118.15 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  1195. 118.15 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  1196. 118.15 s [algebraic-graphs]
  1197. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  1198. 118.15 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1199. 118.15 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1200. 118.15 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  1201. 118.15 s [algebraic-graphs]
  1202. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  1203. 118.15 s [algebraic-graphs] OK: adjacencyList empty == []
  1204. 118.15 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1205. 118.15 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  1206. 118.15 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  1207. 118.15 s [algebraic-graphs]
  1208. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  1209. 118.15 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  1210. 118.15 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  1211. 118.15 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  1212. 118.15 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  1213. 118.15 s [algebraic-graphs]
  1214. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  1215. 118.15 s [algebraic-graphs] OK: path [] == empty
  1216. 118.15 s [algebraic-graphs] OK: path [x] == vertex x
  1217. 118.15 s [algebraic-graphs] OK: path [x,y] == edge x y
  1218. 118.15 s [algebraic-graphs] OK: path == path . reverse
  1219. 118.15 s [algebraic-graphs]
  1220. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  1221. 118.15 s [algebraic-graphs] OK: circuit [] == empty
  1222. 118.15 s [algebraic-graphs] OK: circuit [x] == edge x x
  1223. 118.15 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1224. 118.15 s [algebraic-graphs] OK: circuit == circuit . reverse
  1225. 118.15 s [algebraic-graphs]
  1226. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  1227. 118.15 s [algebraic-graphs] OK: clique [] == empty
  1228. 118.15 s [algebraic-graphs] OK: clique [x] == vertex x
  1229. 118.15 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1230. 118.15 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1231. 118.15 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1232. 118.15 s [algebraic-graphs] OK: clique == clique . reverse
  1233. 118.15 s [algebraic-graphs]
  1234. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  1235. 118.15 s [algebraic-graphs] OK: biclique [] [] == empty
  1236. 118.15 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1237. 118.15 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1238. 118.15 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1239. 118.15 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1240. 118.15 s [algebraic-graphs]
  1241. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  1242. 118.15 s [algebraic-graphs] OK: star x [] == vertex x
  1243. 118.15 s [algebraic-graphs] OK: star x [y] == edge x y
  1244. 118.15 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1245. 118.15 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1246. 118.15 s [algebraic-graphs]
  1247. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  1248. 118.15 s [algebraic-graphs] OK: stars [] == empty
  1249. 118.15 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1250. 118.15 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1251. 118.15 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1252. 118.15 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1253. 118.15 s [algebraic-graphs] OK: stars . adjacencyList == id
  1254. 118.15 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1255. 118.15 s [algebraic-graphs]
  1256. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  1257. 118.15 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1258. 118.15 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1259. 118.15 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1260. 118.15 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1261. 118.15 s [algebraic-graphs]
  1262. 118.15 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  1263. 118.15 s [algebraic-graphs] OK: forest [] == empty
  1264. 121.19 s [haskell-language-server] Preprocessing library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
  1265. 121.19 s [haskell-language-server] Building library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
  1266. 121.29 s [haskell-language-server]
  1267. 121.29 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  1268. 121.29 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  1269. 121.29 s [haskell-language-server] but were not needed for compilation:
  1270. 121.29 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
  1271. 121.29 s [haskell-language-server] - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)
  1272. 121.30 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Pragmas ( plugins/hls-pragmas-plugin/src/Ide/Plugin/Pragmas.hs, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.o, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.dyn_o )
  1273. 123.65 s [haskell-language-server]
  1274. 123.65 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  1275. 123.73 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  1276. 123.73 s [haskell-language-server] but were not needed for compilation:
  1277. 123.73 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
  1278. 123.73 s [haskell-language-server] - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)
  1279. 123.73 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Pragmas ( plugins/hls-pragmas-plugin/src/Ide/Plugin/Pragmas.hs, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.p_o )
  1280. 124.32 s [algebraic-graphs] OK: forest [x] == tree x
  1281. 124.32 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1282. 124.32 s [algebraic-graphs] OK: forest == overlays . map tree
  1283. 124.32 s [algebraic-graphs]
  1284. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  1285. 124.32 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1286. 124.32 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1287. 124.32 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1288. 124.32 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1289. 124.32 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1290. 124.32 s [algebraic-graphs]
  1291. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  1292. 124.32 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1293. 124.32 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1294. 124.32 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1295. 124.32 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1296. 124.32 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1297. 124.32 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1298. 124.32 s [algebraic-graphs]
  1299. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  1300. 124.32 s [algebraic-graphs] OK: replaceVertex x x == id
  1301. 124.32 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1302. 124.32 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1303. 124.32 s [algebraic-graphs]
  1304. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  1305. 124.32 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1306. 124.32 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1307. 124.32 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1308. 124.32 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1309. 124.32 s [algebraic-graphs]
  1310. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  1311. 124.32 s [algebraic-graphs] OK: gmap f empty == empty
  1312. 124.32 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1313. 124.32 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1314. 124.32 s [algebraic-graphs] OK: gmap id == id
  1315. 124.32 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1316. 124.32 s [algebraic-graphs]
  1317. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  1318. 124.32 s [algebraic-graphs] OK: induce (const True ) x == x
  1319. 124.32 s [algebraic-graphs] OK: induce (const False) x == empty
  1320. 124.32 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1321. 124.32 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1322. 124.32 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1323. 124.32 s [algebraic-graphs]
  1324. 124.32 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  1325. 124.32 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1326. 124.32 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1327. 124.32 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1328. 124.32 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1329. 124.32 s [algebraic-graphs]
  1330. 124.32 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  1331. 124.32 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  1332. 124.32 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  1333. 124.32 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  1334. 124.32 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  1335. 124.32 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  1336. 124.32 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  1337. 124.32 s [algebraic-graphs]
  1338. 124.32 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  1339. 124.32 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  1340. 124.32 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  1341. 124.32 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  1342. 124.32 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  1343. 124.32 s [algebraic-graphs]
  1344. 124.32 s [algebraic-graphs] ============ Typed ============
  1345. 124.32 s [algebraic-graphs]
  1346. 124.32 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  1347. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1348. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1349. 124.32 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  1350. 124.32 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1351. 124.32 s [algebraic-graphs]
  1352. 124.32 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  1353. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1354. 124.32 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1355. 124.32 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  1356. 124.32 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1357. 124.32 s [algebraic-graphs]
  1358. 124.32 s [algebraic-graphs] ============ Typed.dfsForest ============
  1359. 124.32 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  1360. 124.32 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  1361. 124.32 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  1362. 124.32 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  1363. 124.32 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  1364. 124.32 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  1365. 124.32 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  1366. 124.32 s [algebraic-graphs]
  1367. 124.32 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  1368. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  1369. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  1370. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  1371. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  1372. 124.32 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  1373. 124.32 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  1374. 124.32 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  1375. 124.32 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  1376. 124.32 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  1377. 124.32 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  1378. 124.32 s [algebraic-graphs]
  1379. 124.32 s [algebraic-graphs] ============ Typed.dfs ============
  1380. 124.32 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  1381. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  1382. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  1383. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  1384. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  1385. 124.32 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  1386. 124.32 s [algebraic-graphs] OK: dfs % x $ [] == []
  1387. 124.32 s [algebraic-graphs]
  1388. 124.32 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  1389. 124.32 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  1390. 124.32 s [algebraic-graphs]
  1391. 124.32 s [algebraic-graphs] ============ Typed.topSort ============
  1392. 124.32 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  1393. 124.32 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  1394. 124.32 s [algebraic-graphs]
  1395. 124.32 s [algebraic-graphs] ============ Graph.Undirected ============
  1396. 124.32 s [algebraic-graphs] OK: Axioms of undirected graphs
  1397. 124.32 s [algebraic-graphs]
  1398. 124.32 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  1399. 124.32 s [algebraic-graphs] OK: show (empty ) == "empty"
  1400. 124.32 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1401. 124.32 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1402. 124.32 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1403. 124.32 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1404. 124.32 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1405. 124.32 s [algebraic-graphs]
  1406. 124.32 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1407. 124.32 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1408. 124.32 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1409. 124.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1410. 124.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1411. 124.32 s [algebraic-graphs]
  1412. 124.32 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1413. 124.32 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1414. 124.32 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1415. 124.32 s [algebraic-graphs]
  1416. 124.32 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  1417. 124.32 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  1418. 124.32 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1419. 124.32 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  1420. 124.32 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  1421. 124.32 s [algebraic-graphs]
  1422. 124.32 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  1423. 124.32 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  1424. 124.32 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1425. 124.32 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  1426. 124.32 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  1427. 124.32 s [algebraic-graphs]
  1428. 124.32 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  1429. 124.32 s [algebraic-graphs] OK: complement empty == empty
  1430. 124.32 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  1431. 124.32 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  1432. 124.32 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  1433. 124.32 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  1434. 124.32 s [algebraic-graphs] OK: complement . complement == id
  1435. 124.32 s [algebraic-graphs]
  1436. 124.32 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  1437. 124.32 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1438. 124.32 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1439. 124.32 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1440. 124.32 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1441. 124.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1442. 124.32 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1443. 124.32 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1444. 124.32 s [algebraic-graphs] OK: x <= x + y
  1445. 124.32 s [algebraic-graphs] OK: x + y <= x * y
  1446. 124.32 s [algebraic-graphs]
  1447. 124.32 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  1448. 124.32 s [algebraic-graphs] OK: isEmpty empty == True
  1449. 124.32 s [algebraic-graphs] OK: hasVertex x empty == False
  1450. 124.32 s [algebraic-graphs] OK: vertexCount empty == 0
  1451. 124.32 s [algebraic-graphs] OK: edgeCount empty == 0
  1452. 124.32 s [algebraic-graphs]
  1453. 124.32 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  1454. 124.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1455. 124.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1456. 124.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1457. 124.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1458. 124.32 s [algebraic-graphs]
  1459. 124.32 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  1460. 124.32 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1461. 124.32 s [algebraic-graphs] OK: edge x y == edge y x
  1462. 131.06 s [haskell-language-server] Preprocessing library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
  1463. 131.07 s [haskell-language-server] Building library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
  1464. 131.17 s [haskell-language-server]
  1465. 131.17 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  1466. 131.17 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  1467. 131.17 s [haskell-language-server] but were not needed for compilation:
  1468. 131.17 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)
  1469. 131.18 s [haskell-language-server] [1 of 8] Compiling Ide.Plugin.SemanticTokens.Types ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Types.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.dyn_o )
  1470. 131.71 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1471. 131.71 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1472. 131.71 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1473. 131.71 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1474. 131.71 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1475. 131.71 s [algebraic-graphs]
  1476. 131.71 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  1477. 131.71 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1478. 131.71 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1479. 131.71 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1480. 131.71 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1481. 131.71 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1482. 131.71 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1483. 131.71 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1484. 131.71 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1485. 131.71 s [algebraic-graphs]
  1486. 131.71 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  1487. 131.71 s [algebraic-graphs] OK: connect x y == connect y x
  1488. 131.71 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1489. 131.71 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1490. 131.71 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1491. 131.71 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1492. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1493. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1494. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1495. 131.71 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1496. 131.71 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1497. 131.71 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1498. 131.71 s [algebraic-graphs]
  1499. 131.71 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  1500. 131.71 s [algebraic-graphs] OK: vertices [] == empty
  1501. 131.71 s [algebraic-graphs] OK: vertices [x] == vertex x
  1502. 131.71 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1503. 131.71 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1504. 131.71 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1505. 131.71 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1506. 131.71 s [algebraic-graphs]
  1507. 131.71 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  1508. 131.71 s [algebraic-graphs] OK: edges [] == empty
  1509. 131.71 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1510. 131.71 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1511. 131.71 s [algebraic-graphs]
  1512. 131.71 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  1513. 131.71 s [algebraic-graphs] OK: overlays [] == empty
  1514. 131.71 s [algebraic-graphs] OK: overlays [x] == x
  1515. 131.71 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1516. 131.71 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1517. 131.71 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1518. 131.71 s [algebraic-graphs]
  1519. 131.71 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  1520. 131.71 s [algebraic-graphs] OK: connects [] == empty
  1521. 131.71 s [algebraic-graphs] OK: connects [x] == x
  1522. 131.71 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1523. 131.71 s [algebraic-graphs] OK: connects == foldr connect empty
  1524. 131.71 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1525. 131.71 s [algebraic-graphs] OK: connects == connects . reverse
  1526. 131.71 s [algebraic-graphs]
  1527. 131.71 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  1528. 131.71 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1529. 131.71 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1530. 131.71 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1531. 131.71 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1532. 131.71 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1533. 131.71 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1534. 131.71 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1535. 131.71 s [algebraic-graphs]
  1536. 131.71 s [algebraic-graphs] ============ Graph.Undirected.path ============
  1537. 131.71 s [algebraic-graphs] OK: path [] == empty
  1538. 131.72 s [algebraic-graphs] OK: path [x] == vertex x
  1539. 131.72 s [algebraic-graphs] OK: path [x,y] == edge x y
  1540. 131.72 s [algebraic-graphs] OK: path == path . reverse
  1541. 131.72 s [algebraic-graphs]
  1542. 131.72 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  1543. 131.72 s [algebraic-graphs] OK: circuit [] == empty
  1544. 131.72 s [algebraic-graphs] OK: circuit [x] == edge x x
  1545. 131.72 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1546. 131.72 s [algebraic-graphs] OK: circuit == circuit . reverse
  1547. 131.72 s [algebraic-graphs]
  1548. 131.72 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  1549. 131.72 s [algebraic-graphs] OK: clique [] == empty
  1550. 131.72 s [algebraic-graphs] OK: clique [x] == vertex x
  1551. 131.72 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1552. 131.72 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1553. 131.72 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1554. 131.72 s [algebraic-graphs] OK: clique == clique . reverse
  1555. 131.72 s [algebraic-graphs]
  1556. 131.72 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  1557. 131.72 s [algebraic-graphs] OK: biclique [] [] == empty
  1558. 131.72 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1559. 131.72 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1560. 131.72 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1561. 131.72 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1562. 131.72 s [algebraic-graphs]
  1563. 131.72 s [algebraic-graphs] ============ Graph.Undirected.star ============
  1564. 131.72 s [algebraic-graphs] OK: star x [] == vertex x
  1565. 131.72 s [algebraic-graphs] OK: star x [y] == edge x y
  1566. 131.72 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1567. 131.72 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1568. 131.72 s [algebraic-graphs]
  1569. 131.72 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  1570. 131.72 s [algebraic-graphs] OK: stars [] == empty
  1571. 131.72 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1572. 131.72 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1573. 131.72 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1574. 131.72 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1575. 131.72 s [algebraic-graphs] OK: stars . adjacencyList == id
  1576. 131.72 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1577. 131.72 s [algebraic-graphs]
  1578. 131.72 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  1579. 131.72 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1580. 131.72 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1581. 131.72 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1582. 131.72 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1583. 131.72 s [algebraic-graphs]
  1584. 131.72 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  1585. 131.72 s [algebraic-graphs] OK: forest [] == empty
  1586. 131.72 s [algebraic-graphs] OK: forest [x] == tree x
  1587. 131.72 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1588. 131.72 s [algebraic-graphs] OK: forest == overlays . map tree
  1589. 131.72 s [algebraic-graphs]
  1590. 131.72 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  1591. 131.72 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1592. 131.72 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1593. 131.72 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1594. 131.72 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1595. 131.72 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1596. 131.72 s [algebraic-graphs]
  1597. 131.72 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  1598. 131.72 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1599. 131.72 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1600. 131.72 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1601. 131.72 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1602. 131.72 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1603. 131.72 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1604. 131.72 s [algebraic-graphs]
  1605. 131.72 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  1606. 131.72 s [algebraic-graphs] OK: replaceVertex x x == id
  1607. 131.72 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1608. 131.72 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1609. 131.72 s [algebraic-graphs]
  1610. 131.72 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  1611. 131.72 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1612. 131.72 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1613. 131.72 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1614. 131.72 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1615. 131.72 s [algebraic-graphs]
  1616. 131.72 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  1617. 131.72 s [algebraic-graphs] OK: gmap f empty == empty
  1618. 131.72 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1619. 131.72 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1620. 131.72 s [algebraic-graphs] OK: gmap id == id
  1621. 131.72 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1622. 131.72 s [algebraic-graphs]
  1623. 131.72 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  1624. 131.72 s [algebraic-graphs] OK: induce (const True ) x == x
  1625. 131.72 s [algebraic-graphs] OK: induce (const False) x == empty
  1626. 131.72 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1627. 131.72 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1628. 131.72 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1629. 131.72 s [algebraic-graphs]
  1630. 131.72 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  1631. 131.72 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1632. 131.72 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1633. 131.72 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1634. 131.72 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1635. 131.73 s [algebraic-graphs] Test suite main: PASS
  1636. 131.73 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  1637. 131.73 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  1638. 131.74 s [algebraic-graphs] checkPhase completed in 1 minutes 39 seconds
  1639. 131.74 s [algebraic-graphs] Phase: haddockPhase
  1640. 131.87 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  1641. 131.88 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  1642. 131.92 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  1643. 132.17 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  1644. 132.31 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  1645. 132.36 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1646. 132.36 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1647. 132.36 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1648. 132.36 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1649. 132.37 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  1650. 132.37 s [algebraic-graphs] Missing documentation for:
  1651. 132.37 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  1652. 132.40 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  1653. 132.40 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1654. 132.40 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  1655. 132.56 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  1656. 132.64 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  1657. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1658. 132.64 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  1659. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1660. 132.64 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  1661. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1662. 132.64 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  1663. 132.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1664. 132.65 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1665. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1666. 132.65 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  1667. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1668. 132.65 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1669. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1670. 132.65 s [algebraic-graphs] Warning: 'box' is out of scope.
  1671. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1672. 132.65 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  1673. 132.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1674. 132.65 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  1675. 132.71 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1676. 132.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1677. 132.72 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  1678. 132.86 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  1679. 132.86 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1680. 132.87 s [haskell-language-server] [2 of 8] Compiling Ide.Plugin.SemanticTokens.Tokenize ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Tokenize.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.dyn_o )
  1681. 132.87 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  1682. 132.98 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  1683. 133.13 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1684. 133.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1685. 133.14 s [algebraic-graphs] Warning: 'empty' is out of scope.
  1686. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1687. 133.14 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1688. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1689. 133.14 s [algebraic-graphs] Warning: 'edges' is out of scope.
  1690. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1691. 133.14 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1692. 133.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1693. 133.15 s [algebraic-graphs] Warning: 'stars' is out of scope.
  1694. 133.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1695. 133.15 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  1696. 133.20 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1697. 133.20 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1698. 133.20 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1699. 133.20 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1700. 133.20 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  1701. 133.20 s [algebraic-graphs] Missing documentation for:
  1702. 133.20 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  1703. 133.26 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  1704. 133.31 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  1705. 133.33 s [haskell-language-server] [3 of 8] Compiling Ide.Plugin.SemanticTokens.SemanticConfig ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/SemanticConfig.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.dyn_o )
  1706. 133.33 s [haskell-language-server] [4 of 8] Compiling Ide.Plugin.SemanticTokens.Utils ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Utils.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.dyn_o )
  1707. 133.33 s [haskell-language-server] [5 of 8] Compiling Ide.Plugin.SemanticTokens.Mappings ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Mappings.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.dyn_o )
  1708. 133.33 s [haskell-language-server] [6 of 8] Compiling Ide.Plugin.SemanticTokens.Query ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Query.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.dyn_o )
  1709. 133.33 s [algebraic-graphs]
  1710. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1711. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1712. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  1713. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1714. 133.34 s [algebraic-graphs] |
  1715. 133.34 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  1716. 133.34 s [algebraic-graphs] | ^
  1717. 133.34 s [algebraic-graphs]
  1718. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1719. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1720. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  1721. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1722. 133.34 s [algebraic-graphs] |
  1723. 133.34 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1724. 133.34 s [algebraic-graphs] | ^
  1725. 133.34 s [algebraic-graphs]
  1726. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1727. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1728. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  1729. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1730. 133.34 s [algebraic-graphs] |
  1731. 133.34 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1732. 133.34 s [algebraic-graphs] | ^
  1733. 133.34 s [algebraic-graphs]
  1734. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1735. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1736. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  1737. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1738. 133.34 s [algebraic-graphs] |
  1739. 133.34 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1740. 133.34 s [algebraic-graphs] | ^
  1741. 133.34 s [algebraic-graphs]
  1742. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1743. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1744. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  1745. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1746. 133.34 s [algebraic-graphs] |
  1747. 133.34 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1748. 133.34 s [algebraic-graphs] | ^
  1749. 133.34 s [algebraic-graphs]
  1750. 133.34 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1751. 133.34 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1752. 133.34 s [algebraic-graphs] will become an error in a future GHC release.
  1753. 133.34 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1754. 133.34 s [algebraic-graphs] |
  1755. 133.34 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1756. 133.34 s [algebraic-graphs] | ^
  1757. 133.34 s [algebraic-graphs]
  1758. 133.35 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1759. 133.35 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1760. 133.35 s [algebraic-graphs] will become an error in a future GHC release.
  1761. 133.35 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1762. 133.35 s [algebraic-graphs] |
  1763. 133.35 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  1764. 133.35 s [algebraic-graphs] | ^
  1765. 133.37 s [haskell-language-server] [7 of 8] Compiling Ide.Plugin.SemanticTokens.Internal ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Internal.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.dyn_o )
  1766. 133.43 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  1767. 133.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1768. 133.44 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  1769. 133.50 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  1770. 133.56 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1771. 133.56 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1772. 133.57 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  1773. 133.66 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  1774. 133.81 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  1775. 133.85 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  1776. 133.86 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  1777. 133.87 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  1778. 133.88 s [algebraic-graphs]
  1779. 133.88 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1780. 133.88 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1781. 133.88 s [algebraic-graphs] will become an error in a future GHC release.
  1782. 133.88 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1783. 133.88 s [algebraic-graphs] |
  1784. 133.88 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  1785. 133.88 s [algebraic-graphs] | ^
  1786. 133.89 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  1787. 133.89 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1788. 133.89 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  1789. 133.90 s [algebraic-graphs]
  1790. 133.90 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1791. 133.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1792. 133.90 s [algebraic-graphs] will become an error in a future GHC release.
  1793. 133.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1794. 133.90 s [algebraic-graphs] |
  1795. 133.90 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  1796. 133.90 s [algebraic-graphs] | ^
  1797. 133.90 s [algebraic-graphs]
  1798. 133.90 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1799. 133.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1800. 133.90 s [algebraic-graphs] will become an error in a future GHC release.
  1801. 133.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1802. 133.90 s [algebraic-graphs] |
  1803. 133.90 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  1804. 133.90 s [algebraic-graphs] | ^
  1805. 133.94 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  1806. 133.98 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  1807. 134.07 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  1808. 134.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1809. 134.07 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  1810. 134.08 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  1811. 134.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1812. 134.08 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  1813. 134.09 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  1814. 134.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1815. 134.09 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  1816. 134.10 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  1817. 134.10 s [algebraic-graphs] Missing documentation for:
  1818. 134.10 s [algebraic-graphs] Module header
  1819. 134.10 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  1820. 134.10 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  1821. 134.10 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  1822. 134.10 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  1823. 134.10 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  1824. 134.10 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  1825. 134.10 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  1826. 134.11 s [algebraic-graphs] Warning: 'array' is out of scope.
  1827. 134.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1828. 134.12 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  1829. 134.12 s [algebraic-graphs] Missing documentation for:
  1830. 134.12 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  1831. 135.34 s [haskell-language-server] [8 of 8] Compiling Ide.Plugin.SemanticTokens ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.dyn_o )
  1832. 135.70 s [haskell-language-server]
  1833. 135.70 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  1834. 135.70 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  1835. 135.70 s [haskell-language-server] but were not needed for compilation:
  1836. 135.70 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)
  1837. 135.71 s [haskell-language-server] [1 of 8] Compiling Ide.Plugin.SemanticTokens.Types ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Types.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.p_o )
  1838. 137.19 s [haskell-language-server] [2 of 8] Compiling Ide.Plugin.SemanticTokens.Tokenize ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Tokenize.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.p_o )
  1839. 137.30 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  1840. 137.30 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  1841. 137.31 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  1842. 137.33 s [algebraic-graphs] Phase: installPhase
  1843. 137.40 s [algebraic-graphs] Installing library in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  1844. 137.65 s [haskell-language-server] [3 of 8] Compiling Ide.Plugin.SemanticTokens.SemanticConfig ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/SemanticConfig.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.p_o )
  1845. 137.65 s [haskell-language-server] [4 of 8] Compiling Ide.Plugin.SemanticTokens.Utils ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Utils.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.p_o )
  1846. 137.65 s [haskell-language-server] [5 of 8] Compiling Ide.Plugin.SemanticTokens.Mappings ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Mappings.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.p_o )
  1847. 137.65 s [haskell-language-server] [6 of 8] Compiling Ide.Plugin.SemanticTokens.Query ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Query.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.p_o )
  1848. 137.77 s [haskell-language-server] [7 of 8] Compiling Ide.Plugin.SemanticTokens.Internal ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Internal.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.p_o )
  1849. 138.05 s [algebraic-graphs] Phase: fixupPhase
  1850. 138.06 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
  1851. 138.07 s [algebraic-graphs] shrinking /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSalgebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE-ghc9.6.7.so
  1852. 138.09 s [algebraic-graphs] checking for references to /build/ in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7...
  1853. 138.13 s [algebraic-graphs] patching script interpreter paths in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7
  1854. 138.13 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/lib
  1855. 138.39 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  1856. 138.41 s [algebraic-graphs] checking for references to /build/ in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc...
  1857. 138.44 s [algebraic-graphs] patching script interpreter paths in /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  1858. 138.58 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7 /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  1859. 139.26 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  1860. 139.28 s [post-build-hook] Uploading to the NixCI cache: /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7 /nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc
  1861. 139.32 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1862. 139.33 s [post-build-hook] copying 2 paths...
  1863. 139.33 s [post-build-hook] copying path '/nix/store/ak449r7dq796x3xizfgl3vr4adgaxsaw-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  1864. 140.58 s [post-build-hook] copying path '/nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  1865. 146.14 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1866. 146.28 s [post-build-hook] copying 0 paths...
  1867. 146.31 s Progress: 1 of 6 built (1 building)
  1868. 146.35 s Building ghc-9.6.7-with-packages
  1869. 146.35 s [haskell-language-server] [8 of 8] Compiling Ide.Plugin.SemanticTokens ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.p_o )
  1870. 146.35 s [haskell-language-server] Preprocessing library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
  1871. 146.35 s [haskell-language-server] Building library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
  1872. 146.35 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Ormolu ( plugins/hls-ormolu-plugin/src/Ide/Plugin/Ormolu.hs, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.o, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.dyn_o )
  1873. 146.40 s [ghc-9.6.7-with-packages] /nix/store/rq5v9857qqgdglsjivmrnh9crcrxfk3k-doctest-0.24.2/nix-support:
  1874. 146.40 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1875. 146.79 s [ghc-9.6.7-with-packages] /nix/store/94r03p5f8yhw9wad22fsxnb3k78wpil6-ghc-compat-plugin-0.1.0.1/nix-support:
  1876. 146.79 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1877. 146.79 s [ghc-9.6.7-with-packages] /nix/store/p4fzy2dqwsnanrj6wjhilpnl24rl7n3x-hedgehog-1.5/nix-support:
  1878. 146.79 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1879. 146.81 s [ghc-9.6.7-with-packages] /nix/store/k0kl195kyi4qabidpds09ypkx7b4sli3-Cabal-3.12.1.0/nix-support:
  1880. 146.81 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1881. 146.84 s [ghc-9.6.7-with-packages] /nix/store/yz10vaiq7lg7h8yghkjh59ic0k8blpk7-cabal-doctest-1.0.12/nix-support:
  1882. 146.84 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1883. 146.86 s [ghc-9.6.7-with-packages] /nix/store/0cdfzfn927mip0lidlngk0rav4nc5l5i-temporary-1.3/nix-support:
  1884. 146.86 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1885. 146.87 s [ghc-9.6.7-with-packages] /nix/store/0cdfzfn927mip0lidlngk0rav4nc5l5i-temporary-1.3/nix-support:
  1886. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1887. 146.87 s [ghc-9.6.7-with-packages] /nix/store/r9jjs7aicy3fwm2lan1301p20dnfnng2-ansi-terminal-1.1.3/nix-support:
  1888. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1889. 146.87 s [ghc-9.6.7-with-packages] /nix/store/r9jjs7aicy3fwm2lan1301p20dnfnng2-ansi-terminal-1.1.3/nix-support:
  1890. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1891. 146.87 s [ghc-9.6.7-with-packages] /nix/store/fnl5hzk5p7w0njpjg5jsh9qvsy4abjza-async-2.2.5/nix-support:
  1892. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1893. 146.87 s [ghc-9.6.7-with-packages] /nix/store/fnl5hzk5p7w0njpjg5jsh9qvsy4abjza-async-2.2.5/nix-support:
  1894. 146.87 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1895. 146.88 s [ghc-9.6.7-with-packages] /nix/store/1jvch0msag4xmavr2b7dxm5pcbwmsq8v-barbies-2.1.1.0/nix-support:
  1896. 146.88 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1897. 146.89 s [ghc-9.6.7-with-packages] /nix/store/1jvch0msag4xmavr2b7dxm5pcbwmsq8v-barbies-2.1.1.0/nix-support:
  1898. 146.89 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1899. 146.89 s [ghc-9.6.7-with-packages] /nix/store/xr6pilcra7kzxjhafkcycy9sw1brf3fs-concurrent-output-1.10.21/nix-support:
  1900. 146.89 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1901. 146.90 s [ghc-9.6.7-with-packages] /nix/store/xr6pilcra7kzxjhafkcycy9sw1brf3fs-concurrent-output-1.10.21/nix-support:
  1902. 146.90 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1903. 146.90 s [ghc-9.6.7-with-packages] /nix/store/57r38a5r1ip7ym37bddz5nqjpzi55r2f-lifted-async-0.10.2.7/nix-support:
  1904. 146.90 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1905. 146.90 s [ghc-9.6.7-with-packages] /nix/store/57r38a5r1ip7ym37bddz5nqjpzi55r2f-lifted-async-0.10.2.7/nix-support:
  1906. 146.90 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1907. 146.91 s [ghc-9.6.7-with-packages] /nix/store/rnhv6vydg7a2r29ljlcf5yr08h94bxjh-mmorph-1.2.1/nix-support:
  1908. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1909. 146.91 s [ghc-9.6.7-with-packages] /nix/store/rnhv6vydg7a2r29ljlcf5yr08h94bxjh-mmorph-1.2.1/nix-support:
  1910. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1911. 146.91 s [ghc-9.6.7-with-packages] /nix/store/42rmqy72nvn5343j0cpxlz4jzga9z20y-monad-control-1.0.3.1/nix-support:
  1912. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1913. 146.91 s [ghc-9.6.7-with-packages] /nix/store/42rmqy72nvn5343j0cpxlz4jzga9z20y-monad-control-1.0.3.1/nix-support:
  1914. 146.91 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1915. 146.92 s [ghc-9.6.7-with-packages] /nix/store/b81azgly41n8vwx0zkjn593zvpwm5r39-pretty-show-1.10/nix-support:
  1916. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1917. 146.92 s [ghc-9.6.7-with-packages] /nix/store/b81azgly41n8vwx0zkjn593zvpwm5r39-pretty-show-1.10/nix-support:
  1918. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1919. 146.92 s [ghc-9.6.7-with-packages] /nix/store/pwphj8m3vcb5z4lj3zhmw9h94jm7rsm5-primitive-0.9.1.0/nix-support:
  1920. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1921. 146.92 s [ghc-9.6.7-with-packages] /nix/store/pwphj8m3vcb5z4lj3zhmw9h94jm7rsm5-primitive-0.9.1.0/nix-support:
  1922. 146.92 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1923. 146.93 s [ghc-9.6.7-with-packages] /nix/store/x3rnwgjgpa75dcb56svvm147jyh0jzzc-random-1.2.1.3/nix-support:
  1924. 146.93 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1925. 146.93 s [ghc-9.6.7-with-packages] /nix/store/x3rnwgjgpa75dcb56svvm147jyh0jzzc-random-1.2.1.3/nix-support:
  1926. 146.93 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1927. 146.93 s [ghc-9.6.7-with-packages] /nix/store/1jclvcv9vkl9fns84dfq6yxv6xd2rdp2-resourcet-1.3.0/nix-support:
  1928. 146.93 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1929. 146.94 s [ghc-9.6.7-with-packages] /nix/store/1jclvcv9vkl9fns84dfq6yxv6xd2rdp2-resourcet-1.3.0/nix-support:
  1930. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1931. 146.94 s [ghc-9.6.7-with-packages] /nix/store/ny88n7biaqxcb13xpakblhksw389m3nm-safe-exceptions-0.1.7.4/nix-support:
  1932. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1933. 146.94 s [ghc-9.6.7-with-packages] /nix/store/ny88n7biaqxcb13xpakblhksw389m3nm-safe-exceptions-0.1.7.4/nix-support:
  1934. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1935. 146.94 s [ghc-9.6.7-with-packages] /nix/store/8dpi11qa3dzn0igbvzmn88iifxn465pc-transformers-base-0.4.6/nix-support:
  1936. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1937. 146.94 s [ghc-9.6.7-with-packages] /nix/store/8dpi11qa3dzn0igbvzmn88iifxn465pc-transformers-base-0.4.6/nix-support:
  1938. 146.94 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1939. 146.95 s [ghc-9.6.7-with-packages] /nix/store/33l47q2agmmjpjx7b2gj8md0x443i8mz-wl-pprint-annotated-0.1.0.1/nix-support:
  1940. 146.95 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1941. 146.95 s [ghc-9.6.7-with-packages] /nix/store/33l47q2agmmjpjx7b2gj8md0x443i8mz-wl-pprint-annotated-0.1.0.1/nix-support:
  1942. 146.95 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1943. 146.95 s [ghc-9.6.7-with-packages] /nix/store/lxg1kdksvxmaha7hymyf5gcy1hxl5pjg-Cabal-syntax-3.12.1.0/nix-support:
  1944. 146.95 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1945. 146.97 s [ghc-9.6.7-with-packages] /nix/store/lxg1kdksvxmaha7hymyf5gcy1hxl5pjg-Cabal-syntax-3.12.1.0/nix-support:
  1946. 146.97 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1947. 146.98 s [ghc-9.6.7-with-packages] /nix/store/456klncybx7saxjbm8n63x80h0bsal8q-ansi-terminal-types-1.1.3/nix-support:
  1948. 146.98 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1949. 146.98 s [ghc-9.6.7-with-packages] /nix/store/456klncybx7saxjbm8n63x80h0bsal8q-ansi-terminal-types-1.1.3/nix-support:
  1950. 146.98 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1951. 146.99 s [ghc-9.6.7-with-packages] /nix/store/76xp5b81536d5yjjjcydg5v677qz7pjz-hashable-1.5.0.0/nix-support:
  1952. 146.99 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1953. 146.99 s [ghc-9.6.7-with-packages] /nix/store/76xp5b81536d5yjjjcydg5v677qz7pjz-hashable-1.5.0.0/nix-support:
  1954. 146.99 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1955. 147.00 s [ghc-9.6.7-with-packages] /nix/store/qn49vwwahm0af9prf072nz4xg76ifm20-distributive-0.6.2.1/nix-support:
  1956. 147.00 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1957. 147.00 s [ghc-9.6.7-with-packages] /nix/store/qn49vwwahm0af9prf072nz4xg76ifm20-distributive-0.6.2.1/nix-support:
  1958. 147.00 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1959. 147.01 s [ghc-9.6.7-with-packages] /nix/store/6qqsyb5jvgnmlifjng0s3v0pgwwkryw2-constraints-0.14.2/nix-support:
  1960. 147.01 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1961. 147.01 s [ghc-9.6.7-with-packages] /nix/store/6qqsyb5jvgnmlifjng0s3v0pgwwkryw2-constraints-0.14.2/nix-support:
  1962. 147.01 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1963. 147.01 s [ghc-9.6.7-with-packages] /nix/store/zn99368wxxcfdnmn0pilyvn66zg0hldv-lifted-base-0.2.3.12/nix-support:
  1964. 147.01 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1965. 147.02 s [ghc-9.6.7-with-packages] /nix/store/zn99368wxxcfdnmn0pilyvn66zg0hldv-lifted-base-0.2.3.12/nix-support:
  1966. 147.02 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1967. 147.02 s [ghc-9.6.7-with-packages] /nix/store/5l1j8bggj9cshs6xqj0knhsn3iix247x-transformers-compat-0.7.2/nix-support:
  1968. 147.02 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1969. 147.02 s [ghc-9.6.7-with-packages] /nix/store/5l1j8bggj9cshs6xqj0knhsn3iix247x-transformers-compat-0.7.2/nix-support:
  1970. 147.02 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1971. 147.03 s [ghc-9.6.7-with-packages] /nix/store/8iy39dha01q6pwczlw1fbxzg2j8sjncl-splitmix-0.1.3.1/nix-support:
  1972. 147.03 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1973. 147.03 s [ghc-9.6.7-with-packages] /nix/store/8iy39dha01q6pwczlw1fbxzg2j8sjncl-splitmix-0.1.3.1/nix-support:
  1974. 147.03 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1975. 147.03 s [ghc-9.6.7-with-packages] /nix/store/n428byzgpjk6ysljizg36fn1hjh8wysn-unliftio-core-0.2.1.0/nix-support:
  1976. 147.03 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1977. 147.04 s [ghc-9.6.7-with-packages] /nix/store/n428byzgpjk6ysljizg36fn1hjh8wysn-unliftio-core-0.2.1.0/nix-support:
  1978. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1979. 147.04 s [ghc-9.6.7-with-packages] /nix/store/cjkmvjiaw972xpzzcn6gpl4p9zqaz3j1-base-orphans-0.9.3/nix-support:
  1980. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1981. 147.04 s [ghc-9.6.7-with-packages] /nix/store/cjkmvjiaw972xpzzcn6gpl4p9zqaz3j1-base-orphans-0.9.3/nix-support:
  1982. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1983. 147.04 s [ghc-9.6.7-with-packages] /nix/store/br9kpx7bzfzvvg5l8q2zf228r3h0anr8-os-string-2.0.8/nix-support:
  1984. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1985. 147.04 s [ghc-9.6.7-with-packages] /nix/store/br9kpx7bzfzvvg5l8q2zf228r3h0anr8-os-string-2.0.8/nix-support:
  1986. 147.04 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1987. 147.05 s [ghc-9.6.7-with-packages] /nix/store/hczmwq6716xprr0jzq4s2hl76wqgy7zb-tagged-0.8.9/nix-support:
  1988. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1989. 147.05 s [ghc-9.6.7-with-packages] /nix/store/hczmwq6716xprr0jzq4s2hl76wqgy7zb-tagged-0.8.9/nix-support:
  1990. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1991. 147.05 s [ghc-9.6.7-with-packages] /nix/store/j0c3yb21ggx6pbi6ak88cwsyd8z413bv-boring-0.2.2/nix-support:
  1992. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1993. 147.05 s [ghc-9.6.7-with-packages] /nix/store/j0c3yb21ggx6pbi6ak88cwsyd8z413bv-boring-0.2.2/nix-support:
  1994. 147.05 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/3r02b52yhkzffsdhwz01dywki8bn9v6i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  1995. 147.74 s [ghc-9.6.7-with-packages] Warning: include-dirs: /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages/lib/ghc-9.6.7/lib/../lib/x86_64-linux-ghc-9.6.7/directory-1.3.8.5/include doesn't exist or isn't a directory
  1996. 148.72 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages
  1997. 149.27 s [post-build-hook] Pushing 1 paths (154 are already present) using zstd to cache sellout ⏳
  1998. 149.27 s [post-build-hook]
  1999. 149.66 s [post-build-hook] Pushing /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages (4.85 MiB)
  2000. 151.25 s [post-build-hook]
  2001. 151.25 s [post-build-hook] All done.
  2002. 151.27 s [post-build-hook] Uploading to the NixCI cache: /nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages
  2003. 151.34 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2004. 151.55 s [post-build-hook] copying 1 paths...
  2005. 151.55 s [post-build-hook] copying path '/nix/store/4lzn0wrbgk6s576hw73266g8pabw4f70-ghc-9.6.7-with-packages' to 'https://cache.nix-ci.com'...
  2006. 152.62 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2007. 152.88 s [post-build-hook] copying 1 paths...
  2008. 152.88 s [post-build-hook] copying path '/nix/store/pgrxblnyadlmrz0rymx7mc6w0bvwia3z-ghc-9.6.7-with-packages.drv' to 'https://cache.nix-ci.com'...
  2009. 153.10 s Progress: 2 of 5 built (1 building)
  2010. 153.10 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Ormolu ( plugins/hls-ormolu-plugin/src/Ide/Plugin/Ormolu.hs, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.p_o )
  2011. 157.63 s [haskell-language-server] Preprocessing library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
  2012. 157.63 s [haskell-language-server] Building library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
  2013. 157.75 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFields ( plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.o, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.dyn_o )
  2014. 160.49 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFields ( plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.p_o )
  2015. 168.19 s [haskell-language-server] Preprocessing library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
  2016. 168.19 s [haskell-language-server] Building library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
  2017. 168.28 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 )
  2018. 169.67 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 )
  2019. 176.44 s [haskell-language-server] Preprocessing library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
  2020. 176.45 s [haskell-language-server] Building library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
  2021. 176.61 s [haskell-language-server] [ 1 of 24] Compiling Ide.Plugin.Cabal.Completion.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.dyn_o )
  2022. 177.96 s [haskell-language-server] [ 2 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.dyn_o )
  2023. 178.02 s [haskell-language-server] [ 3 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Paths ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Paths.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.dyn_o )
  2024. 178.08 s [haskell-language-server] [ 4 of 24] Compiling Ide.Plugin.Cabal.Completion.CabalFields ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/CabalFields.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.dyn_o )
  2025. 178.15 s [haskell-language-server] [ 5 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Simple ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Simple.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.dyn_o )
  2026. 178.29 s [haskell-language-server] [ 6 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Snippet ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Snippet.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.dyn_o )
  2027. 178.47 s [haskell-language-server] [ 7 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.FilePath ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/FilePath.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.dyn_o )
  2028. 178.47 s [haskell-language-server] [ 8 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Module ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Module.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.dyn_o )
  2029. 178.57 s [haskell-language-server] [ 9 of 24] Compiling Ide.Plugin.Cabal.Diagnostics ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Diagnostics.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.dyn_o )
  2030. 178.57 s [haskell-language-server] [10 of 24] Compiling Ide.Plugin.Cabal.FieldSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/FieldSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.dyn_o )
  2031. 178.57 s [haskell-language-server] [11 of 24] Compiling Ide.Plugin.Cabal.LicenseSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/LicenseSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.dyn_o )
  2032. 178.57 s [haskell-language-server] [12 of 24] Compiling Ide.Plugin.Cabal.Completion.Data ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Data.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.dyn_o )
  2033. 179.04 s [haskell-language-server] [13 of 24] Compiling Ide.Plugin.Cabal.Completion.Completions ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completions.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.dyn_o )
  2034. 179.29 s [haskell-language-server] [14 of 24] Compiling Ide.Plugin.Cabal.Orphans ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Orphans.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.dyn_o )
  2035. 179.29 s [haskell-language-server] [15 of 24] Compiling Ide.Plugin.Cabal.OfInterest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/OfInterest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.dyn_o )
  2036. 179.29 s [haskell-language-server] [16 of 24] Compiling Ide.Plugin.Cabal.Files ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Files.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.dyn_o )
  2037. 179.29 s [haskell-language-server] [17 of 24] Compiling Ide.Plugin.Cabal.Definition ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Definition.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.dyn_o )
  2038. 179.29 s [haskell-language-server] [18 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.dyn_o )
  2039. 179.29 s [haskell-language-server] [19 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Command ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Command.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.dyn_o )
  2040. 179.29 s [haskell-language-server] [20 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.CodeAction ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/CodeAction.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.dyn_o )
  2041. 179.30 s [haskell-language-server] [21 of 24] Compiling Ide.Plugin.Cabal.Outline ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Outline.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.dyn_o )
  2042. 179.30 s [haskell-language-server] [22 of 24] Compiling Ide.Plugin.Cabal.Parse ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Parse.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.dyn_o )
  2043. 179.30 s [haskell-language-server] [23 of 24] Compiling Ide.Plugin.Cabal.Rules ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Rules.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.dyn_o )
  2044. 179.30 s [haskell-language-server] [24 of 24] Compiling Ide.Plugin.Cabal ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.dyn_o )
  2045. 180.32 s [haskell-language-server] [ 1 of 24] Compiling Ide.Plugin.Cabal.Completion.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.p_o )
  2046. 181.84 s [haskell-language-server] [ 2 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.p_o )
  2047. 181.98 s [haskell-language-server] [ 3 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Paths ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Paths.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.p_o )
  2048. 182.04 s [haskell-language-server] [ 4 of 24] Compiling Ide.Plugin.Cabal.Completion.CabalFields ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/CabalFields.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.p_o )
  2049. 182.09 s [haskell-language-server] [ 5 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Simple ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Simple.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.p_o )
  2050. 182.31 s [haskell-language-server] [ 6 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Snippet ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Snippet.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.p_o )
  2051. 182.57 s [haskell-language-server] [ 7 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.FilePath ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/FilePath.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.p_o )
  2052. 182.58 s [haskell-language-server] [ 8 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Module ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Module.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.p_o )
  2053. 182.78 s [haskell-language-server] [ 9 of 24] Compiling Ide.Plugin.Cabal.Diagnostics ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Diagnostics.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.p_o )
  2054. 182.78 s [haskell-language-server] [10 of 24] Compiling Ide.Plugin.Cabal.FieldSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/FieldSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.p_o )
  2055. 182.78 s [haskell-language-server] [11 of 24] Compiling Ide.Plugin.Cabal.LicenseSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/LicenseSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.p_o )
  2056. 182.78 s [haskell-language-server] [12 of 24] Compiling Ide.Plugin.Cabal.Completion.Data ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Data.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.p_o )
  2057. 183.34 s [haskell-language-server] [13 of 24] Compiling Ide.Plugin.Cabal.Completion.Completions ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completions.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.p_o )
  2058. 183.64 s [haskell-language-server] [14 of 24] Compiling Ide.Plugin.Cabal.Orphans ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Orphans.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.p_o )
  2059. 183.64 s [haskell-language-server] [15 of 24] Compiling Ide.Plugin.Cabal.OfInterest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/OfInterest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.p_o )
  2060. 183.64 s [haskell-language-server] [16 of 24] Compiling Ide.Plugin.Cabal.Files ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Files.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.p_o )
  2061. 183.64 s [haskell-language-server] [17 of 24] Compiling Ide.Plugin.Cabal.Definition ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Definition.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.p_o )
  2062. 183.64 s [haskell-language-server] [18 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.p_o )
  2063. 184.55 s [haskell-language-server] [19 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Command ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Command.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.p_o )
  2064. 184.94 s [haskell-language-server] [20 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.CodeAction ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/CodeAction.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.p_o )
  2065. 184.94 s [haskell-language-server] [21 of 24] Compiling Ide.Plugin.Cabal.Outline ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Outline.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.p_o )
  2066. 184.94 s [haskell-language-server] [22 of 24] Compiling Ide.Plugin.Cabal.Parse ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Parse.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.p_o )
  2067. 184.94 s [haskell-language-server] [23 of 24] Compiling Ide.Plugin.Cabal.Rules ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Rules.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.p_o )
  2068. 184.94 s [haskell-language-server] [24 of 24] Compiling Ide.Plugin.Cabal ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.p_o )
  2069. 193.39 s [haskell-language-server] Preprocessing library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
  2070. 193.39 s [haskell-language-server] Building library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
  2071. 193.53 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Hlint ( plugins/hls-hlint-plugin/src/Ide/Plugin/Hlint.hs, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.o, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.dyn_o )
  2072. 198.26 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Hlint ( plugins/hls-hlint-plugin/src/Ide/Plugin/Hlint.hs, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.p_o )
  2073. 210.44 s [haskell-language-server] Preprocessing library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
  2074. 210.44 s [haskell-language-server] Building library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
  2075. 210.88 s [haskell-language-server]
  2076. 210.88 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2077. 210.88 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2078. 210.88 s [haskell-language-server] but were not needed for compilation:
  2079. 210.88 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
  2080. 210.88 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)
  2081. 210.90 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.dyn_o )
  2082. 211.32 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.dyn_o )
  2083. 222.28 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.dyn_o )
  2084. 222.31 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.dyn_o )
  2085. 222.32 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.dyn_o )
  2086. 222.36 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.dyn_o )
  2087. 223.02 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.dyn_o )
  2088. 223.63 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.dyn_o )
  2089. 223.63 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.dyn_o )
  2090. 223.63 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.dyn_o )
  2091. 223.63 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.dyn_o )
  2092. 223.63 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.dyn_o )
  2093. 223.63 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.dyn_o )
  2094. 230.05 s [haskell-language-server]
  2095. 230.05 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2096. 230.09 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2097. 230.09 s [haskell-language-server] but were not needed for compilation:
  2098. 230.09 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
  2099. 230.09 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)
  2100. 230.09 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.p_o )
  2101. 230.33 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.p_o )
  2102. 241.63 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.p_o )
  2103. 241.67 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.p_o )
  2104. 241.67 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.p_o )
  2105. 241.83 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.p_o )
  2106. 242.54 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.p_o )
  2107. 243.18 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.p_o )
  2108. 243.18 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.p_o )
  2109. 243.18 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.p_o )
  2110. 243.18 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.p_o )
  2111. 243.18 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.p_o )
  2112. 243.18 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.p_o )
  2113. 253.93 s [haskell-language-server] Preprocessing library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
  2114. 253.93 s [haskell-language-server] Building library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
  2115. 254.04 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 )
  2116. 255.74 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 )
  2117. 264.04 s [haskell-language-server] Preprocessing library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
  2118. 264.04 s [haskell-language-server] Building library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
  2119. 264.17 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.Splice.Types ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice/Types.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.o, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.dyn_o )
  2120. 265.83 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.Splice ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice.o, dist/build/hls-splice-plugin/Ide/Plugin/Splice.dyn_o )
  2121. 267.66 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.Splice.Types ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice/Types.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.p_o )
  2122. 270.42 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.Splice ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice.p_o )
  2123. 277.94 s [haskell-language-server] Preprocessing library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
  2124. 277.94 s [haskell-language-server] Building library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
  2125. 278.08 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Retrie ( plugins/hls-retrie-plugin/src/Ide/Plugin/Retrie.hs, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.o, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.dyn_o )
  2126. 284.62 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Retrie ( plugins/hls-retrie-plugin/src/Ide/Plugin/Retrie.hs, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.p_o )
  2127. 300.45 s [haskell-language-server] Preprocessing library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
  2128. 300.45 s [haskell-language-server] Building library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
  2129. 300.57 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.o, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.dyn_o )
  2130. 301.25 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.GADT ( plugins/hls-gadt-plugin/src/Ide/Plugin/GADT.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.o, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.dyn_o )
  2131. 302.88 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.p_o )
  2132. 303.60 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 )
  2133. 311.74 s [haskell-language-server] Preprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  2134. 311.74 s [haskell-language-server] Building library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  2135. 311.90 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 )
  2136. 312.89 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 )
  2137. 313.41 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 )
  2138. 314.53 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 )
  2139. 315.53 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 )
  2140. 316.06 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 )
  2141. 323.20 s [haskell-language-server] Preprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  2142. 323.20 s [haskell-language-server] Building library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  2143. 323.33 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.o, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.dyn_o )
  2144. 324.90 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.p_o )
  2145. 332.28 s [haskell-language-server] Preprocessing library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  2146. 332.28 s [haskell-language-server] Building library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  2147. 332.37 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalFmt ( plugins/hls-cabal-fmt-plugin/src/Ide/Plugin/CabalFmt.hs, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.o, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.dyn_o )
  2148. 333.68 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalFmt ( plugins/hls-cabal-fmt-plugin/src/Ide/Plugin/CabalFmt.hs, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.p_o )
  2149. 342.22 s [haskell-language-server] Preprocessing library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  2150. 342.22 s [haskell-language-server] Building library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  2151. 342.49 s [haskell-language-server] [ 1 of 10] Compiling Ide.Plugin.Eval.Config ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Config.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.dyn_o )
  2152. 342.87 s [haskell-language-server] [ 2 of 10] Compiling Ide.Plugin.Eval.Parse.Option ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Option.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.dyn_o )
  2153. 342.94 s [haskell-language-server] [ 3 of 10] Compiling Ide.Plugin.Eval.Util ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Util.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.dyn_o )
  2154. 343.14 s [haskell-language-server] [ 4 of 10] Compiling Ide.Plugin.Eval.GHC ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/GHC.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.dyn_o )
  2155. 343.91 s [haskell-language-server] [ 5 of 10] Compiling Ide.Plugin.Eval.Types ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Types.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.dyn_o )
  2156. 348.44 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.dyn_o )
  2157. 348.91 s [haskell-language-server] [ 7 of 10] Compiling Ide.Plugin.Eval.Parse.Comments ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Comments.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.dyn_o )
  2158. 351.14 s [haskell-language-server] [ 8 of 10] Compiling Ide.Plugin.Eval.Code ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.dyn_o )
  2159. 351.14 s [haskell-language-server] [ 9 of 10] Compiling Ide.Plugin.Eval.Handlers ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Handlers.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.dyn_o )
  2160. 352.70 s [haskell-language-server] [10 of 10] Compiling Ide.Plugin.Eval ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval.dyn_o )
  2161. 353.22 s [haskell-language-server] [ 1 of 10] Compiling Ide.Plugin.Eval.Config ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Config.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.p_o )
  2162. 353.69 s [haskell-language-server] [ 2 of 10] Compiling Ide.Plugin.Eval.Parse.Option ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Option.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.p_o )
  2163. 353.78 s [haskell-language-server] [ 3 of 10] Compiling Ide.Plugin.Eval.Util ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Util.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.p_o )
  2164. 353.84 s [haskell-language-server] [ 4 of 10] Compiling Ide.Plugin.Eval.GHC ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/GHC.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.p_o )
  2165. 354.50 s [haskell-language-server] [ 5 of 10] Compiling Ide.Plugin.Eval.Types ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Types.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.p_o )
  2166. 360.77 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.p_o )
  2167. 361.21 s [haskell-language-server] [ 7 of 10] Compiling Ide.Plugin.Eval.Parse.Comments ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Comments.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.p_o )
  2168. 363.25 s [haskell-language-server] [ 8 of 10] Compiling Ide.Plugin.Eval.Code ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.p_o )
  2169. 363.25 s [haskell-language-server] [ 9 of 10] Compiling Ide.Plugin.Eval.Handlers ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Handlers.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.p_o )
  2170. 364.60 s [haskell-language-server] [10 of 10] Compiling Ide.Plugin.Eval ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval.p_o )
  2171. 372.06 s [haskell-language-server] Preprocessing library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  2172. 372.06 s [haskell-language-server] Building library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  2173. 372.15 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 )
  2174. 373.45 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 )
  2175. 381.37 s [haskell-language-server] Preprocessing executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  2176. 381.37 s [haskell-language-server] Building executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  2177. 381.54 s [haskell-language-server] [1 of 1] Compiling Main ( docs/contributing/plugin-tutorial.lhs, dist/build/plugin-tutorial/plugin-tutorial-tmp/Main.dyn_o )
  2178. 382.69 s [haskell-language-server] [2 of 2] Linking dist/build/plugin-tutorial/plugin-tutorial
  2179. 383.75 s [haskell-language-server] Preprocessing library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  2180. 383.75 s [haskell-language-server] Building library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  2181. 383.86 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Stan ( plugins/hls-stan-plugin/src/Ide/Plugin/Stan.hs, dist/build/hls-stan-plugin/Ide/Plugin/Stan.o, dist/build/hls-stan-plugin/Ide/Plugin/Stan.dyn_o )
  2182. 386.51 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Stan ( plugins/hls-stan-plugin/src/Ide/Plugin/Stan.hs, dist/build/hls-stan-plugin/Ide/Plugin/Stan.p_o )
  2183. 395.68 s [haskell-language-server] Preprocessing library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  2184. 395.68 s [haskell-language-server] Building library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  2185. 395.78 s [haskell-language-server]
  2186. 395.78 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2187. 395.78 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2188. 395.78 s [haskell-language-server] but were not needed for compilation:
  2189. 395.78 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2190. 395.79 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitImports ( plugins/hls-explicit-imports-plugin/src/Ide/Plugin/ExplicitImports.hs, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.o, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.dyn_o )
  2191. 400.59 s [haskell-language-server]
  2192. 400.59 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2193. 400.59 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2194. 400.59 s [haskell-language-server] but were not needed for compilation:
  2195. 400.59 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2196. 400.61 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitImports ( plugins/hls-explicit-imports-plugin/src/Ide/Plugin/ExplicitImports.hs, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.p_o )
  2197. 411.58 s [haskell-language-server] Preprocessing library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  2198. 411.58 s [haskell-language-server] Building library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  2199. 411.71 s [haskell-language-server]
  2200. 411.71 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2201. 411.71 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2202. 411.71 s [haskell-language-server] but were not needed for compilation:
  2203. 411.71 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  2204. 411.72 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 )
  2205. 414.23 s [haskell-language-server]
  2206. 414.23 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2207. 414.23 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2208. 414.23 s [haskell-language-server] but were not needed for compilation:
  2209. 414.23 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  2210. 414.25 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 )
  2211. 424.28 s [haskell-language-server] Preprocessing library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  2212. 424.28 s [haskell-language-server] Building library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  2213. 424.40 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFixity ( plugins/hls-explicit-fixity-plugin/src/Ide/Plugin/ExplicitFixity.hs, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.o, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.dyn_o )
  2214. 426.14 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFixity ( plugins/hls-explicit-fixity-plugin/src/Ide/Plugin/ExplicitFixity.hs, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.p_o )
  2215. 433.69 s [haskell-language-server] Preprocessing executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  2216. 433.69 s [haskell-language-server] Building executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  2217. 433.84 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-bench/exe/Main.hs, dist/build/ghcide-bench/ghcide-bench-tmp/Main.dyn_o )
  2218. 434.32 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-bench/ghcide-bench
  2219. 435.49 s [haskell-language-server] Preprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  2220. 435.49 s [haskell-language-server] Building library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  2221. 435.60 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.o, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.dyn_o )
  2222. 437.04 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.p_o )
  2223. 444.84 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0..
  2224. 444.84 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0..
  2225. 445.08 s [haskell-language-server]
  2226. 445.08 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2227. 445.08 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2228. 445.08 s [haskell-language-server] but were not needed for compilation:
  2229. 445.08 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2230. 445.09 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  2231. 446.24 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 )
  2232. 446.24 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 )
  2233. 447.34 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 )
  2234. 447.64 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 )
  2235. 448.60 s [haskell-language-server]
  2236. 448.60 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2237. 448.60 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2238. 448.60 s [haskell-language-server] but were not needed for compilation:
  2239. 448.60 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2240. 448.62 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  2241. 449.72 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 )
  2242. 449.72 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  2243. 450.96 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  2244. 451.51 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  2245. 462.63 s [haskell-language-server] Preprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  2246. 462.67 s [haskell-language-server] Building executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  2247. 462.86 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 )
  2248. 463.82 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 )
  2249. 464.23 s [haskell-language-server] [3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
  2250. 465.79 s [haskell-language-server] Preprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  2251. 465.79 s [haskell-language-server] Building executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  2252. 465.95 s [haskell-language-server] [1 of 1] Compiling Main ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
  2253. 467.08 s [haskell-language-server] [2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
  2254. 468.71 s [haskell-language-server] buildPhase completed in 7 minutes 37 seconds
  2255. 468.75 s [haskell-language-server] Phase: haddockPhase
  2256. 468.75 s [haskell-language-server] Phase: installPhase
  2257. 468.90 s [haskell-language-server] Installing internal library hls-overloaded-record-dot-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  2258. 469.01 s [haskell-language-server] Installing internal library hls-change-type-signature-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  2259. 469.04 s [haskell-language-server] Installing internal library hls-class-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  2260. 469.14 s [haskell-language-server] Installing internal library hls-call-hierarchy-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  2261. 469.22 s [haskell-language-server] Installing executable ghcide-test-preprocessor in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2262. 469.22 s [haskell-language-server] Warning: The directory
  2263. 469.22 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2264. 469.22 s [haskell-language-server] is not in the system search path.
  2265. 469.22 s [haskell-language-server] Installing internal library hls-code-range-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  2266. 469.28 s [haskell-language-server] Installing internal library hls-notes-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  2267. 469.34 s [haskell-language-server] Installing internal library ghcide-bench-lib in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  2268. 469.47 s [haskell-language-server] Installing internal library hls-floskell-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  2269. 469.50 s [haskell-language-server] Installing internal library hls-stylish-haskell-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  2270. 469.52 s [haskell-language-server] Installing internal library hls-pragmas-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  2271. 469.58 s [haskell-language-server] Installing internal library hls-semantic-tokens-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  2272. 469.69 s [haskell-language-server] Installing internal library hls-ormolu-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  2273. 469.72 s [haskell-language-server] Installing internal library hls-explicit-record-fields-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  2274. 469.77 s [haskell-language-server] Installing internal library hls-cabal-gild-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  2275. 469.81 s [haskell-language-server] Installing internal library hls-cabal-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  2276. 470.05 s [haskell-language-server] Installing internal library hls-hlint-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  2277. 470.11 s [haskell-language-server] Installing internal library hls-refactor-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  2278. 470.50 s [haskell-language-server] Installing internal library hls-rename-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  2279. 470.55 s [haskell-language-server] Installing internal library hls-splice-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  2280. 470.63 s [haskell-language-server] Installing internal library hls-retrie-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  2281. 470.77 s [haskell-language-server] Installing internal library hls-gadt-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  2282. 470.82 s [haskell-language-server] Installing internal library hls-alternate-number-format-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  2283. 470.90 s [haskell-language-server] Installing internal library hls-qualify-imported-names-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  2284. 470.94 s [haskell-language-server] Installing internal library hls-cabal-fmt-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  2285. 470.98 s [haskell-language-server] Installing internal library hls-eval-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  2286. 471.19 s [haskell-language-server] Installing internal library hls-signature-help-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  2287. 471.21 s [haskell-language-server] Installing executable plugin-tutorial in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2288. 471.21 s [haskell-language-server] Warning: The directory
  2289. 471.21 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2290. 471.21 s [haskell-language-server] is not in the system search path.
  2291. 471.22 s [haskell-language-server] Installing internal library hls-stan-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  2292. 471.25 s [haskell-language-server] Installing internal library hls-explicit-imports-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  2293. 471.32 s [haskell-language-server] Installing internal library hls-fourmolu-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  2294. 471.37 s [haskell-language-server] Installing internal library hls-explicit-fixity-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  2295. 471.40 s [haskell-language-server] Installing executable ghcide-bench in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2296. 471.40 s [haskell-language-server] Warning: The directory
  2297. 471.40 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2298. 471.40 s [haskell-language-server] is not in the system search path.
  2299. 471.41 s [haskell-language-server] Installing internal library hls-module-name-plugin in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  2300. 471.45 s [haskell-language-server] Installing library in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  2301. 471.54 s [haskell-language-server] Installing executable haskell-language-server-wrapper in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2302. 471.54 s [haskell-language-server] Warning: The directory
  2303. 471.54 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2304. 471.54 s [haskell-language-server] is not in the system search path.
  2305. 471.55 s [haskell-language-server] Installing executable haskell-language-server in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2306. 471.55 s [haskell-language-server] Warning: The directory
  2307. 471.55 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2308. 471.55 s [haskell-language-server] is not in the system search path.
  2309. 474.94 s [haskell-language-server] Phase: fixupPhase
  2310. 474.96 s [haskell-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  2311. 475.02 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
  2312. 475.02 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/plugin-tutorial
  2313. 475.23 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
  2314. 475.41 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.6.7-unwrapped
  2315. 475.57 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/ghcide-bench
  2316. 475.74 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin-ghc9.6.7.so
  2317. 475.88 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin-ghc9.6.7.so
  2318. 475.99 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin-ghc9.6.7.so
  2319. 476.11 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin-ghc9.6.7.so
  2320. 476.23 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin-ghc9.6.7.so
  2321. 476.34 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin-ghc9.6.7.so
  2322. 476.45 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin-ghc9.6.7.so
  2323. 476.57 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib-ghc9.6.7.so
  2324. 476.69 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin-ghc9.6.7.so
  2325. 476.80 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin-ghc9.6.7.so
  2326. 476.92 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin-ghc9.6.7.so
  2327. 477.03 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin-ghc9.6.7.so
  2328. 477.14 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin-ghc9.6.7.so
  2329. 477.25 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin-ghc9.6.7.so
  2330. 477.37 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin-ghc9.6.7.so
  2331. 477.48 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin-ghc9.6.7.so
  2332. 477.59 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF-ghc9.6.7.so
  2333. 477.73 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin-ghc9.6.7.so
  2334. 477.85 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin-ghc9.6.7.so
  2335. 477.97 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin-ghc9.6.7.so
  2336. 478.08 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin-ghc9.6.7.so
  2337. 478.20 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin-ghc9.6.7.so
  2338. 478.32 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin-ghc9.6.7.so
  2339. 478.42 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin-ghc9.6.7.so
  2340. 478.54 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin-ghc9.6.7.so
  2341. 478.65 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin-ghc9.6.7.so
  2342. 478.80 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin-ghc9.6.7.so
  2343. 478.94 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin-ghc9.6.7.so
  2344. 479.07 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin-ghc9.6.7.so
  2345. 479.18 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin-ghc9.6.7.so
  2346. 479.31 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin-ghc9.6.7.so
  2347. 479.43 s [haskell-language-server] shrinking /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin-ghc9.6.7.so
  2348. 479.54 s [haskell-language-server] checking for references to /build/ in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0...
  2349. 479.68 s [haskell-language-server] patching script interpreter paths in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  2350. 479.69 s [haskell-language-server] /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/haskell-language-server: interpreter directive changed from "#!/bin/sh" to "/nix/store/6ph0zypyfc09fw6hlc1ygjvk2hv4j9vd-bash-5.3p3/bin/sh"
  2351. 479.72 s [haskell-language-server] stripping (with command strip and flags -S -p) in /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/lib /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin
  2352. 480.91 s [haskell-language-server] rewriting symlink /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0/bin/haskell-language-server-9.6.7 to be relative to /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  2353. 483.52 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  2354. 484.59 s [post-build-hook] Pushing 1 paths (660 are already present) using zstd to cache sellout ⏳
  2355. 484.59 s [post-build-hook]
  2356. 485.10 s [post-build-hook] Pushing /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0 (123.63 MiB)
  2357. 488.19 s [post-build-hook]
  2358. 488.19 s [post-build-hook] All done.
  2359. 488.22 s [post-build-hook] Uploading to the NixCI cache: /nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0
  2360. 488.28 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2361. 488.36 s [post-build-hook] copying 1 paths...
  2362. 488.36 s [post-build-hook] copying path '/nix/store/2pvqmwpdfdldvn8rxz1yqygb0rpxyp76-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...
  2363. 509.27 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2364. 509.89 s [post-build-hook] copying 119 paths...
  2365. 509.93 s [post-build-hook] copying path '/nix/store/1anixijcmxsagfslr6s5g6kwc0y3kwiy-heaps-0.4.1.drv' to 'https://cache.nix-ci.com'...
  2366. 509.93 s [post-build-hook] copying path '/nix/store/6d3nbqdhyl620r5izmzybikv6kfvmc2q-relude-1.2.2.2.drv' to 'https://cache.nix-ci.com'...
  2367. 509.93 s [post-build-hook] copying path '/nix/store/55vishpdpnn2f6wv9nj821bkgfvljdl3-ghc-lib-parser-9.8.5.20250214.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2368. 509.93 s [post-build-hook] copying path '/nix/store/46xajjrzid9563wg1kdxrhjnvpwn2xgf-hspec-hedgehog-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  2369. 509.93 s [post-build-hook] copying path '/nix/store/4fcdvf3dr03bsbjqj9806xpzgzlhfvn5-colourista-0.1.0.2.drv' to 'https://cache.nix-ci.com'...
  2370. 509.93 s [post-build-hook] copying path '/nix/store/5ik4g51xqspq8cfms6rm10wbrgmf7r16-monad-dijkstra-0.1.1.5.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2371. 509.93 s [post-build-hook] copying path '/nix/store/94x0nhr8p9zaclv4a47r3dxa84ajzbiv-path-0.9.6.drv' to 'https://cache.nix-ci.com'...
  2372. 509.93 s [post-build-hook] copying path '/nix/store/1i8sbvbngykff57ybdzql39q01r8k1zs-refact-0.3.0.2.drv' to 'https://cache.nix-ci.com'...
  2373. 509.93 s [post-build-hook] copying path '/nix/store/2i3752ma5zg43pz2s0z4yqbghpsjk1yq-commutative-semigroups-0.2.0.2.drv' to 'https://cache.nix-ci.com'...
  2374. 509.93 s [post-build-hook] copying path '/nix/store/8pqg623kl9h4s2cy4bisv3qzr326jqiy-stylish-haskell-0.14.6.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2375. 509.93 s [post-build-hook] copying path '/nix/store/93kpbwc8klkll2lm13mg7l2skv545j69-b0df07178133b5b049e3e7764acba0e5e3fa57af.patch.drv' to 'https://cache.nix-ci.com'...
  2376. 509.93 s [post-build-hook] copying path '/nix/store/5cmflmilwj5jw1yiny160nmba8pnfizy-hlint-3.8.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2377. 509.93 s [post-build-hook] copying path '/nix/store/cv6jspkx432k5l175ky5vvphgxbdscjr-hspec-megaparsec-2.2.1.drv' to 'https://cache.nix-ci.com'...
  2378. 509.93 s [post-build-hook] copying path '/nix/store/can6rlqpdjy1839pqs52w6bxpylppvim-ormolu-0.7.4.0-r5.cabal.drv' to 'https://cache.nix-ci.com'...
  2379. 509.93 s [post-build-hook] copying path '/nix/store/1hfpkmcfif1yc2bik0s21d912z2m5scs-random-shuffle-0.0.4.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2380. 509.93 s [post-build-hook] copying path '/nix/store/4k8mdpcc00rjplhzmfan1gqxd9f84l8p-githash-0.1.7.0.drv' to 'https://cache.nix-ci.com'...
  2381. 510.13 s [post-build-hook] copying path '/nix/store/cwsf2vgg5z6f7bz1c19wimsxnb2j5p9q-extensions-0.1.0.1-r1.cabal.drv' to 'https://cache.nix-ci.com'...
  2382. 510.18 s [post-build-hook] copying path '/nix/store/dmsznk7q7a3xr7ajhd3ak87zxy471i3x-fail-4.9.0.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2383. 510.18 s [post-build-hook] copying path '/nix/store/fqnijdw5gjpz3wnqmrgx45ka6iyzwwdi-entropy-0.4.1.11.drv' to 'https://cache.nix-ci.com'...
  2384. 510.19 s [post-build-hook] copying path '/nix/store/g7d03d4vvm931cz3zr7ac323yrkfjfm9-dir-traverse-0.2.3.0.drv' to 'https://cache.nix-ci.com'...
  2385. 510.19 s [post-build-hook] copying path '/nix/store/hg25hnlwsjb5milwajslbf4nd1i1lyzp-vector-th-unbox-0.2.2.drv' to 'https://cache.nix-ci.com'...
  2386. 510.19 s [post-build-hook] copying path '/nix/store/hrwj4v86rqcqxmz89z9ss3vggcwdffzp-retrie-1.2.3.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2387. 510.19 s [post-build-hook] copying path '/nix/store/hz1sbq0lypd4xklacffqjcsr2dv1ydmk-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...
  2388. 510.24 s [post-build-hook] copying path '/nix/store/i3gnrvir3475hz696mls2sc70xifcq31-fourmolu-0.15.0.0-r1.cabal.drv' to 'https://cache.nix-ci.com'...
  2389. 510.24 s [post-build-hook] copying path '/nix/store/izy72imhaajqphchm9d1x6s56gn9x6r5-microaeson-0.1.0.3.drv' to 'https://cache.nix-ci.com'...
  2390. 510.24 s [post-build-hook] copying path '/nix/store/k888jdf8wrg4rj6sg4p6sg678gfin0nm-validation-selective-0.2.0.0.drv' to 'https://cache.nix-ci.com'...
  2391. 510.24 s [post-build-hook] copying path '/nix/store/l5g1qdympv53y5mj77gsvv3r7253wd2q-MonadRandom-0.6.2.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2392. 510.24 s [post-build-hook] copying path '/nix/store/lmxi42ppyfh8zcks9f2dg91krjinjzw6-ormolu-0.7.4.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2393. 510.24 s [post-build-hook] copying path '/nix/store/m6zrfz3fj89sslx2wyr1mjfbnx09bkjp-HsYAML-0.2.1.5.drv' to 'https://cache.nix-ci.com'...
  2394. 510.24 s [post-build-hook] copying path '/nix/store/n24bznzwbymvl5136wc3mpkda9x33cwi-filemanip-0.3.6.3.drv' to 'https://cache.nix-ci.com'...
  2395. 510.24 s [post-build-hook] copying path '/nix/store/n4ar2rmy5hi4lj9745mc2r9i2z0w65v9-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  2396. 510.24 s [post-build-hook] copying path '/nix/store/pikdjcsgm97yill6547qkf4kh34d0mjl-primes-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  2397. 510.38 s [post-build-hook] copying path '/nix/store/pk9wmil5g1914vhd2474bfzahdh4pxx3-fourmolu-0.15.0.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2398. 510.42 s [post-build-hook] copying path '/nix/store/pxx1fd3bhsngp1w90rcccbfpa38g39v9-filtrable-0.1.6.0.drv' to 'https://cache.nix-ci.com'...
  2399. 510.47 s [post-build-hook] copying path '/nix/store/r3svy7zfj80fp89nganb954dz7akbrpk-psqueues-0.2.8.2.drv' to 'https://cache.nix-ci.com'...
  2400. 510.47 s [post-build-hook] copying path '/nix/store/r3akfq0v5ah0ysk65997hbcbi9d70snp-ghc-lib-parser-9.8.5.20250214.drv' to 'https://cache.nix-ci.com'...
  2401. 510.47 s [post-build-hook] copying path '/nix/store/s3s5jz3wan33d1h4i32jcrqqhcvivbk0-ghc-exactprint-1.7.1.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2402. 510.47 s [post-build-hook] copying path '/nix/store/s9m2vgwl8n16h30yxn8b1pkj2rsb887r-ghc-lib-parser-ex-9.8.0.2.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2403. 510.47 s [post-build-hook] copying path '/nix/store/qrbi1lk6c8f48prsl6kbgr9r46c3pihv-markdown-unlit-0.6.0.drv' to 'https://cache.nix-ci.com'...
  2404. 510.52 s [post-build-hook] copying path '/nix/store/v0swygjq31vnyjkb456p66pqhgf9ng0z-uniplate-1.6.13.drv' to 'https://cache.nix-ci.com'...
  2405. 510.52 s [post-build-hook] copying path '/nix/store/vv4vxcpwslmw7f6h6zxhgwd6rminmlas-cabal-doctest-1.0.12.drv' to 'https://cache.nix-ci.com'...
  2406. 510.52 s [post-build-hook] copying path '/nix/store/swj2w4wkc17v4z7shmniq0x0fhma0qbb-extensions-0.1.0.1.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2407. 510.57 s [post-build-hook] copying path '/nix/store/wkvspjnn0y41xmmb4jm8djdib8bpg6qj-optparse-simple-0.1.1.4.drv' to 'https://cache.nix-ci.com'...
  2408. 510.57 s [post-build-hook] copying path '/nix/store/wk4357c75h7rgrg12xlg9kwy1z1idsvz-floskell-0.11.1.tar.gz.drv' to 'https://cache.nix-ci.com'...
  2409. 510.57 s [post-build-hook] copying path '/nix/store/why0vvinxpzpdyj8aw5sgk0yb5b013fa-trial-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  2410. 510.57 s [post-build-hook] copying path '/nix/store/x937iqharrq6j7ijw30cf885fcvc0yrd-clay-0.16.1.drv' to 'https://cache.nix-ci.com'...
  2411. 510.57 s [post-build-hook] copying path '/nix/store/z27ism425zhz1vw1lf55chfbvsxrvbz0-newtype-generics-0.6.2.drv' to 'https://cache.nix-ci.com'...
  2412. 510.57 s [post-build-hook] copying path '/nix/store/yj9jjrnc4s74qy7apjjfz2xvbx7xf7zn-deriving-aeson-0.2.10.drv' to 'https://cache.nix-ci.com'...
  2413. 510.61 s [post-build-hook] copying path '/nix/store/z44ckjv45y80266773fi15pm2sag9z4d-pretty-simple-4.1.4.0.drv' to 'https://cache.nix-ci.com'...
  2414. 510.65 s [post-build-hook] copying path '/nix/store/zbm1gsdcq77xgwpm1na4rqff8ljh53lm-fmlist-0.9.4.drv' to 'https://cache.nix-ci.com'...
  2415. 510.70 s [post-build-hook] copying path '/nix/store/zcnhg61h9xi0z8shjqm5f1kpz9qhzmy2-path-io-1.8.2.drv' to 'https://cache.nix-ci.com'...
  2416. 510.70 s [post-build-hook] copying path '/nix/store/zwiz0flaib11rd20f8pwk2p9c0krfq5y-ordered-containers-0.2.4.drv' to 'https://cache.nix-ci.com'...
  2417. 510.70 s [post-build-hook] copying path '/nix/store/ay3k2i6zc7mr54r3zszjmkgc2splvrym-shake-0.19.8.drv' to 'https://cache.nix-ci.com'...
  2418. 510.70 s [post-build-hook] copying path '/nix/store/17kjpbh3f85hhlq9i2nxracdw0q494xd-slist-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  2419. 510.70 s [post-build-hook] copying path '/nix/store/ff8n0fqpl5srjkskqmaxvbmswm0ydchk-fail-4.9.0.0.drv' to 'https://cache.nix-ci.com'...
  2420. 510.75 s [post-build-hook] copying path '/nix/store/7zc8w2dk4hix7kggrcxrqbg295bp9sr1-math-functions-0.3.4.4.drv' to 'https://cache.nix-ci.com'...
  2421. 510.75 s [post-build-hook] copying path '/nix/store/8kvbkl3v5izwsi5g3kvarcsxnvklrrai-HsYAML-aeson-0.2.0.2.drv' to 'https://cache.nix-ci.com'...
  2422. 510.75 s [post-build-hook] copying path '/nix/store/cjs337qgzfraxmrxji9xq0249vlgfl0w-monoid-subclasses-1.2.6.drv' to 'https://cache.nix-ci.com'...
  2423. 510.80 s [post-build-hook] copying path '/nix/store/8z45n8r7a0vxs3np9kjn8gq7rzvlrwh8-tomland-1.3.3.3.drv' to 'https://cache.nix-ci.com'...
  2424. 510.81 s [post-build-hook] copying path '/nix/store/7i70d4ri1jj0310araa19qvh930rh1wr-MonadRandom-0.6.2.drv' to 'https://cache.nix-ci.com'...
  2425. 510.81 s [post-build-hook] copying path '/nix/store/0f5pbd61m9d4lq85gysr3bfv25vj6g2d-doctest-0.24.2.drv' to 'https://cache.nix-ci.com'...
  2426. 510.81 s [post-build-hook] copying path '/nix/store/kpicw7a0shnlrn7m5piva4h2amk1y91q-regex-applicative-0.3.4.drv' to 'https://cache.nix-ci.com'...
  2427. 510.86 s [post-build-hook] copying path '/nix/store/6f0nsddrsps5dbibmrlrv7vas48s1nac-th-env-0.1.1.drv' to 'https://cache.nix-ci.com'...
  2428. 510.86 s [post-build-hook] copying path '/nix/store/p40khg0m9as6kiflgb3n4bajbpn0rqb2-extensions-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  2429. 510.92 s [post-build-hook] copying path '/nix/store/29g826chkbdvbkz9dzghszapxsc6bpd9-pcg-random-0.1.4.0.drv' to 'https://cache.nix-ci.com'...
  2430. 510.97 s [post-build-hook] copying path '/nix/store/grw2kz9j0adc65xc09hfn0cvgsrj7wr7-ghc-lib-parser-ex-9.8.0.2.drv' to 'https://cache.nix-ci.com'...
  2431. 510.98 s [post-build-hook] copying path '/nix/store/d9hmx3pfhgijg8py3jzxs5qrnkyn31bq-MemoTrie-0.6.11.drv' to 'https://cache.nix-ci.com'...
  2432. 510.98 s [post-build-hook] copying path '/nix/store/jgadx2bn6gwx7licwf865klfrg7g1bg3-trial-optparse-applicative-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  2433. 510.98 s [post-build-hook] copying path '/nix/store/h0cg7hwbx96h8ww35hsdgl08d4scmrvd-ListLike-4.7.8.4.drv' to 'https://cache.nix-ci.com'...
  2434. 510.98 s [post-build-hook] copying path '/nix/store/5i644mwp722mjzd6si8pa7bvnb6hfp4h-ghc-exactprint-1.7.1.0.drv' to 'https://cache.nix-ci.com'...
  2435. 511.03 s [post-build-hook] copying path '/nix/store/xdmbhr4hhh0h5a7rxrv3md3nlcccx3c4-fuzzy-0.1.1.0.drv' to 'https://cache.nix-ci.com'...
  2436. 511.03 s [post-build-hook] copying path '/nix/store/24bs87lmf8m8v9m8ik082lrdl33z2aly-mwc-random-0.15.2.0.drv' to 'https://cache.nix-ci.com'...
  2437. 511.09 s [post-build-hook] copying path '/nix/store/ldaacqa0cdsrpjfiw1lszpxnd5g429m0-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  2438. 511.09 s [post-build-hook] copying path '/nix/store/n9jgkwj3n3039b2xmpxgzq01p5wp88jj-trial-tomland-0.0.0.0.drv' to 'https://cache.nix-ci.com'...
  2439. 511.09 s [post-build-hook] copying path '/nix/store/a5yvz42v5mh8lj7p9wwqbs68frr2khzl-random-shuffle-0.0.4.drv' to 'https://cache.nix-ci.com'...
  2440. 511.25 s [post-build-hook] copying path '/nix/store/bairzzr972yr04dw0w1s4qxf2g7n0j04-stylish-haskell-0.14.6.0.drv' to 'https://cache.nix-ci.com'...
  2441. 511.25 s [post-build-hook] copying path '/nix/store/kgvg0idnq5gy5d0fk3g5rvschv8mspds-process-extras-0.7.4.drv' to 'https://cache.nix-ci.com'...
  2442. 511.25 s [post-build-hook] copying path '/nix/store/ac3057ary3ggk60m7wympmq28qbrj3zz-ormolu-0.7.4.0.drv' to 'https://cache.nix-ci.com'...
  2443. 511.25 s [post-build-hook] copying path '/nix/store/qh28b0xln14zr3sdjhp3g76kbw72m7ij-hlint-3.8.drv' to 'https://cache.nix-ci.com'...
  2444. 511.25 s [post-build-hook] copying path '/nix/store/x6kml2fyfn4rkr2smk8fss3kxvwp4z1p-fourmolu-0.15.0.0.drv' to 'https://cache.nix-ci.com'...
  2445. 511.31 s [post-build-hook] copying path '/nix/store/cs16j13ag9cji0f1k8f73qlkl4la90z2-random-bytestring-0.1.4.drv' to 'https://cache.nix-ci.com'...
  2446. 511.36 s [post-build-hook] copying path '/nix/store/l71rvkbbfi5r2zzwh5b3ki4by53imyy0-attoparsec-0.14.4.drv' to 'https://cache.nix-ci.com'...
  2447. 511.36 s [post-build-hook] copying path '/nix/store/yirjq103f400mpcvly2v0b0is38szhyw-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  2448. 511.54 s [post-build-hook] copying path '/nix/store/3qc8xw3phbgbg7nk1wnvi9qanv87hni8-base64-1.0.drv' to 'https://cache.nix-ci.com'...
  2449. 511.59 s [post-build-hook] copying path '/nix/store/k96qggy30gdcv32zv96j84m33w3gf6da-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  2450. 511.76 s [post-build-hook] copying path '/nix/store/p1r9b27js269128b7xwka9dj4rrfaj0p-stan-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  2451. 511.85 s [post-build-hook] copying path '/nix/store/mljnvmyq3w3cqi2yrfhjhn77s9h1137l-uniplate-1.6.13.drv' to 'https://cache.nix-ci.com'...
  2452. 511.85 s [post-build-hook] copying path '/nix/store/l3qz8wb5m0i7s98r8j6cqp29f3bcm57r-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  2453. 511.85 s [post-build-hook] copying path '/nix/store/wbs1bxqqbpwm3pyaq922vz23j7q05dcy-semigroupoids-6.0.1.drv' to 'https://cache.nix-ci.com'...
  2454. 511.85 s [post-build-hook] copying path '/nix/store/nfhdaidzrx4j6r2yb3zn1bpm8qml36jg-semirings-0.7.drv' to 'https://cache.nix-ci.com'...
  2455. 512.07 s [post-build-hook] copying path '/nix/store/8njcsyk8kvy80dc0xjm7kric6vabv05b-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  2456. 512.07 s [post-build-hook] copying path '/nix/store/jfpdhd1q5kk5vi8q2a01db83ww2f54c0-text-iso8601-0.1.1.drv' to 'https://cache.nix-ci.com'...
  2457. 512.07 s [post-build-hook] copying path '/nix/store/rvga7kk839hyjv09gc73xzsbhmvml8r1-indexed-traversable-instances-0.1.2.drv' to 'https://cache.nix-ci.com'...
  2458. 512.07 s [post-build-hook] copying path '/nix/store/3fqvy35j2yw7q3srrfzgqcki5iyrhkx3-foldl-1.4.18.drv' to 'https://cache.nix-ci.com'...
  2459. 512.07 s [post-build-hook] copying path '/nix/store/k7z9k5y432sbbgkkp8yc9yrfpqxwqjlc-free-5.2.drv' to 'https://cache.nix-ci.com'...
  2460. 512.32 s [post-build-hook] copying path '/nix/store/d0sb8macak0a371f4w26fxy0ak5p5rih-ghc-lib-parser-ex-9.8.0.2.drv' to 'https://cache.nix-ci.com'...
  2461. 512.33 s [post-build-hook] copying path '/nix/store/ypvyrqh4xrdlhmj5wz9s0fbzs2lml5rc-filepattern-0.1.3.drv' to 'https://cache.nix-ci.com'...
  2462. 512.33 s [post-build-hook] copying path '/nix/store/jhs9jcf5d5j2g0izjzn2z2p5jpkcbzv9-witherable-0.5.drv' to 'https://cache.nix-ci.com'...
  2463. 512.33 s [post-build-hook] copying path '/nix/store/mc77pkq25gvz035qbydbqf5p5nxlr5k6-semialign-1.3.1.drv' to 'https://cache.nix-ci.com'...
  2464. 512.33 s [post-build-hook] copying path '/nix/store/4b5jahmj1zmi2q9krp17rsbwksdhw5vh-ghc-exactprint-1.7.1.0.drv' to 'https://cache.nix-ci.com'...
  2465. 512.54 s [post-build-hook] copying path '/nix/store/nywgzhwk47k7j0iqrp7zqcyl1r7b1m0c-aeson-2.2.3.0.drv' to 'https://cache.nix-ci.com'...
  2466. 512.59 s [post-build-hook] copying path '/nix/store/rnpcxsmmmlkkcs5m4x90j2d91drzc64z-apply-refact-0.15.0.0.drv' to 'https://cache.nix-ci.com'...
  2467. 512.84 s [post-build-hook] copying path '/nix/store/zl13dkzxchv1p3xa5605vfwjmpdqh27f-quickcheck-classes-0.6.5.0.drv' to 'https://cache.nix-ci.com'...
  2468. 512.84 s [post-build-hook] copying path '/nix/store/62jd1xf53aczb66d5v2d5qn7q9qw89gx-HTF-0.15.0.2.drv' to 'https://cache.nix-ci.com'...
  2469. 512.84 s [post-build-hook] copying path '/nix/store/aqq1hdzjp62p4pnj0390ggkrr9k5pr3a-deriving-aeson-0.2.10.drv' to 'https://cache.nix-ci.com'...
  2470. 512.84 s [post-build-hook] copying path '/nix/store/lc907lv31k9wz9bawbhg3vgglw1i80b5-attoparsec-aeson-2.2.2.0.drv' to 'https://cache.nix-ci.com'...
  2471. 513.09 s [post-build-hook] copying path '/nix/store/n7sgx3c4wl8b9nigx1ccakn3mlcy2fl5-aeson-pretty-0.8.10.drv' to 'https://cache.nix-ci.com'...
  2472. 513.09 s [post-build-hook] copying path '/nix/store/2djbbx1y4ca60vdqqk2lbarnqf1nxmhh-bitvec-1.1.5.0.drv' to 'https://cache.nix-ci.com'...
  2473. 513.09 s [post-build-hook] copying path '/nix/store/dy3g6pd1wws3kb535ijwm68mx85kjzfz-list-t-1.0.5.7.drv' to 'https://cache.nix-ci.com'...
  2474. 513.60 s [post-build-hook] copying path '/nix/store/jxnnp72s41q197j5khm1dbyppdk5psa5-vector-algorithms-0.9.1.0.drv' to 'https://cache.nix-ci.com'...
  2475. 513.64 s [post-build-hook] copying path '/nix/store/48z571r4gm1rbzwzh62j2vfy9kkazd60-retrie-1.2.3.drv' to 'https://cache.nix-ci.com'...
  2476. 513.81 s [post-build-hook] copying path '/nix/store/xzjkngagvrzvjplwy2sp4ymaxq8a9v40-mono-traversable-1.0.21.0.drv' to 'https://cache.nix-ci.com'...
  2477. 514.02 s [post-build-hook] copying path '/nix/store/7n9m5z3ajbjbn9fjr12j6c2iibpxpvx3-conduit-1.3.6.1.drv' to 'https://cache.nix-ci.com'...
  2478. 514.24 s [post-build-hook] copying path '/nix/store/h476q6y7hms8qz13q5wqhk6jss7bskjv-libyaml-0.1.4.drv' to 'https://cache.nix-ci.com'...
  2479. 514.45 s [post-build-hook] copying path '/nix/store/04k9jvxmvbxzi7aw4n65l3jwdz8zvfdq-yaml-0.11.11.2.drv' to 'https://cache.nix-ci.com'...
  2480. 514.69 s [post-build-hook] copying path '/nix/store/76lch09dxy32bqyrw36ygpc85rzs8ax5-hlint-3.8.drv' to 'https://cache.nix-ci.com'...
  2481. 514.94 s [post-build-hook] copying path '/nix/store/cnzin3r1q71fgprsam2qfa0lc7mkybcg-monad-dijkstra-0.1.1.5.drv' to 'https://cache.nix-ci.com'...
  2482. 515.16 s [post-build-hook] copying path '/nix/store/kch4w2pdl27b77a7acgfcsy4qppmm050-floskell-0.11.1.drv' to 'https://cache.nix-ci.com'...
  2483. 515.41 s [post-build-hook] copying path '/nix/store/xj1m88nvjddmccvigs4nbpjrpr8w2cy9-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  2484. 515.72 s Progress: 3 of 5 built
  2485. 515.86 s Building ghc-shell-for-packages
  2486. 516.84 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0
  2487. 517.55 s [post-build-hook] Pushing 2 paths (877 are already present) using zstd to cache sellout ⏳
  2488. 517.55 s [post-build-hook]
  2489. 517.93 s [post-build-hook] Pushing /nix/store/2nz6ghwj4lif5nxwzmzc80y6hpyn0x9y-util-linux-minimal-2.41.3-login (95.23 KiB)
  2490. 518.10 s [post-build-hook] Pushing /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0 (336.00 B)
  2491. 519.16 s [post-build-hook]
  2492. 519.16 s [post-build-hook] All done.
  2493. 519.18 s [post-build-hook] Uploading to the NixCI cache: /nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0
  2494. 519.25 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2495. 519.32 s [post-build-hook] copying 1 paths...
  2496. 519.33 s [post-build-hook] copying path '/nix/store/bxg479kxnyfixrkkzix69c5j19i576iy-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  2497. 519.65 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2498. 520.04 s [post-build-hook] copying 1 paths...
  2499. 520.08 s [post-build-hook] copying path '/nix/store/g5dmpyig36i52nhvhjzsjkwjpyv3g3yc-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  2500. 520.28 s Progress: 4 of 5 built
More Logs Raw Logs

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/e483de29-ce2f-41bc-81aa-3d21d02458c4/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/e483de29-ce2f-41bc-81aa-3d21d02458c4/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/e483de29-ce2f-41bc-81aa-3d21d02458c4/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/e483de29-ce2f-41bc-81aa-3d21d02458c4/raw-logs

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

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/e483de29-ce2f-41bc-81aa-3d21d02458c4/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/e483de29-ce2f-41bc-81aa-3d21d02458c4/repro

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