build devShells.x86_64-linux.ghc984

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

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b69bf1ba-988b-456a-9c10-9982a4178a53/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b69bf1ba-988b-456a-9c10-9982a4178a53/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b69bf1ba-988b-456a-9c10-9982a4178a53/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b69bf1ba-988b-456a-9c10-9982a4178a53/raw-logs

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

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b69bf1ba-988b-456a-9c10-9982a4178a53/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/renovate%2Flock-file-maintenance/aeca24e0ba147679323a49b0d71b1010da9c6629/b69bf1ba-988b-456a-9c10-9982a4178a53/repro

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

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