build packages.x86_64-linux.ghc981_all

Reproduce this run
  1. 1267.91 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  2. 1267.91 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  3. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  4. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
  5. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  6. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  7. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
  8. 1267.91 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  9. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  10. 1267.91 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
  11. 1267.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  12. 1267.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  13. 1267.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
  14. 1267.92 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  15. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  16. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  17. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  18. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  19. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  20. 1267.92 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  21. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:873:1
  22. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
  23. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  25. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
  26. 1267.92 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  27. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  28. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  29. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  30. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  31. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  32. 1267.92 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  33. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  34. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
  35. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  36. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  37. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
  38. 1267.92 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  39. 1267.92 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  40. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  41. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  42. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  43. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  44. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  45. 1267.92 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  46. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  47. 1267.92 s [algebraic-graphs] * in ‘Data.Map.Internal’
  48. 1267.92 s [algebraic-graphs] * in ‘Data.Set.Internal’
  49. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  50. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  51. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  52. 1267.92 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  53. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  54. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  55. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  56. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  57. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  58. 1267.92 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  59. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  60. 1267.92 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  61. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  62. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  63. 1267.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  64. 1267.92 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  65. 1267.92 s [algebraic-graphs] * in ‘GHC.Base’
  66. 1267.92 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  67. 1267.92 s [algebraic-graphs] * in ‘Data.Set.Internal’
  68. 1267.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  69. 1267.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  70. 1267.92 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  71. 1267.93 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  72. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  73. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  74. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  75. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  76. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  77. 1267.93 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  78. 1267.93 s [algebraic-graphs] * in ‘Data.Foldable’
  79. 1267.93 s [algebraic-graphs] * in ‘Data.Map.Internal’
  80. 1267.93 s [algebraic-graphs] * in ‘Data.Set.Internal’
  81. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  82. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  83. 1267.93 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  84. 1267.93 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  85. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  86. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  87. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  88. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  89. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
  90. 1267.93 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  91. 1267.93 s [algebraic-graphs] Missing documentation for:
  92. 1267.93 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  93. 1267.93 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  94. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:96:1
  95. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  96. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  97. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  98. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  99. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  100. 1267.93 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  101. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:198:1
  102. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  103. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  104. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  105. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  106. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
  107. 1267.93 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  108. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  109. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  110. 1267.93 s [algebraic-graphs] * in ‘Data.Map.Internal’
  111. 1267.93 s [algebraic-graphs] * in ‘Data.Set.Internal’
  112. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  113. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  114. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  115. 1267.93 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  116. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  117. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  118. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  119. 1267.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  120. 1267.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  121. 1267.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  122. 1267.93 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  123. 1267.93 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  124. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  125. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
  126. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  127. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  128. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
  129. 1267.94 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  130. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  131. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  132. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
  133. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  134. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  135. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
  136. 1267.94 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  137. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:210:1
  138. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  139. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  140. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  141. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
  142. 1267.94 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  143. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:221:1
  144. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  145. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  146. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  147. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  148. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
  149. 1267.94 s [algebraic-graphs] Warning: 'length' is ambiguous. It is defined
  150. 1267.94 s [algebraic-graphs] * in ‘Data.Foldable’
  151. 1267.94 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  152. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  153. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  154. 1267.94 s [algebraic-graphs] Defaulting to the one defined in ‘Data.List.NonEmpty’
  155. 1267.94 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  156. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:303:1
  157. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  158. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  159. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  160. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  161. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  162. 1267.94 s [algebraic-graphs] Warning: 'edgeSet' is ambiguous. It is defined
  163. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:314:1
  164. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:478:1
  165. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
  166. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  167. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  168. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
  169. 1267.94 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  170. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:390:1
  171. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  172. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  173. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  174. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:763:1
  175. 1267.94 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  176. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:440:1
  177. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  178. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  179. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  180. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  181. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
  182. 1267.94 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  183. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:352:1
  184. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  185. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  186. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  187. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
  188. 1267.94 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  189. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:364:1
  190. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  191. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
  192. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  193. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  194. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
  195. 1267.94 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  196. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:281:1
  197. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  198. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
  199. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  200. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  201. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
  202. 1267.94 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  203. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:269:1
  204. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  205. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  206. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  207. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
  208. 1267.94 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  209. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  210. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  211. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  212. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  213. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  214. 1267.94 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  215. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:376:1
  216. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  217. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
  218. 1267.94 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  219. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  220. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  221. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
  222. 1267.94 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  223. 1267.94 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  224. 1267.94 s [algebraic-graphs] * in ‘GHC.Base’
  225. 1267.94 s [algebraic-graphs] * in ‘Data.Map.Internal’
  226. 1267.94 s [algebraic-graphs] * in ‘Data.Set.Internal’
  227. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  228. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  229. 1267.94 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  230. 1267.94 s [algebraic-graphs] Warning: 'scc' is ambiguous. It is defined
  231. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:471:1
  232. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
  233. 1267.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  234. 1267.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  235. 1267.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
  236. 1267.94 s [algebraic-graphs] Warning: 'union' is ambiguous. It is defined
  237. 1267.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
  238. 1267.94 s [algebraic-graphs] * in ‘Data.Map.Internal’
  239. 1267.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  240. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  241. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  242. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
  243. 1267.95 s [algebraic-graphs] Warning: 'box' is ambiguous. It is defined
  244. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:428:1
  245. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:835:1
  246. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  247. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  248. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:835:1
  249. 1267.95 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  250. 1267.95 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  251. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  252. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  253. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  254. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  255. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  256. 1267.95 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  257. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  258. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  259. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
  260. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  261. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  262. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  263. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  264. 1267.95 s [algebraic-graphs] Warning: 'edgeSet' is ambiguous. It is defined
  265. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph.hs:783:1
  266. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:489:1
  267. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:478:1
  268. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
  269. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:179:5
  270. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  271. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  272. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:179:5
  273. 1267.95 s [algebraic-graphs] Warning: 'preSet' is ambiguous. It is defined
  274. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:503:1
  275. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:434:1
  276. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:187:5
  277. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  278. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  279. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:187:5
  280. 1267.95 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  281. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  282. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
  283. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:205:5
  284. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  285. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  286. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
  287. 1267.95 s [algebraic-graphs] Warning: 'adjacencyMap' is ambiguous. It is defined
  288. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:167:5
  289. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:443:1
  290. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  291. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  292. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:443:1
  293. 1267.95 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  294. 1267.95 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  295. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  296. 1267.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  297. 1267.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  298. 1267.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  299. 1267.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  300. 1267.96 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  301. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  302. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  303. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  304. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  305. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  306. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  307. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
  308. 1267.96 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  309. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  310. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  311. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  312. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:283:1
  313. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  314. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  315. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:283:1
  316. 1267.96 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  317. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  318. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  319. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  320. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:304:1
  321. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  322. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  323. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:304:1
  324. 1267.96 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  325. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  326. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  327. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  328. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  329. 1267.96 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  330. 1267.96 s [algebraic-graphs] * in ‘Data.Set.Internal’
  331. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  332. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  333. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  334. 1267.96 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  335. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  336. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  337. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  338. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:266:1
  339. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  340. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  341. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:266:1
  342. 1267.96 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  343. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  344. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  345. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  346. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:373:1
  347. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  348. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  349. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:373:1
  350. 1267.96 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  351. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  352. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
  353. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  354. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:387:1
  355. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  356. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  357. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  358. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  359. 1267.96 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  360. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  361. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  362. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  363. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:398:1
  364. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  365. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  366. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  367. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  368. 1267.96 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  369. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  370. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  371. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  372. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  373. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  374. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  375. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  376. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  377. 1267.96 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  378. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  379. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  380. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  381. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  382. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  383. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  384. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  385. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  386. 1267.96 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  387. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  388. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  389. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  390. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:411:1
  391. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  392. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  393. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  394. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  395. 1267.96 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  396. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  397. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  398. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  399. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:345:1
  400. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  401. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  402. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:345:1
  403. 1267.96 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  404. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  405. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  406. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:471:1
  407. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  408. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  409. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  410. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  411. 1267.96 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  412. 1267.96 s [algebraic-graphs] * in ‘GHC.Base’
  413. 1267.96 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  414. 1267.96 s [algebraic-graphs] * in ‘Data.Set.Internal’
  415. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  416. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  417. 1267.96 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  418. 1267.96 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  419. 1267.96 s [algebraic-graphs] * in ‘Data.Foldable’
  420. 1267.96 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  421. 1267.96 s [algebraic-graphs] * in ‘Data.Set.Internal’
  422. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  423. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  424. 1267.96 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  425. 1267.96 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  426. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  427. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  428. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  429. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  430. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  431. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  432. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
  433. 1267.96 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  434. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  435. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  436. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  437. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:554:1
  438. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  439. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  440. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:554:1
  441. 1267.96 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  442. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  443. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
  444. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  445. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:663:1
  446. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  447. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  448. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:663:1
  449. 1267.96 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  450. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  451. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  452. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  453. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:678:1
  454. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  455. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  456. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:678:1
  457. 1267.96 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  458. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  459. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  460. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  461. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:460:1
  462. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  463. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  464. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  465. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  466. 1267.96 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  467. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  468. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  469. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  470. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:446:1
  471. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  472. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  473. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  474. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  475. 1267.96 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  476. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  477. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  478. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  479. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:320:1
  480. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  481. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  482. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:320:1
  483. 1267.96 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  484. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  485. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  486. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  487. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:603:1
  488. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  489. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  490. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:603:1
  491. 1267.96 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  492. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  493. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  494. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  495. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:332:1
  496. 1267.96 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  497. 1267.96 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  498. 1267.96 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:332:1
  499. 1267.96 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  500. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph.hs:1145:1
  501. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
  502. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  503. 1267.96 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:716:1
  504. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  505. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  506. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:716:1
  507. 1267.97 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  508. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:937:1
  509. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
  510. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:611:1
  511. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:621:1
  512. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  513. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  514. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:621:1
  515. 1267.97 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  516. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:805:1
  517. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
  518. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:491:1
  519. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:496:1
  520. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:223:5
  521. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  522. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  523. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
  524. 1267.97 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  525. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  526. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  527. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  528. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:636:1
  529. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  530. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  531. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:636:1
  532. 1267.97 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  533. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  534. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  535. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  536. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:690:1
  537. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  538. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  539. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:690:1
  540. 1267.97 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  541. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  542. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  543. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  544. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:703:1
  545. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  546. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  547. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:703:1
  548. 1267.97 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  549. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
  550. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  551. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:731:1
  552. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  553. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  554. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:731:1
  555. 1267.97 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  556. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:1163:1
  557. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
  558. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  559. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:745:1
  560. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  561. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  562. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:745:1
  563. 1267.97 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  564. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:834:1
  565. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:873:1
  566. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:823:1
  567. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  568. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  569. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:823:1
  570. 1267.97 s [algebraic-graphs] Warning: 'clique' is ambiguous. It is defined
  571. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph.hs:878:1
  572. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:570:1
  573. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:558:1
  574. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:569:1
  575. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  576. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  577. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
  578. 1267.97 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  579. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:861:1
  580. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  581. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:850:1
  582. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  583. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  584. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:850:1
  585. 1267.97 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  586. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  587. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:528:1
  588. 1267.97 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:205:5
  589. 1267.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  590. 1267.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  591. 1267.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
  592. 1267.98 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  593. 1267.98 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  594. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  595. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:104:1
  596. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  597. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  598. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:104:1
  599. 1267.98 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  600. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  601. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  602. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  603. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:304:1
  604. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  605. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  606. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  607. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  608. 1267.98 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  609. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  610. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  611. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  612. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  613. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  614. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  615. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  616. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  617. 1267.98 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  618. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  619. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  620. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  621. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:266:1
  622. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  623. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  624. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  625. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  626. 1267.98 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  627. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  628. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  629. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  630. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:373:1
  631. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  632. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  633. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  634. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  635. 1267.98 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  636. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  637. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  638. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  639. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:283:1
  640. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  641. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  642. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  643. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  644. 1267.98 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  645. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  646. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  647. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  648. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  649. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  650. 1267.98 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  651. 1267.98 s [algebraic-graphs] * in ‘Data.Set.Internal’
  652. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  653. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  654. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  655. 1267.98 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  656. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  657. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  658. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  659. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  660. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  661. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  662. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  663. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  664. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  665. 1267.98 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  666. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  667. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  668. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  669. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  670. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  671. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  672. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  673. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  674. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  675. 1267.98 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  676. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  677. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
  678. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  679. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:387:1
  680. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
  681. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  682. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  683. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  684. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  685. 1267.98 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  686. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  687. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  688. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  689. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:398:1
  690. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
  691. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  692. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  693. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  694. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  695. 1267.98 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  696. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  697. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  698. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  699. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:332:1
  700. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  701. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  702. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  703. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  704. 1267.98 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  705. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  706. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  707. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  708. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:411:1
  709. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
  710. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  711. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  712. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  713. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  714. 1267.98 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  715. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  716. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  717. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  718. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:345:1
  719. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  720. 1267.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  721. 1267.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  722. 1267.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  723. 1267.98 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  724. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  725. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  726. 1267.98 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:471:1
  727. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
  728. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  729. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  730. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  731. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  732. 1267.99 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  733. 1267.99 s [algebraic-graphs] * in ‘Data.Foldable’
  734. 1267.99 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  735. 1267.99 s [algebraic-graphs] * in ‘Data.Set.Internal’
  736. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  737. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  738. 1267.99 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  739. 1267.99 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  740. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  741. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  742. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  743. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  744. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  745. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  746. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  747. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  748. 1267.99 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  749. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  750. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  751. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  752. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:554:1
  753. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  754. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  755. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  756. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  757. 1267.99 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  758. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  759. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
  760. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  761. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:663:1
  762. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
  763. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  764. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  765. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:571:1
  766. 1267.99 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  767. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  768. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  769. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  770. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:678:1
  771. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
  772. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  773. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  774. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:585:1
  775. 1267.99 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  776. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  777. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  778. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  779. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:460:1
  780. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
  781. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  782. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  783. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  784. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  785. 1267.99 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  786. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  787. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  788. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  789. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:446:1
  790. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
  791. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  792. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  793. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  794. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  795. 1267.99 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  796. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  797. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  798. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  799. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:320:1
  800. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  801. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  802. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  803. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  804. 1267.99 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  805. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  806. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  807. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  808. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:603:1
  809. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  810. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  811. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  812. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  813. 1267.99 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  814. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:937:1
  815. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
  816. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:611:1
  817. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:621:1
  818. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
  819. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  820. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  821. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:534:1
  822. 1267.99 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  823. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:805:1
  824. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
  825. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:491:1
  826. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:496:1
  827. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
  828. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:223:5
  829. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  830. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  831. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
  832. 1267.99 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  833. 1267.99 s [algebraic-graphs] * in ‘GHC.Base’
  834. 1267.99 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  835. 1267.99 s [algebraic-graphs] * in ‘Data.Set.Internal’
  836. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  837. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  838. 1267.99 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  839. 1267.99 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  840. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  841. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  842. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  843. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:636:1
  844. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  845. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  846. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  847. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  848. 1267.99 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  849. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  850. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  851. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  852. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:690:1
  853. 1267.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
  854. 1267.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  855. 1267.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  856. 1267.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:597:1
  857. 1268.00 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  858. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  859. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  860. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  861. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:703:1
  862. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
  863. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  864. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  865. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:610:1
  866. 1268.00 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  867. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
  868. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  869. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:731:1
  870. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:625:1
  871. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  872. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  873. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:625:1
  874. 1268.00 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  875. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:1163:1
  876. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
  877. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  878. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:745:1
  879. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
  880. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  881. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  882. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:639:1
  883. 1268.00 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  884. 1268.00 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  885. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  886. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:164:1
  887. 1268.00 s [algebraic-graphs] * in ‘Data.Graph’
  888. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  889. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  890. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:1
  891. 1268.00 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  892. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  893. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  894. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  895. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:257:1
  896. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  897. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  898. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:257:1
  899. 1268.00 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  900. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  901. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  902. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  903. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:287:1
  904. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  905. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  906. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:287:1
  907. 1268.00 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  908. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  909. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  910. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  911. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:322:1
  912. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  913. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  914. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:322:1
  915. 1268.00 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  916. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  917. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
  918. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  919. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:490:1
  920. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  921. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  922. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  923. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  924. 1268.00 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  925. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  926. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
  927. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  928. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:508:1
  929. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  930. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  931. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  932. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  933. 1268.00 s [algebraic-graphs] Warning: 'size' is ambiguous. It is defined
  934. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:602:1
  935. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:447:1
  936. 1268.00 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  937. 1268.00 s [algebraic-graphs] * in ‘Data.Set.Internal’
  938. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  939. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  940. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:447:1
  941. 1268.00 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  942. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  943. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  944. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  945. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:270:1
  946. 1268.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  947. 1268.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  948. 1268.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:270:1
  949. 1268.00 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  950. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  951. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  952. 1268.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  953. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:410:1
  954. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  955. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  956. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:410:1
  957. 1268.01 s [algebraic-graphs] Warning: 'Vertex' is ambiguous. It is defined
  958. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:184:16
  959. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:164:16
  960. 1268.01 s [algebraic-graphs] * in ‘Data.Graph’
  961. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  962. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  963. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:16
  964. 1268.01 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  965. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  966. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
  967. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  968. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:456:1
  969. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  970. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  971. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  972. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  973. 1268.01 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  974. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  975. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
  976. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  977. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:470:1
  978. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  979. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  980. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  981. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  982. 1268.01 s [algebraic-graphs] Warning: 'Overlay' is ambiguous. It is defined
  983. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:185:16
  984. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:165:16
  985. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  986. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  987. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:165:16
  988. 1268.01 s [algebraic-graphs] Warning: 'Connect' is ambiguous. It is defined
  989. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:186:16
  990. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:166:16
  991. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  992. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  993. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:166:16
  994. 1268.01 s [algebraic-graphs] Warning: 'length' is ambiguous. It is defined
  995. 1268.01 s [algebraic-graphs] * in ‘Data.Foldable’
  996. 1268.01 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  997. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  998. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  999. 1268.01 s [algebraic-graphs] Defaulting to the one defined in ‘Data.List.NonEmpty’
  1000. 1268.01 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  1001. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  1002. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  1003. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:561:1
  1004. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  1005. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1006. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1007. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  1008. 1268.01 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  1009. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:1145:1
  1010. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
  1011. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  1012. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:809:1
  1013. 1268.01 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  1014. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1015. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1016. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:809:1
  1017. 1268.01 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  1018. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  1019. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
  1020. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  1021. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:747:1
  1022. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1023. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1024. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:747:1
  1025. 1268.01 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  1026. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  1027. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
  1028. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  1029. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:544:1
  1030. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  1031. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1032. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1033. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  1034. 1268.01 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  1035. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  1036. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
  1037. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  1038. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  1039. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1040. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1041. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  1042. 1268.01 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  1043. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  1044. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  1045. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  1046. 1268.01 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:639:1
  1047. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1048. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1049. 1268.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:639:1
  1050. 1268.01 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  1051. 1268.01 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  1052. 1268.01 s [algebraic-graphs] * in ‘GHC.Base’
  1053. 1268.01 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1054. 1268.01 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1055. 1268.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1056. 1268.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1057. 1268.01 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1058. 1268.02 s [algebraic-graphs] Warning: 'box' is ambiguous. It is defined
  1059. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:1287:1
  1060. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:835:1
  1061. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:909:1
  1062. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1063. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1064. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:909:1
  1065. 1268.02 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  1066. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  1067. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
  1068. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  1069. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:768:1
  1070. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1071. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1072. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:768:1
  1073. 1268.02 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  1074. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  1075. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
  1076. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:704:1
  1077. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:782:1
  1078. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1079. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1080. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:782:1
  1081. 1268.02 s [algebraic-graphs] Warning: '===' is ambiguous. It is defined
  1082. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:562:17
  1083. 1268.02 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty.hs:428:17
  1084. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1085. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1086. 1268.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:428:17
  1087. 1268.02 s [algebraic-graphs] Warning: 'filter' is ambiguous. It is defined
  1088. 1268.02 s [algebraic-graphs] * in ‘Data.List.NonEmpty’
  1089. 1268.02 s [algebraic-graphs] * in ‘GHC.List’
  1090. 1268.02 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1091. 1268.02 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1092. 1268.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1093. 1268.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1094. 1268.02 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1095. 1268.03 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  1096. 1268.03 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  1097. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  1098. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
  1099. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1100. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1101. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
  1102. 1268.03 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  1103. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:379:1
  1104. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
  1105. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  1106. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1107. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1108. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  1109. 1268.03 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  1110. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:390:1
  1111. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
  1112. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  1113. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1114. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1115. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  1116. 1268.03 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  1117. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  1118. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:403:1
  1119. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:130:5
  1120. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1121. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1122. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
  1123. 1268.03 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  1124. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  1125. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:415:1
  1126. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:138:5
  1127. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1128. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1129. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
  1130. 1268.03 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  1131. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  1132. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  1133. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1134. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1135. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  1136. 1268.03 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1137. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1138. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  1139. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1140. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1141. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  1142. 1268.03 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  1143. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  1144. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  1145. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1146. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1147. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  1148. 1268.03 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  1149. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  1150. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  1151. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  1152. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1153. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1154. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  1155. 1268.03 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  1156. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  1157. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  1158. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1159. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1160. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  1161. 1268.03 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1162. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1163. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1164. 1268.03 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1165. 1268.03 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1166. 1268.03 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1167. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1168. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1169. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1170. 1268.03 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  1171. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  1172. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  1173. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1174. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1175. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  1176. 1268.03 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  1177. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:900:1
  1178. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  1179. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1180. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1181. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  1182. 1268.03 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  1183. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  1184. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  1185. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1186. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1187. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  1188. 1268.03 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  1189. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:466:1
  1190. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
  1191. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  1192. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1193. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1194. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  1195. 1268.03 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  1196. 1268.03 s [algebraic-graphs] * in ‘GHC.Base’
  1197. 1268.03 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1198. 1268.03 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  1199. 1268.03 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1200. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1201. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1202. 1268.03 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1203. 1268.03 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  1204. 1268.03 s [algebraic-graphs] * in ‘Data.Foldable’
  1205. 1268.03 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1206. 1268.03 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1207. 1268.03 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1208. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1209. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1210. 1268.03 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1211. 1268.03 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  1212. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  1213. 1268.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  1214. 1268.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1215. 1268.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1216. 1268.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  1217. 1268.04 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  1218. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:666:1
  1219. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  1220. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1221. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1222. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  1223. 1268.04 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  1224. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:679:1
  1225. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  1226. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1227. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1228. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  1229. 1268.04 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  1230. 1268.04 s [algebraic-graphs] * in ‘Data.Foldable’
  1231. 1268.04 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1232. 1268.04 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1233. 1268.04 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1234. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1235. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1236. 1268.04 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1237. 1268.04 s [algebraic-graphs] Warning: 'filter' is ambiguous. It is defined
  1238. 1268.04 s [algebraic-graphs] * in ‘GHC.List’
  1239. 1268.04 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1240. 1268.04 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1241. 1268.04 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1242. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1243. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1244. 1268.04 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1245. 1268.04 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  1246. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:454:1
  1247. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
  1248. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  1249. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1250. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1251. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  1252. 1268.04 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  1253. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:440:1
  1254. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:426:1
  1255. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:146:5
  1256. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1257. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1258. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
  1259. 1268.04 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  1260. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:691:1
  1261. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  1262. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1263. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1264. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  1265. 1268.04 s [algebraic-graphs] Warning: 'gmap' is ambiguous. It is defined
  1266. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:749:1
  1267. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
  1268. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1269. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1270. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
  1271. 1268.04 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  1272. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:763:1
  1273. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  1274. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1275. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1276. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  1277. 1268.04 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  1278. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  1279. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  1280. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1281. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1282. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  1283. 1268.04 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  1284. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:873:1
  1285. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  1286. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1287. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1288. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  1289. 1268.04 s [algebraic-graphs] Warning: 'postSet' is ambiguous. It is defined
  1290. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:517:1
  1291. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:486:1
  1292. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:205:5
  1293. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1294. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1295. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
  1296. 1268.04 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  1297. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:717:1
  1298. 1268.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  1299. 1268.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1300. 1268.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1301. 1268.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  1302. 1268.05 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  1303. 1268.05 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  1304. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  1305. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  1306. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1307. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1308. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  1309. 1268.05 s [algebraic-graphs] Warning: 'size' is ambiguous. It is defined
  1310. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:357:1
  1311. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1312. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1313. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1314. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1315. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1316. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:357:1
  1317. 1268.05 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1318. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  1319. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1320. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1321. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1322. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1323. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1324. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1325. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1326. 1268.05 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1327. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:203:1
  1328. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  1329. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1330. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1331. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  1332. 1268.05 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  1333. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:288:1
  1334. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  1335. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1336. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1337. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  1338. 1268.05 s [algebraic-graphs] Warning: 'transpose' is ambiguous. It is defined
  1339. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:496:1
  1340. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  1341. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1342. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1343. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
  1344. 1268.05 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  1345. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:342:1
  1346. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
  1347. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:106:5
  1348. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1349. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1350. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
  1351. 1268.05 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  1352. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:368:1
  1353. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
  1354. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:114:5
  1355. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1356. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1357. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
  1358. 1268.05 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  1359. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:424:1
  1360. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
  1361. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:162:5
  1362. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1363. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1364. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
  1365. 1268.05 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  1366. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:145:1
  1367. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  1368. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1369. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1370. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  1371. 1268.05 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  1372. 1268.05 s [algebraic-graphs] * in ‘Data.Foldable’
  1373. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1374. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1375. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1376. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1377. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1378. 1268.05 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1379. 1268.05 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  1380. 1268.05 s [algebraic-graphs] * in ‘GHC.Base’
  1381. 1268.05 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1382. 1268.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1383. 1268.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1384. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1385. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1386. 1268.05 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1387. 1268.05 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  1388. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:303:1
  1389. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  1390. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1391. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1392. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  1393. 1268.05 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  1394. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:180:1
  1395. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  1396. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1397. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1398. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  1399. 1268.05 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  1400. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:270:1
  1401. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  1402. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1403. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1404. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  1405. 1268.05 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  1406. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:381:1
  1407. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  1408. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:122:5
  1409. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1410. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1411. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
  1412. 1268.05 s [algebraic-graphs] Warning: 'edgeLabel' is ambiguous. It is defined
  1413. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:385:1
  1414. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
  1415. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1416. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1417. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
  1418. 1268.05 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  1419. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:217:1
  1420. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  1421. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1422. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1423. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  1424. 1268.05 s [algebraic-graphs] Warning: 'transitiveClosure' is ambiguous. It is defined
  1425. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:619:1
  1426. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  1427. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1428. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1429. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
  1430. 1268.05 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  1431. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:329:1
  1432. 1268.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  1433. 1268.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1434. 1268.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1435. 1268.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  1436. 1268.06 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  1437. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:448:1
  1438. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  1439. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1440. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1441. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
  1442. 1268.06 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  1443. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:461:1
  1444. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  1445. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1446. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1447. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
  1448. 1268.06 s [algebraic-graphs] Warning: 'null' is ambiguous. It is defined
  1449. 1268.06 s [algebraic-graphs] * in ‘Data.Foldable’
  1450. 1268.06 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1451. 1268.06 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1452. 1268.06 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1453. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1454. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1455. 1268.06 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1456. 1268.06 s [algebraic-graphs] Warning: 'filter' is ambiguous. It is defined
  1457. 1268.06 s [algebraic-graphs] * in ‘GHC.List’
  1458. 1268.06 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  1459. 1268.06 s [algebraic-graphs] * in ‘Data.Map.Internal’
  1460. 1268.06 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1461. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1462. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1463. 1268.06 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1464. 1268.06 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  1465. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:413:1
  1466. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
  1467. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:154:5
  1468. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1469. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1470. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
  1471. 1268.06 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  1472. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:473:1
  1473. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  1474. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1475. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1476. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
  1477. 1268.06 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  1478. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:545:1
  1479. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  1480. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1481. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1482. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
  1483. 1268.06 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  1484. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:315:1
  1485. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  1486. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1487. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1488. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  1489. 1268.06 s [algebraic-graphs] Warning: 'reflexiveClosure' is ambiguous. It is defined
  1490. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:592:1
  1491. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  1492. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1493. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1494. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
  1495. 1268.06 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  1496. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  1497. 1268.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  1498. 1268.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1499. 1268.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1500. 1268.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  1501. 1268.06 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  1502. 1268.07 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  1503. 1268.07 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  1504. 1268.07 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  1505. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  1506. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  1507. 1268.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1508. 1268.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1509. 1268.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  1510. 1268.07 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  1511. 1268.07 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  1512. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  1513. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  1514. 1268.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1515. 1268.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1516. 1268.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  1517. 1268.07 s [algebraic-graphs] Warning: 'export' is ambiguous. It is defined
  1518. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:186:1
  1519. 1268.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:122:1
  1520. 1268.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1521. 1268.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1522. 1268.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:122:1
  1523. 1268.07 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  1524. 1268.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1525. 1268.08 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  1526. 1268.08 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  1527. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  1528. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  1529. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:325:1
  1530. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1531. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1532. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
  1533. 1268.08 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  1534. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  1535. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:178:1
  1536. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1537. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1538. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
  1539. 1268.08 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1540. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  1541. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  1542. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  1543. 1268.08 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1544. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1545. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1546. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  1547. 1268.08 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1548. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  1549. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  1550. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:266:1
  1551. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1552. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1553. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
  1554. 1268.08 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  1555. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  1556. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  1557. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:300:1
  1558. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1559. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1560. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
  1561. 1268.08 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  1562. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:677:1
  1563. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  1564. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:505:1
  1565. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1566. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1567. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:505:1
  1568. 1268.08 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  1569. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:699:1
  1570. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  1571. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:519:1
  1572. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1573. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1574. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:519:1
  1575. 1268.08 s [algebraic-graphs] Warning: 'size' is ambiguous. It is defined
  1576. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:602:1
  1577. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:462:1
  1578. 1268.08 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1579. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1580. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1581. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:462:1
  1582. 1268.08 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  1583. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  1584. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  1585. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:281:1
  1586. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1587. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1588. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
  1589. 1268.08 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  1590. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  1591. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  1592. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:424:1
  1593. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1594. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1595. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
  1596. 1268.08 s [algebraic-graphs] Warning: 'isEmpty' is ambiguous. It is defined
  1597. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:584:1
  1598. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
  1599. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:446:1
  1600. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1601. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1602. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:446:1
  1603. 1268.08 s [algebraic-graphs] Warning: 'hasVertex' is ambiguous. It is defined
  1604. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:616:1
  1605. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
  1606. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:474:1
  1607. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1608. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1609. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:474:1
  1610. 1268.08 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  1611. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  1612. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  1613. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:354:1
  1614. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1615. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1616. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
  1617. 1268.08 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  1618. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:653:1
  1619. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
  1620. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:491:1
  1621. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1622. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1623. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:491:1
  1624. 1268.08 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  1625. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  1626. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  1627. 1268.08 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:369:1
  1628. 1268.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1629. 1268.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1630. 1268.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
  1631. 1268.09 s [algebraic-graphs] Warning: 'vertexSet' is ambiguous. It is defined
  1632. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:763:1
  1633. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
  1634. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:557:1
  1635. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1636. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1637. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:557:1
  1638. 1268.09 s [algebraic-graphs] Warning: 'foldr' is ambiguous. It is defined
  1639. 1268.09 s [algebraic-graphs] * in ‘Data.Foldable’
  1640. 1268.09 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1641. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1642. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1643. 1268.09 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1644. 1268.09 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  1645. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  1646. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  1647. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:610:1
  1648. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1649. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1650. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
  1651. 1268.09 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  1652. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  1653. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  1654. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:624:1
  1655. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1656. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1657. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
  1658. 1268.09 s [algebraic-graphs] Warning: 'removeVertex' is ambiguous. It is defined
  1659. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1052:1
  1660. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
  1661. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:729:1
  1662. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1663. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1664. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:729:1
  1665. 1268.09 s [algebraic-graphs] Warning: 'removeEdge' is ambiguous. It is defined
  1666. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1067:1
  1667. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
  1668. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:746:1
  1669. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1670. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1671. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:746:1
  1672. 1268.09 s [algebraic-graphs] Warning: 'edgeList' is ambiguous. It is defined
  1673. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:743:1
  1674. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
  1675. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:545:1
  1676. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1677. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1678. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:545:1
  1679. 1268.09 s [algebraic-graphs] Warning: 'vertexList' is ambiguous. It is defined
  1680. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:719:1
  1681. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
  1682. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:531:1
  1683. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1684. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1685. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:531:1
  1686. 1268.09 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  1687. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  1688. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  1689. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:341:1
  1690. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1691. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1692. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
  1693. 1268.09 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  1694. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  1695. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  1696. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:669:1
  1697. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1698. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1699. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
  1700. 1268.09 s [algebraic-graphs] Warning: 'stars' is ambiguous. It is defined
  1701. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:937:1
  1702. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
  1703. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:687:1
  1704. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1705. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1706. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:687:1
  1707. 1268.09 s [algebraic-graphs] Warning: 'adjacencyList' is ambiguous. It is defined
  1708. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:805:1
  1709. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
  1710. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:583:1
  1711. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1712. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1713. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:583:1
  1714. 1268.09 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  1715. 1268.09 s [algebraic-graphs] * in ‘GHC.Base’
  1716. 1268.09 s [algebraic-graphs] * in ‘Data.Set.Internal’
  1717. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1718. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1719. 1268.09 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  1720. 1268.09 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  1721. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  1722. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  1723. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:701:1
  1724. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1725. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1726. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
  1727. 1268.09 s [algebraic-graphs] Warning: 'replaceVertex' is ambiguous. It is defined
  1728. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1091:1
  1729. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
  1730. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:760:1
  1731. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1732. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1733. 1268.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:760:1
  1734. 1268.09 s [algebraic-graphs] Warning: 'mergeVertices' is ambiguous. It is defined
  1735. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1108:1
  1736. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
  1737. 1268.09 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:775:1
  1738. 1268.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1739. 1268.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1740. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:775:1
  1741. 1268.10 s [algebraic-graphs] Warning: 'induce' is ambiguous. It is defined
  1742. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:1163:1
  1743. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
  1744. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:791:1
  1745. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1746. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1747. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:791:1
  1748. 1268.10 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  1749. 1268.10 s [algebraic-graphs] Warning: 'Graph' is ambiguous. It is defined
  1750. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:183:1
  1751. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:109:1
  1752. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:66:1
  1753. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:178:1
  1754. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1755. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1756. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
  1757. 1268.10 s [algebraic-graphs] Warning: 'connect' is ambiguous. It is defined
  1758. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:386:1
  1759. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
  1760. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:292:1
  1761. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:119:5
  1762. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:288:1
  1763. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
  1764. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:304:1
  1765. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
  1766. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:325:1
  1767. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1768. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1769. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
  1770. 1268.10 s [algebraic-graphs] Warning: 'overlay' is ambiguous. It is defined
  1771. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:362:1
  1772. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
  1773. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:270:1
  1774. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:117:5
  1775. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:270:1
  1776. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
  1777. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:283:1
  1778. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
  1779. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:300:1
  1780. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1781. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1782. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
  1783. 1268.10 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1784. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  1785. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  1786. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  1787. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:113:5
  1788. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  1789. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  1790. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  1791. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  1792. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  1793. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1794. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1795. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  1796. 1268.10 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1797. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:330:1
  1798. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
  1799. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  1800. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:115:5
  1801. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:203:1
  1802. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
  1803. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  1804. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
  1805. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:266:1
  1806. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1807. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1808. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
  1809. 1268.10 s [algebraic-graphs] Warning: 'overlays' is ambiguous. It is defined
  1810. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:440:1
  1811. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
  1812. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:336:1
  1813. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:325:1
  1814. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:329:1
  1815. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
  1816. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:345:1
  1817. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
  1818. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:369:1
  1819. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1820. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1821. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
  1822. 1268.10 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  1823. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:343:1
  1824. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
  1825. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  1826. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:289:1
  1827. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:217:1
  1828. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
  1829. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:266:1
  1830. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
  1831. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:281:1
  1832. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1833. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1834. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
  1835. 1268.10 s [algebraic-graphs] Warning: 'isSubgraphOf' is ambiguous. It is defined
  1836. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:542:1
  1837. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
  1838. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:366:1
  1839. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:361:1
  1840. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:180:1
  1841. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
  1842. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:373:1
  1843. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
  1844. 1268.10 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:424:1
  1845. 1268.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1846. 1268.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1847. 1268.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
  1848. 1268.10 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  1849. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:837:1
  1850. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
  1851. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:529:1
  1852. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:373:1
  1853. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  1854. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
  1855. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:610:1
  1856. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1857. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1858. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
  1859. 1268.11 s [algebraic-graphs] Warning: 'circuit' is ambiguous. It is defined
  1860. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:858:1
  1861. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
  1862. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:543:1
  1863. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:387:1
  1864. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:554:1
  1865. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
  1866. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:624:1
  1867. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1868. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1869. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
  1870. 1268.11 s [algebraic-graphs] Warning: 'edges' is ambiguous. It is defined
  1871. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:423:1
  1872. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
  1873. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:323:1
  1874. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:312:1
  1875. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:315:1
  1876. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
  1877. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:332:1
  1878. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
  1879. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:354:1
  1880. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1881. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1882. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
  1883. 1268.11 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  1884. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:407:1
  1885. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
  1886. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  1887. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:301:1
  1888. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:303:1
  1889. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
  1890. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:320:1
  1891. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
  1892. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:341:1
  1893. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1894. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1895. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
  1896. 1268.11 s [algebraic-graphs] Warning: 'star' is ambiguous. It is defined
  1897. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:915:1
  1898. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
  1899. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:592:1
  1900. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:431:1
  1901. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:603:1
  1902. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
  1903. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:669:1
  1904. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1905. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1906. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
  1907. 1268.11 s [algebraic-graphs] Warning: 'tree' is ambiguous. It is defined
  1908. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:951:1
  1909. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
  1910. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:639:1
  1911. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:445:1
  1912. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:636:1
  1913. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
  1914. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:701:1
  1915. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1916. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1917. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
  1918. 1268.11 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  1919. 1268.11 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  1920. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  1921. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  1922. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1923. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1924. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  1925. 1268.11 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1926. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:113:5
  1927. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  1928. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1929. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1930. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  1931. 1268.11 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  1932. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:373:1
  1933. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  1934. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1935. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1936. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
  1937. 1268.11 s [algebraic-graphs] Warning: 'clique' is ambiguous. It is defined
  1938. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:402:1
  1939. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:569:1
  1940. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1941. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1942. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
  1943. 1268.11 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  1944. 1268.11 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  1945. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  1946. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  1947. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1948. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1949. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  1950. 1268.11 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1951. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:115:5
  1952. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  1953. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1954. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1955. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
  1956. 1268.11 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  1957. 1268.11 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  1958. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  1959. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  1960. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1961. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1962. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  1963. 1268.11 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  1964. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:115:5
  1965. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:254:1
  1966. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1967. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1968. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
  1969. 1268.11 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  1970. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:113:5
  1971. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  1972. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1973. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1974. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  1975. 1268.11 s [algebraic-graphs] Warning: 'path' is ambiguous. It is defined
  1976. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:373:1
  1977. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:540:1
  1978. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1979. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1980. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
  1981. 1268.11 s [algebraic-graphs] Warning: 'clique' is ambiguous. It is defined
  1982. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Class.hs:402:1
  1983. 1268.11 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:569:1
  1984. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  1985. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  1986. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
  1987. 1268.11 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  1988. 1268.11 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  1989. 1268.11 s [algebraic-graphs] Missing documentation for:
  1990. 1268.11 s [algebraic-graphs] Module header
  1991. 1268.11 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  1992. 1268.11 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  1993. 1268.11 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  1994. 1268.11 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  1995. 1268.11 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  1996. 1268.11 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  1997. 1268.11 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  1998. 1268.11 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  1999. 1268.11 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  2000. 1268.11 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  2001. 1268.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2002. 1268.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2003. 1268.11 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  2004. 1268.11 s [algebraic-graphs] Warning: 'array' is out of scope.
  2005. 1268.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2006. 1268.12 s [algebraic-graphs] Warning: 'fromAdjacencyMap' is ambiguous. It is defined
  2007. 1268.12 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:222:1
  2008. 1268.12 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:60:1
  2009. 1268.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2010. 1268.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2011. 1268.12 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:60:1
  2012. 1268.12 s [algebraic-graphs] Warning: 'map' is ambiguous. It is defined
  2013. 1268.12 s [algebraic-graphs] * in ‘GHC.Base’
  2014. 1268.12 s [algebraic-graphs] * in ‘Data.Map.Strict.Internal’
  2015. 1268.12 s [algebraic-graphs] * in ‘Data.Set.Internal’
  2016. 1268.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  2017. 1268.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  2018. 1268.12 s [algebraic-graphs] Defaulting to the one defined in ‘Data.Set.Internal’
  2019. 1268.12 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  2020. 1268.12 s [algebraic-graphs] Missing documentation for:
  2021. 1268.12 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  2022. 1268.43 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  2023. 1268.43 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  2024. 1268.43 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2025. 1268.43 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2026. 1268.44 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  2027. 1268.44 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  2028. 1268.44 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2029. 1268.44 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2030. 1268.44 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  2031. 1268.44 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  2032. 1268.45 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  2033. 1268.45 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  2034. 1268.45 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2035. 1268.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2036. 1268.46 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  2037. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  2038. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  2039. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  2040. 1268.46 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  2041. 1268.46 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  2042. 1268.46 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  2043. 1268.46 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  2044. 1268.46 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  2045. 1268.47 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  2046. 1268.47 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  2047. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2048. 1268.47 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  2049. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  2050. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  2051. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  2052. 1268.47 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  2053. 1268.47 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2054. 1268.47 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2055. 1268.47 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2056. 1268.47 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2057. 1268.47 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2058. 1268.48 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  2059. 1268.48 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  2060. 1268.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2061. 1268.48 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  2062. 1268.48 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  2063. 1268.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2064. 1268.49 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  2065. 1268.49 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  2066. 1268.49 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  2067. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  2068. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  2069. 1268.49 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2070. 1268.49 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  2071. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  2072. 1268.49 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  2073. 1268.49 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2074. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  2075. 1268.50 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  2076. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2077. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  2078. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  2079. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  2080. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  2081. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  2082. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  2083. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  2084. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  2085. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  2086. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  2087. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  2088. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  2089. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  2090. 1268.50 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  2091. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2092. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2093. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2094. 1268.50 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2095. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  2096. 1268.50 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  2097. 1268.50 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  2098. 1268.51 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  2099. 1268.51 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  2100. 1268.51 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  2101. 1268.51 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  2102. 1268.51 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  2103. 1271.86 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  2104. 1272.29 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  2105. 1272.29 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  2106. 1272.29 s [algebraic-graphs] Phase: installPhase
  2107. 1272.29 s [algebraic-graphs] Installing library in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  2108. 1272.66 s [algebraic-graphs] Phase: fixupPhase
  2109. 1272.68 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  2110. 1272.70 s [algebraic-graphs] shrinking /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSalgebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd-ghc9.8.1.so
  2111. 1272.71 s [algebraic-graphs] checking for references to /build/ in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7...
  2112. 1272.74 s [algebraic-graphs] patching script interpreter paths in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  2113. 1272.74 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib
  2114. 1273.01 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc
  2115. 1273.03 s [algebraic-graphs] checking for references to /build/ in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc...
  2116. 1273.05 s [algebraic-graphs] patching script interpreter paths in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc
  2117. 1273.21 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  2118. 1273.66 s [algebraic-graphs:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  2119. 1273.66 s [algebraic-graphs:post-build]
  2120. 1274.03 s [algebraic-graphs:post-build] Pushing /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc (10.46 MiB)
  2121. 1274.09 s [algebraic-graphs:post-build] Pushing /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7 (24.51 MiB)
  2122. 1275.29 s [algebraic-graphs:post-build]
  2123. 1275.29 s [algebraic-graphs:post-build] All done.
  2124. 1275.31 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
  2125. 1275.36 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2126. 1275.37 s [algebraic-graphs:post-build] copying 2 paths...
  2127. 1275.37 s [algebraic-graphs:post-build] copying path '/nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  2128. 1277.46 s [algebraic-graphs:post-build] copying path '/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  2129. 1285.45 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2130. 1285.73 s [algebraic-graphs:post-build] copying 1 paths...
  2131. 1285.77 s [algebraic-graphs:post-build] copying path '/nix/store/95fb9gb6crg1i0pfri43y25jsra3fcj4-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  2132. 1286.40 s Progress: 41 of 46 built
  2133. 1286.44 s Building /nix/store/vd1nbpw17vdqfdymk5kgg64cavs7xqx8-algebraic-graph-duoids-0.0.1.0.drv
  2134. 1286.59 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  2135. 1286.60 s [algebraic-graph-duoids] Build with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
  2136. 1286.80 s [algebraic-graph-duoids] Phase: unpackPhase
  2137. 1286.81 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  2138. 1286.82 s [algebraic-graph-duoids] source root is algebraic-graphs
  2139. 1286.83 s [algebraic-graph-duoids] Phase: patchPhase
  2140. 1286.83 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  2141. 1286.84 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.dyirN2rqFf/setup-package.conf.d -threaded
  2142. 1286.89 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.dyirN2rqFf/Main.o )
  2143. 1286.94 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  2144. 1288.35 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  2145. 1288.36 s [algebraic-graph-duoids] Phase: configurePhase
  2146. 1288.36 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.dyirN2rqFf/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
  2147. 1288.37 s [algebraic-graph-duoids] Using Parsec parser
  2148. 1288.37 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  2149. 1288.67 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  2150. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  2151. 1288.89 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2152. 1288.89 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.0.0
  2153. 1288.89 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2154. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2155. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  2156. 1288.89 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2157. 1288.89 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.0.0
  2158. 1288.89 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  2159. 1288.89 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2160. 1288.89 s [algebraic-graph-duoids] hedgehog-1.5
  2161. 1288.89 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2162. 1288.89 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2163. 1288.89 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.0.0
  2164. 1288.89 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2165. 1288.89 s [algebraic-graph-duoids] <0.25: using doctest-0.22.6
  2166. 1288.89 s [algebraic-graph-duoids] Source component graph:
  2167. 1288.89 s [algebraic-graph-duoids] component lib
  2168. 1288.89 s [algebraic-graph-duoids] component test:doctests dependency lib
  2169. 1288.89 s [algebraic-graph-duoids] component test:laws dependency lib
  2170. 1288.89 s [algebraic-graph-duoids] Configured component graph:
  2171. 1288.89 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2172. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  2173. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  2174. 1288.89 s [algebraic-graph-duoids] include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  2175. 1288.89 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
  2176. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2177. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  2178. 1288.89 s [algebraic-graph-duoids] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  2179. 1288.89 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
  2180. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2181. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  2182. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  2183. 1288.89 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  2184. 1288.89 s [algebraic-graph-duoids] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  2185. 1288.89 s [algebraic-graph-duoids] Linked component graph:
  2186. 1288.89 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2187. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  2188. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  2189. 1288.89 s [algebraic-graph-duoids] include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  2190. 1288.89 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev:Algebra.Graph.Duoid.Orphans
  2191. 1288.89 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
  2192. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2193. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  2194. 1288.89 s [algebraic-graph-duoids] include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  2195. 1288.89 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
  2196. 1288.89 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2197. 1288.89 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  2198. 1288.89 s [algebraic-graph-duoids] include base-4.19.0.0-b960
  2199. 1288.89 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  2200. 1288.89 s [algebraic-graph-duoids] include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  2201. 1288.89 s [algebraic-graph-duoids] Ready component graph:
  2202. 1288.89 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2203. 1288.89 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  2204. 1288.89 s [algebraic-graph-duoids] depends base-4.19.0.0-b960
  2205. 1288.89 s [algebraic-graph-duoids] depends duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
  2206. 1288.89 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
  2207. 1288.89 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2208. 1288.89 s [algebraic-graph-duoids] depends base-4.19.0.0-b960
  2209. 1288.89 s [algebraic-graph-duoids] depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
  2210. 1288.89 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
  2211. 1288.89 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2212. 1288.89 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
  2213. 1288.89 s [algebraic-graph-duoids] depends base-4.19.0.0-b960
  2214. 1288.89 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
  2215. 1288.89 s [algebraic-graph-duoids] depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
  2216. 1288.89 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.8
  2217. 1288.89 s [algebraic-graph-duoids] Using compiler: ghc-9.8.1
  2218. 1288.89 s [algebraic-graph-duoids] Using install prefix:
  2219. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
  2220. 1288.89 s [algebraic-graph-duoids] Executables installed in:
  2221. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/bin
  2222. 1288.89 s [algebraic-graph-duoids] Libraries installed in:
  2223. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2224. 1288.89 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  2225. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
  2226. 1288.89 s [algebraic-graph-duoids] Private executables installed in:
  2227. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0
  2228. 1288.89 s [algebraic-graph-duoids] Data files installed in:
  2229. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0
  2230. 1288.89 s [algebraic-graph-duoids] Documentation installed in:
  2231. 1288.89 s [algebraic-graph-duoids] /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  2232. 1288.89 s [algebraic-graph-duoids] Configuration files installed in:
  2233. 1288.89 s [algebraic-graph-duoids] /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/etc
  2234. 1288.89 s [algebraic-graph-duoids] No alex found
  2235. 1288.89 s [algebraic-graph-duoids] Using ar found on system at:
  2236. 1288.89 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  2237. 1288.89 s [algebraic-graph-duoids] No c2hs found
  2238. 1288.89 s [algebraic-graph-duoids] No cpphs found
  2239. 1288.89 s [algebraic-graph-duoids] Using doctest version 0.22.6 found on system at:
  2240. 1288.89 s [algebraic-graph-duoids] /nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
  2241. 1288.89 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  2242. 1288.89 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  2243. 1288.89 s [algebraic-graph-duoids] Using ghc version 9.8.1 found on system at:
  2244. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
  2245. 1288.89 s [algebraic-graph-duoids] Using ghc-pkg version 9.8.1 found on system at:
  2246. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
  2247. 1288.89 s [algebraic-graph-duoids] No ghcjs found
  2248. 1288.89 s [algebraic-graph-duoids] No ghcjs-pkg found
  2249. 1288.89 s [algebraic-graph-duoids] No greencard found
  2250. 1288.89 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  2251. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
  2252. 1288.89 s [algebraic-graph-duoids] No happy found
  2253. 1288.89 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  2254. 1288.89 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2255. 1288.89 s [algebraic-graph-duoids] No hmake found
  2256. 1288.89 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  2257. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
  2258. 1288.89 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  2259. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
  2260. 1288.89 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  2261. 1288.89 s [algebraic-graph-duoids] /nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
  2262. 1288.89 s [algebraic-graph-duoids] No jhc found
  2263. 1288.89 s [algebraic-graph-duoids] Using ld found on system at:
  2264. 1288.89 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  2265. 1288.89 s [algebraic-graph-duoids] No pkg-config found
  2266. 1288.89 s [algebraic-graph-duoids] Using runghc version 9.8.1 found on system at:
  2267. 1288.89 s [algebraic-graph-duoids] /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
  2268. 1288.89 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  2269. 1288.89 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  2270. 1288.89 s [algebraic-graph-duoids] Using tar found on system at:
  2271. 1288.89 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  2272. 1288.89 s [algebraic-graph-duoids] No uhc found
  2273. 1289.02 s [algebraic-graph-duoids] Phase: buildPhase
  2274. 1289.36 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2275. 1289.36 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  2276. 1289.42 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  2277. 1289.52 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  2278. 1290.46 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  2279. 1290.62 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  2280. 1292.55 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2281. 1292.55 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2282. 1292.64 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2283. 1292.97 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2284. 1293.31 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  2285. 1296.97 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2286. 1296.97 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2287. 1297.02 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  2288. 1297.36 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  2289. 1298.30 s [algebraic-graph-duoids] Phase: checkPhase
  2290. 1298.56 s [algebraic-graph-duoids] Running 2 test suites...
  2291. 1298.56 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  2292. 1298.96 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2293. 1298.99 s [algebraic-graph-duoids] Test suite doctests: PASS
  2294. 1298.99 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  2295. 1298.99 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  2296. 1298.99 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  2297. 1299.00 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  2298. 1299.01 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  2299. 1299.01 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  2300. 1299.01 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  2301. 1299.01 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  2302. 1299.01 s [algebraic-graph-duoids] ✓ 5 succeeded.
  2303. 1299.01 s [algebraic-graph-duoids] Test suite laws: PASS
  2304. 1299.01 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  2305. 1299.01 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  2306. 1299.02 s [algebraic-graph-duoids] Phase: haddockPhase
  2307. 1299.14 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2308. 1299.14 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  2309. 1299.26 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  2310. 1299.28 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  2311. 1299.40 s [algebraic-graph-duoids] Haddock coverage:
  2312. 1299.40 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  2313. 1299.40 s [algebraic-graph-duoids] Missing documentation for:
  2314. 1299.40 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:24)
  2315. 1299.40 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27)
  2316. 1299.40 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:30)
  2317. 1299.40 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:33)
  2318. 1299.40 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  2319. 1301.81 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  2320. 1301.81 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  2321. 1301.87 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2322. 1301.87 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2323. 1301.87 s [algebraic-graph-duoids] Phase: installPhase
  2324. 1301.94 s [algebraic-graph-duoids] Installing library in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
  2325. 1302.14 s [algebraic-graph-duoids] Phase: fixupPhase
  2326. 1302.16 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
  2327. 1302.16 s [algebraic-graph-duoids] shrinking /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSalgebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev-ghc9.8.1.so
  2328. 1302.17 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0...
  2329. 1302.17 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
  2330. 1302.18 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib
  2331. 1302.22 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  2332. 1302.22 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc...
  2333. 1302.23 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  2334. 1302.34 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  2335. 1302.81 s [algebraic-graph-duoids:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  2336. 1302.81 s [algebraic-graph-duoids:post-build]
  2337. 1303.17 s [algebraic-graph-duoids:post-build] Pushing /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 (1.17 MiB)
  2338. 1303.25 s [algebraic-graph-duoids:post-build] Pushing /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc (523.23 KiB)
  2339. 1304.35 s [algebraic-graph-duoids:post-build]
  2340. 1304.35 s [algebraic-graph-duoids:post-build] All done.
  2341. 1304.38 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
  2342. 1304.43 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2343. 1304.45 s [algebraic-graph-duoids:post-build] copying 2 paths...
  2344. 1304.45 s [algebraic-graph-duoids:post-build] copying path '/nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2345. 1304.88 s [algebraic-graph-duoids:post-build] copying path '/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  2346. 1305.44 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2347. 1305.71 s [algebraic-graph-duoids:post-build] copying 1 paths...
  2348. 1305.71 s [algebraic-graph-duoids:post-build] copying path '/nix/store/vd1nbpw17vdqfdymk5kgg64cavs7xqx8-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  2349. 1306.06 s Progress: 42 of 46 built
  2350. 1306.11 s Building /nix/store/azlq3lij05jhzf277wwsgpv2b517ygd8-ghc-9.8.1-with-packages.drv
  2351. 1306.16 s [ghc-9.8.1-with-packages] /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/nix-support:
  2352. 1306.16 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2353. 1306.17 s [ghc-9.8.1-with-packages] /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/nix-support:
  2354. 1306.17 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2355. 1306.17 s [ghc-9.8.1-with-packages] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/nix-support:
  2356. 1306.17 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2357. 1306.18 s [ghc-9.8.1-with-packages] /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/nix-support:
  2358. 1306.18 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2359. 1306.18 s [ghc-9.8.1-with-packages] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/nix-support:
  2360. 1306.18 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2361. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/nix-support:
  2362. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2363. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/b3f8c6alnwzazpxal53mis3355qcpfs6-ansi-terminal-1.1.2/nix-support:
  2364. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2365. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/b3f8c6alnwzazpxal53mis3355qcpfs6-ansi-terminal-1.1.2/nix-support:
  2366. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2367. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/yffb2fyahw5l2b1spp6qzixkkq4qccny-async-2.2.5/nix-support:
  2368. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2369. 1306.19 s [ghc-9.8.1-with-packages] /nix/store/yffb2fyahw5l2b1spp6qzixkkq4qccny-async-2.2.5/nix-support:
  2370. 1306.19 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2371. 1306.20 s [ghc-9.8.1-with-packages] /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/nix-support:
  2372. 1306.20 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2373. 1306.20 s [ghc-9.8.1-with-packages] /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/nix-support:
  2374. 1306.20 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2375. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/nix-support:
  2376. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2377. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/nix-support:
  2378. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2379. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/nix-support:
  2380. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2381. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/nix-support:
  2382. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2383. 1306.21 s [ghc-9.8.1-with-packages] /nix/store/chsh8byjnibabpdjikj6klc0mcfg7h51-mmorph-1.2.0/nix-support:
  2384. 1306.21 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2385. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/chsh8byjnibabpdjikj6klc0mcfg7h51-mmorph-1.2.0/nix-support:
  2386. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2387. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/nix-support:
  2388. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2389. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/nix-support:
  2390. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2391. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/f74gslln4agdd8q1m0yl10f9blclxwa5-pretty-show-1.10/nix-support:
  2392. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2393. 1306.22 s [ghc-9.8.1-with-packages] /nix/store/f74gslln4agdd8q1m0yl10f9blclxwa5-pretty-show-1.10/nix-support:
  2394. 1306.22 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2395. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/hvypiz5gf5afp4rscfw2z76yvnh5a2vy-primitive-0.9.1.0/nix-support:
  2396. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2397. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/hvypiz5gf5afp4rscfw2z76yvnh5a2vy-primitive-0.9.1.0/nix-support:
  2398. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2399. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/zl44xqm0pxy2zbkr4xqgfmb0ijrhmmlh-random-1.2.1.3/nix-support:
  2400. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2401. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/zl44xqm0pxy2zbkr4xqgfmb0ijrhmmlh-random-1.2.1.3/nix-support:
  2402. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2403. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/nix-support:
  2404. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2405. 1306.23 s [ghc-9.8.1-with-packages] /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/nix-support:
  2406. 1306.23 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2407. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/nix-support:
  2408. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2409. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/nix-support:
  2410. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2411. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/nix-support:
  2412. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2413. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/nix-support:
  2414. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2415. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/nix-support:
  2416. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2417. 1306.24 s [ghc-9.8.1-with-packages] /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/nix-support:
  2418. 1306.24 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2419. 1306.25 s [ghc-9.8.1-with-packages] /nix/store/v12w7ab6kncc5ipndqxa6fcrybrszlfx-ansi-terminal-types-1.1/nix-support:
  2420. 1306.25 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2421. 1306.25 s [ghc-9.8.1-with-packages] /nix/store/v12w7ab6kncc5ipndqxa6fcrybrszlfx-ansi-terminal-types-1.1/nix-support:
  2422. 1306.25 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2423. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/xcphpq6p9nzaw7jfppn10cqi7vpg7min-hashable-1.4.7.0/nix-support:
  2424. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2425. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/xcphpq6p9nzaw7jfppn10cqi7vpg7min-hashable-1.4.7.0/nix-support:
  2426. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2427. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/nix-support:
  2428. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2429. 1306.26 s [ghc-9.8.1-with-packages] /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/nix-support:
  2430. 1306.26 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2431. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/b01ixa73fb5yvc1yghs9jc3fsxk1p52q-constraints-0.14.2/nix-support:
  2432. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2433. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/b01ixa73fb5yvc1yghs9jc3fsxk1p52q-constraints-0.14.2/nix-support:
  2434. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2435. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/nix-support:
  2436. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2437. 1306.27 s [ghc-9.8.1-with-packages] /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/nix-support:
  2438. 1306.27 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2439. 1306.28 s [ghc-9.8.1-with-packages] /nix/store/nnn8i7zj6v0jk9yzk9cblqz689wl4r98-transformers-compat-0.7.2/nix-support:
  2440. 1306.28 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2441. 1306.28 s [ghc-9.8.1-with-packages] /nix/store/nnn8i7zj6v0jk9yzk9cblqz689wl4r98-transformers-compat-0.7.2/nix-support:
  2442. 1306.28 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2443. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/f03a08rpf8c4ha3iwv37h6a5aj3pnim5-splitmix-0.1.1/nix-support:
  2444. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2445. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/f03a08rpf8c4ha3iwv37h6a5aj3pnim5-splitmix-0.1.1/nix-support:
  2446. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2447. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/a93x45v7px1mi26b5bdqa6w7kfg0xjqf-unliftio-core-0.2.1.0/nix-support:
  2448. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2449. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/a93x45v7px1mi26b5bdqa6w7kfg0xjqf-unliftio-core-0.2.1.0/nix-support:
  2450. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2451. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/nix-support:
  2452. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2453. 1306.29 s [ghc-9.8.1-with-packages] /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/nix-support:
  2454. 1306.29 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2455. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/1pdz8ayjwx6x3qqn2pbp4g83dzrv1v7a-os-string-2.0.7/nix-support:
  2456. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2457. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/1pdz8ayjwx6x3qqn2pbp4g83dzrv1v7a-os-string-2.0.7/nix-support:
  2458. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2459. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/nyyds8a3nis8rpi8prn83l69mgfhz5sj-tagged-0.8.8/nix-support:
  2460. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2461. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/nyyds8a3nis8rpi8prn83l69mgfhz5sj-tagged-0.8.8/nix-support:
  2462. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2463. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/sg5m2ghn81wwf9af7yq2r5hs50n74r88-boring-0.2.2/nix-support:
  2464. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2465. 1306.30 s [ghc-9.8.1-with-packages] /nix/store/sg5m2ghn81wwf9af7yq2r5hs50n74r88-boring-0.2.2/nix-support:
  2466. 1306.30 s [ghc-9.8.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2467. 1306.94 s [ghc-9.8.1-with-packages] Warning: include-dirs: /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages/lib/ghc-9.8.1/lib/../lib/x86_64-linux-ghc-9.8.1/directory-1.3.8.1-6a8e/include doesn't exist or isn't a directory
  2468. 1308.10 s [ghc-9.8.1-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages
  2469. 1308.86 s [ghc-9.8.1-with-packages:post-build] Pushing 1 paths (140 are already present) using zstd to cache sellout ⏳
  2470. 1308.86 s [ghc-9.8.1-with-packages:post-build]
  2471. 1309.21 s [ghc-9.8.1-with-packages:post-build] Pushing /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages (4.32 MiB)
  2472. 1310.98 s [ghc-9.8.1-with-packages:post-build]
  2473. 1311.06 s [ghc-9.8.1-with-packages:post-build] All done.
  2474. 1311.06 s [ghc-9.8.1-with-packages:post-build] Uploading to the NixCI cache: /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages
  2475. 1311.09 s [ghc-9.8.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2476. 1311.42 s [ghc-9.8.1-with-packages:post-build] copying 1 paths...
  2477. 1311.42 s [ghc-9.8.1-with-packages:post-build] copying path '/nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages' to 'https://cache.nix-ci.com'...
  2478. 1312.91 s [ghc-9.8.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2479. 1313.18 s [ghc-9.8.1-with-packages:post-build] copying 1 paths...
  2480. 1313.18 s [ghc-9.8.1-with-packages:post-build] copying path '/nix/store/azlq3lij05jhzf277wwsgpv2b517ygd8-ghc-9.8.1-with-packages.drv' to 'https://cache.nix-ci.com'...
  2481. 1313.46 s Progress: 43 of 45 built
  2482. 1313.51 s Building /nix/store/h2krq8wfacscrny1i2gxiwk8cdrj957m-all-packages.drv
  2483. 1313.58 s [all-packages] created 3 symlinks in user environment
  2484. 1313.62 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages
  2485. 1314.11 s [all-packages:post-build] Pushing 1 paths (141 are already present) using zstd to cache sellout ⏳
  2486. 1314.11 s [all-packages:post-build]
  2487. 1314.46 s [all-packages:post-build] Pushing /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages (872.00 B)
  2488. 1315.44 s [all-packages:post-build]
  2489. 1315.44 s [all-packages:post-build] All done.
  2490. 1315.46 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages
  2491. 1315.51 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2492. 1315.88 s [all-packages:post-build] copying 1 paths...
  2493. 1315.88 s [all-packages:post-build] copying path '/nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages' to 'https://cache.nix-ci.com'...
  2494. 1316.33 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2495. 1316.63 s [all-packages:post-build] copying 1 paths...
  2496. 1316.63 s [all-packages:post-build] copying path '/nix/store/h2krq8wfacscrny1i2gxiwk8cdrj957m-all-packages.drv' to 'https://cache.nix-ci.com'...
  2497. 1317.01 s Progress: 44 of 45 built
  2498. 1317.01 s Progress: 45 of 45 built
  2499. 1317.01 s /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages
  2500. 1317.09 s Build succeeded.
More Logs Raw Logs

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/73a15951-1e47-4849-92e9-09fc4a310522/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/73a15951-1e47-4849-92e9-09fc4a310522/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/73a15951-1e47-4849-92e9-09fc4a310522/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/73a15951-1e47-4849-92e9-09fc4a310522/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/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/73a15951-1e47-4849-92e9-09fc4a310522/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/73a15951-1e47-4849-92e9-09fc4a310522/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 .