Resolving dependencies... Downloading algebraic-graphs-0.8 Downloaded algebraic-graphs-0.8 Configuring algebraic-graphs-0.8... Preprocessing library for algebraic-graphs-0.8.. Building library for algebraic-graphs-0.8.. [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o ) [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o ) [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o ) [ 4 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o ) [ 5 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o ) [ 6 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o ) [ 7 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o ) [ 8 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o ) [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o ) [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o ) [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o ) [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o ) [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o ) [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o ) [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o ) [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o ) [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o ) [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o ) [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o ) [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o ) [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o ) [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o ) [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o ) [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o ) [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o ) [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o ) [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o ) [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o ) [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o ) Preprocessing library for algebraic-graphs-0.8.. Running Haddock on library for algebraic-graphs-0.8.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [ 4 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [ 5 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [ 6 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [ 7 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [ 8 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) Haddock coverage: Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/AdjacencyMap.hs:227:1 * in Data.Map.Internal * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap' Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1 * in Data.IntMap.Internal * in Data.IntSet.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap' Warning: 'nub' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'sort' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm' Missing documentation for: Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227) Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1 * in Data.Map.Internal * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1 Warning: 'nub' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'swap' is ambiguous. It is defined * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:412:1 * in Data.Tuple You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:412:1 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap' Warning: 'isRight' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'Matching' is ambiguous. It is defined * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21 * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1 * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm' Warning: 'List' is ambiguous. It is defined * at src/Algebra/Graph/Internal.hs:48:18 * at src/Algebra/Graph/Internal.hs:48:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Internal.hs:48:1 Warning: 'IsList' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 19 / 19) in 'Algebra.Graph.Internal' Warning: 'Context' is ambiguous. It is defined * at src/Algebra/Graph.hs:1400:18 * at src/Algebra/Graph.hs:1400:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph.hs:1400:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph.hs:316:1 * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph.hs:316:1 100% ( 61 / 61) in 'Algebra.Graph' Warning: 'mplus' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'vertexCount' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'hasVertex' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'vertexSet' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'isEmpty' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'edgeList' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'adjacencyList' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'box' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'edgeCount' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class' Warning: 'Optimum' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:449:20 * at src/Algebra/Graph/Label.hs:449:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Label.hs:449:1 Warning: 'Distance' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:240:22 * at src/Algebra/Graph/Label.hs:240:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Label.hs:240:1 Warning: 'Minimum' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:313:21 * at src/Algebra/Graph/Label.hs:313:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Label.hs:313:1 Warning: 'Capacity' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:175:22 * at src/Algebra/Graph/Label.hs:175:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Label.hs:175:1 Warning: 'Count' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:208:19 * at src/Algebra/Graph/Label.hs:208:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Label.hs:208:1 100% ( 39 / 39) in 'Algebra.Graph.Label' Warning: 'AdjacencyMap' is ambiguous. It is defined * at src/Algebra/Graph/AdjacencyMap.hs:157:1 * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1 Warning: 'isEmpty' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'empty' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'vertexList' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'edges' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'adjacencyList' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'stars' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap' Warning: 'nub' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'sort' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'vertex' is ambiguous. It is defined * at src/Algebra/Graph/AdjacencyMap.hs:239:1 * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1 Warning: 'edge' is ambiguous. It is defined * at src/Algebra/Graph/AdjacencyMap.hs:252:1 * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm' Missing documentation for: Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:227) Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1 * at src/Algebra/Graph/AdjacencyMap.hs:227:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1 Warning: 'vertex' is ambiguous. It is defined * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1 * at src/Algebra/Graph/AdjacencyMap.hs:239:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1 Warning: 'vertexCount' is ambiguous. It is defined * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1 * at src/Algebra/Graph/AdjacencyMap.hs:417:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1 Warning: 'edgeCount' is ambiguous. It is defined * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1 * at src/Algebra/Graph/AdjacencyMap.hs:429:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1 Warning: 'vertices' is ambiguous. It is defined * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1 * at src/Algebra/Graph/AdjacencyMap.hs:309:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap' Warning: 'foldg' is ambiguous. It is defined * at src/Algebra/Graph.hs:482:1 * at src/Algebra/Graph/ToGraph.hs:98:5 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5 100% ( 8 / 8) in 'Algebra.Graph.ToGraph' Warning: 'Relation' is ambiguous. It is defined * at src/Algebra/Graph/Relation.hs:155:19 * at src/Algebra/Graph/Relation.hs:155:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation.hs:155:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Relation.hs:241:1 * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation.hs:241:1 Warning: 'AdjacencyMap' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 56 / 56) in 'Algebra.Graph.Relation' Warning: 'vertexCount' is ambiguous. It is defined * at src/Algebra/Graph/Relation.hs:421:1 * at src/Algebra/Graph/Relation/Symmetric.hs:369:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:369:1 Warning: 'edgeCount' is ambiguous. It is defined * at src/Algebra/Graph/Relation.hs:433:1 * at src/Algebra/Graph/Relation/Symmetric.hs:381:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:381:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Relation/Symmetric.hs:185:1 * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:185:1 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric' Warning: 'vertexList' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: '>=>' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty' Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1 * in Data.Map.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1 Warning: 'hasEdge' is ambiguous. It is defined * at src/Algebra/Graph/AdjacencyMap.hs:403:1 * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap' Warning: 'Context' is ambiguous. It is defined * at src/Algebra/Graph/Labelled.hs:674:20 * at src/Algebra/Graph/Labelled.hs:674:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:674:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Labelled.hs:190:1 * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:190:1 Warning: 'Focus' is ambiguous. It is defined * at src/Algebra/Graph/Labelled.hs:641:18 * at src/Algebra/Graph/Labelled.hs:641:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:641:1 100% ( 49 / 49) in 'Algebra.Graph.Labelled' 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network' 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton' Warning: 'Doc' is ambiguous. It is defined * at src/Algebra/Graph/Export.hs:57:17 * at src/Algebra/Graph/Export.hs:57:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1 100% ( 14 / 14) in 'Algebra.Graph.Export' Warning: 'Style' is ambiguous. It is defined * at src/Algebra/Graph/Export/Dot.hs:49:18 * at src/Algebra/Graph/Export/Dot.hs:49:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1 Warning: 'Graph' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot' Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Undirected.hs:253:1 * in Data.Set.Internal You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1 100% ( 50 / 50) in 'Algebra.Graph.Undirected' 100% ( 27 / 27) in 'Algebra.Graph.Class' Warning: 'TransitiveRelation' is ambiguous. It is defined * at src/Algebra/Graph/Relation/Transitive.hs:39:32 * at src/Algebra/Graph/Relation/Transitive.hs:39:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1 Warning: 'Transitive' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive' Warning: 'ReflexiveRelation' is ambiguous. It is defined * at src/Algebra/Graph/Relation/Reflexive.hs:34:31 * at src/Algebra/Graph/Relation/Reflexive.hs:34:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1 Warning: 'Reflexive' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive' Warning: 'PreorderRelation' is ambiguous. It is defined * at src/Algebra/Graph/Relation/Preorder.hs:44:30 * at src/Algebra/Graph/Relation/Preorder.hs:44:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1 Warning: 'Preorder' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder' 16% ( 2 / 12) in 'Algebra.Graph.Example.Todo' Missing documentation for: Module header Todo (src/Algebra/Graph/Example/Todo.hs:21) todo (src/Algebra/Graph/Example/Todo.hs:50) low (src/Algebra/Graph/Example/Todo.hs:31) high (src/Algebra/Graph/Example/Todo.hs:35) ~*~ (src/Algebra/Graph/Example/Todo.hs:43) >*< (src/Algebra/Graph/Example/Todo.hs:47) priority (src/Algebra/Graph/Example/Todo.hs:39) shopping (src/Algebra/Graph/Example/Todo.hs:75) holiday (src/Algebra/Graph/Example/Todo.hs:80) Warning: 'GraphKL' is ambiguous. It is defined * at src/Data/Graph/Typed.hs:40:18 * at src/Data/Graph/Typed.hs:40:1 You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1 Warning: 'array' is out of scope. If you qualify the identifier, haddock can try to link it anyway. 90% ( 10 / 11) in 'Data.Graph.Typed' Missing documentation for: scc (src/Data/Graph/Typed.hs:192) Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for: - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0 - Algebra.Graph.Class.D:R:VertexAdjacencyMap0 Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for: - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for: - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for: - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching Warning: Algebra.Graph.Internal: could not find link destinations for: - Algebra.Graph.Internal.D:R:ItemList Warning: Algebra.Graph: could not find link destinations for: - Algebra.Graph.Rep_Graph - Algebra.Graph.ToGraph.D:R:ToVertexGraph - Algebra.Graph.Class.D:R:VertexGraph1 Warning: Algebra.Graph.Label: could not find link destinations for: - Algebra.Graph.Label.Zero - Algebra.Graph.Label.Symbol - Algebra.Graph.Label.D:R:ItemMinimum - Algebra.Graph.Label.D:R:ItemLabel Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for: - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap Warning: Algebra.Graph.ToGraph: could not find link destinations for: - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0 - Algebra.Graph.ToGraph.D:R:ToVertexGraph - Algebra.Graph.Relation.D:R:ToVertexRelation - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation - Algebra.Graph.NonEmpty.D:R:ToVertexGraph - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap - Algebra.Graph.Labelled.D:R:ToVertexGraph Warning: Algebra.Graph.Relation: could not find link destinations for: - Algebra.Graph.Relation.D:R:ToVertexRelation - Algebra.Graph.Class.D:R:VertexRelation0 Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for: - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation - Algebra.Graph.Class.D:R:VertexRelation Warning: Algebra.Graph.NonEmpty: could not find link destinations for: - Algebra.Graph.NonEmpty.D:R:ToVertexGraph Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for: - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap - Algebra.Graph.Class.D:R:VertexAdjacencyMap Warning: Algebra.Graph.Labelled: could not find link destinations for: - Algebra.Graph.Labelled.D:R:ToVertexGraph - Algebra.Graph.Labelled.Rep_Graph - Algebra.Graph.Class.D:R:VertexGraph Warning: Algebra.Graph.Undirected: could not find link destinations for: - Algebra.Graph.Undirected.Rep_Graph - Algebra.Graph.Class.D:R:VertexGraph0 Warning: Algebra.Graph.Class: could not find link destinations for: - Algebra.Graph.Class.D:R:VertexTuple3 - Algebra.Graph.Class.D:R:VertexTuple2 - Algebra.Graph.Class.D:R:VertexFUN - Algebra.Graph.Class.D:R:VertexMaybe - Algebra.Graph.Class.D:R:VertexUnit - Algebra.Graph.Class.D:R:VertexRelation - Algebra.Graph.Class.D:R:VertexRelation0 - Algebra.Graph.Class.D:R:VertexAdjacencyMap - Algebra.Graph.Class.D:R:VertexGraph - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap - Algebra.Graph.Class.D:R:VertexAdjacencyMap0 - Algebra.Graph.Class.D:R:VertexGraph0 - Algebra.Graph.Class.D:R:VertexGraph1 - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation - Algebra.Graph.Example.Todo.D:R:VertexTodo Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for: - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for: - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for: - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation Warning: Algebra.Graph.Example.Todo: could not find link destinations for: - Algebra.Graph.Example.Todo.D:R:VertexTodo Documentation created: dist/doc/html/algebraic-graphs/, dist/doc/html/algebraic-graphs/algebraic-graphs.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.8-Lkj7u0xtmKaB64xP8hCQNy Completed algebraic-graphs-0.8