build packages.x86_64-linux.ghc948_all

Reproduce this run
  1. 1609.75 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  2. 1609.75 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  3. 1609.75 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  4. 1609.75 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  5. 1609.75 s [algebraic-graphs] OK: emap id == id
  6. 1609.75 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  7. 1609.75 s [algebraic-graphs]
  8. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  9. 1609.75 s [algebraic-graphs] OK: induce (const True ) x == x
  10. 1609.75 s [algebraic-graphs] OK: induce (const False) x == empty
  11. 1609.75 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  12. 1609.75 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  13. 1609.75 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  14. 1609.75 s [algebraic-graphs]
  15. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  16. 1611.04 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17. 1611.04 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18. 1611.04 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19. 1611.04 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20. 1611.04 s [algebraic-graphs]
  21. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22. 1611.04 s [algebraic-graphs] OK: closure empty == empty
  23. 1611.04 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  24. 1611.04 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  25. 1611.04 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  26. 1611.04 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  27. 1611.04 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  28. 1611.04 s [algebraic-graphs] OK: closure . closure == closure
  29. 1611.04 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  30. 1611.04 s [algebraic-graphs]
  31. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  32. 1611.04 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  33. 1611.04 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  34. 1611.04 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  35. 1611.04 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  36. 1611.04 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  37. 1611.04 s [algebraic-graphs]
  38. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  39. 1611.04 s [algebraic-graphs] OK: symmetricClosure empty == empty
  40. 1611.04 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  41. 1611.04 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  42. 1611.04 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  43. 1611.04 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  44. 1611.04 s [algebraic-graphs]
  45. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  46. 1611.04 s [algebraic-graphs] OK: transitiveClosure empty == empty
  47. 1611.04 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  48. 1611.04 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  49. 1611.04 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  50. 1611.04 s [algebraic-graphs]
  51. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  52. 1611.04 s [algebraic-graphs] OK: isEmpty empty == True
  53. 1611.04 s [algebraic-graphs] OK: hasVertex x empty == False
  54. 1611.04 s [algebraic-graphs] OK: vertexCount empty == 0
  55. 1611.04 s [algebraic-graphs] OK: edgeCount empty == 0
  56. 1611.04 s [algebraic-graphs]
  57. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  58. 1611.04 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  59. 1611.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  60. 1611.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  61. 1611.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  62. 1611.04 s [algebraic-graphs]
  63. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  64. 1611.04 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  65. 1611.04 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  66. 1611.04 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  67. 1611.04 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  68. 1611.04 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  69. 1611.04 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  70. 1611.04 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  71. 1611.04 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  72. 1611.04 s [algebraic-graphs]
  73. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  74. 1611.04 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  75. 1611.04 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  76. 1611.04 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  77. 1611.04 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  78. 1611.04 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  79. 1611.04 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  80. 1611.04 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  81. 1611.04 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  82. 1611.04 s [algebraic-graphs]
  83. 1611.04 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  84. 1611.04 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  85. 1611.04 s [algebraic-graphs]
  86. 1611.04 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  87. 1611.04 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  88. 1611.04 s [algebraic-graphs]
  89. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  90. 1611.04 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  91. 1611.04 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  92. 1611.04 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  93. 1611.04 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  94. 1611.04 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  95. 1611.04 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  96. 1611.04 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  97. 1611.04 s [algebraic-graphs]
  98. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  99. 1611.04 s [algebraic-graphs] OK: vertices [] == empty
  100. 1611.04 s [algebraic-graphs] OK: vertices [x] == vertex x
  101. 1611.04 s [algebraic-graphs] OK: vertices == overlays . map vertex
  102. 1611.04 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  103. 1611.04 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  104. 1611.04 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  105. 1611.04 s [algebraic-graphs]
  106. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  107. 1611.04 s [algebraic-graphs] OK: edges [] == empty
  108. 1611.04 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  109. 1611.04 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  110. 1611.04 s [algebraic-graphs]
  111. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  112. 1611.04 s [algebraic-graphs] OK: overlays [] == empty
  113. 1611.04 s [algebraic-graphs] OK: overlays [x] == x
  114. 1611.04 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  115. 1611.04 s [algebraic-graphs] OK: overlays == foldr overlay empty
  116. 1611.04 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  117. 1611.04 s [algebraic-graphs]
  118. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  119. 1611.04 s [algebraic-graphs] OK: foldg empty vertex connect == id
  120. 1611.04 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  121. 1611.04 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  122. 1611.04 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  123. 1611.04 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  124. 1611.04 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  125. 1611.04 s [algebraic-graphs]
  126. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  127. 1611.04 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  128. 1611.04 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  129. 1611.04 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  130. 1611.04 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  131. 1611.04 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  132. 1611.04 s [algebraic-graphs]
  133. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  134. 1611.04 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  135. 1611.04 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  136. 1611.04 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  137. 1611.04 s [algebraic-graphs]
  138. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  139. 1611.04 s [algebraic-graphs] OK: isEmpty empty == True
  140. 1611.04 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  141. 1611.04 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  142. 1611.04 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  143. 1611.04 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  144. 1611.04 s [algebraic-graphs]
  145. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.size ============
  146. 1611.04 s [algebraic-graphs] OK: size empty == 1
  147. 1611.04 s [algebraic-graphs] OK: size (vertex x) == 1
  148. 1611.04 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  149. 1611.04 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  150. 1611.04 s [algebraic-graphs] OK: size x >= 1
  151. 1611.04 s [algebraic-graphs] OK: size x >= vertexCount x
  152. 1611.04 s [algebraic-graphs]
  153. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  154. 1611.04 s [algebraic-graphs] OK: hasVertex x empty == False
  155. 1611.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  156. 1611.04 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  157. 1611.04 s [algebraic-graphs]
  158. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  159. 1611.04 s [algebraic-graphs] OK: hasEdge x y empty == False
  160. 1611.04 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  161. 1611.04 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  162. 1611.04 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  163. 1611.04 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  164. 1611.04 s [algebraic-graphs]
  165. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  166. 1611.04 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  167. 1611.04 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  168. 1611.04 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  169. 1611.04 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  170. 1611.04 s [algebraic-graphs]
  171. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  172. 1611.04 s [algebraic-graphs] OK: vertexCount empty == 0
  173. 1611.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  174. 1611.04 s [algebraic-graphs] OK: vertexCount == length . vertexList
  175. 1611.04 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  176. 1611.04 s [algebraic-graphs]
  177. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  178. 1611.04 s [algebraic-graphs] OK: edgeCount empty == 0
  179. 1611.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  180. 1611.04 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  181. 1611.04 s [algebraic-graphs] OK: edgeCount == length . edgeList
  182. 1611.04 s [algebraic-graphs]
  183. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  184. 1611.04 s [algebraic-graphs] OK: vertexList empty == []
  185. 1611.04 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  186. 1611.04 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  187. 1611.04 s [algebraic-graphs]
  188. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  189. 1611.04 s [algebraic-graphs] OK: edgeList empty == []
  190. 1611.04 s [algebraic-graphs] OK: edgeList (vertex x) == []
  191. 1611.04 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  192. 1611.04 s [algebraic-graphs]
  193. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  194. 1611.04 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  195. 1611.04 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  196. 1611.04 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  197. 1611.04 s [algebraic-graphs]
  198. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  199. 1611.04 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  200. 1611.04 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  201. 1611.04 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  202. 1611.04 s [algebraic-graphs]
  203. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  204. 1611.04 s [algebraic-graphs] OK: preSet x empty == Set.empty
  205. 1611.04 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  206. 1614.31 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  207. 1614.37 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  208. 1614.37 s [algebraic-graphs]
  209. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  210. 1614.37 s [algebraic-graphs] OK: postSet x empty == Set.empty
  211. 1614.37 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  212. 1614.37 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  213. 1614.37 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  214. 1614.37 s [algebraic-graphs]
  215. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  216. 1614.37 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  217. 1614.37 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  218. 1614.37 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  219. 1614.37 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  220. 1614.37 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  221. 1614.37 s [algebraic-graphs]
  222. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  223. 1614.37 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  224. 1614.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  225. 1614.37 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  226. 1614.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  227. 1614.37 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  228. 1614.37 s [algebraic-graphs]
  229. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  230. 1614.37 s [algebraic-graphs] OK: replaceVertex x x == id
  231. 1614.37 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  232. 1614.37 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  233. 1614.37 s [algebraic-graphs]
  234. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  235. 1614.37 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  236. 1614.37 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  237. 1614.37 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  238. 1614.37 s [algebraic-graphs]
  239. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  240. 1614.37 s [algebraic-graphs] OK: transpose empty == empty
  241. 1614.37 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  242. 1614.37 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  243. 1614.37 s [algebraic-graphs] OK: transpose . transpose == id
  244. 1614.37 s [algebraic-graphs]
  245. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  246. 1614.37 s [algebraic-graphs] OK: fmap f empty == empty
  247. 1614.37 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  248. 1614.37 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  249. 1614.37 s [algebraic-graphs] OK: fmap id == id
  250. 1614.37 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  251. 1614.37 s [algebraic-graphs]
  252. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  253. 1614.37 s [algebraic-graphs] OK: emap h empty == empty
  254. 1614.37 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  255. 1614.37 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  256. 1614.37 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  257. 1614.37 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  258. 1614.37 s [algebraic-graphs] OK: emap id == id
  259. 1614.37 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  260. 1614.37 s [algebraic-graphs]
  261. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  262. 1614.37 s [algebraic-graphs] OK: induce (const True ) x == x
  263. 1614.37 s [algebraic-graphs] OK: induce (const False) x == empty
  264. 1614.37 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  265. 1614.37 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  266. 1614.37 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  267. 1614.37 s [algebraic-graphs]
  268. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  269. 1614.37 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  270. 1614.37 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  271. 1614.37 s [algebraic-graphs] OK: induceJust . gmap Just == id
  272. 1614.37 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  273. 1614.37 s [algebraic-graphs]
  274. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  275. 1614.37 s [algebraic-graphs] OK: closure empty == empty
  276. 1614.37 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  277. 1614.37 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  278. 1614.37 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  279. 1614.37 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  280. 1614.37 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  281. 1614.37 s [algebraic-graphs] OK: closure . closure == closure
  282. 1614.37 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  283. 1614.37 s [algebraic-graphs]
  284. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  285. 1614.37 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  286. 1614.37 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  287. 1614.37 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  288. 1614.37 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  289. 1614.37 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  290. 1614.37 s [algebraic-graphs]
  291. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  292. 1614.37 s [algebraic-graphs] OK: symmetricClosure empty == empty
  293. 1614.37 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  294. 1614.37 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  295. 1614.37 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  296. 1614.37 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  297. 1614.37 s [algebraic-graphs]
  298. 1614.38 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  299. 1614.38 s [algebraic-graphs] OK: transitiveClosure empty == empty
  300. 1614.38 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  301. 1614.38 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  302. 1614.38 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  303. 1614.38 s [algebraic-graphs]
  304. 1614.38 s [algebraic-graphs] ============ Labelled.Graph.context ============
  305. 1614.38 s [algebraic-graphs] OK: context (const False) x == Nothing
  306. 1614.38 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  307. 1614.38 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  308. 1614.38 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  309. 1614.38 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  310. 1614.38 s [algebraic-graphs]
  311. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  312. 1614.38 s [algebraic-graphs] OK: Axioms of non-empty graphs
  313. 1614.38 s [algebraic-graphs] OK: Theorems of non-empty graphs
  314. 1614.38 s [algebraic-graphs]
  315. 1614.38 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  316. 1614.38 s [algebraic-graphs] OK: vertex 1 < vertex 2
  317. 1614.38 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  318. 1614.38 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  319. 1614.38 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  320. 1614.38 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  321. 1614.38 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  322. 1614.38 s [algebraic-graphs] OK: x <= x + y
  323. 1614.38 s [algebraic-graphs] OK: x + y <= x * y
  324. 1614.38 s [algebraic-graphs]
  325. 1614.38 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  326. 1614.38 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  327. 1614.38 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  328. 1614.38 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  329. 1614.38 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  330. 1614.38 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  331. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  332. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  333. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  334. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  335. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  336. 1614.38 s [algebraic-graphs]
  337. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  338. 1614.38 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  339. 1614.38 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  340. 1614.38 s [algebraic-graphs]
  341. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  342. 1614.38 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  343. 1614.38 s [algebraic-graphs]
  344. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  345. 1614.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  346. 1614.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  347. 1614.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  348. 1614.38 s [algebraic-graphs]
  349. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  350. 1614.38 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  351. 1614.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  352. 1614.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  353. 1614.38 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  354. 1614.38 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  355. 1614.38 s [algebraic-graphs]
  356. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  357. 1614.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  358. 1614.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  359. 1614.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  360. 1614.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  361. 1614.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  362. 1614.38 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  363. 1614.38 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  364. 1614.38 s [algebraic-graphs]
  365. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  366. 1614.38 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  367. 1614.38 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  368. 1614.38 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  369. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  370. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  371. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  372. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  373. 1614.38 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  374. 1614.38 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  375. 1614.38 s [algebraic-graphs]
  376. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  377. 1614.38 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  378. 1614.38 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  379. 1614.38 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  380. 1614.38 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  381. 1614.38 s [algebraic-graphs]
  382. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  383. 1614.38 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  384. 1614.38 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  385. 1614.38 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  386. 1614.38 s [algebraic-graphs]
  387. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  388. 1617.76 s [algebraic-graphs] OK: overlays1 [x] == x
  389. 1617.76 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  390. 1617.76 s [algebraic-graphs]
  391. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  392. 1617.76 s [algebraic-graphs] OK: connects1 [x] == x
  393. 1617.76 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  394. 1617.76 s [algebraic-graphs]
  395. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  396. 1617.76 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  397. 1617.76 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  398. 1617.76 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  399. 1617.76 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  400. 1617.76 s [algebraic-graphs]
  401. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  402. 1617.76 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  403. 1617.77 s [algebraic-graphs]
  404. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  405. 1617.77 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  406. 1617.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  407. 1617.77 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  408. 1617.77 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  409. 1617.77 s [algebraic-graphs]
  410. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  411. 1617.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  412. 1617.77 s [algebraic-graphs] OK: vertexCount x >= 1
  413. 1617.77 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  414. 1617.77 s [algebraic-graphs]
  415. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  416. 1617.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  417. 1617.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  418. 1617.77 s [algebraic-graphs] OK: edgeCount == length . edgeList
  419. 1617.77 s [algebraic-graphs]
  420. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  421. 1617.77 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  422. 1617.77 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  423. 1617.77 s [algebraic-graphs]
  424. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  425. 1617.77 s [algebraic-graphs] OK: edgeList (vertex x) == []
  426. 1617.77 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  427. 1617.77 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  428. 1617.77 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  429. 1617.77 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  430. 1617.77 s [algebraic-graphs]
  431. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  432. 1617.77 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  433. 1617.77 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  434. 1617.77 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  435. 1617.77 s [algebraic-graphs]
  436. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  437. 1617.77 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  438. 1617.77 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  439. 1617.77 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  440. 1617.77 s [algebraic-graphs]
  441. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  442. 1617.77 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  443. 1617.77 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  444. 1617.77 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  445. 1617.77 s [algebraic-graphs]
  446. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  447. 1617.77 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  448. 1617.77 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  449. 1617.77 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  450. 1617.77 s [algebraic-graphs]
  451. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  452. 1617.77 s [algebraic-graphs] OK: path1 [x] == vertex x
  453. 1617.77 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  454. 1617.77 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  455. 1617.77 s [algebraic-graphs]
  456. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  457. 1617.77 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  458. 1617.77 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  459. 1617.77 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  460. 1617.77 s [algebraic-graphs]
  461. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  462. 1617.77 s [algebraic-graphs] OK: clique1 [x] == vertex x
  463. 1617.77 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  464. 1617.77 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  465. 1617.77 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  466. 1617.77 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  467. 1617.77 s [algebraic-graphs]
  468. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  469. 1617.77 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  470. 1617.77 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  471. 1617.77 s [algebraic-graphs]
  472. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  473. 1617.77 s [algebraic-graphs] OK: star x [] == vertex x
  474. 1617.77 s [algebraic-graphs] OK: star x [y] == edge x y
  475. 1617.77 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  476. 1617.77 s [algebraic-graphs]
  477. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  478. 1617.77 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  479. 1617.77 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  480. 1617.77 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  481. 1617.77 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  482. 1617.77 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  483. 1617.77 s [algebraic-graphs]
  484. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  485. 1617.77 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  486. 1617.77 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  487. 1617.77 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  488. 1617.77 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  489. 1617.77 s [algebraic-graphs]
  490. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  491. 1617.77 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  492. 1617.77 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  493. 1617.77 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  494. 1617.77 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  495. 1617.77 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  496. 1617.77 s [algebraic-graphs]
  497. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  498. 1617.77 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  499. 1617.77 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  500. 1617.77 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  501. 1617.77 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  502. 1617.77 s [algebraic-graphs]
  503. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  504. 1617.77 s [algebraic-graphs] OK: replaceVertex x x == id
  505. 1617.77 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  506. 1617.77 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  507. 1617.77 s [algebraic-graphs]
  508. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  509. 1617.77 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  510. 1617.77 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  511. 1617.77 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  512. 1617.77 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  513. 1617.77 s [algebraic-graphs]
  514. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  515. 1617.77 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  516. 1617.77 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  517. 1617.77 s [algebraic-graphs] OK: transpose . transpose == id
  518. 1617.77 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  519. 1617.77 s [algebraic-graphs]
  520. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  521. 1617.77 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  522. 1617.77 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  523. 1617.77 s [algebraic-graphs] OK: gmap id == id
  524. 1617.78 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  525. 1617.78 s [algebraic-graphs]
  526. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  527. 1617.78 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  528. 1617.78 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  529. 1617.78 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  530. 1617.78 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  531. 1617.78 s [algebraic-graphs]
  532. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  533. 1617.78 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  534. 1617.78 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  535. 1617.78 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  536. 1617.78 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  537. 1617.78 s [algebraic-graphs]
  538. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  539. 1617.78 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  540. 1617.78 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  541. 1617.78 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  542. 1617.78 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  543. 1617.78 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  544. 1617.78 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  545. 1617.78 s [algebraic-graphs] OK: closure . closure == closure
  546. 1617.78 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  547. 1617.78 s [algebraic-graphs]
  548. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  549. 1617.78 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  550. 1617.78 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  551. 1617.78 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  552. 1617.78 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  553. 1617.78 s [algebraic-graphs]
  554. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  555. 1617.78 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  556. 1617.78 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  557. 1617.78 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  558. 1617.78 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  559. 1617.78 s [algebraic-graphs]
  560. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  561. 1617.78 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  562. 1617.78 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  563. 1617.78 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  564. 1617.78 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  565. 1617.78 s [algebraic-graphs]
  566. 1617.78 s [algebraic-graphs] ============ NonEmpty.Graph.============
  567. 1617.78 s [algebraic-graphs] OK: Axioms of non-empty graphs
  568. 1617.78 s [algebraic-graphs] OK: Theorems of non-empty graphs
  569. 1617.78 s [algebraic-graphs]
  570. 1617.78 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  571. 1617.78 s [algebraic-graphs] OK: vertex 1 < vertex 2
  572. 1617.78 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  573. 1617.78 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  574. 1617.78 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  575. 1617.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  576. 1617.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  577. 1617.78 s [algebraic-graphs] OK: x <= x + y
  578. 1617.78 s [algebraic-graphs] OK: x + y <= x * y
  579. 1617.78 s [algebraic-graphs]
  580. 1617.78 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  581. 1617.78 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  582. 1617.78 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  583. 1617.78 s [algebraic-graphs] OK: fmap id == id
  584. 1617.78 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  585. 1617.78 s [algebraic-graphs]
  586. 1617.78 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  587. 1617.78 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  588. 1619.69 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  589. 1619.69 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  590. 1619.74 s [algebraic-graphs] OK: (x >>= vertex) == x
  591. 1619.74 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  592. 1619.74 s [algebraic-graphs]
  593. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  594. 1619.74 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  595. 1619.74 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  596. 1619.74 s [algebraic-graphs]
  597. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  598. 1619.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  599. 1619.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  600. 1619.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  601. 1619.74 s [algebraic-graphs] OK: size (vertex x) == 1
  602. 1619.74 s [algebraic-graphs]
  603. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  604. 1619.74 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  605. 1619.74 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  606. 1619.74 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  607. 1619.74 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  608. 1619.74 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  609. 1619.74 s [algebraic-graphs]
  610. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  611. 1619.74 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  612. 1619.74 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  613. 1619.74 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  614. 1619.74 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  615. 1619.74 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  616. 1619.74 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  617. 1619.74 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  618. 1619.74 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  619. 1619.74 s [algebraic-graphs]
  620. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  621. 1619.74 s [algebraic-graphs] OK: overlay1 empty x == x
  622. 1619.74 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  623. 1619.74 s [algebraic-graphs]
  624. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  625. 1619.74 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  626. 1619.74 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  627. 1619.74 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  628. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  629. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  630. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  631. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  632. 1619.74 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  633. 1619.74 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  634. 1619.74 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  635. 1619.74 s [algebraic-graphs]
  636. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  637. 1619.74 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  638. 1619.74 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  639. 1619.75 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  640. 1619.75 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  641. 1619.75 s [algebraic-graphs]
  642. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  643. 1619.75 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  644. 1619.75 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  645. 1619.75 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  646. 1619.75 s [algebraic-graphs]
  647. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  648. 1619.75 s [algebraic-graphs] OK: overlays1 [x] == x
  649. 1619.75 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  650. 1619.75 s [algebraic-graphs]
  651. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  652. 1619.75 s [algebraic-graphs] OK: connects1 [x] == x
  653. 1619.75 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  654. 1619.75 s [algebraic-graphs]
  655. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  656. 1619.75 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  657. 1619.75 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  658. 1619.75 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  659. 1619.75 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  660. 1619.75 s [algebraic-graphs]
  661. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  662. 1619.75 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  663. 1619.75 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  664. 1619.75 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  665. 1619.75 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  666. 1619.75 s [algebraic-graphs]
  667. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  668. 1619.75 s [algebraic-graphs] OK: x === x == True
  669. 1619.75 s [algebraic-graphs] OK: x + y === x + y == True
  670. 1619.75 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  671. 1619.75 s [algebraic-graphs] OK: x + y === x * y == False
  672. 1619.75 s [algebraic-graphs]
  673. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  674. 1619.75 s [algebraic-graphs] OK: size (vertex x) == 1
  675. 1619.75 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  676. 1619.75 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  677. 1619.75 s [algebraic-graphs] OK: size x >= 1
  678. 1619.75 s [algebraic-graphs] OK: size x >= vertexCount x
  679. 1619.75 s [algebraic-graphs]
  680. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  681. 1619.75 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  682. 1619.75 s [algebraic-graphs]
  683. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  684. 1619.75 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  685. 1619.75 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  686. 1619.75 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  687. 1619.75 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  688. 1619.75 s [algebraic-graphs]
  689. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  690. 1619.75 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  691. 1619.75 s [algebraic-graphs] OK: vertexCount x >= 1
  692. 1619.75 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  693. 1619.75 s [algebraic-graphs]
  694. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  695. 1619.75 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  696. 1619.75 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  697. 1619.75 s [algebraic-graphs] OK: edgeCount == length . edgeList
  698. 1619.75 s [algebraic-graphs]
  699. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  700. 1619.75 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  701. 1619.75 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  702. 1619.75 s [algebraic-graphs]
  703. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  704. 1619.75 s [algebraic-graphs] OK: edgeList (vertex x) == []
  705. 1619.75 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  706. 1619.75 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  707. 1619.75 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  708. 1619.75 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  709. 1619.75 s [algebraic-graphs]
  710. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  711. 1619.75 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  712. 1619.75 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  713. 1619.75 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  714. 1619.75 s [algebraic-graphs]
  715. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  716. 1619.75 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  717. 1619.75 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  718. 1619.75 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  719. 1619.75 s [algebraic-graphs]
  720. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  721. 1619.75 s [algebraic-graphs] OK: path1 [x] == vertex x
  722. 1619.75 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  723. 1619.75 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  724. 1619.75 s [algebraic-graphs]
  725. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  726. 1619.75 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  727. 1619.75 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  728. 1619.75 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  729. 1619.75 s [algebraic-graphs]
  730. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  731. 1619.75 s [algebraic-graphs] OK: clique1 [x] == vertex x
  732. 1619.75 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  733. 1619.75 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  734. 1619.75 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  735. 1619.75 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  736. 1619.75 s [algebraic-graphs]
  737. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  738. 1619.75 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  739. 1619.75 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  740. 1619.75 s [algebraic-graphs]
  741. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  742. 1619.75 s [algebraic-graphs] OK: star x [] == vertex x
  743. 1619.75 s [algebraic-graphs] OK: star x [y] == edge x y
  744. 1619.75 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  745. 1619.75 s [algebraic-graphs]
  746. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  747. 1619.75 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  748. 1619.75 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  749. 1619.75 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  750. 1619.75 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  751. 1619.75 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  752. 1619.75 s [algebraic-graphs]
  753. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  754. 1619.75 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  755. 1619.75 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  756. 1619.75 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  757. 1619.75 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  758. 1619.75 s [algebraic-graphs]
  759. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  760. 1619.75 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  761. 1619.75 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  762. 1619.75 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  763. 1619.75 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  764. 1619.75 s [algebraic-graphs]
  765. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  766. 1619.75 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  767. 1619.75 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  768. 1619.75 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  769. 1619.75 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  770. 1619.75 s [algebraic-graphs]
  771. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  772. 1619.75 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  773. 1619.75 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  774. 1619.75 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  775. 1619.75 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  776. 1619.75 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  777. 1619.75 s [algebraic-graphs]
  778. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  779. 1619.75 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  780. 1619.75 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  781. 1619.75 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  782. 1619.75 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  783. 1619.75 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  784. 1619.75 s [algebraic-graphs]
  785. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  786. 1619.75 s [algebraic-graphs] OK: replaceVertex x x == id
  787. 1619.75 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  788. 1619.75 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  789. 1619.75 s [algebraic-graphs]
  790. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  791. 1619.75 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  792. 1627.37 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  793. 1627.37 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  794. 1627.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  795. 1627.39 s [algebraic-graphs]
  796. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  797. 1627.39 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  798. 1627.39 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  799. 1627.39 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  800. 1627.39 s [algebraic-graphs]
  801. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  802. 1627.39 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  803. 1627.39 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  804. 1627.39 s [algebraic-graphs] OK: transpose . transpose == id
  805. 1627.39 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  806. 1627.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  807. 1627.39 s [algebraic-graphs]
  808. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  809. 1627.39 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  810. 1627.39 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  811. 1627.39 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  812. 1627.39 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  813. 1627.39 s [algebraic-graphs]
  814. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  815. 1627.39 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  816. 1627.39 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  817. 1627.39 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  818. 1627.39 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  819. 1627.39 s [algebraic-graphs]
  820. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  821. 1627.39 s [algebraic-graphs] OK: simplify == id
  822. 1627.39 s [algebraic-graphs] OK: size (simplify x) <= size x
  823. 1627.39 s [algebraic-graphs] OK: simplify 1 === 1
  824. 1627.39 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  825. 1627.39 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  826. 1627.39 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  827. 1627.39 s [algebraic-graphs]
  828. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  829. 1627.39 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  830. 1627.39 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  831. 1627.39 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  832. 1627.39 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  833. 1627.39 s [algebraic-graphs]
  834. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  835. 1627.39 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  836. 1627.39 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  837. 1627.39 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  838. 1627.39 s [algebraic-graphs]
  839. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  840. 1627.39 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  841. 1627.39 s [algebraic-graphs] OK: box x y ~~ box y x
  842. 1627.39 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  843. 1627.39 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  844. 1627.39 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  845. 1627.39 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  846. 1627.39 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  847. 1627.39 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  848. 1627.39 s [algebraic-graphs]
  849. 1627.39 s [algebraic-graphs] ============ Relation ============
  850. 1627.39 s [algebraic-graphs] OK: Axioms of graphs
  851. 1627.39 s [algebraic-graphs]
  852. 1627.39 s [algebraic-graphs] ============ Relation.consistent ============
  853. 1627.39 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  854. 1627.39 s [algebraic-graphs]
  855. 1627.39 s [algebraic-graphs] OK: consistent empty == True
  856. 1627.39 s [algebraic-graphs] OK: consistent (vertex x) == True
  857. 1627.39 s [algebraic-graphs] OK: consistent (overlay x y) == True
  858. 1627.39 s [algebraic-graphs] OK: consistent (connect x y) == True
  859. 1627.39 s [algebraic-graphs] OK: consistent (edge x y) == True
  860. 1627.39 s [algebraic-graphs] OK: consistent (edges xs) == True
  861. 1627.39 s [algebraic-graphs] OK: consistent (stars xs) == True
  862. 1627.39 s [algebraic-graphs]
  863. 1627.39 s [algebraic-graphs] ============ Relation.Show ============
  864. 1627.39 s [algebraic-graphs] OK: show (empty ) == "empty"
  865. 1627.39 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  866. 1627.39 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  867. 1627.39 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  868. 1627.39 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  869. 1627.39 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  870. 1627.39 s [algebraic-graphs]
  871. 1627.39 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  872. 1627.39 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  873. 1627.39 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  874. 1627.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  875. 1627.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  876. 1627.39 s [algebraic-graphs]
  877. 1627.39 s [algebraic-graphs] ============ Relation.Ord ============
  878. 1627.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  879. 1627.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  880. 1627.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  881. 1627.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  882. 1627.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  883. 1627.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  884. 1627.39 s [algebraic-graphs] OK: x <= x + y
  885. 1627.39 s [algebraic-graphs] OK: x + y <= x * y
  886. 1627.39 s [algebraic-graphs]
  887. 1627.39 s [algebraic-graphs] ============ Relation.empty ============
  888. 1627.39 s [algebraic-graphs] OK: isEmpty empty == True
  889. 1627.39 s [algebraic-graphs] OK: hasVertex x empty == False
  890. 1627.39 s [algebraic-graphs] OK: vertexCount empty == 0
  891. 1627.39 s [algebraic-graphs] OK: edgeCount empty == 0
  892. 1627.39 s [algebraic-graphs]
  893. 1627.39 s [algebraic-graphs] ============ Relation.vertex ============
  894. 1627.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  895. 1627.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  896. 1627.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  897. 1627.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  898. 1627.39 s [algebraic-graphs]
  899. 1627.39 s [algebraic-graphs] ============ Relation.edge ============
  900. 1627.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  901. 1627.39 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  902. 1627.39 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  903. 1627.39 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  904. 1627.39 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  905. 1627.39 s [algebraic-graphs]
  906. 1627.39 s [algebraic-graphs] ============ Relation.overlay ============
  907. 1627.39 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  908. 1627.39 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  909. 1627.39 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  910. 1627.39 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  911. 1627.39 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  912. 1627.39 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  913. 1627.39 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  914. 1627.39 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  915. 1627.39 s [algebraic-graphs]
  916. 1627.39 s [algebraic-graphs] ============ Relation.connect ============
  917. 1627.39 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  918. 1627.39 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  919. 1627.39 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  920. 1627.39 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  921. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  922. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  923. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  924. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  925. 1627.39 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  926. 1627.39 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  927. 1627.39 s [algebraic-graphs]
  928. 1627.39 s [algebraic-graphs] ============ Relation.vertices ============
  929. 1627.39 s [algebraic-graphs] OK: vertices [] == empty
  930. 1627.39 s [algebraic-graphs] OK: vertices [x] == vertex x
  931. 1627.39 s [algebraic-graphs] OK: vertices == overlays . map vertex
  932. 1627.39 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  933. 1627.39 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  934. 1627.39 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  935. 1627.39 s [algebraic-graphs]
  936. 1627.39 s [algebraic-graphs] ============ Relation.edges ============
  937. 1627.39 s [algebraic-graphs] OK: edges [] == empty
  938. 1627.39 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  939. 1627.39 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  940. 1627.39 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  941. 1627.39 s [algebraic-graphs]
  942. 1627.39 s [algebraic-graphs] ============ Relation.overlays ============
  943. 1627.39 s [algebraic-graphs] OK: overlays [] == empty
  944. 1627.39 s [algebraic-graphs] OK: overlays [x] == x
  945. 1627.39 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  946. 1627.39 s [algebraic-graphs] OK: overlays == foldr overlay empty
  947. 1627.39 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  948. 1627.39 s [algebraic-graphs]
  949. 1627.39 s [algebraic-graphs] ============ Relation.connects ============
  950. 1627.39 s [algebraic-graphs] OK: connects [] == empty
  951. 1627.39 s [algebraic-graphs] OK: connects [x] == x
  952. 1627.39 s [algebraic-graphs] OK: connects [x,y] == connect x y
  953. 1627.39 s [algebraic-graphs] OK: connects == foldr connect empty
  954. 1627.39 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  955. 1627.39 s [algebraic-graphs]
  956. 1627.39 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  957. 1627.39 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  958. 1627.39 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  959. 1627.39 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  960. 1627.39 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  961. 1627.39 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  962. 1627.39 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  963. 1627.39 s [algebraic-graphs]
  964. 1627.39 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  965. 1627.39 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  966. 1627.39 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  967. 1627.39 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  968. 1627.39 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  969. 1627.39 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  970. 1627.39 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  971. 1627.39 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  972. 1627.39 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  973. 1627.39 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  974. 1627.39 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  975. 1627.39 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  976. 1627.39 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  977. 1627.39 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  978. 1627.39 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  979. 1627.39 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  980. 1627.39 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  981. 1627.39 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  982. 1631.34 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  983. 1631.34 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  984. 1631.34 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  985. 1631.34 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  986. 1631.35 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  987. 1631.35 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  988. 1631.35 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  989. 1631.35 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  990. 1631.35 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  991. 1631.35 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  992. 1631.35 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  993. 1631.35 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  994. 1631.35 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  995. 1631.35 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  996. 1631.35 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  997. 1631.35 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  998. 1631.35 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  999. 1631.35 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1000. 1631.35 s [algebraic-graphs]
  1001. 1631.35 s [algebraic-graphs] ============ Relation.foldg ============
  1002. 1631.35 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  1003. 1631.35 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  1004. 1631.35 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  1005. 1631.35 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  1006. 1631.35 s [algebraic-graphs]
  1007. 1631.35 s [algebraic-graphs] ============ Relation.isEmpty ============
  1008. 1631.35 s [algebraic-graphs] OK: isEmpty empty == True
  1009. 1631.35 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1010. 1631.35 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1011. 1631.35 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1012. 1631.35 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1013. 1631.35 s [algebraic-graphs]
  1014. 1631.35 s [algebraic-graphs] ============ Relation.hasVertex ============
  1015. 1631.35 s [algebraic-graphs] OK: hasVertex x empty == False
  1016. 1631.35 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1017. 1631.35 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1018. 1631.35 s [algebraic-graphs]
  1019. 1631.35 s [algebraic-graphs] ============ Relation.hasEdge ============
  1020. 1631.35 s [algebraic-graphs] OK: hasEdge x y empty == False
  1021. 1631.35 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1022. 1631.35 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1023. 1631.35 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1024. 1631.35 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  1025. 1631.35 s [algebraic-graphs]
  1026. 1631.35 s [algebraic-graphs] ============ Relation.vertexCount ============
  1027. 1631.35 s [algebraic-graphs] OK: vertexCount empty == 0
  1028. 1631.35 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1029. 1631.35 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1030. 1631.35 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1031. 1631.35 s [algebraic-graphs]
  1032. 1631.35 s [algebraic-graphs] ============ Relation.edgeCount ============
  1033. 1631.35 s [algebraic-graphs] OK: edgeCount empty == 0
  1034. 1631.35 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1035. 1631.35 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1036. 1631.35 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1037. 1631.35 s [algebraic-graphs]
  1038. 1631.35 s [algebraic-graphs] ============ Relation.vertexList ============
  1039. 1631.35 s [algebraic-graphs] OK: vertexList empty == []
  1040. 1631.35 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1041. 1631.35 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1042. 1631.35 s [algebraic-graphs]
  1043. 1631.35 s [algebraic-graphs] ============ Relation.vertexSet ============
  1044. 1631.35 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1045. 1631.35 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1046. 1631.35 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1047. 1631.35 s [algebraic-graphs]
  1048. 1631.35 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  1049. 1631.35 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1050. 1631.35 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1051. 1631.35 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1052. 1631.35 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1053. 1631.35 s [algebraic-graphs]
  1054. 1631.35 s [algebraic-graphs] ============ Relation.edgeList ============
  1055. 1631.35 s [algebraic-graphs] OK: edgeList empty == []
  1056. 1631.35 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1057. 1631.35 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  1058. 1631.35 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  1059. 1631.35 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  1060. 1631.35 s [algebraic-graphs]
  1061. 1631.35 s [algebraic-graphs] ============ Relation.edgeSet ============
  1062. 1631.35 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1063. 1631.35 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1064. 1631.35 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  1065. 1631.35 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  1066. 1631.35 s [algebraic-graphs]
  1067. 1631.35 s [algebraic-graphs] ============ Relation.adjacencyList ============
  1068. 1631.35 s [algebraic-graphs] OK: adjacencyList empty == []
  1069. 1631.35 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1070. 1631.35 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  1071. 1631.35 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  1072. 1631.35 s [algebraic-graphs]
  1073. 1631.35 s [algebraic-graphs] ============ Relation.preSet ============
  1074. 1631.35 s [algebraic-graphs] OK: preSet x empty == Set.empty
  1075. 1631.35 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  1076. 1631.35 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  1077. 1631.35 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  1078. 1631.35 s [algebraic-graphs]
  1079. 1631.35 s [algebraic-graphs] ============ Relation.preIntSet ============
  1080. 1631.35 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  1081. 1631.35 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  1082. 1631.35 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  1083. 1631.35 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  1084. 1631.35 s [algebraic-graphs]
  1085. 1631.35 s [algebraic-graphs] ============ Relation.postSet ============
  1086. 1631.35 s [algebraic-graphs] OK: postSet x empty == Set.empty
  1087. 1631.35 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  1088. 1631.35 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  1089. 1631.35 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  1090. 1631.35 s [algebraic-graphs]
  1091. 1631.35 s [algebraic-graphs] ============ Relation.postIntSet ============
  1092. 1631.35 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  1093. 1631.35 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  1094. 1631.35 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  1095. 1631.35 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  1096. 1631.35 s [algebraic-graphs]
  1097. 1631.35 s [algebraic-graphs] ============ Relation.path ============
  1098. 1631.35 s [algebraic-graphs] OK: path [] == empty
  1099. 1631.35 s [algebraic-graphs] OK: path [x] == vertex x
  1100. 1631.35 s [algebraic-graphs] OK: path [x,y] == edge x y
  1101. 1631.35 s [algebraic-graphs]
  1102. 1631.35 s [algebraic-graphs] ============ Relation.circuit ============
  1103. 1631.35 s [algebraic-graphs] OK: circuit [] == empty
  1104. 1631.35 s [algebraic-graphs] OK: circuit [x] == edge x x
  1105. 1631.35 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1106. 1631.35 s [algebraic-graphs]
  1107. 1631.35 s [algebraic-graphs] ============ Relation.clique ============
  1108. 1631.35 s [algebraic-graphs] OK: clique [] == empty
  1109. 1631.35 s [algebraic-graphs] OK: clique [x] == vertex x
  1110. 1631.35 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1111. 1631.35 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1112. 1631.35 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1113. 1631.35 s [algebraic-graphs]
  1114. 1631.35 s [algebraic-graphs] ============ Relation.biclique ============
  1115. 1631.35 s [algebraic-graphs] OK: biclique [] [] == empty
  1116. 1631.35 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1117. 1631.35 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1118. 1631.35 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1119. 1631.35 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1120. 1631.35 s [algebraic-graphs]
  1121. 1631.35 s [algebraic-graphs] ============ Relation.star ============
  1122. 1631.35 s [algebraic-graphs] OK: star x [] == vertex x
  1123. 1631.35 s [algebraic-graphs] OK: star x [y] == edge x y
  1124. 1631.35 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1125. 1631.35 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1126. 1631.35 s [algebraic-graphs]
  1127. 1631.35 s [algebraic-graphs] ============ Relation.stars ============
  1128. 1631.35 s [algebraic-graphs] OK: stars [] == empty
  1129. 1631.35 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1130. 1631.35 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1131. 1631.35 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1132. 1631.35 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1133. 1631.35 s [algebraic-graphs] OK: stars . adjacencyList == id
  1134. 1631.35 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1135. 1631.35 s [algebraic-graphs]
  1136. 1631.35 s [algebraic-graphs] ============ Relation.tree ============
  1137. 1631.35 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1138. 1631.35 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1139. 1631.35 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1140. 1631.35 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1141. 1631.35 s [algebraic-graphs]
  1142. 1631.35 s [algebraic-graphs] ============ Relation.forest ============
  1143. 1631.35 s [algebraic-graphs] OK: forest [] == empty
  1144. 1631.35 s [algebraic-graphs] OK: forest [x] == tree x
  1145. 1631.35 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1146. 1631.35 s [algebraic-graphs] OK: forest == overlays . map tree
  1147. 1631.35 s [algebraic-graphs]
  1148. 1631.35 s [algebraic-graphs] ============ Relation.removeVertex ============
  1149. 1631.35 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1150. 1631.35 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1151. 1631.35 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1152. 1631.35 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1153. 1631.35 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1154. 1631.35 s [algebraic-graphs]
  1155. 1631.35 s [algebraic-graphs] ============ Relation.removeEdge ============
  1156. 1631.35 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1157. 1631.35 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1158. 1631.35 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1159. 1631.35 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1160. 1631.35 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1161. 1631.35 s [algebraic-graphs]
  1162. 1631.35 s [algebraic-graphs] ============ Relation.replaceVertex ============
  1163. 1631.35 s [algebraic-graphs] OK: replaceVertex x x == id
  1164. 1631.35 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1165. 1631.35 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1166. 1631.35 s [algebraic-graphs]
  1167. 1631.35 s [algebraic-graphs] ============ Relation.mergeVertices ============
  1168. 1631.35 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1169. 1659.38 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1170. 1659.38 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1171. 1659.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1172. 1659.39 s [algebraic-graphs]
  1173. 1659.39 s [algebraic-graphs] ============ Relation.transpose ============
  1174. 1659.39 s [algebraic-graphs] OK: transpose empty == empty
  1175. 1659.39 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  1176. 1659.39 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  1177. 1659.39 s [algebraic-graphs] OK: transpose . transpose == id
  1178. 1659.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  1179. 1659.39 s [algebraic-graphs]
  1180. 1659.39 s [algebraic-graphs] ============ Relation.gmap ============
  1181. 1659.39 s [algebraic-graphs] OK: gmap f empty == empty
  1182. 1659.39 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1183. 1659.39 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1184. 1659.39 s [algebraic-graphs] OK: gmap id == id
  1185. 1659.39 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1186. 1659.39 s [algebraic-graphs]
  1187. 1659.39 s [algebraic-graphs] ============ Relation.induce ============
  1188. 1659.39 s [algebraic-graphs] OK: induce (const True ) x == x
  1189. 1659.39 s [algebraic-graphs] OK: induce (const False) x == empty
  1190. 1659.39 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1191. 1659.39 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1192. 1659.39 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1193. 1659.39 s [algebraic-graphs]
  1194. 1659.39 s [algebraic-graphs] ============ Relation.compose ============
  1195. 1659.39 s [algebraic-graphs] OK: compose empty x == empty
  1196. 1659.39 s [algebraic-graphs] OK: compose x empty == empty
  1197. 1659.39 s [algebraic-graphs] OK: compose (vertex x) y == empty
  1198. 1659.39 s [algebraic-graphs] OK: compose x (vertex y) == empty
  1199. 1659.39 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  1200. 1659.39 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  1201. 1659.39 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  1202. 1659.39 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  1203. 1659.39 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  1204. 1659.39 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  1205. 1659.39 s [algebraic-graphs]
  1206. 1659.39 s [algebraic-graphs] ============ Relation.closure ============
  1207. 1659.39 s [algebraic-graphs] OK: closure empty == empty
  1208. 1659.39 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  1209. 1659.39 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  1210. 1659.39 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1211. 1659.39 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  1212. 1659.39 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  1213. 1659.39 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  1214. 1659.39 s [algebraic-graphs] OK: closure . closure == closure
  1215. 1659.39 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  1216. 1659.39 s [algebraic-graphs]
  1217. 1659.39 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  1218. 1659.39 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  1219. 1659.39 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  1220. 1659.39 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  1221. 1659.39 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1222. 1659.39 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  1223. 1659.39 s [algebraic-graphs]
  1224. 1659.39 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  1225. 1659.39 s [algebraic-graphs] OK: symmetricClosure empty == empty
  1226. 1659.39 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  1227. 1659.39 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  1228. 1659.39 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  1229. 1659.39 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  1230. 1659.39 s [algebraic-graphs]
  1231. 1659.39 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  1232. 1659.39 s [algebraic-graphs] OK: transitiveClosure empty == empty
  1233. 1659.39 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  1234. 1659.39 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  1235. 1659.39 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  1236. 1659.39 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  1237. 1659.39 s [algebraic-graphs]
  1238. 1659.39 s [algebraic-graphs] ============ Relation.induceJust ============
  1239. 1659.39 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1240. 1659.39 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1241. 1659.40 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1242. 1659.40 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1243. 1659.40 s [algebraic-graphs]
  1244. 1659.40 s [algebraic-graphs] ============ ReflexiveRelation ============
  1245. 1659.40 s [algebraic-graphs] OK: Axioms of reflexive graphs
  1246. 1659.40 s [algebraic-graphs]
  1247. 1659.40 s [algebraic-graphs] ============ TransitiveRelation ============
  1248. 1659.40 s [algebraic-graphs] OK: Axioms of transitive graphs
  1249. 1659.40 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  1250. 1659.40 s [algebraic-graphs]
  1251. 1659.40 s [algebraic-graphs] ============ PreorderRelation ============
  1252. 1659.40 s [algebraic-graphs] OK: Axioms of preorder graphs
  1253. 1659.40 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  1254. 1659.40 s [algebraic-graphs]
  1255. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation ============
  1256. 1659.40 s [algebraic-graphs] OK: Axioms of undirected graphs
  1257. 1659.40 s [algebraic-graphs]
  1258. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  1259. 1659.40 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  1260. 1659.40 s [algebraic-graphs]
  1261. 1659.40 s [algebraic-graphs] OK: consistent empty == True
  1262. 1659.40 s [algebraic-graphs] OK: consistent (vertex x) == True
  1263. 1659.40 s [algebraic-graphs] OK: consistent (overlay x y) == True
  1264. 1659.40 s [algebraic-graphs] OK: consistent (connect x y) == True
  1265. 1659.40 s [algebraic-graphs] OK: consistent (edge x y) == True
  1266. 1659.40 s [algebraic-graphs] OK: consistent (edges xs) == True
  1267. 1659.40 s [algebraic-graphs] OK: consistent (stars xs) == True
  1268. 1659.40 s [algebraic-graphs]
  1269. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  1270. 1659.40 s [algebraic-graphs] OK: show (empty ) == "empty"
  1271. 1659.40 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1272. 1659.40 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1273. 1659.40 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1274. 1659.40 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1275. 1659.40 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1276. 1659.40 s [algebraic-graphs]
  1277. 1659.40 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1278. 1659.40 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1279. 1659.40 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1280. 1659.40 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1281. 1659.40 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1282. 1659.40 s [algebraic-graphs]
  1283. 1659.40 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1284. 1659.40 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1285. 1659.40 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1286. 1659.40 s [algebraic-graphs]
  1287. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  1288. 1659.40 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  1289. 1659.40 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  1290. 1659.40 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  1291. 1659.40 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  1292. 1659.40 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  1293. 1659.40 s [algebraic-graphs]
  1294. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  1295. 1659.40 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  1296. 1659.40 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  1297. 1659.40 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  1298. 1659.40 s [algebraic-graphs]
  1299. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  1300. 1659.40 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1301. 1659.40 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1302. 1659.40 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1303. 1659.40 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1304. 1659.40 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1305. 1659.40 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1306. 1659.40 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1307. 1659.40 s [algebraic-graphs] OK: x <= x + y
  1308. 1659.40 s [algebraic-graphs] OK: x + y <= x * y
  1309. 1659.40 s [algebraic-graphs]
  1310. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  1311. 1659.40 s [algebraic-graphs] OK: isEmpty empty == True
  1312. 1659.40 s [algebraic-graphs] OK: hasVertex x empty == False
  1313. 1659.40 s [algebraic-graphs] OK: vertexCount empty == 0
  1314. 1659.40 s [algebraic-graphs] OK: edgeCount empty == 0
  1315. 1659.40 s [algebraic-graphs]
  1316. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  1317. 1659.40 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1318. 1659.40 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1319. 1659.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1320. 1659.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1321. 1659.40 s [algebraic-graphs]
  1322. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  1323. 1659.40 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1324. 1659.40 s [algebraic-graphs] OK: edge x y == edge y x
  1325. 1659.40 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1326. 1659.40 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1327. 1659.40 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1328. 1659.40 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1329. 1659.40 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1330. 1659.40 s [algebraic-graphs]
  1331. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  1332. 1659.40 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1333. 1659.40 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1334. 1659.40 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1335. 1659.40 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1336. 1659.40 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1337. 1659.40 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1338. 1659.40 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1339. 1659.40 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1340. 1659.40 s [algebraic-graphs]
  1341. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  1342. 1659.40 s [algebraic-graphs] OK: connect x y == connect y x
  1343. 1659.40 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1344. 1659.40 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1345. 1659.40 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1346. 1659.40 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1347. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1348. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1349. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1350. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1351. 1659.40 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1352. 1659.40 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1353. 1659.40 s [algebraic-graphs]
  1354. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  1355. 1659.40 s [algebraic-graphs] OK: vertices [] == empty
  1356. 1659.40 s [algebraic-graphs] OK: vertices [x] == vertex x
  1357. 1659.40 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1358. 1659.40 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1359. 1659.40 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1360. 1659.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1361. 1659.40 s [algebraic-graphs]
  1362. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  1363. 1659.40 s [algebraic-graphs] OK: edges [] == empty
  1364. 1659.40 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1365. 1659.40 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1366. 1659.40 s [algebraic-graphs]
  1367. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  1368. 1659.40 s [algebraic-graphs] OK: overlays [] == empty
  1369. 1673.84 s [algebraic-graphs] OK: overlays [x] == x
  1370. 1673.85 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1371. 1673.85 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1372. 1673.85 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1373. 1673.85 s [algebraic-graphs]
  1374. 1673.85 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  1375. 1673.85 s [algebraic-graphs] OK: connects [] == empty
  1376. 1673.85 s [algebraic-graphs] OK: connects [x] == x
  1377. 1673.85 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1378. 1673.85 s [algebraic-graphs] OK: connects == foldr connect empty
  1379. 1673.85 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1380. 1673.85 s [algebraic-graphs] OK: connects == connects . reverse
  1381. 1673.85 s [algebraic-graphs]
  1382. 1673.85 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  1383. 1673.85 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1384. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1385. 1673.85 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1386. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1387. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1388. 1673.85 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1389. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1390. 1673.85 s [algebraic-graphs]
  1391. 1673.85 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  1392. 1673.85 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  1393. 1673.85 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  1394. 1673.85 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  1395. 1673.85 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  1396. 1673.85 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  1397. 1673.85 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  1398. 1673.85 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  1399. 1673.85 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  1400. 1673.85 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  1401. 1673.85 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1402. 1673.85 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1403. 1673.86 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1404. 1673.86 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1405. 1673.86 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1406. 1673.86 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1407. 1673.86 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1408. 1673.86 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1409. 1673.86 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1410. 1673.86 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1411. 1673.86 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1412. 1673.86 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1413. 1673.86 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1414. 1673.86 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1415. 1673.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1416. 1673.86 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1417. 1673.86 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1418. 1673.86 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1419. 1673.86 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1420. 1673.86 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1421. 1673.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1422. 1673.86 s [algebraic-graphs]
  1423. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  1424. 1673.86 s [algebraic-graphs] OK: isEmpty empty == True
  1425. 1673.86 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1426. 1673.86 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1427. 1673.86 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1428. 1673.86 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1429. 1673.86 s [algebraic-graphs]
  1430. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  1431. 1673.86 s [algebraic-graphs] OK: hasVertex x empty == False
  1432. 1673.86 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1433. 1673.86 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1434. 1673.86 s [algebraic-graphs]
  1435. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  1436. 1673.86 s [algebraic-graphs] OK: hasEdge x y empty == False
  1437. 1673.86 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1438. 1673.86 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1439. 1673.86 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  1440. 1673.86 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1441. 1673.86 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  1442. 1673.86 s [algebraic-graphs]
  1443. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  1444. 1673.86 s [algebraic-graphs] OK: vertexCount empty == 0
  1445. 1673.86 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1446. 1673.86 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1447. 1673.86 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1448. 1673.86 s [algebraic-graphs]
  1449. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  1450. 1673.86 s [algebraic-graphs] OK: edgeCount empty == 0
  1451. 1673.86 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1452. 1673.86 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1453. 1673.86 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1454. 1673.86 s [algebraic-graphs]
  1455. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  1456. 1673.86 s [algebraic-graphs] OK: vertexList empty == []
  1457. 1673.86 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1458. 1673.86 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1459. 1673.86 s [algebraic-graphs]
  1460. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  1461. 1673.86 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1462. 1673.86 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1463. 1673.86 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1464. 1673.86 s [algebraic-graphs]
  1465. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  1466. 1673.86 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1467. 1673.86 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1468. 1673.86 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1469. 1673.86 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1470. 1673.86 s [algebraic-graphs]
  1471. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  1472. 1673.86 s [algebraic-graphs] OK: edgeList empty == []
  1473. 1673.86 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1474. 1673.86 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  1475. 1673.86 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  1476. 1673.86 s [algebraic-graphs]
  1477. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  1478. 1673.86 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1479. 1673.86 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1480. 1673.86 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  1481. 1673.86 s [algebraic-graphs]
  1482. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  1483. 1673.86 s [algebraic-graphs] OK: adjacencyList empty == []
  1484. 1673.86 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1485. 1673.86 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  1486. 1673.86 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  1487. 1673.86 s [algebraic-graphs]
  1488. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  1489. 1673.86 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  1490. 1673.86 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  1491. 1673.86 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  1492. 1673.86 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  1493. 1673.86 s [algebraic-graphs]
  1494. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  1495. 1673.86 s [algebraic-graphs] OK: path [] == empty
  1496. 1673.86 s [algebraic-graphs] OK: path [x] == vertex x
  1497. 1673.86 s [algebraic-graphs] OK: path [x,y] == edge x y
  1498. 1673.86 s [algebraic-graphs] OK: path == path . reverse
  1499. 1673.86 s [algebraic-graphs]
  1500. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  1501. 1673.86 s [algebraic-graphs] OK: circuit [] == empty
  1502. 1673.86 s [algebraic-graphs] OK: circuit [x] == edge x x
  1503. 1673.86 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1504. 1673.86 s [algebraic-graphs] OK: circuit == circuit . reverse
  1505. 1673.86 s [algebraic-graphs]
  1506. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  1507. 1673.86 s [algebraic-graphs] OK: clique [] == empty
  1508. 1673.86 s [algebraic-graphs] OK: clique [x] == vertex x
  1509. 1673.86 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1510. 1673.86 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1511. 1673.86 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1512. 1673.86 s [algebraic-graphs] OK: clique == clique . reverse
  1513. 1673.86 s [algebraic-graphs]
  1514. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  1515. 1673.86 s [algebraic-graphs] OK: biclique [] [] == empty
  1516. 1673.86 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1517. 1673.86 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1518. 1673.86 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1519. 1673.86 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1520. 1673.86 s [algebraic-graphs]
  1521. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  1522. 1673.86 s [algebraic-graphs] OK: star x [] == vertex x
  1523. 1673.86 s [algebraic-graphs] OK: star x [y] == edge x y
  1524. 1673.86 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1525. 1673.86 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1526. 1673.86 s [algebraic-graphs]
  1527. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  1528. 1673.86 s [algebraic-graphs] OK: stars [] == empty
  1529. 1673.86 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1530. 1673.86 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1531. 1673.86 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1532. 1673.86 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1533. 1673.86 s [algebraic-graphs] OK: stars . adjacencyList == id
  1534. 1673.86 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1535. 1673.86 s [algebraic-graphs]
  1536. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  1537. 1673.86 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1538. 1673.86 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1539. 1673.86 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1540. 1673.86 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1541. 1673.86 s [algebraic-graphs]
  1542. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  1543. 1673.86 s [algebraic-graphs] OK: forest [] == empty
  1544. 1681.37 s [algebraic-graphs] OK: forest [x] == tree x
  1545. 1681.37 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1546. 1681.38 s [algebraic-graphs] OK: forest == overlays . map tree
  1547. 1681.38 s [algebraic-graphs]
  1548. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  1549. 1681.38 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1550. 1681.38 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1551. 1681.38 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1552. 1681.38 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1553. 1681.38 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1554. 1681.38 s [algebraic-graphs]
  1555. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  1556. 1681.38 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1557. 1681.38 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1558. 1681.38 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1559. 1681.38 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1560. 1681.38 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1561. 1681.38 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1562. 1681.38 s [algebraic-graphs]
  1563. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  1564. 1681.38 s [algebraic-graphs] OK: replaceVertex x x == id
  1565. 1681.38 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1566. 1681.38 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1567. 1681.38 s [algebraic-graphs]
  1568. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  1569. 1681.38 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1570. 1681.38 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1571. 1681.38 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1572. 1681.38 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1573. 1681.38 s [algebraic-graphs]
  1574. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  1575. 1681.38 s [algebraic-graphs] OK: gmap f empty == empty
  1576. 1681.38 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1577. 1681.38 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1578. 1681.38 s [algebraic-graphs] OK: gmap id == id
  1579. 1681.38 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1580. 1681.38 s [algebraic-graphs]
  1581. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  1582. 1681.38 s [algebraic-graphs] OK: induce (const True ) x == x
  1583. 1681.38 s [algebraic-graphs] OK: induce (const False) x == empty
  1584. 1681.38 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1585. 1681.38 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1586. 1681.38 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1587. 1681.38 s [algebraic-graphs]
  1588. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  1589. 1681.38 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1590. 1681.38 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1591. 1681.38 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1592. 1681.38 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1593. 1681.38 s [algebraic-graphs]
  1594. 1681.38 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  1595. 1681.38 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  1596. 1681.38 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  1597. 1681.38 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  1598. 1681.38 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  1599. 1681.38 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  1600. 1681.38 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  1601. 1681.38 s [algebraic-graphs]
  1602. 1681.38 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  1603. 1681.38 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  1604. 1681.39 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  1605. 1681.39 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  1606. 1681.39 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  1607. 1681.39 s [algebraic-graphs]
  1608. 1681.39 s [algebraic-graphs] ============ Typed ============
  1609. 1681.39 s [algebraic-graphs]
  1610. 1681.39 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  1611. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1612. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1613. 1681.39 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  1614. 1681.39 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1615. 1681.39 s [algebraic-graphs]
  1616. 1681.39 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  1617. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1618. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1619. 1681.39 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  1620. 1681.39 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1621. 1681.39 s [algebraic-graphs]
  1622. 1681.39 s [algebraic-graphs] ============ Typed.dfsForest ============
  1623. 1681.39 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  1624. 1681.39 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  1625. 1681.39 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  1626. 1681.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  1627. 1681.39 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  1628. 1681.39 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  1629. 1681.39 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  1630. 1681.39 s [algebraic-graphs]
  1631. 1681.39 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  1632. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  1633. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  1634. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  1635. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  1636. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  1637. 1681.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  1638. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  1639. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  1640. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  1641. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  1642. 1681.39 s [algebraic-graphs]
  1643. 1681.39 s [algebraic-graphs] ============ Typed.dfs ============
  1644. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  1645. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  1646. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  1647. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  1648. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  1649. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  1650. 1681.39 s [algebraic-graphs] OK: dfs % x $ [] == []
  1651. 1681.39 s [algebraic-graphs]
  1652. 1681.39 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  1653. 1681.39 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  1654. 1681.39 s [algebraic-graphs]
  1655. 1681.39 s [algebraic-graphs] ============ Typed.topSort ============
  1656. 1681.39 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  1657. 1681.39 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  1658. 1681.39 s [algebraic-graphs]
  1659. 1681.39 s [algebraic-graphs] ============ Graph.Undirected ============
  1660. 1681.39 s [algebraic-graphs] OK: Axioms of undirected graphs
  1661. 1681.39 s [algebraic-graphs]
  1662. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  1663. 1681.39 s [algebraic-graphs] OK: show (empty ) == "empty"
  1664. 1681.39 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1665. 1681.39 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1666. 1681.39 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1667. 1681.39 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1668. 1681.39 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1669. 1681.39 s [algebraic-graphs]
  1670. 1681.39 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1671. 1681.39 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1672. 1681.39 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1673. 1681.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1674. 1681.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1675. 1681.39 s [algebraic-graphs]
  1676. 1681.39 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1677. 1681.39 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1678. 1681.39 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1679. 1681.39 s [algebraic-graphs]
  1680. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  1681. 1681.39 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  1682. 1681.39 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1683. 1681.39 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  1684. 1681.39 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  1685. 1681.39 s [algebraic-graphs]
  1686. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  1687. 1681.39 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  1688. 1681.39 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1689. 1681.39 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  1690. 1681.39 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  1691. 1681.39 s [algebraic-graphs]
  1692. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  1693. 1681.39 s [algebraic-graphs] OK: complement empty == empty
  1694. 1681.39 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  1695. 1681.39 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  1696. 1681.39 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  1697. 1681.39 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  1698. 1681.39 s [algebraic-graphs] OK: complement . complement == id
  1699. 1681.39 s [algebraic-graphs]
  1700. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  1701. 1681.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1702. 1681.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1703. 1681.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1704. 1681.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1705. 1681.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1706. 1681.39 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1707. 1681.39 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1708. 1681.39 s [algebraic-graphs] OK: x <= x + y
  1709. 1681.39 s [algebraic-graphs] OK: x + y <= x * y
  1710. 1681.39 s [algebraic-graphs]
  1711. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  1712. 1681.39 s [algebraic-graphs] OK: isEmpty empty == True
  1713. 1681.39 s [algebraic-graphs] OK: hasVertex x empty == False
  1714. 1681.39 s [algebraic-graphs] OK: vertexCount empty == 0
  1715. 1681.39 s [algebraic-graphs] OK: edgeCount empty == 0
  1716. 1681.39 s [algebraic-graphs]
  1717. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  1718. 1681.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1719. 1681.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1720. 1681.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1721. 1681.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1722. 1681.39 s [algebraic-graphs]
  1723. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  1724. 1681.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1725. 1681.39 s [algebraic-graphs] OK: edge x y == edge y x
  1726. 1692.04 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1727. 1692.04 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1728. 1692.04 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1729. 1692.05 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1730. 1692.05 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1731. 1692.05 s [algebraic-graphs]
  1732. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  1733. 1692.05 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1734. 1692.05 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1735. 1692.05 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1736. 1692.05 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1737. 1692.05 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1738. 1692.05 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1739. 1692.05 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1740. 1692.05 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1741. 1692.05 s [algebraic-graphs]
  1742. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  1743. 1692.05 s [algebraic-graphs] OK: connect x y == connect y x
  1744. 1692.05 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1745. 1692.05 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1746. 1692.05 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1747. 1692.05 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1748. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1749. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1750. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1751. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1752. 1692.05 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1753. 1692.05 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1754. 1692.05 s [algebraic-graphs]
  1755. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  1756. 1692.05 s [algebraic-graphs] OK: vertices [] == empty
  1757. 1692.05 s [algebraic-graphs] OK: vertices [x] == vertex x
  1758. 1692.05 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1759. 1692.05 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1760. 1692.05 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1761. 1692.05 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1762. 1692.05 s [algebraic-graphs]
  1763. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  1764. 1692.05 s [algebraic-graphs] OK: edges [] == empty
  1765. 1692.05 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1766. 1692.05 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1767. 1692.05 s [algebraic-graphs]
  1768. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  1769. 1692.05 s [algebraic-graphs] OK: overlays [] == empty
  1770. 1692.05 s [algebraic-graphs] OK: overlays [x] == x
  1771. 1692.05 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1772. 1692.05 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1773. 1692.05 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1774. 1692.05 s [algebraic-graphs]
  1775. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  1776. 1692.05 s [algebraic-graphs] OK: connects [] == empty
  1777. 1692.05 s [algebraic-graphs] OK: connects [x] == x
  1778. 1692.05 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1779. 1692.06 s [algebraic-graphs] OK: connects == foldr connect empty
  1780. 1692.06 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1781. 1692.06 s [algebraic-graphs] OK: connects == connects . reverse
  1782. 1692.06 s [algebraic-graphs]
  1783. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  1784. 1692.06 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1785. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1786. 1692.06 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1787. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1788. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1789. 1692.06 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1790. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1791. 1692.06 s [algebraic-graphs]
  1792. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.path ============
  1793. 1692.06 s [algebraic-graphs] OK: path [] == empty
  1794. 1692.06 s [algebraic-graphs] OK: path [x] == vertex x
  1795. 1692.06 s [algebraic-graphs] OK: path [x,y] == edge x y
  1796. 1692.06 s [algebraic-graphs] OK: path == path . reverse
  1797. 1692.06 s [algebraic-graphs]
  1798. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  1799. 1692.06 s [algebraic-graphs] OK: circuit [] == empty
  1800. 1692.06 s [algebraic-graphs] OK: circuit [x] == edge x x
  1801. 1692.06 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1802. 1692.06 s [algebraic-graphs] OK: circuit == circuit . reverse
  1803. 1692.06 s [algebraic-graphs]
  1804. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  1805. 1692.06 s [algebraic-graphs] OK: clique [] == empty
  1806. 1692.06 s [algebraic-graphs] OK: clique [x] == vertex x
  1807. 1692.06 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1808. 1692.06 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1809. 1692.06 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1810. 1692.06 s [algebraic-graphs] OK: clique == clique . reverse
  1811. 1692.06 s [algebraic-graphs]
  1812. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  1813. 1692.06 s [algebraic-graphs] OK: biclique [] [] == empty
  1814. 1692.06 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1815. 1692.06 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1816. 1692.06 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1817. 1692.06 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1818. 1692.06 s [algebraic-graphs]
  1819. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.star ============
  1820. 1692.06 s [algebraic-graphs] OK: star x [] == vertex x
  1821. 1692.06 s [algebraic-graphs] OK: star x [y] == edge x y
  1822. 1692.06 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1823. 1692.06 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1824. 1692.06 s [algebraic-graphs]
  1825. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  1826. 1692.06 s [algebraic-graphs] OK: stars [] == empty
  1827. 1692.06 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1828. 1692.06 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1829. 1692.06 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1830. 1692.06 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1831. 1692.06 s [algebraic-graphs] OK: stars . adjacencyList == id
  1832. 1692.06 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1833. 1692.06 s [algebraic-graphs]
  1834. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  1835. 1692.06 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1836. 1692.06 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1837. 1692.06 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1838. 1692.06 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1839. 1692.06 s [algebraic-graphs]
  1840. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  1841. 1692.06 s [algebraic-graphs] OK: forest [] == empty
  1842. 1692.06 s [algebraic-graphs] OK: forest [x] == tree x
  1843. 1692.06 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1844. 1692.06 s [algebraic-graphs] OK: forest == overlays . map tree
  1845. 1692.06 s [algebraic-graphs]
  1846. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  1847. 1692.06 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1848. 1692.06 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1849. 1692.06 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1850. 1692.06 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1851. 1692.06 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1852. 1692.06 s [algebraic-graphs]
  1853. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  1854. 1692.06 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1855. 1692.06 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1856. 1692.06 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1857. 1692.06 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1858. 1692.06 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1859. 1692.06 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1860. 1692.06 s [algebraic-graphs]
  1861. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  1862. 1692.06 s [algebraic-graphs] OK: replaceVertex x x == id
  1863. 1692.06 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1864. 1692.06 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1865. 1692.06 s [algebraic-graphs]
  1866. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  1867. 1692.06 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1868. 1692.06 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1869. 1692.06 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1870. 1692.06 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1871. 1692.06 s [algebraic-graphs]
  1872. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  1873. 1692.06 s [algebraic-graphs] OK: gmap f empty == empty
  1874. 1692.06 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1875. 1692.06 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1876. 1692.06 s [algebraic-graphs] OK: gmap id == id
  1877. 1692.06 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1878. 1692.06 s [algebraic-graphs]
  1879. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  1880. 1692.06 s [algebraic-graphs] OK: induce (const True ) x == x
  1881. 1692.06 s [algebraic-graphs] OK: induce (const False) x == empty
  1882. 1692.06 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1883. 1692.06 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1884. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1885. 1692.06 s [algebraic-graphs]
  1886. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  1887. 1692.06 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1888. 1692.06 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1889. 1692.06 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1890. 1692.06 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1891. 1692.06 s [algebraic-graphs] Test suite main: PASS
  1892. 1692.06 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  1893. 1692.06 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  1894. 1692.07 s [algebraic-graphs] checkPhase completed in 2 minutes 39 seconds
  1895. 1692.07 s [algebraic-graphs] Phase: haddockPhase
  1896. 1692.32 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  1897. 1692.33 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  1898. 1692.41 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  1899. 1692.93 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  1900. 1693.05 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  1901. 1693.13 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1902. 1693.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1903. 1693.13 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1904. 1693.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1905. 1693.13 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  1906. 1693.13 s [algebraic-graphs] Missing documentation for:
  1907. 1693.13 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  1908. 1693.25 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  1909. 1693.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1910. 1693.25 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  1911. 1693.37 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  1912. 1693.52 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  1913. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1914. 1693.52 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  1915. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1916. 1693.52 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  1917. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1918. 1693.52 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  1919. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1920. 1693.52 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1921. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1922. 1693.52 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  1923. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1924. 1693.52 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1925. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1926. 1693.52 s [algebraic-graphs] Warning: 'box' is out of scope.
  1927. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1928. 1693.52 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  1929. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1930. 1693.52 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  1931. 1693.70 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1932. 1693.70 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1933. 1693.70 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  1934. 1693.83 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  1935. 1693.83 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1936. 1693.83 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  1937. 1693.97 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  1938. 1694.25 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1939. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1940. 1694.25 s [algebraic-graphs] Warning: 'empty' is out of scope.
  1941. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1942. 1694.25 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1943. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1944. 1694.25 s [algebraic-graphs] Warning: 'edges' is out of scope.
  1945. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1946. 1694.25 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1947. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1948. 1694.25 s [algebraic-graphs] Warning: 'stars' is out of scope.
  1949. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1950. 1694.26 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  1951. 1694.34 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1952. 1694.34 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1953. 1694.34 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1954. 1694.34 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1955. 1694.34 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  1956. 1694.34 s [algebraic-graphs] Missing documentation for:
  1957. 1694.34 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  1958. 1694.43 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  1959. 1694.49 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  1960. 1694.53 s [algebraic-graphs]
  1961. 1694.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  1962. 1694.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1963. 1694.53 s [algebraic-graphs] will become an error in a future GHC release.
  1964. 1694.53 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1965. 1694.53 s [algebraic-graphs] |
  1966. 1694.53 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  1967. 1694.53 s [algebraic-graphs] | ^
  1968. 1694.53 s [algebraic-graphs]
  1969. 1694.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  1970. 1694.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1971. 1694.53 s [algebraic-graphs] will become an error in a future GHC release.
  1972. 1694.53 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1973. 1694.53 s [algebraic-graphs] |
  1974. 1694.54 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1975. 1694.54 s [algebraic-graphs] | ^
  1976. 1694.54 s [algebraic-graphs]
  1977. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  1978. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1979. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  1980. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1981. 1694.54 s [algebraic-graphs] |
  1982. 1694.54 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  1983. 1694.54 s [algebraic-graphs] | ^
  1984. 1694.54 s [algebraic-graphs]
  1985. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  1986. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1987. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  1988. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1989. 1694.54 s [algebraic-graphs] |
  1990. 1694.54 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1991. 1694.54 s [algebraic-graphs] | ^
  1992. 1694.54 s [algebraic-graphs]
  1993. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  1994. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1995. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  1996. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1997. 1694.54 s [algebraic-graphs] |
  1998. 1694.54 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  1999. 1694.54 s [algebraic-graphs] | ^
  2000. 1694.54 s [algebraic-graphs]
  2001. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  2002. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2003. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  2004. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2005. 1694.54 s [algebraic-graphs] |
  2006. 1694.54 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  2007. 1694.55 s [algebraic-graphs] | ^
  2008. 1694.55 s [algebraic-graphs]
  2009. 1694.55 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  2010. 1694.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2011. 1694.55 s [algebraic-graphs] will become an error in a future GHC release.
  2012. 1694.55 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2013. 1694.55 s [algebraic-graphs] |
  2014. 1694.55 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  2015. 1694.55 s [algebraic-graphs] | ^
  2016. 1694.70 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  2017. 1694.70 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2018. 1694.70 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  2019. 1694.81 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  2020. 1694.91 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  2021. 1694.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2022. 1694.91 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  2023. 1695.07 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  2024. 1695.30 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  2025. 1695.35 s [algebraic-graphs]
  2026. 1695.35 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  2027. 1695.35 s [algebraic-graphs] • Redundant constraint: Eq e
  2028. 1695.35 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  2029. 1695.35 s [algebraic-graphs] |
  2030. 1695.36 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  2031. 1695.36 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  2032. 1695.37 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  2033. 1695.38 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  2034. 1695.41 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  2035. 1695.41 s [algebraic-graphs]
  2036. 1695.42 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  2037. 1695.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2038. 1695.42 s [algebraic-graphs] will become an error in a future GHC release.
  2039. 1695.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2040. 1695.42 s [algebraic-graphs] |
  2041. 1695.42 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  2042. 1695.42 s [algebraic-graphs] | ^
  2043. 1695.44 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  2044. 1695.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2045. 1695.44 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  2046. 1695.47 s [algebraic-graphs]
  2047. 1695.47 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  2048. 1695.47 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2049. 1695.47 s [algebraic-graphs] will become an error in a future GHC release.
  2050. 1695.47 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2051. 1695.47 s [algebraic-graphs] |
  2052. 1695.47 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  2053. 1695.47 s [algebraic-graphs] | ^
  2054. 1695.47 s [algebraic-graphs]
  2055. 1695.47 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  2056. 1695.47 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2057. 1695.47 s [algebraic-graphs] will become an error in a future GHC release.
  2058. 1695.47 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2059. 1695.48 s [algebraic-graphs] |
  2060. 1695.48 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  2061. 1695.48 s [algebraic-graphs] | ^
  2062. 1695.55 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  2063. 1695.61 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  2064. 1695.66 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  2065. 1695.66 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2066. 1695.66 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  2067. 1695.68 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  2068. 1695.68 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2069. 1695.68 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  2070. 1695.69 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  2071. 1695.69 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2072. 1695.69 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  2073. 1695.71 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  2074. 1695.71 s [algebraic-graphs] Missing documentation for:
  2075. 1695.71 s [algebraic-graphs] Module header
  2076. 1695.71 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  2077. 1695.71 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  2078. 1695.71 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  2079. 1695.71 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  2080. 1695.71 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  2081. 1695.71 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  2082. 1695.71 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  2083. 1695.74 s [algebraic-graphs] Warning: 'array' is out of scope.
  2084. 1695.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2085. 1695.74 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  2086. 1695.74 s [algebraic-graphs] Missing documentation for:
  2087. 1695.74 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  2088. 1696.06 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  2089. 1696.06 s [algebraic-graphs]
  2090. 1696.06 s [algebraic-graphs] - Algebra.Graph.Labelled.Focus
  2091. 1700.63 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/index.html,
  2092. 1700.63 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  2093. 1700.69 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  2094. 1700.70 s [algebraic-graphs] Phase: installPhase
  2095. 1700.76 s [algebraic-graphs] Installing library in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  2096. 1701.53 s [algebraic-graphs] Phase: fixupPhase
  2097. 1701.55 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  2098. 1701.55 s [algebraic-graphs] shrinking /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSalgebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F-ghc9.4.8.so
  2099. 1701.58 s [algebraic-graphs] checking for references to /build/ in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7...
  2100. 1701.62 s [algebraic-graphs] patching script interpreter paths in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  2101. 1701.62 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib
  2102. 1701.92 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  2103. 1701.95 s [algebraic-graphs] checking for references to /build/ in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc...
  2104. 1701.98 s [algebraic-graphs] patching script interpreter paths in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  2105. 1702.14 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  2106. 1702.57 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  2107. 1702.59 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  2108. 1702.63 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2109. 1702.71 s [algebraic-graphs:post-build] copying 1 paths...
  2110. 1702.71 s [algebraic-graphs:post-build] copying path '/nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  2111. 1710.69 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2112. 1710.77 s [algebraic-graphs:post-build] copying 0 paths...
  2113. 1710.81 s Progress: 14 of 19 built, 161 of 161 downloaded from cache
  2114. 1710.85 s Building /nix/store/yq11w1cv46amflsdfd70y3j1y67s43qz-algebraic-graph-duoids-0.0.1.0.drv
  2115. 1711.04 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  2116. 1711.05 s [algebraic-graph-duoids] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  2117. 1711.30 s [algebraic-graph-duoids] Phase: unpackPhase
  2118. 1711.30 s [algebraic-graph-duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./algebraic-graphs
  2119. 1711.31 s [algebraic-graph-duoids] source root is algebraic-graphs
  2120. 1711.32 s [algebraic-graph-duoids] Phase: patchPhase
  2121. 1711.33 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  2122. 1711.34 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.zUuTJ0NXVO/setup-package.conf.d -threaded
  2123. 1711.39 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.zUuTJ0NXVO/Main.o )
  2124. 1711.46 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  2125. 1712.79 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  2126. 1712.80 s [algebraic-graph-duoids] Phase: configurePhase
  2127. 1712.81 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.zUuTJ0NXVO/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  2128. 1712.82 s [algebraic-graph-duoids] Using Parsec parser
  2129. 1712.82 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  2130. 1713.19 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  2131. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  2132. 1713.55 s [algebraic-graph-duoids] algebraic-graphs-0.7
  2133. 1713.55 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  2134. 1713.55 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  2135. 1713.55 s [algebraic-graph-duoids] <4.23: using base-4.17.2.1
  2136. 1713.55 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2137. 1713.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2138. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2139. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  2140. 1713.55 s [algebraic-graph-duoids] algebraic-graphs-0.7
  2141. 1713.55 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  2142. 1713.55 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  2143. 1713.55 s [algebraic-graph-duoids] <4.23: using base-4.17.2.1
  2144. 1713.55 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  2145. 1713.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2146. 1713.55 s [algebraic-graph-duoids] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2147. 1713.55 s [algebraic-graph-duoids] hedgehog-1.5
  2148. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2149. 1713.55 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  2150. 1713.55 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  2151. 1713.55 s [algebraic-graph-duoids] <4.23: using base-4.17.2.1
  2152. 1713.55 s [algebraic-graph-duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  2153. 1713.55 s [algebraic-graph-duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  2154. 1713.55 s [algebraic-graph-duoids] doctest-0.24.2
  2155. 1713.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2156. 1713.55 s [algebraic-graph-duoids] Source component graph:
  2157. 1713.55 s [algebraic-graph-duoids] component lib
  2158. 1713.55 s [algebraic-graph-duoids] component test:doctests dependency lib
  2159. 1713.55 s [algebraic-graph-duoids] component test:laws dependency lib
  2160. 1713.55 s [algebraic-graph-duoids] Configured component graph:
  2161. 1713.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2162. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  2163. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  2164. 1713.55 s [algebraic-graph-duoids] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  2165. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2166. 1713.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-JqxAzThiaDAEz9yEmrIIb6-doctests
  2167. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2168. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  2169. 1713.55 s [algebraic-graph-duoids] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  2170. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2171. 1713.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-JAUo7xOyin5FXRhEQ08TZd-laws
  2172. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2173. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  2174. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  2175. 1713.55 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  2176. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2177. 1713.55 s [algebraic-graph-duoids] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  2178. 1713.55 s [algebraic-graph-duoids] Linked component graph:
  2179. 1713.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2180. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  2181. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  2182. 1713.55 s [algebraic-graph-duoids] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  2183. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2184. 1713.55 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6:Algebra.Graph.Duoid.Orphans
  2185. 1713.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-JqxAzThiaDAEz9yEmrIIb6-doctests
  2186. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2187. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  2188. 1713.55 s [algebraic-graph-duoids] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  2189. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2190. 1713.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-JAUo7xOyin5FXRhEQ08TZd-laws
  2191. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2192. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  2193. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  2194. 1713.55 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  2195. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2196. 1713.55 s [algebraic-graph-duoids] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  2197. 1713.55 s [algebraic-graph-duoids] Ready component graph:
  2198. 1713.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2199. 1713.55 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  2200. 1713.55 s [algebraic-graph-duoids] depends base-4.17.2.1
  2201. 1713.55 s [algebraic-graph-duoids] depends duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  2202. 1713.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2203. 1713.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-JAUo7xOyin5FXRhEQ08TZd-laws
  2204. 1713.55 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2205. 1713.55 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  2206. 1713.55 s [algebraic-graph-duoids] depends base-4.17.2.1
  2207. 1713.55 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  2208. 1713.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2209. 1713.55 s [algebraic-graph-duoids] depends hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  2210. 1713.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-JqxAzThiaDAEz9yEmrIIb6-doctests
  2211. 1713.55 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2212. 1713.55 s [algebraic-graph-duoids] depends base-4.17.2.1
  2213. 1713.55 s [algebraic-graph-duoids] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  2214. 1713.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  2215. 1713.55 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.4
  2216. 1713.55 s [algebraic-graph-duoids] Using compiler: ghc-9.4.8
  2217. 1713.55 s [algebraic-graph-duoids] Using install prefix:
  2218. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  2219. 1713.55 s [algebraic-graph-duoids] Executables installed in:
  2220. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/bin
  2221. 1713.55 s [algebraic-graph-duoids] Libraries installed in:
  2222. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2223. 1713.55 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  2224. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  2225. 1713.55 s [algebraic-graph-duoids] Private executables installed in:
  2226. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0
  2227. 1713.55 s [algebraic-graph-duoids] Data files installed in:
  2228. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0
  2229. 1713.55 s [algebraic-graph-duoids] Documentation installed in:
  2230. 1713.55 s [algebraic-graph-duoids] /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  2231. 1713.55 s [algebraic-graph-duoids] Configuration files installed in:
  2232. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/etc
  2233. 1713.55 s [algebraic-graph-duoids] No alex found
  2234. 1713.55 s [algebraic-graph-duoids] Using ar found on system at:
  2235. 1713.55 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  2236. 1713.55 s [algebraic-graph-duoids] No c2hs found
  2237. 1713.55 s [algebraic-graph-duoids] No cpphs found
  2238. 1713.55 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  2239. 1713.55 s [algebraic-graph-duoids] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  2240. 1713.55 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  2241. 1713.55 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  2242. 1713.55 s [algebraic-graph-duoids] Using ghc version 9.4.8 found on system at:
  2243. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  2244. 1713.55 s [algebraic-graph-duoids] Using ghc-pkg version 9.4.8 found on system at:
  2245. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  2246. 1713.55 s [algebraic-graph-duoids] No ghcjs found
  2247. 1713.55 s [algebraic-graph-duoids] No ghcjs-pkg found
  2248. 1713.55 s [algebraic-graph-duoids] No greencard found
  2249. 1713.55 s [algebraic-graph-duoids] Using haddock version 2.27.0 found on system at:
  2250. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  2251. 1713.55 s [algebraic-graph-duoids] No happy found
  2252. 1713.55 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  2253. 1713.55 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2254. 1713.55 s [algebraic-graph-duoids] No hmake found
  2255. 1713.55 s [algebraic-graph-duoids] Using hpc version 0.68 found on system at:
  2256. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  2257. 1713.55 s [algebraic-graph-duoids] Using hsc2hs version 0.68.8 found on system at:
  2258. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  2259. 1713.55 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  2260. 1713.55 s [algebraic-graph-duoids] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  2261. 1713.55 s [algebraic-graph-duoids] No jhc found
  2262. 1713.56 s [algebraic-graph-duoids] Using ld found on system at:
  2263. 1713.56 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  2264. 1713.56 s [algebraic-graph-duoids] No pkg-config found
  2265. 1713.56 s [algebraic-graph-duoids] Using runghc version 9.4.8 found on system at:
  2266. 1713.56 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  2267. 1713.56 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  2268. 1713.56 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  2269. 1713.56 s [algebraic-graph-duoids] Using tar found on system at:
  2270. 1713.56 s [algebraic-graph-duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  2271. 1713.56 s [algebraic-graph-duoids] No uhc found
  2272. 1713.80 s [algebraic-graph-duoids] Phase: buildPhase
  2273. 1713.88 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2274. 1713.88 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  2275. 1714.00 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  2276. 1714.45 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  2277. 1715.51 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  2278. 1716.03 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  2279. 1719.05 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2280. 1719.05 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2281. 1719.17 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  2282. 1720.16 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  2283. 1721.27 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2284. 1721.27 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2285. 1721.38 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2286. 1721.93 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2287. 1722.63 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  2288. 1724.49 s [algebraic-graph-duoids] Phase: checkPhase
  2289. 1724.77 s [algebraic-graph-duoids] Running 2 test suites...
  2290. 1724.77 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  2291. 1724.77 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  2292. 1724.78 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  2293. 1724.79 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  2294. 1724.79 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  2295. 1724.79 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  2296. 1724.79 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  2297. 1724.79 s [algebraic-graph-duoids] ✓ 5 succeeded.
  2298. 1724.79 s [algebraic-graph-duoids] Test suite laws: PASS
  2299. 1724.79 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  2300. 1724.79 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  2301. 1725.52 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2302. 1725.57 s [algebraic-graph-duoids] NameLib Nothing
  2303. 1725.57 s [algebraic-graph-duoids] ----------------------------------------
  2304. 1725.60 s [algebraic-graph-duoids] Test suite doctests: PASS
  2305. 1725.60 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  2306. 1725.60 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  2307. 1725.61 s [algebraic-graph-duoids] Phase: haddockPhase
  2308. 1725.79 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2309. 1725.79 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  2310. 1726.36 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  2311. 1726.83 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  2312. 1733.20 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  2313. 1733.21 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  2314. 1733.29 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2315. 1733.29 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2316. 1733.30 s [algebraic-graph-duoids] Phase: installPhase
  2317. 1733.38 s [algebraic-graph-duoids] Installing library in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  2318. 1733.65 s [algebraic-graph-duoids] Phase: fixupPhase
  2319. 1733.67 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  2320. 1733.67 s [algebraic-graph-duoids] shrinking /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSalgebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6-ghc9.4.8.so
  2321. 1733.68 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0...
  2322. 1733.70 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  2323. 1733.71 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib
  2324. 1733.75 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc
  2325. 1733.76 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc...
  2326. 1733.78 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc
  2327. 1733.93 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  2328. 1734.33 s [algebraic-graph-duoids:post-build] Pushing 2 paths (43 are already present) using zstd to cache sellout ⏳
  2329. 1734.33 s [algebraic-graph-duoids:post-build]
  2330. 1734.68 s [algebraic-graph-duoids:post-build] Pushing /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0 (1.24 MiB)
  2331. 1734.79 s [algebraic-graph-duoids:post-build] Pushing /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc (585.84 KiB)
  2332. 1735.78 s [algebraic-graph-duoids:post-build]
  2333. 1735.78 s [algebraic-graph-duoids:post-build] All done.
  2334. 1735.81 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  2335. 1735.87 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2336. 1735.89 s [algebraic-graph-duoids:post-build] copying 2 paths...
  2337. 1735.89 s [algebraic-graph-duoids:post-build] copying path '/nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2338. 1736.12 s [algebraic-graph-duoids:post-build] copying path '/nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  2339. 1736.55 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2340. 1736.76 s [algebraic-graph-duoids:post-build] copying 1 paths...
  2341. 1736.76 s [algebraic-graph-duoids:post-build] copying path '/nix/store/yq11w1cv46amflsdfd70y3j1y67s43qz-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  2342. 1736.92 s Progress: 15 of 19 built, 161 of 161 downloaded from cache
  2343. 1736.97 s Building /nix/store/856b25hav7xgwkdjgjcnw8k3fmshc3kj-ghc-9.4.8-with-packages.drv
  2344. 1737.04 s [ghc-9.4.8-with-packages] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/nix-support:
  2345. 1737.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2346. 1737.04 s [ghc-9.4.8-with-packages] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/nix-support:
  2347. 1737.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2348. 1737.04 s [ghc-9.4.8-with-packages] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/nix-support:
  2349. 1737.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2350. 1737.05 s [ghc-9.4.8-with-packages] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support:
  2351. 1737.05 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2352. 1737.06 s [ghc-9.4.8-with-packages] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support:
  2353. 1737.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2354. 1737.06 s [ghc-9.4.8-with-packages] /nix/store/xhxf8fh0kdv3jyvi7barm5q9ihmwzbna-ghc-compat-plugin-0.1.0.1/nix-support:
  2355. 1737.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2356. 1737.06 s [ghc-9.4.8-with-packages] /nix/store/xhxf8fh0kdv3jyvi7barm5q9ihmwzbna-ghc-compat-plugin-0.1.0.1/nix-support:
  2357. 1737.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2358. 1737.07 s [ghc-9.4.8-with-packages] /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/nix-support:
  2359. 1737.07 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2360. 1737.07 s [ghc-9.4.8-with-packages] /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/nix-support:
  2361. 1737.07 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2362. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/5xxjc2n7b0wb1pivm6f897512r965zh1-ansi-terminal-1.1.3/nix-support:
  2363. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2364. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/5xxjc2n7b0wb1pivm6f897512r965zh1-ansi-terminal-1.1.3/nix-support:
  2365. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2366. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/v6mn5q2pffwalmdqam9hshx6lnmab5av-async-2.2.5/nix-support:
  2367. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2368. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/v6mn5q2pffwalmdqam9hshx6lnmab5av-async-2.2.5/nix-support:
  2369. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2370. 1737.09 s [ghc-9.4.8-with-packages] /nix/store/c60sg81w1z2925kyw9drag0v1khnr9fp-barbies-2.1.1.0/nix-support:
  2371. 1737.09 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2372. 1737.09 s [ghc-9.4.8-with-packages] /nix/store/c60sg81w1z2925kyw9drag0v1khnr9fp-barbies-2.1.1.0/nix-support:
  2373. 1737.09 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2374. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/462yg7zm4bgfkzfsrxiryirhjx1s0cab-concurrent-output-1.10.21/nix-support:
  2375. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2376. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/462yg7zm4bgfkzfsrxiryirhjx1s0cab-concurrent-output-1.10.21/nix-support:
  2377. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2378. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/3y7qlb5nyiqq18v1mv2936ks9fnw43hp-lifted-async-0.10.2.7/nix-support:
  2379. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2380. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/3y7qlb5nyiqq18v1mv2936ks9fnw43hp-lifted-async-0.10.2.7/nix-support:
  2381. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2382. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/2f9yr728820hr5hknnbpj6pcndghrvrv-mmorph-1.2.1/nix-support:
  2383. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2384. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/2f9yr728820hr5hknnbpj6pcndghrvrv-mmorph-1.2.1/nix-support:
  2385. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2386. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/cxmidfcc1pfg15jhwcskjp0sak71m4vz-monad-control-1.0.3.1/nix-support:
  2387. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2388. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/cxmidfcc1pfg15jhwcskjp0sak71m4vz-monad-control-1.0.3.1/nix-support:
  2389. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2390. 1737.12 s [ghc-9.4.8-with-packages] /nix/store/233bl99xi6ilwyb0n0z8lqcq8wghjbw3-pretty-show-1.10/nix-support:
  2391. 1737.12 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2392. 1737.12 s [ghc-9.4.8-with-packages] /nix/store/233bl99xi6ilwyb0n0z8lqcq8wghjbw3-pretty-show-1.10/nix-support:
  2393. 1737.12 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2394. 1737.12 s [ghc-9.4.8-with-packages] /nix/store/cyijhm1wvqdhm9b4b41ap0v8a8ar8pr2-primitive-0.9.1.0/nix-support:
  2395. 1737.12 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2396. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/cyijhm1wvqdhm9b4b41ap0v8a8ar8pr2-primitive-0.9.1.0/nix-support:
  2397. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2398. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/sys9r5vn8pmzbrffdps9mrd0j9c3v21w-random-1.2.1.3/nix-support:
  2399. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2400. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/sys9r5vn8pmzbrffdps9mrd0j9c3v21w-random-1.2.1.3/nix-support:
  2401. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2402. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/7qjvf35fl0pkv9wj8n3cx182j24zwm7l-resourcet-1.3.0/nix-support:
  2403. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2404. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/7qjvf35fl0pkv9wj8n3cx182j24zwm7l-resourcet-1.3.0/nix-support:
  2405. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2406. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/r3x9zl5gmlbbclkxs9x9xv5plbqghp68-safe-exceptions-0.1.7.4/nix-support:
  2407. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2408. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/r3x9zl5gmlbbclkxs9x9xv5plbqghp68-safe-exceptions-0.1.7.4/nix-support:
  2409. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2410. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/0hy1fhipcn6f0ygjb20116nb5dvgsaj5-transformers-base-0.4.6/nix-support:
  2411. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2412. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/0hy1fhipcn6f0ygjb20116nb5dvgsaj5-transformers-base-0.4.6/nix-support:
  2413. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2414. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/4ls456xhh8ms32l43agldrhi4m3wl838-wl-pprint-annotated-0.1.0.1/nix-support:
  2415. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2416. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/4ls456xhh8ms32l43agldrhi4m3wl838-wl-pprint-annotated-0.1.0.1/nix-support:
  2417. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2418. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/ncm10l6pk5zmkb3sapfqv4hkg45n16cr-ansi-terminal-types-1.1.3/nix-support:
  2419. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2420. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/ncm10l6pk5zmkb3sapfqv4hkg45n16cr-ansi-terminal-types-1.1.3/nix-support:
  2421. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2422. 1737.16 s [ghc-9.4.8-with-packages] /nix/store/jspa0h3jp93qrkbc5g5a4fzx6pgrf890-hashable-1.4.7.0/nix-support:
  2423. 1737.16 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2424. 1737.16 s [ghc-9.4.8-with-packages] /nix/store/jspa0h3jp93qrkbc5g5a4fzx6pgrf890-hashable-1.4.7.0/nix-support:
  2425. 1737.16 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2426. 1737.16 s [ghc-9.4.8-with-packages] /nix/store/pl48aarrvj4a78524196ynrp0kfa0rlz-distributive-0.6.2.1/nix-support:
  2427. 1737.16 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2428. 1737.17 s [ghc-9.4.8-with-packages] /nix/store/pl48aarrvj4a78524196ynrp0kfa0rlz-distributive-0.6.2.1/nix-support:
  2429. 1737.17 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2430. 1737.17 s [ghc-9.4.8-with-packages] /nix/store/1r4jmk61ibj9l32555cqwkzcizkr9msd-constraints-0.14.2/nix-support:
  2431. 1737.17 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2432. 1737.18 s [ghc-9.4.8-with-packages] /nix/store/1r4jmk61ibj9l32555cqwkzcizkr9msd-constraints-0.14.2/nix-support:
  2433. 1737.18 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2434. 1737.18 s [ghc-9.4.8-with-packages] /nix/store/jcn2fbz35mdbic6gbp9r5vqgh4h265a7-lifted-base-0.2.3.12/nix-support:
  2435. 1737.18 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2436. 1737.18 s [ghc-9.4.8-with-packages] /nix/store/jcn2fbz35mdbic6gbp9r5vqgh4h265a7-lifted-base-0.2.3.12/nix-support:
  2437. 1737.18 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2438. 1737.19 s [ghc-9.4.8-with-packages] /nix/store/9i2ipcbxnddqba4h5kqlz8skd6c4yb9f-transformers-compat-0.7.2/nix-support:
  2439. 1737.19 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2440. 1737.19 s [ghc-9.4.8-with-packages] /nix/store/9i2ipcbxnddqba4h5kqlz8skd6c4yb9f-transformers-compat-0.7.2/nix-support:
  2441. 1737.19 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2442. 1737.19 s [ghc-9.4.8-with-packages] /nix/store/wjr31kxrg5xzjyfjwgfdh31m908893an-splitmix-0.1.3.1/nix-support:
  2443. 1737.19 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2444. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/wjr31kxrg5xzjyfjwgfdh31m908893an-splitmix-0.1.3.1/nix-support:
  2445. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2446. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/w2wfk6ad9zqz33q8cjrm1rnq4rzrkc2f-unliftio-core-0.2.1.0/nix-support:
  2447. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2448. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/w2wfk6ad9zqz33q8cjrm1rnq4rzrkc2f-unliftio-core-0.2.1.0/nix-support:
  2449. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2450. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/lnflkc76zbjzj6nz862nr3d0hgn8y5g5-base-orphans-0.9.3/nix-support:
  2451. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2452. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/lnflkc76zbjzj6nz862nr3d0hgn8y5g5-base-orphans-0.9.3/nix-support:
  2453. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2454. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/rvw80ra5wr1an100njnn6i9gp1wdcipr-os-string-2.0.8/nix-support:
  2455. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2456. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/rvw80ra5wr1an100njnn6i9gp1wdcipr-os-string-2.0.8/nix-support:
  2457. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2458. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/nqfx6vm4r7yzwzfxas9klvp0myx0ijvd-tagged-0.8.9/nix-support:
  2459. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2460. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/nqfx6vm4r7yzwzfxas9klvp0myx0ijvd-tagged-0.8.9/nix-support:
  2461. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2462. 1737.22 s [ghc-9.4.8-with-packages] /nix/store/yrlcjwmlwwmk9x9a3cy8vvn4mlww8kn1-boring-0.2.2/nix-support:
  2463. 1737.22 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2464. 1737.22 s [ghc-9.4.8-with-packages] /nix/store/yrlcjwmlwwmk9x9a3cy8vvn4mlww8kn1-boring-0.2.2/nix-support:
  2465. 1737.22 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2466. 1738.02 s [ghc-9.4.8-with-packages] Warning: haddock-interfaces: /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html/hedgehog.haddock doesn't exist or isn't a file
  2467. 1738.02 s [ghc-9.4.8-with-packages] Warning: haddock-html: /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html doesn't exist or isn't a directory
  2468. 1739.07 s [ghc-9.4.8-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages
  2469. 1739.49 s [ghc-9.4.8-with-packages:post-build] Pushing 1 paths (112 are already present) using zstd to cache sellout ⏳
  2470. 1739.49 s [ghc-9.4.8-with-packages:post-build]
  2471. 1739.83 s [ghc-9.4.8-with-packages:post-build] Pushing /nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages (4.30 MiB)
  2472. 1741.32 s [ghc-9.4.8-with-packages:post-build]
  2473. 1741.32 s [ghc-9.4.8-with-packages:post-build] All done.
  2474. 1741.34 s [ghc-9.4.8-with-packages:post-build] Uploading to the NixCI cache: /nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages
  2475. 1741.39 s [ghc-9.4.8-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2476. 1741.54 s [ghc-9.4.8-with-packages:post-build] copying 1 paths...
  2477. 1741.54 s [ghc-9.4.8-with-packages:post-build] copying path '/nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages' to 'https://cache.nix-ci.com'...
  2478. 1742.52 s [ghc-9.4.8-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2479. 1742.70 s [ghc-9.4.8-with-packages:post-build] copying 1 paths...
  2480. 1742.70 s [ghc-9.4.8-with-packages:post-build] copying path '/nix/store/856b25hav7xgwkdjgjcnw8k3fmshc3kj-ghc-9.4.8-with-packages.drv' to 'https://cache.nix-ci.com'...
  2481. 1742.86 s Progress: 16 of 18 built, 161 of 161 downloaded from cache
  2482. 1742.90 s Building /nix/store/zk2i2j3rk91fzi9hpw2sn8qw37s27i00-all-packages.drv
  2483. 1742.96 s [all-packages] created 3 symlinks in user environment
  2484. 1743.00 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages
  2485. 1743.40 s [all-packages:post-build] Pushing 1 paths (113 are already present) using zstd to cache sellout ⏳
  2486. 1743.40 s [all-packages:post-build]
  2487. 1743.73 s [all-packages:post-build] Pushing /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages (872.00 B)
  2488. 1744.83 s [all-packages:post-build]
  2489. 1744.83 s [all-packages:post-build] All done.
  2490. 1744.85 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages
  2491. 1744.91 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2492. 1745.07 s [all-packages:post-build] copying 1 paths...
  2493. 1745.07 s [all-packages:post-build] copying path '/nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages' to 'https://cache.nix-ci.com'...
  2494. 1745.25 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2495. 1745.46 s [all-packages:post-build] copying 1 paths...
  2496. 1745.46 s [all-packages:post-build] copying path '/nix/store/zk2i2j3rk91fzi9hpw2sn8qw37s27i00-all-packages.drv' to 'https://cache.nix-ci.com'...
  2497. 1745.63 s Progress: 17 of 18 built, 161 of 161 downloaded from cache
  2498. 1745.63 s Progress: 18 of 18 built, 161 of 161 downloaded from cache
  2499. 1745.63 s /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages
  2500. 1745.69 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/3dfec61d-cd1d-4213-be43-ffb1b040ad11/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/3dfec61d-cd1d-4213-be43-ffb1b040ad11/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/3dfec61d-cd1d-4213-be43-ffb1b040ad11/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/3dfec61d-cd1d-4213-be43-ffb1b040ad11/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/3dfec61d-cd1d-4213-be43-ffb1b040ad11/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/3dfec61d-cd1d-4213-be43-ffb1b040ad11/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 .