build devShells.x86_64-linux.ghc984

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

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/544c76b4-f27e-45fe-9dd2-f4b461054a2e/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/544c76b4-f27e-45fe-9dd2-f4b461054a2e/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/544c76b4-f27e-45fe-9dd2-f4b461054a2e/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/544c76b4-f27e-45fe-9dd2-f4b461054a2e/raw-logs

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

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/544c76b4-f27e-45fe-9dd2-f4b461054a2e/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/efcb599e94b311c8c6f8c2a5caf56f3137bbef9a/544c76b4-f27e-45fe-9dd2-f4b461054a2e/repro

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