build devShells.x86_64-linux.ghc967

Reproduce this run
  1. 1604.07 s [algebraic-graphs]
  2. 1604.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  3. 1604.07 s [algebraic-graphs] OK: emap h empty == empty
  4. 1604.07 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  5. 1604.07 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  6. 1604.07 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  7. 1604.07 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  8. 1604.07 s [algebraic-graphs] OK: emap id == id
  9. 1604.07 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  10. 1604.07 s [algebraic-graphs]
  11. 1604.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  12. 1604.07 s [algebraic-graphs] OK: induce (const True ) x == x
  13. 1604.07 s [algebraic-graphs] OK: induce (const False) x == empty
  14. 1604.07 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  15. 1604.07 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  16. 1604.07 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17. 1604.07 s [algebraic-graphs]
  18. 1604.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  19. 1605.33 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20. 1605.33 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21. 1605.33 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22. 1605.33 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23. 1605.33 s [algebraic-graphs]
  24. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  25. 1605.33 s [algebraic-graphs] OK: closure empty == empty
  26. 1605.33 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  27. 1605.33 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  28. 1605.33 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  29. 1605.33 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  30. 1605.33 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  31. 1605.33 s [algebraic-graphs] OK: closure . closure == closure
  32. 1605.33 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  33. 1605.33 s [algebraic-graphs]
  34. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  35. 1605.33 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  36. 1605.33 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  37. 1605.33 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  38. 1605.33 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  39. 1605.33 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  40. 1605.33 s [algebraic-graphs]
  41. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  42. 1605.33 s [algebraic-graphs] OK: symmetricClosure empty == empty
  43. 1605.33 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  44. 1605.33 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  45. 1605.33 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  46. 1605.33 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  47. 1605.33 s [algebraic-graphs]
  48. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  49. 1605.33 s [algebraic-graphs] OK: transitiveClosure empty == empty
  50. 1605.33 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  51. 1605.33 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  52. 1605.33 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  53. 1605.33 s [algebraic-graphs]
  54. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  55. 1605.33 s [algebraic-graphs] OK: isEmpty empty == True
  56. 1605.33 s [algebraic-graphs] OK: hasVertex x empty == False
  57. 1605.33 s [algebraic-graphs] OK: vertexCount empty == 0
  58. 1605.33 s [algebraic-graphs] OK: edgeCount empty == 0
  59. 1605.33 s [algebraic-graphs]
  60. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  61. 1605.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  62. 1605.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  63. 1605.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  64. 1605.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  65. 1605.33 s [algebraic-graphs]
  66. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  67. 1605.33 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  68. 1605.33 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  69. 1605.33 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  70. 1605.33 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  71. 1605.33 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  72. 1605.33 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  73. 1605.33 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  74. 1605.33 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  75. 1605.33 s [algebraic-graphs]
  76. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  77. 1605.33 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  78. 1605.33 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  79. 1605.33 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  80. 1605.33 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  81. 1605.33 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  82. 1605.33 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  83. 1605.33 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  84. 1605.33 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  85. 1605.33 s [algebraic-graphs]
  86. 1605.33 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  87. 1605.33 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  88. 1605.33 s [algebraic-graphs]
  89. 1605.33 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  90. 1605.33 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  91. 1605.33 s [algebraic-graphs]
  92. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  93. 1605.33 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  94. 1605.33 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  95. 1605.33 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  96. 1605.33 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  97. 1605.33 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  98. 1605.33 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  99. 1605.33 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  100. 1605.33 s [algebraic-graphs]
  101. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  102. 1605.33 s [algebraic-graphs] OK: vertices [] == empty
  103. 1605.33 s [algebraic-graphs] OK: vertices [x] == vertex x
  104. 1605.33 s [algebraic-graphs] OK: vertices == overlays . map vertex
  105. 1605.33 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  106. 1605.33 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  107. 1605.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  108. 1605.33 s [algebraic-graphs]
  109. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  110. 1605.33 s [algebraic-graphs] OK: edges [] == empty
  111. 1605.33 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  112. 1605.33 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  113. 1605.33 s [algebraic-graphs]
  114. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  115. 1605.33 s [algebraic-graphs] OK: overlays [] == empty
  116. 1605.33 s [algebraic-graphs] OK: overlays [x] == x
  117. 1605.33 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  118. 1605.33 s [algebraic-graphs] OK: overlays == foldr overlay empty
  119. 1605.33 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  120. 1605.33 s [algebraic-graphs]
  121. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  122. 1605.33 s [algebraic-graphs] OK: foldg empty vertex connect == id
  123. 1605.33 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  124. 1605.33 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  125. 1605.33 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  126. 1605.33 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  127. 1605.33 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  128. 1605.33 s [algebraic-graphs]
  129. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  130. 1605.33 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  131. 1605.33 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  132. 1605.33 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  133. 1605.33 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  134. 1605.33 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  135. 1605.33 s [algebraic-graphs]
  136. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  137. 1605.33 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  138. 1605.33 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  139. 1605.33 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  140. 1605.33 s [algebraic-graphs]
  141. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  142. 1605.33 s [algebraic-graphs] OK: isEmpty empty == True
  143. 1605.33 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  144. 1605.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  145. 1605.33 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  146. 1605.33 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  147. 1605.33 s [algebraic-graphs]
  148. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.size ============
  149. 1605.33 s [algebraic-graphs] OK: size empty == 1
  150. 1605.33 s [algebraic-graphs] OK: size (vertex x) == 1
  151. 1605.33 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  152. 1605.33 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  153. 1605.33 s [algebraic-graphs] OK: size x >= 1
  154. 1605.33 s [algebraic-graphs] OK: size x >= vertexCount x
  155. 1605.33 s [algebraic-graphs]
  156. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  157. 1605.33 s [algebraic-graphs] OK: hasVertex x empty == False
  158. 1605.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  159. 1605.33 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  160. 1605.33 s [algebraic-graphs]
  161. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  162. 1605.33 s [algebraic-graphs] OK: hasEdge x y empty == False
  163. 1605.33 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  164. 1605.33 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  165. 1605.33 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  166. 1605.33 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  167. 1605.33 s [algebraic-graphs]
  168. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  169. 1605.33 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  170. 1605.33 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  171. 1605.33 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  172. 1605.33 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  173. 1605.33 s [algebraic-graphs]
  174. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  175. 1605.33 s [algebraic-graphs] OK: vertexCount empty == 0
  176. 1605.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  177. 1605.33 s [algebraic-graphs] OK: vertexCount == length . vertexList
  178. 1605.33 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  179. 1605.33 s [algebraic-graphs]
  180. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  181. 1605.33 s [algebraic-graphs] OK: edgeCount empty == 0
  182. 1605.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  183. 1605.33 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  184. 1605.33 s [algebraic-graphs] OK: edgeCount == length . edgeList
  185. 1605.33 s [algebraic-graphs]
  186. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  187. 1605.33 s [algebraic-graphs] OK: vertexList empty == []
  188. 1605.33 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  189. 1605.33 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  190. 1605.33 s [algebraic-graphs]
  191. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  192. 1605.33 s [algebraic-graphs] OK: edgeList empty == []
  193. 1605.33 s [algebraic-graphs] OK: edgeList (vertex x) == []
  194. 1605.33 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  195. 1605.33 s [algebraic-graphs]
  196. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  197. 1605.33 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  198. 1605.33 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  199. 1605.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  200. 1605.33 s [algebraic-graphs]
  201. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  202. 1605.33 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  203. 1605.33 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  204. 1605.33 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  205. 1605.33 s [algebraic-graphs]
  206. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  207. 1605.33 s [algebraic-graphs] OK: preSet x empty == Set.empty
  208. 1605.33 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  209. 1606.34 s Waiting for lock on shellcheck
  210. 1606.77 s [haskell-language-server] Preprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  211. 1606.77 s [haskell-language-server] Building library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  212. 1606.96 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 )
  213. 1608.43 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  214. 1608.43 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  215. 1608.43 s [algebraic-graphs]
  216. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  217. 1608.43 s [algebraic-graphs] OK: postSet x empty == Set.empty
  218. 1608.43 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  219. 1608.43 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  220. 1608.43 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  221. 1608.43 s [algebraic-graphs]
  222. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  223. 1608.43 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  224. 1608.43 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  225. 1608.43 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  226. 1608.43 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  227. 1608.43 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  228. 1608.43 s [algebraic-graphs]
  229. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  230. 1608.43 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  231. 1608.43 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  232. 1608.43 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  233. 1608.43 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  234. 1608.43 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  235. 1608.43 s [algebraic-graphs]
  236. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  237. 1608.43 s [algebraic-graphs] OK: replaceVertex x x == id
  238. 1608.43 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  239. 1608.43 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  240. 1608.43 s [algebraic-graphs]
  241. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  242. 1608.43 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  243. 1608.43 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  244. 1608.43 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  245. 1608.43 s [algebraic-graphs]
  246. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  247. 1608.43 s [algebraic-graphs] OK: transpose empty == empty
  248. 1608.43 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  249. 1608.43 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  250. 1608.43 s [algebraic-graphs] OK: transpose . transpose == id
  251. 1608.43 s [algebraic-graphs]
  252. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  253. 1608.43 s [algebraic-graphs] OK: fmap f empty == empty
  254. 1608.43 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  255. 1608.43 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  256. 1608.43 s [algebraic-graphs] OK: fmap id == id
  257. 1608.43 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  258. 1608.43 s [algebraic-graphs]
  259. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  260. 1608.43 s [algebraic-graphs] OK: emap h empty == empty
  261. 1608.43 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  262. 1608.43 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  263. 1608.43 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  264. 1608.43 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  265. 1608.43 s [algebraic-graphs] OK: emap id == id
  266. 1608.43 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  267. 1608.43 s [algebraic-graphs]
  268. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  269. 1608.43 s [algebraic-graphs] OK: induce (const True ) x == x
  270. 1608.43 s [algebraic-graphs] OK: induce (const False) x == empty
  271. 1608.43 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  272. 1608.43 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  273. 1608.43 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  274. 1608.43 s [algebraic-graphs]
  275. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  276. 1608.43 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  277. 1608.43 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  278. 1608.43 s [algebraic-graphs] OK: induceJust . gmap Just == id
  279. 1608.43 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  280. 1608.43 s [algebraic-graphs]
  281. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  282. 1608.43 s [algebraic-graphs] OK: closure empty == empty
  283. 1608.43 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  284. 1608.43 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  285. 1608.43 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  286. 1608.43 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  287. 1608.43 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  288. 1608.43 s [algebraic-graphs] OK: closure . closure == closure
  289. 1608.43 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  290. 1608.43 s [algebraic-graphs]
  291. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  292. 1608.43 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  293. 1608.43 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  294. 1608.43 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  295. 1608.43 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  296. 1608.43 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  297. 1608.43 s [algebraic-graphs]
  298. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  299. 1608.43 s [algebraic-graphs] OK: symmetricClosure empty == empty
  300. 1608.43 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  301. 1608.43 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  302. 1608.43 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  303. 1608.43 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  304. 1608.43 s [algebraic-graphs]
  305. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  306. 1608.43 s [algebraic-graphs] OK: transitiveClosure empty == empty
  307. 1608.43 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  308. 1608.43 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  309. 1608.43 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  310. 1608.43 s [algebraic-graphs]
  311. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.context ============
  312. 1608.43 s [algebraic-graphs] OK: context (const False) x == Nothing
  313. 1608.43 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  314. 1608.43 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  315. 1608.43 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  316. 1608.43 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  317. 1608.43 s [algebraic-graphs]
  318. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  319. 1608.43 s [algebraic-graphs] OK: Axioms of non-empty graphs
  320. 1608.43 s [algebraic-graphs] OK: Theorems of non-empty graphs
  321. 1608.43 s [algebraic-graphs]
  322. 1608.43 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  323. 1608.43 s [algebraic-graphs] OK: vertex 1 < vertex 2
  324. 1608.43 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  325. 1608.43 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  326. 1608.43 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  327. 1608.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  328. 1608.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  329. 1608.43 s [algebraic-graphs] OK: x <= x + y
  330. 1608.43 s [algebraic-graphs] OK: x + y <= x * y
  331. 1608.43 s [algebraic-graphs]
  332. 1608.43 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  333. 1608.43 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  334. 1608.43 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  335. 1608.43 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  336. 1608.43 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  337. 1608.43 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  338. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  339. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  340. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  341. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  342. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  343. 1608.43 s [algebraic-graphs]
  344. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  345. 1608.43 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  346. 1608.43 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  347. 1608.43 s [algebraic-graphs]
  348. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  349. 1608.43 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  350. 1608.43 s [algebraic-graphs]
  351. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  352. 1608.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  353. 1608.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  354. 1608.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  355. 1608.43 s [algebraic-graphs]
  356. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  357. 1608.43 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  358. 1608.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  359. 1608.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  360. 1608.43 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  361. 1608.43 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  362. 1608.43 s [algebraic-graphs]
  363. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  364. 1608.43 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  365. 1608.43 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  366. 1608.43 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  367. 1608.43 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  368. 1608.43 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  369. 1608.43 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  370. 1608.43 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  371. 1608.43 s [algebraic-graphs]
  372. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  373. 1608.43 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  374. 1608.43 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  375. 1608.43 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  376. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  377. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  378. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  379. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  380. 1608.43 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  381. 1608.43 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  382. 1608.43 s [algebraic-graphs]
  383. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  384. 1608.43 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  385. 1608.43 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  386. 1608.43 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  387. 1608.43 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  388. 1608.43 s [algebraic-graphs]
  389. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  390. 1608.43 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  391. 1608.43 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  392. 1608.43 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  393. 1608.43 s [algebraic-graphs]
  394. 1608.44 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 )
  395. 1609.15 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 )
  396. 1610.74 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 )
  397. 1611.75 s Waiting for lock on bash-language-server
  398. 1611.86 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  399. 1611.86 s [algebraic-graphs] OK: overlays1 [x] == x
  400. 1611.89 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  401. 1611.89 s [algebraic-graphs]
  402. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  403. 1611.89 s [algebraic-graphs] OK: connects1 [x] == x
  404. 1611.89 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  405. 1611.89 s [algebraic-graphs]
  406. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  407. 1611.89 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  408. 1611.89 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  409. 1611.89 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  410. 1611.89 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  411. 1611.89 s [algebraic-graphs]
  412. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  413. 1611.89 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  414. 1611.89 s [algebraic-graphs]
  415. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  416. 1611.89 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  417. 1611.89 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  418. 1611.89 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  419. 1611.89 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  420. 1611.89 s [algebraic-graphs]
  421. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  422. 1611.89 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  423. 1611.89 s [algebraic-graphs] OK: vertexCount x >= 1
  424. 1611.89 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  425. 1611.89 s [algebraic-graphs]
  426. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  427. 1611.89 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  428. 1611.89 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  429. 1611.89 s [algebraic-graphs] OK: edgeCount == length . edgeList
  430. 1611.89 s [algebraic-graphs]
  431. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  432. 1611.89 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  433. 1611.89 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  434. 1611.89 s [algebraic-graphs]
  435. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  436. 1611.89 s [algebraic-graphs] OK: edgeList (vertex x) == []
  437. 1611.89 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  438. 1611.89 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  439. 1611.89 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  440. 1611.89 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  441. 1611.89 s [algebraic-graphs]
  442. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  443. 1611.89 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  444. 1611.89 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  445. 1611.89 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  446. 1611.89 s [algebraic-graphs]
  447. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  448. 1611.89 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  449. 1611.89 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  450. 1611.89 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  451. 1611.89 s [algebraic-graphs]
  452. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  453. 1611.89 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  454. 1611.89 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  455. 1611.89 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  456. 1611.89 s [algebraic-graphs]
  457. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  458. 1611.89 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  459. 1611.89 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  460. 1611.89 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  461. 1611.89 s [algebraic-graphs]
  462. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  463. 1611.89 s [algebraic-graphs] OK: path1 [x] == vertex x
  464. 1611.89 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  465. 1611.89 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  466. 1611.89 s [algebraic-graphs]
  467. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  468. 1611.89 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  469. 1611.89 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  470. 1611.89 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  471. 1611.89 s [algebraic-graphs]
  472. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  473. 1611.89 s [algebraic-graphs] OK: clique1 [x] == vertex x
  474. 1611.89 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  475. 1611.89 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  476. 1611.89 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  477. 1611.89 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  478. 1611.89 s [algebraic-graphs]
  479. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  480. 1611.89 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  481. 1611.89 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  482. 1611.89 s [algebraic-graphs]
  483. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  484. 1611.89 s [algebraic-graphs] OK: star x [] == vertex x
  485. 1611.89 s [algebraic-graphs] OK: star x [y] == edge x y
  486. 1611.89 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  487. 1611.89 s [algebraic-graphs]
  488. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  489. 1611.89 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  490. 1611.89 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  491. 1611.89 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  492. 1611.89 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  493. 1611.89 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  494. 1611.89 s [algebraic-graphs]
  495. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  496. 1611.89 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  497. 1611.89 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  498. 1611.89 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  499. 1611.89 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  500. 1611.89 s [algebraic-graphs]
  501. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  502. 1611.89 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  503. 1611.89 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  504. 1611.89 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  505. 1611.89 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  506. 1611.89 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  507. 1611.89 s [algebraic-graphs]
  508. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  509. 1611.89 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  510. 1611.89 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  511. 1611.89 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  512. 1611.89 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  513. 1611.89 s [algebraic-graphs]
  514. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  515. 1611.89 s [algebraic-graphs] OK: replaceVertex x x == id
  516. 1611.89 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  517. 1611.89 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  518. 1611.89 s [algebraic-graphs]
  519. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  520. 1611.89 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  521. 1611.89 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  522. 1611.89 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  523. 1611.89 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  524. 1611.89 s [algebraic-graphs]
  525. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  526. 1611.89 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  527. 1611.89 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  528. 1611.89 s [algebraic-graphs] OK: transpose . transpose == id
  529. 1611.89 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  530. 1611.89 s [algebraic-graphs]
  531. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  532. 1611.89 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  533. 1611.89 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  534. 1611.89 s [algebraic-graphs] OK: gmap id == id
  535. 1611.89 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  536. 1611.89 s [algebraic-graphs]
  537. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  538. 1611.89 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  539. 1611.89 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  540. 1611.89 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  541. 1611.89 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  542. 1611.89 s [algebraic-graphs]
  543. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  544. 1611.89 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  545. 1611.89 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  546. 1611.89 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  547. 1611.89 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  548. 1611.89 s [algebraic-graphs]
  549. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  550. 1611.89 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  551. 1611.89 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  552. 1611.89 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  553. 1611.89 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  554. 1611.89 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  555. 1611.89 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  556. 1611.89 s [algebraic-graphs] OK: closure . closure == closure
  557. 1611.89 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  558. 1611.89 s [algebraic-graphs]
  559. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  560. 1611.89 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  561. 1611.89 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  562. 1611.89 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  563. 1611.89 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  564. 1611.89 s [algebraic-graphs]
  565. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  566. 1611.89 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  567. 1611.89 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  568. 1611.89 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  569. 1611.89 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  570. 1611.89 s [algebraic-graphs]
  571. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  572. 1611.89 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  573. 1611.89 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  574. 1611.89 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  575. 1611.89 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  576. 1611.90 s [algebraic-graphs]
  577. 1611.90 s [algebraic-graphs] ============ NonEmpty.Graph.============
  578. 1611.90 s [algebraic-graphs] OK: Axioms of non-empty graphs
  579. 1611.90 s [algebraic-graphs] OK: Theorems of non-empty graphs
  580. 1611.90 s [algebraic-graphs]
  581. 1611.90 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  582. 1611.90 s [algebraic-graphs] OK: vertex 1 < vertex 2
  583. 1611.90 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  584. 1611.90 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  585. 1611.90 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  586. 1611.90 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  587. 1611.90 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  588. 1611.90 s [algebraic-graphs] OK: x <= x + y
  589. 1611.90 s [algebraic-graphs] OK: x + y <= x * y
  590. 1611.90 s [algebraic-graphs]
  591. 1611.90 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  592. 1611.90 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  593. 1611.90 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  594. 1611.90 s [algebraic-graphs] OK: fmap id == id
  595. 1611.90 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  596. 1611.90 s [algebraic-graphs]
  597. 1611.90 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  598. 1611.90 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  599. 1612.12 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 )
  600. 1612.79 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 )
  601. 1613.33 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  602. 1613.33 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  603. 1613.33 s [algebraic-graphs] OK: (x >>= vertex) == x
  604. 1613.33 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  605. 1613.33 s [algebraic-graphs]
  606. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  607. 1613.33 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  608. 1613.33 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  609. 1613.33 s [algebraic-graphs]
  610. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  611. 1613.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  612. 1613.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  613. 1613.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  614. 1613.33 s [algebraic-graphs] OK: size (vertex x) == 1
  615. 1613.33 s [algebraic-graphs]
  616. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  617. 1613.33 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  618. 1613.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  619. 1613.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  620. 1613.33 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  621. 1613.33 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  622. 1613.33 s [algebraic-graphs]
  623. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  624. 1613.33 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  625. 1613.33 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  626. 1613.33 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  627. 1613.33 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  628. 1613.33 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  629. 1613.33 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  630. 1613.33 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  631. 1613.33 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  632. 1613.33 s [algebraic-graphs]
  633. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  634. 1613.33 s [algebraic-graphs] OK: overlay1 empty x == x
  635. 1613.33 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  636. 1613.33 s [algebraic-graphs]
  637. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  638. 1613.33 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  639. 1613.33 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  640. 1613.33 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  641. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  642. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  643. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  644. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  645. 1613.33 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  646. 1613.33 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  647. 1613.33 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  648. 1613.33 s [algebraic-graphs]
  649. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  650. 1613.33 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  651. 1613.33 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  652. 1613.33 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  653. 1613.33 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  654. 1613.33 s [algebraic-graphs]
  655. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  656. 1613.33 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  657. 1613.33 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  658. 1613.33 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  659. 1613.33 s [algebraic-graphs]
  660. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  661. 1613.33 s [algebraic-graphs] OK: overlays1 [x] == x
  662. 1613.33 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  663. 1613.33 s [algebraic-graphs]
  664. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  665. 1613.33 s [algebraic-graphs] OK: connects1 [x] == x
  666. 1613.33 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  667. 1613.33 s [algebraic-graphs]
  668. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  669. 1613.33 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  670. 1613.33 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  671. 1613.33 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  672. 1613.33 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  673. 1613.33 s [algebraic-graphs]
  674. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  675. 1613.33 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  676. 1613.34 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  677. 1613.34 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  678. 1613.34 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  679. 1613.34 s [algebraic-graphs]
  680. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  681. 1613.34 s [algebraic-graphs] OK: x === x == True
  682. 1613.34 s [algebraic-graphs] OK: x + y === x + y == True
  683. 1613.34 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  684. 1613.34 s [algebraic-graphs] OK: x + y === x * y == False
  685. 1613.34 s [algebraic-graphs]
  686. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  687. 1613.34 s [algebraic-graphs] OK: size (vertex x) == 1
  688. 1613.34 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  689. 1613.34 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  690. 1613.34 s [algebraic-graphs] OK: size x >= 1
  691. 1613.34 s [algebraic-graphs] OK: size x >= vertexCount x
  692. 1613.34 s [algebraic-graphs]
  693. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  694. 1613.34 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  695. 1613.34 s [algebraic-graphs]
  696. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  697. 1613.34 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  698. 1613.34 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  699. 1613.34 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  700. 1613.34 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  701. 1613.34 s [algebraic-graphs]
  702. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  703. 1613.34 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  704. 1613.34 s [algebraic-graphs] OK: vertexCount x >= 1
  705. 1613.34 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  706. 1613.34 s [algebraic-graphs]
  707. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  708. 1613.34 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  709. 1613.34 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  710. 1613.34 s [algebraic-graphs] OK: edgeCount == length . edgeList
  711. 1613.34 s [algebraic-graphs]
  712. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  713. 1613.34 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  714. 1613.34 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  715. 1613.34 s [algebraic-graphs]
  716. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  717. 1613.34 s [algebraic-graphs] OK: edgeList (vertex x) == []
  718. 1613.34 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  719. 1613.34 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  720. 1613.34 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  721. 1613.34 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  722. 1613.34 s [algebraic-graphs]
  723. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  724. 1613.34 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  725. 1613.34 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  726. 1613.34 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  727. 1613.34 s [algebraic-graphs]
  728. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  729. 1613.34 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  730. 1613.34 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  731. 1613.34 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  732. 1613.34 s [algebraic-graphs]
  733. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  734. 1613.34 s [algebraic-graphs] OK: path1 [x] == vertex x
  735. 1613.34 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  736. 1613.34 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  737. 1613.34 s [algebraic-graphs]
  738. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  739. 1613.34 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  740. 1613.34 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  741. 1613.34 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  742. 1613.34 s [algebraic-graphs]
  743. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  744. 1613.34 s [algebraic-graphs] OK: clique1 [x] == vertex x
  745. 1613.34 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  746. 1613.34 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  747. 1613.34 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  748. 1613.34 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  749. 1613.34 s [algebraic-graphs]
  750. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  751. 1613.34 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  752. 1613.34 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  753. 1613.34 s [algebraic-graphs]
  754. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  755. 1613.34 s [algebraic-graphs] OK: star x [] == vertex x
  756. 1613.34 s [algebraic-graphs] OK: star x [y] == edge x y
  757. 1613.34 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  758. 1613.34 s [algebraic-graphs]
  759. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  760. 1613.34 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  761. 1613.34 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  762. 1613.34 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  763. 1613.34 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  764. 1613.34 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  765. 1613.34 s [algebraic-graphs]
  766. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  767. 1613.34 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  768. 1613.34 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  769. 1613.34 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  770. 1613.34 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  771. 1613.34 s [algebraic-graphs]
  772. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  773. 1613.34 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  774. 1613.34 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  775. 1613.34 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  776. 1613.34 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  777. 1613.34 s [algebraic-graphs]
  778. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  779. 1613.34 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  780. 1613.34 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  781. 1613.34 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  782. 1613.34 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  783. 1613.34 s [algebraic-graphs]
  784. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  785. 1613.34 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  786. 1613.34 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  787. 1613.34 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  788. 1613.34 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  789. 1613.34 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  790. 1613.34 s [algebraic-graphs]
  791. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  792. 1613.34 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  793. 1613.34 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  794. 1613.34 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  795. 1613.34 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  796. 1613.34 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  797. 1613.34 s [algebraic-graphs]
  798. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  799. 1613.34 s [algebraic-graphs] OK: replaceVertex x x == id
  800. 1613.34 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  801. 1613.34 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  802. 1613.34 s [algebraic-graphs]
  803. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  804. 1613.34 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  805. 1620.66 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  806. 1620.66 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  807. 1620.67 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  808. 1620.67 s [algebraic-graphs]
  809. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  810. 1620.67 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  811. 1620.67 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  812. 1620.67 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  813. 1620.67 s [algebraic-graphs]
  814. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  815. 1620.67 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  816. 1620.67 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  817. 1620.67 s [algebraic-graphs] OK: transpose . transpose == id
  818. 1620.67 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  819. 1620.67 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  820. 1620.67 s [algebraic-graphs]
  821. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  822. 1620.67 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  823. 1620.67 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  824. 1620.67 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  825. 1620.67 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  826. 1620.67 s [algebraic-graphs]
  827. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  828. 1620.67 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  829. 1620.67 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  830. 1620.67 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  831. 1620.67 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  832. 1620.67 s [algebraic-graphs]
  833. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  834. 1620.67 s [algebraic-graphs] OK: simplify == id
  835. 1620.67 s [algebraic-graphs] OK: size (simplify x) <= size x
  836. 1620.67 s [algebraic-graphs] OK: simplify 1 === 1
  837. 1620.67 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  838. 1620.67 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  839. 1620.67 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  840. 1620.67 s [algebraic-graphs]
  841. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  842. 1620.67 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  843. 1620.67 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  844. 1620.67 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  845. 1620.67 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  846. 1620.67 s [algebraic-graphs]
  847. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  848. 1620.67 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  849. 1620.67 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  850. 1620.67 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  851. 1620.67 s [algebraic-graphs]
  852. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  853. 1620.67 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  854. 1620.67 s [algebraic-graphs] OK: box x y ~~ box y x
  855. 1620.67 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  856. 1620.67 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  857. 1620.67 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  858. 1620.67 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  859. 1620.67 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  860. 1620.67 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  861. 1620.67 s [algebraic-graphs]
  862. 1620.67 s [algebraic-graphs] ============ Relation ============
  863. 1620.67 s [algebraic-graphs] OK: Axioms of graphs
  864. 1620.67 s [algebraic-graphs]
  865. 1620.67 s [algebraic-graphs] ============ Relation.consistent ============
  866. 1620.67 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  867. 1620.67 s [algebraic-graphs]
  868. 1620.67 s [algebraic-graphs] OK: consistent empty == True
  869. 1620.67 s [algebraic-graphs] OK: consistent (vertex x) == True
  870. 1620.67 s [algebraic-graphs] OK: consistent (overlay x y) == True
  871. 1620.67 s [algebraic-graphs] OK: consistent (connect x y) == True
  872. 1620.67 s [algebraic-graphs] OK: consistent (edge x y) == True
  873. 1620.67 s [algebraic-graphs] OK: consistent (edges xs) == True
  874. 1620.67 s [algebraic-graphs] OK: consistent (stars xs) == True
  875. 1620.67 s [algebraic-graphs]
  876. 1620.67 s [algebraic-graphs] ============ Relation.Show ============
  877. 1620.67 s [algebraic-graphs] OK: show (empty ) == "empty"
  878. 1620.67 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  879. 1620.67 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  880. 1620.67 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  881. 1620.67 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  882. 1620.67 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  883. 1620.67 s [algebraic-graphs]
  884. 1620.67 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  885. 1620.67 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  886. 1620.67 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  887. 1620.67 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  888. 1620.67 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  889. 1620.67 s [algebraic-graphs]
  890. 1620.67 s [algebraic-graphs] ============ Relation.Ord ============
  891. 1620.67 s [algebraic-graphs] OK: vertex 1 < vertex 2
  892. 1620.67 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  893. 1620.67 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  894. 1620.67 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  895. 1620.67 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  896. 1620.67 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  897. 1620.67 s [algebraic-graphs] OK: x <= x + y
  898. 1620.67 s [algebraic-graphs] OK: x + y <= x * y
  899. 1620.67 s [algebraic-graphs]
  900. 1620.67 s [algebraic-graphs] ============ Relation.empty ============
  901. 1620.67 s [algebraic-graphs] OK: isEmpty empty == True
  902. 1620.67 s [algebraic-graphs] OK: hasVertex x empty == False
  903. 1620.67 s [algebraic-graphs] OK: vertexCount empty == 0
  904. 1620.67 s [algebraic-graphs] OK: edgeCount empty == 0
  905. 1620.67 s [algebraic-graphs]
  906. 1620.67 s [algebraic-graphs] ============ Relation.vertex ============
  907. 1620.67 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  908. 1620.67 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  909. 1620.67 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  910. 1620.67 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  911. 1620.67 s [algebraic-graphs]
  912. 1620.67 s [algebraic-graphs] ============ Relation.edge ============
  913. 1620.67 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  914. 1620.67 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  915. 1620.67 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  916. 1620.67 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  917. 1620.67 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  918. 1620.67 s [algebraic-graphs]
  919. 1620.67 s [algebraic-graphs] ============ Relation.overlay ============
  920. 1620.67 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  921. 1620.67 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  922. 1620.67 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  923. 1620.67 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  924. 1620.67 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  925. 1620.67 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  926. 1620.67 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  927. 1620.67 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  928. 1620.67 s [algebraic-graphs]
  929. 1620.67 s [algebraic-graphs] ============ Relation.connect ============
  930. 1620.67 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  931. 1620.67 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  932. 1620.67 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  933. 1620.67 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  934. 1620.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  935. 1620.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  936. 1620.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  937. 1620.68 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  938. 1620.68 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  939. 1620.68 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  940. 1620.68 s [algebraic-graphs]
  941. 1620.68 s [algebraic-graphs] ============ Relation.vertices ============
  942. 1620.68 s [algebraic-graphs] OK: vertices [] == empty
  943. 1620.68 s [algebraic-graphs] OK: vertices [x] == vertex x
  944. 1620.68 s [algebraic-graphs] OK: vertices == overlays . map vertex
  945. 1620.68 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  946. 1620.68 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  947. 1620.68 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  948. 1620.68 s [algebraic-graphs]
  949. 1620.68 s [algebraic-graphs] ============ Relation.edges ============
  950. 1620.68 s [algebraic-graphs] OK: edges [] == empty
  951. 1620.68 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  952. 1620.68 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  953. 1620.68 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  954. 1620.68 s [algebraic-graphs]
  955. 1620.68 s [algebraic-graphs] ============ Relation.overlays ============
  956. 1620.68 s [algebraic-graphs] OK: overlays [] == empty
  957. 1620.68 s [algebraic-graphs] OK: overlays [x] == x
  958. 1620.68 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  959. 1620.68 s [algebraic-graphs] OK: overlays == foldr overlay empty
  960. 1620.68 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  961. 1620.68 s [algebraic-graphs]
  962. 1620.68 s [algebraic-graphs] ============ Relation.connects ============
  963. 1620.68 s [algebraic-graphs] OK: connects [] == empty
  964. 1620.68 s [algebraic-graphs] OK: connects [x] == x
  965. 1620.68 s [algebraic-graphs] OK: connects [x,y] == connect x y
  966. 1620.68 s [algebraic-graphs] OK: connects == foldr connect empty
  967. 1620.68 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  968. 1620.68 s [algebraic-graphs]
  969. 1620.68 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  970. 1620.68 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  971. 1620.68 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  972. 1620.68 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  973. 1620.68 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  974. 1620.68 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  975. 1620.68 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  976. 1620.68 s [algebraic-graphs]
  977. 1620.68 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  978. 1620.68 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  979. 1620.68 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  980. 1620.68 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  981. 1620.68 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  982. 1620.68 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  983. 1620.68 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  984. 1620.68 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  985. 1620.68 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  986. 1620.68 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  987. 1620.68 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  988. 1620.68 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  989. 1620.68 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  990. 1620.68 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  991. 1620.68 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  992. 1620.68 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  993. 1620.68 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  994. 1620.68 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  995. 1621.09 s [haskell-language-server] Preprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  996. 1621.09 s [haskell-language-server] Building library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  997. 1621.23 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 )
  998. 1623.24 s Waiting for lock on project-manager-path-for-duoids
  999. 1623.36 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 )
  1000. 1624.25 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1001. 1624.25 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1002. 1624.25 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1003. 1624.25 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1004. 1624.25 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1005. 1624.25 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1006. 1624.25 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1007. 1624.25 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1008. 1624.25 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1009. 1624.25 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1010. 1624.25 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1011. 1624.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1012. 1624.25 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1013. 1624.25 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1014. 1624.25 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1015. 1624.25 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1016. 1624.25 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1017. 1624.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1018. 1624.25 s [algebraic-graphs]
  1019. 1624.25 s [algebraic-graphs] ============ Relation.foldg ============
  1020. 1624.25 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  1021. 1624.25 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  1022. 1624.25 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  1023. 1624.25 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  1024. 1624.25 s [algebraic-graphs]
  1025. 1624.25 s [algebraic-graphs] ============ Relation.isEmpty ============
  1026. 1624.25 s [algebraic-graphs] OK: isEmpty empty == True
  1027. 1624.25 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1028. 1624.25 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1029. 1624.25 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1030. 1624.25 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1031. 1624.25 s [algebraic-graphs]
  1032. 1624.25 s [algebraic-graphs] ============ Relation.hasVertex ============
  1033. 1624.25 s [algebraic-graphs] OK: hasVertex x empty == False
  1034. 1624.25 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1035. 1624.25 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1036. 1624.25 s [algebraic-graphs]
  1037. 1624.25 s [algebraic-graphs] ============ Relation.hasEdge ============
  1038. 1624.25 s [algebraic-graphs] OK: hasEdge x y empty == False
  1039. 1624.25 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1040. 1624.25 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1041. 1624.25 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1042. 1624.25 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  1043. 1624.25 s [algebraic-graphs]
  1044. 1624.25 s [algebraic-graphs] ============ Relation.vertexCount ============
  1045. 1624.25 s [algebraic-graphs] OK: vertexCount empty == 0
  1046. 1624.25 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1047. 1624.25 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1048. 1624.25 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1049. 1624.25 s [algebraic-graphs]
  1050. 1624.25 s [algebraic-graphs] ============ Relation.edgeCount ============
  1051. 1624.25 s [algebraic-graphs] OK: edgeCount empty == 0
  1052. 1624.25 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1053. 1624.25 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1054. 1624.25 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1055. 1624.25 s [algebraic-graphs]
  1056. 1624.25 s [algebraic-graphs] ============ Relation.vertexList ============
  1057. 1624.25 s [algebraic-graphs] OK: vertexList empty == []
  1058. 1624.25 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1059. 1624.25 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1060. 1624.25 s [algebraic-graphs]
  1061. 1624.25 s [algebraic-graphs] ============ Relation.vertexSet ============
  1062. 1624.25 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1063. 1624.25 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1064. 1624.25 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1065. 1624.25 s [algebraic-graphs]
  1066. 1624.25 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  1067. 1624.25 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1068. 1624.25 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1069. 1624.25 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1070. 1624.25 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1071. 1624.25 s [algebraic-graphs]
  1072. 1624.25 s [algebraic-graphs] ============ Relation.edgeList ============
  1073. 1624.25 s [algebraic-graphs] OK: edgeList empty == []
  1074. 1624.25 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1075. 1624.25 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  1076. 1624.25 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  1077. 1624.25 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  1078. 1624.25 s [algebraic-graphs]
  1079. 1624.25 s [algebraic-graphs] ============ Relation.edgeSet ============
  1080. 1624.25 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1081. 1624.25 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1082. 1624.25 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  1083. 1624.25 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  1084. 1624.25 s [algebraic-graphs]
  1085. 1624.25 s [algebraic-graphs] ============ Relation.adjacencyList ============
  1086. 1624.25 s [algebraic-graphs] OK: adjacencyList empty == []
  1087. 1624.25 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1088. 1624.25 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  1089. 1624.25 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  1090. 1624.25 s [algebraic-graphs]
  1091. 1624.25 s [algebraic-graphs] ============ Relation.preSet ============
  1092. 1624.25 s [algebraic-graphs] OK: preSet x empty == Set.empty
  1093. 1624.25 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  1094. 1624.25 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  1095. 1624.25 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  1096. 1624.25 s [algebraic-graphs]
  1097. 1624.25 s [algebraic-graphs] ============ Relation.preIntSet ============
  1098. 1624.25 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  1099. 1624.25 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  1100. 1624.25 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  1101. 1624.25 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  1102. 1624.25 s [algebraic-graphs]
  1103. 1624.25 s [algebraic-graphs] ============ Relation.postSet ============
  1104. 1624.25 s [algebraic-graphs] OK: postSet x empty == Set.empty
  1105. 1624.25 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  1106. 1624.25 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  1107. 1624.25 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  1108. 1624.25 s [algebraic-graphs]
  1109. 1624.25 s [algebraic-graphs] ============ Relation.postIntSet ============
  1110. 1624.25 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  1111. 1624.25 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  1112. 1624.25 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  1113. 1624.25 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  1114. 1624.25 s [algebraic-graphs]
  1115. 1624.25 s [algebraic-graphs] ============ Relation.path ============
  1116. 1624.25 s [algebraic-graphs] OK: path [] == empty
  1117. 1624.25 s [algebraic-graphs] OK: path [x] == vertex x
  1118. 1624.25 s [algebraic-graphs] OK: path [x,y] == edge x y
  1119. 1624.25 s [algebraic-graphs]
  1120. 1624.25 s [algebraic-graphs] ============ Relation.circuit ============
  1121. 1624.25 s [algebraic-graphs] OK: circuit [] == empty
  1122. 1624.25 s [algebraic-graphs] OK: circuit [x] == edge x x
  1123. 1624.25 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1124. 1624.25 s [algebraic-graphs]
  1125. 1624.25 s [algebraic-graphs] ============ Relation.clique ============
  1126. 1624.25 s [algebraic-graphs] OK: clique [] == empty
  1127. 1624.25 s [algebraic-graphs] OK: clique [x] == vertex x
  1128. 1624.25 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1129. 1624.25 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1130. 1624.25 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1131. 1624.25 s [algebraic-graphs]
  1132. 1624.25 s [algebraic-graphs] ============ Relation.biclique ============
  1133. 1624.25 s [algebraic-graphs] OK: biclique [] [] == empty
  1134. 1624.25 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1135. 1624.25 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1136. 1624.25 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1137. 1624.25 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1138. 1624.25 s [algebraic-graphs]
  1139. 1624.25 s [algebraic-graphs] ============ Relation.star ============
  1140. 1624.25 s [algebraic-graphs] OK: star x [] == vertex x
  1141. 1624.25 s [algebraic-graphs] OK: star x [y] == edge x y
  1142. 1624.25 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1143. 1624.25 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1144. 1624.25 s [algebraic-graphs]
  1145. 1624.25 s [algebraic-graphs] ============ Relation.stars ============
  1146. 1624.25 s [algebraic-graphs] OK: stars [] == empty
  1147. 1624.25 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1148. 1624.25 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1149. 1624.25 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1150. 1624.25 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1151. 1624.25 s [algebraic-graphs] OK: stars . adjacencyList == id
  1152. 1624.25 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1153. 1624.25 s [algebraic-graphs]
  1154. 1624.25 s [algebraic-graphs] ============ Relation.tree ============
  1155. 1624.25 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1156. 1624.25 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1157. 1624.25 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1158. 1624.25 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1159. 1624.25 s [algebraic-graphs]
  1160. 1624.25 s [algebraic-graphs] ============ Relation.forest ============
  1161. 1624.25 s [algebraic-graphs] OK: forest [] == empty
  1162. 1624.25 s [algebraic-graphs] OK: forest [x] == tree x
  1163. 1624.25 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1164. 1624.25 s [algebraic-graphs] OK: forest == overlays . map tree
  1165. 1624.25 s [algebraic-graphs]
  1166. 1624.25 s [algebraic-graphs] ============ Relation.removeVertex ============
  1167. 1624.25 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1168. 1624.25 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1169. 1624.25 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1170. 1624.25 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1171. 1624.25 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1172. 1624.26 s [algebraic-graphs]
  1173. 1624.26 s [algebraic-graphs] ============ Relation.removeEdge ============
  1174. 1624.26 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1175. 1624.26 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1176. 1624.26 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1177. 1624.26 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1178. 1624.26 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1179. 1624.26 s [algebraic-graphs]
  1180. 1624.26 s [algebraic-graphs] ============ Relation.replaceVertex ============
  1181. 1624.26 s [algebraic-graphs] OK: replaceVertex x x == id
  1182. 1624.26 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1183. 1624.26 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1184. 1624.26 s [algebraic-graphs]
  1185. 1624.26 s [algebraic-graphs] ============ Relation.mergeVertices ============
  1186. 1624.26 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1187. 1631.14 s [haskell-language-server] Preprocessing library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  1188. 1631.14 s [haskell-language-server] Building library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  1189. 1631.25 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 )
  1190. 1632.88 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 )
  1191. 1639.85 s [haskell-language-server] Preprocessing library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  1192. 1639.85 s [haskell-language-server] Building library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  1193. 1640.14 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 )
  1194. 1640.92 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 )
  1195. 1640.92 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 )
  1196. 1641.04 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 )
  1197. 1642.02 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 )
  1198. 1647.36 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1199. 1647.36 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1200. 1647.41 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1201. 1647.41 s [algebraic-graphs]
  1202. 1647.41 s [algebraic-graphs] ============ Relation.transpose ============
  1203. 1647.41 s [algebraic-graphs] OK: transpose empty == empty
  1204. 1647.41 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  1205. 1647.41 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  1206. 1647.41 s [algebraic-graphs] OK: transpose . transpose == id
  1207. 1647.41 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  1208. 1647.41 s [algebraic-graphs]
  1209. 1647.41 s [algebraic-graphs] ============ Relation.gmap ============
  1210. 1647.41 s [algebraic-graphs] OK: gmap f empty == empty
  1211. 1647.41 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1212. 1647.41 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1213. 1647.41 s [algebraic-graphs] OK: gmap id == id
  1214. 1647.41 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1215. 1647.41 s [algebraic-graphs]
  1216. 1647.41 s [algebraic-graphs] ============ Relation.induce ============
  1217. 1647.41 s [algebraic-graphs] OK: induce (const True ) x == x
  1218. 1647.41 s [algebraic-graphs] OK: induce (const False) x == empty
  1219. 1647.41 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1220. 1647.41 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1221. 1647.41 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1222. 1647.41 s [algebraic-graphs]
  1223. 1647.41 s [algebraic-graphs] ============ Relation.compose ============
  1224. 1647.41 s [algebraic-graphs] OK: compose empty x == empty
  1225. 1647.41 s [algebraic-graphs] OK: compose x empty == empty
  1226. 1647.41 s [algebraic-graphs] OK: compose (vertex x) y == empty
  1227. 1647.41 s [algebraic-graphs] OK: compose x (vertex y) == empty
  1228. 1647.41 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  1229. 1647.41 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  1230. 1647.41 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  1231. 1647.41 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  1232. 1647.41 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  1233. 1647.41 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  1234. 1647.41 s [algebraic-graphs]
  1235. 1647.41 s [algebraic-graphs] ============ Relation.closure ============
  1236. 1647.41 s [algebraic-graphs] OK: closure empty == empty
  1237. 1647.41 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  1238. 1647.41 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  1239. 1647.41 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1240. 1647.41 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  1241. 1647.41 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  1242. 1647.41 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  1243. 1647.42 s [algebraic-graphs] OK: closure . closure == closure
  1244. 1647.42 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  1245. 1647.42 s [algebraic-graphs]
  1246. 1647.42 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  1247. 1647.42 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  1248. 1647.42 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  1249. 1647.42 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  1250. 1647.42 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1251. 1647.42 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  1252. 1647.42 s [algebraic-graphs]
  1253. 1647.42 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  1254. 1647.42 s [algebraic-graphs] OK: symmetricClosure empty == empty
  1255. 1647.42 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  1256. 1647.42 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  1257. 1647.42 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  1258. 1647.42 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  1259. 1647.42 s [algebraic-graphs]
  1260. 1647.42 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  1261. 1647.42 s [algebraic-graphs] OK: transitiveClosure empty == empty
  1262. 1647.42 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  1263. 1647.42 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  1264. 1647.42 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  1265. 1647.42 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  1266. 1647.42 s [algebraic-graphs]
  1267. 1647.42 s [algebraic-graphs] ============ Relation.induceJust ============
  1268. 1647.42 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1269. 1647.42 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1270. 1647.42 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1271. 1647.42 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1272. 1647.42 s [algebraic-graphs]
  1273. 1647.42 s [algebraic-graphs] ============ ReflexiveRelation ============
  1274. 1647.42 s [algebraic-graphs] OK: Axioms of reflexive graphs
  1275. 1647.42 s [algebraic-graphs]
  1276. 1647.42 s [algebraic-graphs] ============ TransitiveRelation ============
  1277. 1647.42 s [algebraic-graphs] OK: Axioms of transitive graphs
  1278. 1647.42 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  1279. 1647.42 s [algebraic-graphs]
  1280. 1647.42 s [algebraic-graphs] ============ PreorderRelation ============
  1281. 1647.42 s [algebraic-graphs] OK: Axioms of preorder graphs
  1282. 1647.42 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  1283. 1647.42 s [algebraic-graphs]
  1284. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation ============
  1285. 1647.42 s [algebraic-graphs] OK: Axioms of undirected graphs
  1286. 1647.42 s [algebraic-graphs]
  1287. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  1288. 1647.42 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  1289. 1647.42 s [algebraic-graphs]
  1290. 1647.42 s [algebraic-graphs] OK: consistent empty == True
  1291. 1647.42 s [algebraic-graphs] OK: consistent (vertex x) == True
  1292. 1647.42 s [algebraic-graphs] OK: consistent (overlay x y) == True
  1293. 1647.42 s [algebraic-graphs] OK: consistent (connect x y) == True
  1294. 1647.42 s [algebraic-graphs] OK: consistent (edge x y) == True
  1295. 1647.42 s [algebraic-graphs] OK: consistent (edges xs) == True
  1296. 1647.42 s [algebraic-graphs] OK: consistent (stars xs) == True
  1297. 1647.42 s [algebraic-graphs]
  1298. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  1299. 1647.42 s [algebraic-graphs] OK: show (empty ) == "empty"
  1300. 1647.42 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1301. 1647.42 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1302. 1647.42 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1303. 1647.42 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1304. 1647.42 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1305. 1647.42 s [algebraic-graphs]
  1306. 1647.42 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1307. 1647.42 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1308. 1647.42 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1309. 1647.42 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1310. 1647.42 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1311. 1647.42 s [algebraic-graphs]
  1312. 1647.42 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1313. 1647.42 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1314. 1647.42 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1315. 1647.42 s [algebraic-graphs]
  1316. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  1317. 1647.42 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  1318. 1647.42 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  1319. 1647.42 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  1320. 1647.42 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  1321. 1647.42 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  1322. 1647.42 s [algebraic-graphs]
  1323. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  1324. 1647.42 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  1325. 1647.42 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  1326. 1647.42 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  1327. 1647.42 s [algebraic-graphs]
  1328. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  1329. 1647.42 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1330. 1647.42 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1331. 1647.42 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1332. 1647.42 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1333. 1647.42 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1334. 1647.42 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1335. 1647.42 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1336. 1647.42 s [algebraic-graphs] OK: x <= x + y
  1337. 1647.42 s [algebraic-graphs] OK: x + y <= x * y
  1338. 1647.42 s [algebraic-graphs]
  1339. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  1340. 1647.42 s [algebraic-graphs] OK: isEmpty empty == True
  1341. 1647.42 s [algebraic-graphs] OK: hasVertex x empty == False
  1342. 1647.42 s [algebraic-graphs] OK: vertexCount empty == 0
  1343. 1647.42 s [algebraic-graphs] OK: edgeCount empty == 0
  1344. 1647.42 s [algebraic-graphs]
  1345. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  1346. 1647.42 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1347. 1647.42 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1348. 1647.42 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1349. 1647.42 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1350. 1647.42 s [algebraic-graphs]
  1351. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  1352. 1647.42 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1353. 1647.42 s [algebraic-graphs] OK: edge x y == edge y x
  1354. 1647.42 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1355. 1647.42 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1356. 1647.42 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1357. 1647.42 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1358. 1647.42 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1359. 1647.42 s [algebraic-graphs]
  1360. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  1361. 1647.42 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1362. 1647.42 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1363. 1647.42 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1364. 1647.42 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1365. 1647.42 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1366. 1647.42 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1367. 1647.42 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1368. 1647.42 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1369. 1647.42 s [algebraic-graphs]
  1370. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  1371. 1647.42 s [algebraic-graphs] OK: connect x y == connect y x
  1372. 1647.42 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1373. 1647.42 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1374. 1647.42 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1375. 1647.42 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1376. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1377. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1378. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1379. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1380. 1647.42 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1381. 1647.42 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1382. 1647.42 s [algebraic-graphs]
  1383. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  1384. 1647.42 s [algebraic-graphs] OK: vertices [] == empty
  1385. 1647.42 s [algebraic-graphs] OK: vertices [x] == vertex x
  1386. 1647.42 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1387. 1647.42 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1388. 1647.42 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1389. 1647.42 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1390. 1647.42 s [algebraic-graphs]
  1391. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  1392. 1647.42 s [algebraic-graphs] OK: edges [] == empty
  1393. 1647.42 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1394. 1647.42 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1395. 1647.42 s [algebraic-graphs]
  1396. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  1397. 1647.42 s [algebraic-graphs] OK: overlays [] == empty
  1398. 1647.49 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 )
  1399. 1647.98 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 )
  1400. 1650.55 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 )
  1401. 1650.55 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 )
  1402. 1652.42 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 )
  1403. 1653.03 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 )
  1404. 1653.63 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 )
  1405. 1653.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 )
  1406. 1653.86 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 )
  1407. 1654.84 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 )
  1408. 1660.17 s [algebraic-graphs] OK: overlays [x] == x
  1409. 1660.17 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1410. 1660.17 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1411. 1660.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1412. 1660.19 s [algebraic-graphs]
  1413. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  1414. 1660.19 s [algebraic-graphs] OK: connects [] == empty
  1415. 1660.19 s [algebraic-graphs] OK: connects [x] == x
  1416. 1660.19 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1417. 1660.19 s [algebraic-graphs] OK: connects == foldr connect empty
  1418. 1660.19 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1419. 1660.19 s [algebraic-graphs] OK: connects == connects . reverse
  1420. 1660.19 s [algebraic-graphs]
  1421. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  1422. 1660.19 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1423. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1424. 1660.19 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1425. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1426. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1427. 1660.19 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1428. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1429. 1660.19 s [algebraic-graphs]
  1430. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  1431. 1660.19 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  1432. 1660.19 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  1433. 1660.19 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  1434. 1660.19 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  1435. 1660.19 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  1436. 1660.19 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  1437. 1660.19 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  1438. 1660.19 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  1439. 1660.19 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  1440. 1660.19 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1441. 1660.19 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1442. 1660.19 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1443. 1660.19 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1444. 1660.19 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1445. 1660.19 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1446. 1660.19 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1447. 1660.19 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1448. 1660.19 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1449. 1660.19 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1450. 1660.19 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1451. 1660.19 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1452. 1660.19 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1453. 1660.19 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1454. 1660.19 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1455. 1660.19 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1456. 1660.19 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1457. 1660.19 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1458. 1660.19 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1459. 1660.19 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1460. 1660.19 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1461. 1660.19 s [algebraic-graphs]
  1462. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  1463. 1660.19 s [algebraic-graphs] OK: isEmpty empty == True
  1464. 1660.19 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1465. 1660.19 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1466. 1660.19 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1467. 1660.19 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1468. 1660.19 s [algebraic-graphs]
  1469. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  1470. 1660.19 s [algebraic-graphs] OK: hasVertex x empty == False
  1471. 1660.19 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1472. 1660.19 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1473. 1660.19 s [algebraic-graphs]
  1474. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  1475. 1660.19 s [algebraic-graphs] OK: hasEdge x y empty == False
  1476. 1660.19 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1477. 1660.19 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1478. 1660.19 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  1479. 1660.19 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1480. 1660.19 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  1481. 1660.19 s [algebraic-graphs]
  1482. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  1483. 1660.19 s [algebraic-graphs] OK: vertexCount empty == 0
  1484. 1660.19 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1485. 1660.19 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1486. 1660.19 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1487. 1660.19 s [algebraic-graphs]
  1488. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  1489. 1660.19 s [algebraic-graphs] OK: edgeCount empty == 0
  1490. 1660.19 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1491. 1660.19 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1492. 1660.19 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1493. 1660.19 s [algebraic-graphs]
  1494. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  1495. 1660.19 s [algebraic-graphs] OK: vertexList empty == []
  1496. 1660.19 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1497. 1660.19 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1498. 1660.19 s [algebraic-graphs]
  1499. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  1500. 1660.19 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1501. 1660.19 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1502. 1660.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1503. 1660.19 s [algebraic-graphs]
  1504. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  1505. 1660.19 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1506. 1660.19 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1507. 1660.19 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1508. 1660.19 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1509. 1660.19 s [algebraic-graphs]
  1510. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  1511. 1660.19 s [algebraic-graphs] OK: edgeList empty == []
  1512. 1660.19 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1513. 1660.19 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  1514. 1660.19 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  1515. 1660.19 s [algebraic-graphs]
  1516. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  1517. 1660.19 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1518. 1660.19 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1519. 1660.19 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  1520. 1660.19 s [algebraic-graphs]
  1521. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  1522. 1660.19 s [algebraic-graphs] OK: adjacencyList empty == []
  1523. 1660.19 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1524. 1660.19 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  1525. 1660.19 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  1526. 1660.19 s [algebraic-graphs]
  1527. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  1528. 1660.19 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  1529. 1660.19 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  1530. 1660.19 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  1531. 1660.19 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  1532. 1660.19 s [algebraic-graphs]
  1533. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  1534. 1660.19 s [algebraic-graphs] OK: path [] == empty
  1535. 1660.19 s [algebraic-graphs] OK: path [x] == vertex x
  1536. 1660.19 s [algebraic-graphs] OK: path [x,y] == edge x y
  1537. 1660.19 s [algebraic-graphs] OK: path == path . reverse
  1538. 1660.19 s [algebraic-graphs]
  1539. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  1540. 1660.19 s [algebraic-graphs] OK: circuit [] == empty
  1541. 1660.19 s [algebraic-graphs] OK: circuit [x] == edge x x
  1542. 1660.19 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1543. 1660.19 s [algebraic-graphs] OK: circuit == circuit . reverse
  1544. 1660.19 s [algebraic-graphs]
  1545. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  1546. 1660.19 s [algebraic-graphs] OK: clique [] == empty
  1547. 1660.19 s [algebraic-graphs] OK: clique [x] == vertex x
  1548. 1660.19 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1549. 1660.19 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1550. 1660.19 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1551. 1660.19 s [algebraic-graphs] OK: clique == clique . reverse
  1552. 1660.19 s [algebraic-graphs]
  1553. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  1554. 1660.19 s [algebraic-graphs] OK: biclique [] [] == empty
  1555. 1660.19 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1556. 1660.19 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1557. 1660.19 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1558. 1660.19 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1559. 1660.19 s [algebraic-graphs]
  1560. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  1561. 1660.19 s [algebraic-graphs] OK: star x [] == vertex x
  1562. 1660.19 s [algebraic-graphs] OK: star x [y] == edge x y
  1563. 1660.19 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1564. 1660.19 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1565. 1660.19 s [algebraic-graphs]
  1566. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  1567. 1660.19 s [algebraic-graphs] OK: stars [] == empty
  1568. 1660.19 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1569. 1660.19 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1570. 1660.19 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1571. 1660.19 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1572. 1660.19 s [algebraic-graphs] OK: stars . adjacencyList == id
  1573. 1660.19 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1574. 1660.19 s [algebraic-graphs]
  1575. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  1576. 1660.19 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1577. 1660.19 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1578. 1660.19 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1579. 1660.19 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1580. 1660.19 s [algebraic-graphs]
  1581. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  1582. 1660.19 s [algebraic-graphs] OK: forest [] == empty
  1583. 1662.58 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 )
  1584. 1663.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 )
  1585. 1665.80 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 )
  1586. 1665.83 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 )
  1587. 1667.34 s [algebraic-graphs] OK: forest [x] == tree x
  1588. 1667.34 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1589. 1667.34 s [algebraic-graphs] OK: forest == overlays . map tree
  1590. 1667.34 s [algebraic-graphs]
  1591. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  1592. 1667.34 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1593. 1667.34 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1594. 1667.34 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1595. 1667.34 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1596. 1667.34 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1597. 1667.34 s [algebraic-graphs]
  1598. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  1599. 1667.34 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1600. 1667.34 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1601. 1667.34 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1602. 1667.34 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1603. 1667.34 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1604. 1667.34 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1605. 1667.34 s [algebraic-graphs]
  1606. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  1607. 1667.34 s [algebraic-graphs] OK: replaceVertex x x == id
  1608. 1667.34 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1609. 1667.34 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1610. 1667.34 s [algebraic-graphs]
  1611. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  1612. 1667.34 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1613. 1667.34 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1614. 1667.34 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1615. 1667.34 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1616. 1667.34 s [algebraic-graphs]
  1617. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  1618. 1667.34 s [algebraic-graphs] OK: gmap f empty == empty
  1619. 1667.34 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1620. 1667.34 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1621. 1667.34 s [algebraic-graphs] OK: gmap id == id
  1622. 1667.34 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1623. 1667.34 s [algebraic-graphs]
  1624. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  1625. 1667.34 s [algebraic-graphs] OK: induce (const True ) x == x
  1626. 1667.34 s [algebraic-graphs] OK: induce (const False) x == empty
  1627. 1667.34 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1628. 1667.34 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1629. 1667.34 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1630. 1667.34 s [algebraic-graphs]
  1631. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  1632. 1667.34 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1633. 1667.34 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1634. 1667.34 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1635. 1667.34 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1636. 1667.34 s [algebraic-graphs]
  1637. 1667.34 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  1638. 1667.34 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  1639. 1667.34 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  1640. 1667.34 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  1641. 1667.34 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  1642. 1667.34 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  1643. 1667.34 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  1644. 1667.34 s [algebraic-graphs]
  1645. 1667.34 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  1646. 1667.34 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  1647. 1667.34 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  1648. 1667.34 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  1649. 1667.34 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  1650. 1667.34 s [algebraic-graphs]
  1651. 1667.34 s [algebraic-graphs] ============ Typed ============
  1652. 1667.34 s [algebraic-graphs]
  1653. 1667.34 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  1654. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1655. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1656. 1667.34 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  1657. 1667.34 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1658. 1667.34 s [algebraic-graphs]
  1659. 1667.34 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  1660. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1661. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1662. 1667.34 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  1663. 1667.34 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1664. 1667.34 s [algebraic-graphs]
  1665. 1667.34 s [algebraic-graphs] ============ Typed.dfsForest ============
  1666. 1667.34 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  1667. 1667.34 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  1668. 1667.34 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  1669. 1667.34 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  1670. 1667.34 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  1671. 1667.34 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  1672. 1667.34 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  1673. 1667.34 s [algebraic-graphs]
  1674. 1667.34 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  1675. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  1676. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  1677. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  1678. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  1679. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  1680. 1667.34 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  1681. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  1682. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  1683. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  1684. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  1685. 1667.34 s [algebraic-graphs]
  1686. 1667.34 s [algebraic-graphs] ============ Typed.dfs ============
  1687. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  1688. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  1689. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  1690. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  1691. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  1692. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  1693. 1667.34 s [algebraic-graphs] OK: dfs % x $ [] == []
  1694. 1667.34 s [algebraic-graphs]
  1695. 1667.34 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  1696. 1667.34 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  1697. 1667.34 s [algebraic-graphs]
  1698. 1667.34 s [algebraic-graphs] ============ Typed.topSort ============
  1699. 1667.34 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  1700. 1667.34 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  1701. 1667.34 s [algebraic-graphs]
  1702. 1667.34 s [algebraic-graphs] ============ Graph.Undirected ============
  1703. 1667.34 s [algebraic-graphs] OK: Axioms of undirected graphs
  1704. 1667.34 s [algebraic-graphs]
  1705. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  1706. 1667.34 s [algebraic-graphs] OK: show (empty ) == "empty"
  1707. 1667.34 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1708. 1667.34 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1709. 1667.34 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1710. 1667.34 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1711. 1667.34 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1712. 1667.34 s [algebraic-graphs]
  1713. 1667.34 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1714. 1667.34 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1715. 1667.34 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1716. 1667.34 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1717. 1667.34 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1718. 1667.34 s [algebraic-graphs]
  1719. 1667.34 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1720. 1667.34 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1721. 1667.34 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1722. 1667.34 s [algebraic-graphs]
  1723. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  1724. 1667.34 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  1725. 1667.34 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1726. 1667.34 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  1727. 1667.34 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  1728. 1667.34 s [algebraic-graphs]
  1729. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  1730. 1667.34 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  1731. 1667.34 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1732. 1667.34 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  1733. 1667.34 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  1734. 1667.34 s [algebraic-graphs]
  1735. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  1736. 1667.34 s [algebraic-graphs] OK: complement empty == empty
  1737. 1667.34 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  1738. 1667.34 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  1739. 1667.34 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  1740. 1667.34 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  1741. 1667.34 s [algebraic-graphs] OK: complement . complement == id
  1742. 1667.34 s [algebraic-graphs]
  1743. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  1744. 1667.34 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1745. 1667.34 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1746. 1667.34 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1747. 1667.34 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1748. 1667.34 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1749. 1667.34 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1750. 1667.34 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1751. 1667.34 s [algebraic-graphs] OK: x <= x + y
  1752. 1667.34 s [algebraic-graphs] OK: x + y <= x * y
  1753. 1667.34 s [algebraic-graphs]
  1754. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  1755. 1667.34 s [algebraic-graphs] OK: isEmpty empty == True
  1756. 1667.34 s [algebraic-graphs] OK: hasVertex x empty == False
  1757. 1667.34 s [algebraic-graphs] OK: vertexCount empty == 0
  1758. 1667.34 s [algebraic-graphs] OK: edgeCount empty == 0
  1759. 1667.34 s [algebraic-graphs]
  1760. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  1761. 1667.34 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1762. 1667.34 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1763. 1667.34 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1764. 1667.34 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1765. 1667.34 s [algebraic-graphs]
  1766. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  1767. 1667.34 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1768. 1667.34 s [algebraic-graphs] OK: edge x y == edge y x
  1769. 1667.65 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 )
  1770. 1674.03 s [haskell-language-server] Preprocessing library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  1771. 1674.03 s [haskell-language-server] Building library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  1772. 1674.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 )
  1773. 1676.07 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 )
  1774. 1677.31 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1775. 1677.31 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1776. 1677.31 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1777. 1677.31 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1778. 1677.31 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1779. 1677.31 s [algebraic-graphs]
  1780. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  1781. 1677.31 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1782. 1677.31 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1783. 1677.31 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1784. 1677.31 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1785. 1677.31 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1786. 1677.31 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1787. 1677.31 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1788. 1677.31 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1789. 1677.31 s [algebraic-graphs]
  1790. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  1791. 1677.31 s [algebraic-graphs] OK: connect x y == connect y x
  1792. 1677.31 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1793. 1677.31 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1794. 1677.31 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1795. 1677.31 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1796. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1797. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1798. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1799. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1800. 1677.31 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1801. 1677.31 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1802. 1677.31 s [algebraic-graphs]
  1803. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  1804. 1677.31 s [algebraic-graphs] OK: vertices [] == empty
  1805. 1677.31 s [algebraic-graphs] OK: vertices [x] == vertex x
  1806. 1677.31 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1807. 1677.31 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1808. 1677.31 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1809. 1677.31 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1810. 1677.31 s [algebraic-graphs]
  1811. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  1812. 1677.31 s [algebraic-graphs] OK: edges [] == empty
  1813. 1677.31 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1814. 1677.31 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1815. 1677.31 s [algebraic-graphs]
  1816. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  1817. 1677.31 s [algebraic-graphs] OK: overlays [] == empty
  1818. 1677.31 s [algebraic-graphs] OK: overlays [x] == x
  1819. 1677.31 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1820. 1677.31 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1821. 1677.31 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1822. 1677.31 s [algebraic-graphs]
  1823. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  1824. 1677.31 s [algebraic-graphs] OK: connects [] == empty
  1825. 1677.31 s [algebraic-graphs] OK: connects [x] == x
  1826. 1677.31 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1827. 1677.31 s [algebraic-graphs] OK: connects == foldr connect empty
  1828. 1677.31 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1829. 1677.31 s [algebraic-graphs] OK: connects == connects . reverse
  1830. 1677.31 s [algebraic-graphs]
  1831. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  1832. 1677.31 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1833. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1834. 1677.31 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1835. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1836. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1837. 1677.31 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1838. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1839. 1677.31 s [algebraic-graphs]
  1840. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.path ============
  1841. 1677.31 s [algebraic-graphs] OK: path [] == empty
  1842. 1677.31 s [algebraic-graphs] OK: path [x] == vertex x
  1843. 1677.32 s [algebraic-graphs] OK: path [x,y] == edge x y
  1844. 1677.32 s [algebraic-graphs] OK: path == path . reverse
  1845. 1677.32 s [algebraic-graphs]
  1846. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  1847. 1677.32 s [algebraic-graphs] OK: circuit [] == empty
  1848. 1677.32 s [algebraic-graphs] OK: circuit [x] == edge x x
  1849. 1677.32 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1850. 1677.32 s [algebraic-graphs] OK: circuit == circuit . reverse
  1851. 1677.32 s [algebraic-graphs]
  1852. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  1853. 1677.32 s [algebraic-graphs] OK: clique [] == empty
  1854. 1677.32 s [algebraic-graphs] OK: clique [x] == vertex x
  1855. 1677.32 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1856. 1677.32 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1857. 1677.32 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1858. 1677.32 s [algebraic-graphs] OK: clique == clique . reverse
  1859. 1677.32 s [algebraic-graphs]
  1860. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  1861. 1677.32 s [algebraic-graphs] OK: biclique [] [] == empty
  1862. 1677.32 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1863. 1677.32 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1864. 1677.32 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1865. 1677.32 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1866. 1677.32 s [algebraic-graphs]
  1867. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.star ============
  1868. 1677.32 s [algebraic-graphs] OK: star x [] == vertex x
  1869. 1677.32 s [algebraic-graphs] OK: star x [y] == edge x y
  1870. 1677.32 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1871. 1677.32 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1872. 1677.32 s [algebraic-graphs]
  1873. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  1874. 1677.32 s [algebraic-graphs] OK: stars [] == empty
  1875. 1677.32 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1876. 1677.32 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1877. 1677.32 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1878. 1677.32 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1879. 1677.32 s [algebraic-graphs] OK: stars . adjacencyList == id
  1880. 1677.32 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1881. 1677.32 s [algebraic-graphs]
  1882. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  1883. 1677.32 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1884. 1677.32 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1885. 1677.32 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1886. 1677.32 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1887. 1677.32 s [algebraic-graphs]
  1888. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  1889. 1677.32 s [algebraic-graphs] OK: forest [] == empty
  1890. 1677.32 s [algebraic-graphs] OK: forest [x] == tree x
  1891. 1677.32 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1892. 1677.32 s [algebraic-graphs] OK: forest == overlays . map tree
  1893. 1677.32 s [algebraic-graphs]
  1894. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  1895. 1677.32 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1896. 1677.32 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1897. 1677.32 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1898. 1677.32 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1899. 1677.32 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1900. 1677.32 s [algebraic-graphs]
  1901. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  1902. 1677.32 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1903. 1677.32 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1904. 1677.32 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1905. 1677.32 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1906. 1677.32 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1907. 1677.32 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1908. 1677.32 s [algebraic-graphs]
  1909. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  1910. 1677.32 s [algebraic-graphs] OK: replaceVertex x x == id
  1911. 1677.32 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1912. 1677.32 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1913. 1677.32 s [algebraic-graphs]
  1914. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  1915. 1677.32 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1916. 1677.32 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1917. 1677.32 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1918. 1677.32 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1919. 1677.32 s [algebraic-graphs]
  1920. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  1921. 1677.32 s [algebraic-graphs] OK: gmap f empty == empty
  1922. 1677.32 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1923. 1677.32 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1924. 1677.32 s [algebraic-graphs] OK: gmap id == id
  1925. 1677.32 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1926. 1677.32 s [algebraic-graphs]
  1927. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  1928. 1677.32 s [algebraic-graphs] OK: induce (const True ) x == x
  1929. 1677.32 s [algebraic-graphs] OK: induce (const False) x == empty
  1930. 1677.32 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1931. 1677.32 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1932. 1677.32 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1933. 1677.32 s [algebraic-graphs]
  1934. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  1935. 1677.32 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1936. 1677.32 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1937. 1677.32 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1938. 1677.32 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1939. 1677.32 s [algebraic-graphs] Test suite main: PASS
  1940. 1677.32 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  1941. 1677.32 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  1942. 1677.33 s [algebraic-graphs] checkPhase completed in 2 minutes 4 seconds
  1943. 1677.33 s [algebraic-graphs] Phase: haddockPhase
  1944. 1677.46 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  1945. 1677.47 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  1946. 1677.52 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  1947. 1677.84 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  1948. 1678.03 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  1949. 1678.11 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1950. 1678.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1951. 1678.11 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1952. 1678.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1953. 1678.11 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  1954. 1678.11 s [algebraic-graphs] Missing documentation for:
  1955. 1678.11 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  1956. 1678.17 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  1957. 1678.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1958. 1678.18 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  1959. 1678.38 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  1960. 1678.49 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  1961. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1962. 1678.49 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  1963. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1964. 1678.49 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  1965. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1966. 1678.49 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  1967. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1968. 1678.49 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1969. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1970. 1678.49 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  1971. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1972. 1678.49 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1973. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1974. 1678.50 s [algebraic-graphs] Warning: 'box' is out of scope.
  1975. 1678.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1976. 1678.50 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  1977. 1678.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1978. 1678.50 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  1979. 1678.59 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1980. 1678.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1981. 1678.60 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  1982. 1678.78 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  1983. 1678.78 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1984. 1678.79 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  1985. 1678.91 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  1986. 1679.03 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1987. 1679.03 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1988. 1679.07 s [algebraic-graphs] Warning: 'empty' is out of scope.
  1989. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1990. 1679.07 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1991. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1992. 1679.07 s [algebraic-graphs] Warning: 'edges' is out of scope.
  1993. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1994. 1679.07 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1995. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1996. 1679.07 s [algebraic-graphs] Warning: 'stars' is out of scope.
  1997. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1998. 1679.07 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  1999. 1679.21 s [algebraic-graphs] Warning: 'nub' is out of scope.
  2000. 1679.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2001. 1679.21 s [algebraic-graphs] Warning: 'sort' is out of scope.
  2002. 1679.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2003. 1679.22 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  2004. 1679.22 s [algebraic-graphs] Missing documentation for:
  2005. 1679.22 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  2006. 1679.32 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  2007. 1679.39 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  2008. 1679.44 s [algebraic-graphs]
  2009. 1679.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2010. 1679.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2011. 1679.44 s [algebraic-graphs] will become an error in a future GHC release.
  2012. 1679.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2013. 1679.44 s [algebraic-graphs] |
  2014. 1679.44 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  2015. 1679.44 s [algebraic-graphs] | ^
  2016. 1679.44 s [algebraic-graphs]
  2017. 1679.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2018. 1679.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2019. 1679.44 s [algebraic-graphs] will become an error in a future GHC release.
  2020. 1679.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2021. 1679.45 s [algebraic-graphs] |
  2022. 1679.45 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  2023. 1679.45 s [algebraic-graphs] | ^
  2024. 1679.45 s [algebraic-graphs]
  2025. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2026. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2027. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  2028. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2029. 1679.45 s [algebraic-graphs] |
  2030. 1679.45 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  2031. 1679.45 s [algebraic-graphs] | ^
  2032. 1679.45 s [algebraic-graphs]
  2033. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2034. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2035. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  2036. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2037. 1679.45 s [algebraic-graphs] |
  2038. 1679.45 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  2039. 1679.45 s [algebraic-graphs] | ^
  2040. 1679.45 s [algebraic-graphs]
  2041. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2042. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2043. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  2044. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2045. 1679.45 s [algebraic-graphs] |
  2046. 1679.45 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  2047. 1679.45 s [algebraic-graphs] | ^
  2048. 1679.45 s [algebraic-graphs]
  2049. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2050. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2051. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  2052. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2053. 1679.45 s [algebraic-graphs] |
  2054. 1679.45 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  2055. 1679.45 s [algebraic-graphs] | ^
  2056. 1679.45 s [algebraic-graphs]
  2057. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2058. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2059. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  2060. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2061. 1679.45 s [algebraic-graphs] |
  2062. 1679.46 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  2063. 1679.46 s [algebraic-graphs] | ^
  2064. 1679.53 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  2065. 1679.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2066. 1679.53 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  2067. 1679.73 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  2068. 1679.82 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  2069. 1679.82 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2070. 1679.84 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  2071. 1679.96 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  2072. 1680.24 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  2073. 1680.64 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  2074. 1680.67 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  2075. 1680.71 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  2076. 1680.72 s [algebraic-graphs]
  2077. 1680.72 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2078. 1680.72 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2079. 1680.72 s [algebraic-graphs] will become an error in a future GHC release.
  2080. 1680.72 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2081. 1680.72 s [algebraic-graphs] |
  2082. 1680.72 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  2083. 1680.72 s [algebraic-graphs] | ^
  2084. 1680.73 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  2085. 1680.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2086. 1680.74 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  2087. 1680.74 s [algebraic-graphs]
  2088. 1680.74 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2089. 1680.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2090. 1680.74 s [algebraic-graphs] will become an error in a future GHC release.
  2091. 1680.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2092. 1680.74 s [algebraic-graphs] |
  2093. 1680.74 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  2094. 1680.74 s [algebraic-graphs] | ^
  2095. 1680.74 s [algebraic-graphs]
  2096. 1680.75 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2097. 1680.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2098. 1680.75 s [algebraic-graphs] will become an error in a future GHC release.
  2099. 1680.75 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2100. 1680.75 s [algebraic-graphs] |
  2101. 1680.75 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  2102. 1680.75 s [algebraic-graphs] | ^
  2103. 1680.80 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  2104. 1680.96 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  2105. 1681.02 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  2106. 1681.02 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2107. 1681.03 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  2108. 1681.04 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  2109. 1681.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2110. 1681.04 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  2111. 1681.06 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  2112. 1681.06 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2113. 1681.06 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  2114. 1681.15 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  2115. 1681.15 s [algebraic-graphs] Missing documentation for:
  2116. 1681.15 s [algebraic-graphs] Module header
  2117. 1681.15 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  2118. 1681.16 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  2119. 1681.16 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  2120. 1681.16 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  2121. 1681.16 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  2122. 1681.16 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  2123. 1681.16 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  2124. 1681.18 s [algebraic-graphs] Warning: 'array' is out of scope.
  2125. 1681.18 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2126. 1681.18 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  2127. 1681.18 s [algebraic-graphs] Missing documentation for:
  2128. 1681.18 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  2129. 1683.45 s [haskell-language-server] Preprocessing executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  2130. 1683.45 s [haskell-language-server] Building executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  2131. 1683.62 s [haskell-language-server] [1 of 1] Compiling Main ( docs/contributing/plugin-tutorial.lhs, dist/build/plugin-tutorial/plugin-tutorial-tmp/Main.dyn_o )
  2132. 1684.80 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  2133. 1684.80 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  2134. 1684.87 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  2135. 1684.88 s [algebraic-graphs] Phase: installPhase
  2136. 1684.95 s [algebraic-graphs] Installing library in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  2137. 1685.05 s [haskell-language-server] [2 of 2] Linking dist/build/plugin-tutorial/plugin-tutorial
  2138. 1685.56 s [algebraic-graphs] Phase: fixupPhase
  2139. 1685.58 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  2140. 1685.60 s [algebraic-graphs] shrinking /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-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
  2141. 1685.61 s [algebraic-graphs] checking for references to /build/ in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7...
  2142. 1685.65 s [algebraic-graphs] patching script interpreter paths in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  2143. 1685.65 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib
  2144. 1685.91 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc
  2145. 1685.94 s [algebraic-graphs] checking for references to /build/ in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc...
  2146. 1685.97 s [algebraic-graphs] patching script interpreter paths in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc
  2147. 1686.12 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  2148. 1686.55 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  2149. 1686.57 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  2150. 1686.61 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2151. 1686.62 s [algebraic-graphs:post-build] copying 2 paths...
  2152. 1686.62 s [algebraic-graphs:post-build] copying path '/nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  2153. 1688.05 s [algebraic-graphs:post-build] copying path '/nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  2154. 1694.07 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2155. 1694.15 s [algebraic-graphs:post-build] copying 0 paths...
  2156. 1694.17 s Progress: 22 of 27 built (1 building), 341 of 341 downloaded from cache
  2157. 1694.22 s Building /nix/store/3ik1jpbmsnyv5kdcr4w2ajwvybsflc6w-ghc-9.6.7-with-packages.drv
  2158. 1694.22 s [haskell-language-server] Preprocessing library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  2159. 1694.22 s [haskell-language-server] Building library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  2160. 1694.22 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 )
  2161. 1694.22 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 )
  2162. 1694.28 s [ghc-9.6.7-with-packages] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/nix-support:
  2163. 1694.28 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2164. 1694.28 s [ghc-9.6.7-with-packages] /nix/store/ws4bxm02xf3qm4nhj7wqa0pmnyap2ly6-ghc-compat-plugin-0.1.0.1/nix-support:
  2165. 1694.28 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2166. 1694.29 s [ghc-9.6.7-with-packages] /nix/store/dy7plzxvi4bj3cj8g64wf3k5vaj5c70a-hedgehog-1.5/nix-support:
  2167. 1694.29 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2168. 1694.31 s [ghc-9.6.7-with-packages] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/nix-support:
  2169. 1694.31 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2170. 1694.33 s [ghc-9.6.7-with-packages] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/nix-support:
  2171. 1694.33 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2172. 1694.34 s [ghc-9.6.7-with-packages] /nix/store/1cnj5acqwjghacz5lcl0df0g61b7b2g1-temporary-1.3/nix-support:
  2173. 1694.34 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2174. 1694.34 s [ghc-9.6.7-with-packages] /nix/store/1cnj5acqwjghacz5lcl0df0g61b7b2g1-temporary-1.3/nix-support:
  2175. 1694.34 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2176. 1694.34 s [ghc-9.6.7-with-packages] /nix/store/fcbs80997frlprcgnfz1pgqzwx17bdfj-ansi-terminal-1.1.3/nix-support:
  2177. 1694.34 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2178. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/fcbs80997frlprcgnfz1pgqzwx17bdfj-ansi-terminal-1.1.3/nix-support:
  2179. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2180. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/jjabyw5gl9cvdkdwfmgvllmj76cd5xx2-async-2.2.5/nix-support:
  2181. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2182. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/jjabyw5gl9cvdkdwfmgvllmj76cd5xx2-async-2.2.5/nix-support:
  2183. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2184. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/1rnj3abisldb1ysvfg7jx4xq63kvnh9f-barbies-2.1.1.0/nix-support:
  2185. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2186. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/1rnj3abisldb1ysvfg7jx4xq63kvnh9f-barbies-2.1.1.0/nix-support:
  2187. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2188. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/ygwfbz0mwnsj9r4vy9zhqnhn5baqlwz7-concurrent-output-1.10.21/nix-support:
  2189. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2190. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/ygwfbz0mwnsj9r4vy9zhqnhn5baqlwz7-concurrent-output-1.10.21/nix-support:
  2191. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2192. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/76z6kzz2xf8gljhm76swxb542xp0lqkz-lifted-async-0.10.2.7/nix-support:
  2193. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2194. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/76z6kzz2xf8gljhm76swxb542xp0lqkz-lifted-async-0.10.2.7/nix-support:
  2195. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2196. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/iasz4h3zl5q9kgrf288g9fak6g03s54x-mmorph-1.2.1/nix-support:
  2197. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2198. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/iasz4h3zl5q9kgrf288g9fak6g03s54x-mmorph-1.2.1/nix-support:
  2199. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2200. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/9h348vl6yhan64ibbcabyjx2fmxs7d3b-monad-control-1.0.3.1/nix-support:
  2201. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2202. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/9h348vl6yhan64ibbcabyjx2fmxs7d3b-monad-control-1.0.3.1/nix-support:
  2203. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2204. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/wdxmylyqc8p4j414kk3ymndp5i2yqjm3-pretty-show-1.10/nix-support:
  2205. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2206. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/wdxmylyqc8p4j414kk3ymndp5i2yqjm3-pretty-show-1.10/nix-support:
  2207. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2208. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/k1gharvwzs4drk9axklr4dcizqkqnia7-primitive-0.9.1.0/nix-support:
  2209. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2210. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/k1gharvwzs4drk9axklr4dcizqkqnia7-primitive-0.9.1.0/nix-support:
  2211. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2212. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/nnj36snlh7c273pijflsjp18z8z6bv71-random-1.2.1.3/nix-support:
  2213. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2214. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/nnj36snlh7c273pijflsjp18z8z6bv71-random-1.2.1.3/nix-support:
  2215. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2216. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/hgb60y6pgscn0xg3sa2j4llfykqikdcb-resourcet-1.3.0/nix-support:
  2217. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2218. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/hgb60y6pgscn0xg3sa2j4llfykqikdcb-resourcet-1.3.0/nix-support:
  2219. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2220. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/gni425lh8g2a5k2iy04gza6hxwivikyp-safe-exceptions-0.1.7.4/nix-support:
  2221. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2222. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/gni425lh8g2a5k2iy04gza6hxwivikyp-safe-exceptions-0.1.7.4/nix-support:
  2223. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2224. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/iq5g0dfwam9zz3v08lgvcvvvgwhsbv0x-transformers-base-0.4.6/nix-support:
  2225. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2226. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/iq5g0dfwam9zz3v08lgvcvvvgwhsbv0x-transformers-base-0.4.6/nix-support:
  2227. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2228. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/w5r1n1grfq99nsaqjfsi3qspcxikk9hl-wl-pprint-annotated-0.1.0.1/nix-support:
  2229. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2230. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/w5r1n1grfq99nsaqjfsi3qspcxikk9hl-wl-pprint-annotated-0.1.0.1/nix-support:
  2231. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2232. 1694.41 s [ghc-9.6.7-with-packages] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/nix-support:
  2233. 1694.41 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2234. 1694.42 s [ghc-9.6.7-with-packages] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/nix-support:
  2235. 1694.42 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2236. 1694.42 s [ghc-9.6.7-with-packages] /nix/store/i1773scyxkqyblf6vpzp8rwlnivkfggx-ansi-terminal-types-1.1.3/nix-support:
  2237. 1694.42 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2238. 1694.42 s [ghc-9.6.7-with-packages] /nix/store/i1773scyxkqyblf6vpzp8rwlnivkfggx-ansi-terminal-types-1.1.3/nix-support:
  2239. 1694.42 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2240. 1694.43 s [ghc-9.6.7-with-packages] /nix/store/6pimarw92xx2gdc004l52j33pgfnk5q3-hashable-1.5.0.0/nix-support:
  2241. 1694.43 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2242. 1694.43 s [ghc-9.6.7-with-packages] /nix/store/6pimarw92xx2gdc004l52j33pgfnk5q3-hashable-1.5.0.0/nix-support:
  2243. 1694.43 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2244. 1694.43 s [ghc-9.6.7-with-packages] /nix/store/r45rn7pmhwhm2a2arlc59m6q0ayf3x7k-distributive-0.6.2.1/nix-support:
  2245. 1694.43 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2246. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/r45rn7pmhwhm2a2arlc59m6q0ayf3x7k-distributive-0.6.2.1/nix-support:
  2247. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2248. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/g35hdx8r4gl48g5p5a7716hzmiacl823-constraints-0.14.2/nix-support:
  2249. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2250. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/g35hdx8r4gl48g5p5a7716hzmiacl823-constraints-0.14.2/nix-support:
  2251. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2252. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/0yc01qnfkqq6ncifsd27ap4dvplafl0w-lifted-base-0.2.3.12/nix-support:
  2253. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2254. 1694.45 s [ghc-9.6.7-with-packages] /nix/store/0yc01qnfkqq6ncifsd27ap4dvplafl0w-lifted-base-0.2.3.12/nix-support:
  2255. 1694.45 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2256. 1694.45 s [ghc-9.6.7-with-packages] /nix/store/x61ml6alhwgm163idq8ykgn021gn0lf6-transformers-compat-0.7.2/nix-support:
  2257. 1694.45 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2258. 1694.45 s [ghc-9.6.7-with-packages] /nix/store/x61ml6alhwgm163idq8ykgn021gn0lf6-transformers-compat-0.7.2/nix-support:
  2259. 1694.45 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2260. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/zyhsf74vsbisnk8nxg7immascxvrgzrx-splitmix-0.1.3.1/nix-support:
  2261. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2262. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/zyhsf74vsbisnk8nxg7immascxvrgzrx-splitmix-0.1.3.1/nix-support:
  2263. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2264. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/qq625vh42zngn5an1w1fipnj2h9yfxb6-unliftio-core-0.2.1.0/nix-support:
  2265. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2266. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/qq625vh42zngn5an1w1fipnj2h9yfxb6-unliftio-core-0.2.1.0/nix-support:
  2267. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2268. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/hf7mjbw39mc2s31v9s0gvq0irxrj3ljz-base-orphans-0.9.3/nix-support:
  2269. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2270. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/hf7mjbw39mc2s31v9s0gvq0irxrj3ljz-base-orphans-0.9.3/nix-support:
  2271. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2272. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/8qkh2vgcsvil9pkzial83q66cc6csf0h-os-string-2.0.8/nix-support:
  2273. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2274. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/8qkh2vgcsvil9pkzial83q66cc6csf0h-os-string-2.0.8/nix-support:
  2275. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2276. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/74c3l72p3ahsbcdqzxpmicwp8cyhqj1d-tagged-0.8.9/nix-support:
  2277. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2278. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/74c3l72p3ahsbcdqzxpmicwp8cyhqj1d-tagged-0.8.9/nix-support:
  2279. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2280. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/fam1g9nds2cbk2b6xp4jv742dm7kkjkp-boring-0.2.2/nix-support:
  2281. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2282. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/fam1g9nds2cbk2b6xp4jv742dm7kkjkp-boring-0.2.2/nix-support:
  2283. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  2284. 1695.16 s [ghc-9.6.7-with-packages] Warning: include-dirs: /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-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
  2285. 1696.36 s [ghc-9.6.7-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages
  2286. 1696.75 s [ghc-9.6.7-with-packages:post-build] Pushing 1 paths (154 are already present) using zstd to cache sellout ⏳
  2287. 1696.75 s [ghc-9.6.7-with-packages:post-build]
  2288. 1697.13 s [ghc-9.6.7-with-packages:post-build] Pushing /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages (4.85 MiB)
  2289. 1698.57 s [ghc-9.6.7-with-packages:post-build]
  2290. 1698.57 s [ghc-9.6.7-with-packages:post-build] All done.
  2291. 1698.59 s [ghc-9.6.7-with-packages:post-build] Uploading to the NixCI cache: /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages
  2292. 1698.63 s [ghc-9.6.7-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2293. 1698.78 s [ghc-9.6.7-with-packages:post-build] copying 1 paths...
  2294. 1698.78 s [ghc-9.6.7-with-packages:post-build] copying path '/nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages' to 'https://cache.nix-ci.com'...
  2295. 1699.80 s [ghc-9.6.7-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2296. 1699.98 s [ghc-9.6.7-with-packages:post-build] copying 1 paths...
  2297. 1699.98 s [ghc-9.6.7-with-packages:post-build] copying path '/nix/store/3ik1jpbmsnyv5kdcr4w2ajwvybsflc6w-ghc-9.6.7-with-packages.drv' to 'https://cache.nix-ci.com'...
  2298. 1700.15 s Progress: 23 of 26 built (1 building), 341 of 341 downloaded from cache
  2299. 1700.15 s [haskell-language-server] Preprocessing library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  2300. 1700.15 s [haskell-language-server] Building library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  2301. 1700.15 s [haskell-language-server]
  2302. 1700.15 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2303. 1700.15 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2304. 1700.15 s [haskell-language-server] but were not needed for compilation:
  2305. 1700.15 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2306. 1700.15 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 )
  2307. 1703.10 s [haskell-language-server]
  2308. 1703.10 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2309. 1703.10 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2310. 1703.10 s [haskell-language-server] but were not needed for compilation:
  2311. 1703.10 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2312. 1703.11 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 )
  2313. 1713.78 s [haskell-language-server] Preprocessing library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  2314. 1713.78 s [haskell-language-server] Building library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  2315. 1713.88 s [haskell-language-server]
  2316. 1713.88 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2317. 1713.88 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2318. 1713.88 s [haskell-language-server] but were not needed for compilation:
  2319. 1713.88 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  2320. 1713.90 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 )
  2321. 1719.11 s [haskell-language-server]
  2322. 1719.11 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2323. 1719.13 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2324. 1719.13 s [haskell-language-server] but were not needed for compilation:
  2325. 1719.13 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  2326. 1719.13 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 )
  2327. 1728.99 s [haskell-language-server] Preprocessing library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  2328. 1729.00 s [haskell-language-server] Building library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  2329. 1729.12 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 )
  2330. 1731.10 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 )
  2331. 1737.53 s [haskell-language-server] Preprocessing executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  2332. 1737.53 s [haskell-language-server] Building executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  2333. 1737.66 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-bench/exe/Main.hs, dist/build/ghcide-bench/ghcide-bench-tmp/Main.dyn_o )
  2334. 1738.09 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-bench/ghcide-bench
  2335. 1739.74 s [haskell-language-server] Preprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  2336. 1739.74 s [haskell-language-server] Building library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  2337. 1739.83 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 )
  2338. 1741.42 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 )
  2339. 1747.64 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0..
  2340. 1747.64 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0..
  2341. 1747.88 s [haskell-language-server]
  2342. 1747.88 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2343. 1747.88 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2344. 1747.88 s [haskell-language-server] but were not needed for compilation:
  2345. 1747.88 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2346. 1747.89 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  2347. 1749.16 s [haskell-language-server] [2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.o, dist/build/Paths_haskell_language_server.dyn_o )
  2348. 1749.16 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.o, dist/build/Ide/Version.dyn_o )
  2349. 1750.74 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 )
  2350. 1751.23 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 )
  2351. 1752.12 s [haskell-language-server]
  2352. 1752.12 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  2353. 1752.12 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  2354. 1752.12 s [haskell-language-server] but were not needed for compilation:
  2355. 1752.12 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  2356. 1752.14 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  2357. 1753.33 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 )
  2358. 1753.34 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  2359. 1755.12 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  2360. 1755.66 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  2361. 1764.13 s [haskell-language-server] Preprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  2362. 1764.15 s [haskell-language-server] Building executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  2363. 1764.33 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 )
  2364. 1765.38 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 )
  2365. 1765.77 s [haskell-language-server] [3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
  2366. 1767.97 s [haskell-language-server] Preprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  2367. 1767.97 s [haskell-language-server] Building executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  2368. 1768.10 s [haskell-language-server] [1 of 1] Compiling Main ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
  2369. 1769.21 s [haskell-language-server] [2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
  2370. 1771.39 s [haskell-language-server] buildPhase completed in 10 minutes 38 seconds
  2371. 1771.41 s [haskell-language-server] Phase: haddockPhase
  2372. 1771.41 s [haskell-language-server] Phase: installPhase
  2373. 1771.57 s [haskell-language-server] Installing internal library hls-overloaded-record-dot-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2374. 1771.67 s [haskell-language-server] Installing internal library hls-change-type-signature-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2375. 1771.69 s [haskell-language-server] Installing internal library hls-class-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2376. 1771.76 s [haskell-language-server] Installing internal library hls-call-hierarchy-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2377. 1771.82 s [haskell-language-server] Installing executable ghcide-test-preprocessor in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2378. 1771.82 s [haskell-language-server] Warning: The directory
  2379. 1771.82 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2380. 1771.82 s [haskell-language-server] is not in the system search path.
  2381. 1771.82 s [haskell-language-server] Installing internal library hls-code-range-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2382. 1771.86 s [haskell-language-server] Installing internal library hls-notes-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2383. 1771.89 s [haskell-language-server] Installing internal library ghcide-bench-lib in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2384. 1771.98 s [haskell-language-server] Installing internal library hls-floskell-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2385. 1771.99 s [haskell-language-server] Installing internal library hls-stylish-haskell-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2386. 1772.01 s [haskell-language-server] Installing internal library hls-pragmas-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2387. 1772.05 s [haskell-language-server] Installing internal library hls-semantic-tokens-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2388. 1772.12 s [haskell-language-server] Installing internal library hls-ormolu-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2389. 1772.14 s [haskell-language-server] Installing internal library hls-explicit-record-fields-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2390. 1772.18 s [haskell-language-server] Installing internal library hls-cabal-gild-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2391. 1772.20 s [haskell-language-server] Installing internal library hls-cabal-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2392. 1772.36 s [haskell-language-server] Installing internal library hls-hlint-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2393. 1772.41 s [haskell-language-server] Installing internal library hls-refactor-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2394. 1772.75 s [haskell-language-server] Installing internal library hls-rename-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2395. 1772.78 s [haskell-language-server] Installing internal library hls-splice-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2396. 1772.83 s [haskell-language-server] Installing internal library hls-retrie-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2397. 1772.93 s [haskell-language-server] Installing internal library hls-gadt-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2398. 1772.96 s [haskell-language-server] Installing internal library hls-alternate-number-format-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2399. 1773.00 s [haskell-language-server] Installing internal library hls-qualify-imported-names-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2400. 1773.03 s [haskell-language-server] Installing internal library hls-cabal-fmt-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2401. 1773.05 s [haskell-language-server] Installing internal library hls-eval-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2402. 1773.22 s [haskell-language-server] Installing internal library hls-signature-help-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2403. 1773.24 s [haskell-language-server] Installing executable plugin-tutorial in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2404. 1773.24 s [haskell-language-server] Warning: The directory
  2405. 1773.24 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2406. 1773.24 s [haskell-language-server] is not in the system search path.
  2407. 1773.25 s [haskell-language-server] Installing internal library hls-stan-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2408. 1773.27 s [haskell-language-server] Installing internal library hls-explicit-imports-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2409. 1773.32 s [haskell-language-server] Installing internal library hls-fourmolu-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2410. 1773.35 s [haskell-language-server] Installing internal library hls-explicit-fixity-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2411. 1773.37 s [haskell-language-server] Installing executable ghcide-bench in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2412. 1773.37 s [haskell-language-server] Warning: The directory
  2413. 1773.37 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2414. 1773.37 s [haskell-language-server] is not in the system search path.
  2415. 1773.37 s [haskell-language-server] Installing internal library hls-module-name-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2416. 1773.40 s [haskell-language-server] Installing library in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2417. 1773.45 s [haskell-language-server] Installing executable haskell-language-server-wrapper in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2418. 1773.45 s [haskell-language-server] Warning: The directory
  2419. 1773.45 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2420. 1773.45 s [haskell-language-server] is not in the system search path.
  2421. 1773.45 s [haskell-language-server] Installing executable haskell-language-server in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2422. 1773.45 s [haskell-language-server] Warning: The directory
  2423. 1773.45 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2424. 1773.45 s [haskell-language-server] is not in the system search path.
  2425. 1776.34 s [haskell-language-server] Phase: fixupPhase
  2426. 1776.35 s [haskell-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  2427. 1776.36 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2428. 1776.56 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2429. 1776.73 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2430. 1776.85 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2431. 1776.98 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2432. 1777.11 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2433. 1777.25 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2434. 1777.37 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2435. 1777.50 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2436. 1777.64 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2437. 1777.76 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2438. 1777.88 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2439. 1778.01 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2440. 1778.14 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2441. 1778.26 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2442. 1778.38 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2443. 1778.50 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2444. 1778.65 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2445. 1778.78 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2446. 1778.92 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2447. 1779.06 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2448. 1779.19 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2449. 1779.31 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2450. 1779.44 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2451. 1779.56 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2452. 1779.68 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2453. 1779.80 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2454. 1779.93 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2455. 1780.05 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2456. 1780.20 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2457. 1780.32 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2458. 1780.44 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-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
  2459. 1780.56 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/ghcide-bench
  2460. 1780.72 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.6.7-unwrapped
  2461. 1780.89 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/plugin-tutorial
  2462. 1781.02 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
  2463. 1781.03 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
  2464. 1781.21 s [haskell-language-server] checking for references to /build/ in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0...
  2465. 1781.34 s [haskell-language-server] patching script interpreter paths in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  2466. 1781.36 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/haskell-language-server: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  2467. 1781.37 s [haskell-language-server] stripping (with command strip and flags -S -p) in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  2468. 1782.22 s [haskell-language-server] rewriting symlink /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/haskell-language-server-9.6.7 to be relative to /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  2469. 1784.34 s [haskell-language-server:post-build] Uploading to cachix cache "sellout": /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  2470. 1784.85 s [haskell-language-server:post-build] Pushing 1 paths (660 are already present) using zstd to cache sellout ⏳
  2471. 1784.85 s [haskell-language-server:post-build]
  2472. 1785.20 s [haskell-language-server:post-build] Pushing /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0 (123.63 MiB)
  2473. 1787.98 s [haskell-language-server:post-build]
  2474. 1787.98 s [haskell-language-server:post-build] All done.
  2475. 1788.00 s [haskell-language-server:post-build] Uploading to the NixCI cache: /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  2476. 1788.04 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2477. 1788.10 s [haskell-language-server:post-build] copying 1 paths...
  2478. 1788.10 s [haskell-language-server:post-build] copying path '/nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...
  2479. 1810.67 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2480. 1810.91 s [haskell-language-server:post-build] copying 1 paths...
  2481. 1810.91 s [haskell-language-server:post-build] copying path '/nix/store/3ar7h9qlgjsynrjnc8x5py4d6f9jkh09-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  2482. 1811.08 s Progress: 24 of 26 built, 341 of 341 downloaded from cache
  2483. 1811.18 s Building /nix/store/qcsvgix30xcj8plxn109fy9rs352myv7-ghc-shell-for-packages-0.drv
  2484. 1812.20 s [ghc-shell-for-packages:post-build] Uploading to cachix cache "sellout": /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0
  2485. 1812.68 s [ghc-shell-for-packages:post-build] Pushing 1 paths (878 are already present) using zstd to cache sellout ⏳
  2486. 1812.68 s [ghc-shell-for-packages:post-build]
  2487. 1813.29 s [ghc-shell-for-packages:post-build] Pushing /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0 (336.00 B)
  2488. 1814.13 s [ghc-shell-for-packages:post-build]
  2489. 1814.13 s [ghc-shell-for-packages:post-build] All done.
  2490. 1814.15 s [ghc-shell-for-packages:post-build] Uploading to the NixCI cache: /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0
  2491. 1814.19 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2492. 1814.24 s [ghc-shell-for-packages:post-build] copying 1 paths...
  2493. 1814.24 s [ghc-shell-for-packages:post-build] copying path '/nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  2494. 1814.44 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2495. 1814.78 s [ghc-shell-for-packages:post-build] copying 1 paths...
  2496. 1814.78 s [ghc-shell-for-packages:post-build] copying path '/nix/store/qcsvgix30xcj8plxn109fy9rs352myv7-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  2497. 1815.09 s Progress: 25 of 26 built, 341 of 341 downloaded from cache
  2498. 1815.10 s Progress: 26 of 26 built, 341 of 341 downloaded from cache
  2499. 1815.10 s /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0
  2500. 1815.18 s Build succeeded.
More Logs Raw Logs

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/a9dce78d-867f-4a2b-9a68-b2c23ac29a5e/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/a9dce78d-867f-4a2b-9a68-b2c23ac29a5e/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/a9dce78d-867f-4a2b-9a68-b2c23ac29a5e/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/a9dce78d-867f-4a2b-9a68-b2c23ac29a5e/raw-logs

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

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/a9dce78d-867f-4a2b-9a68-b2c23ac29a5e/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/a9dce78d-867f-4a2b-9a68-b2c23ac29a5e/repro

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

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