Resolving dependencies... Configuring algebraic-graphs-0.7... Preprocessing library for algebraic-graphs-0.7.. Building library for algebraic-graphs-0.7.. [ 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.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o ) [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o ) [ 6 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 ) [ 7 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 ) [ 8 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 ) [ 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 ) src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial] In the use of head (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack | ^^^^ src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial] In the use of tail (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v | ^^^^ src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial] In the use of head (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 395 | p_v = fst $ head bnd | ^^^^ src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial] In the use of tail (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 397 | bnd' = tail bnd | ^^^^ [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 ) src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet | ^ src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet | ^ src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet | ^ src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap | ^ src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap | ^ src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet | ^ src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet | ^ [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 ) src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s | ^ [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 ) src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s | ^ src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s | ^ [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.7.. Running Haddock on library for algebraic-graphs-0.7.. 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.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.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 ) src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial] In the use of head (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack | ^^^^ src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial] In the use of tail (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v | ^^^^ src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial] In the use of head (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 395 | p_v = fst $ head bnd | ^^^^ src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial] In the use of tail (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 397 | bnd' = tail bnd | ^^^^ [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 ) src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet | ^ src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet | ^ src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet | ^ src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap | ^ src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap | ^ src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet | ^ src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet | ^ [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 ) src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s | ^ [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s | ^ src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators] The use of ~ without TypeOperators will become an error in a future GHC release. Suggested fix: Perhaps you intended to use TypeOperators | 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s | ^ [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: 'List' is ambiguous. It is defined * at src/Algebra/Graph/Internal.hs:50:18 * at src/Algebra/Graph/Internal.hs:50: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:50: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: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250: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:250: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:418: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:418: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:250: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:250:1 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm' Warning: 'Optimum' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:442:20 * at src/Algebra/Graph/Label.hs:442: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:442:1 Warning: 'Distance' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:241:22 * at src/Algebra/Graph/Label.hs:241: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:241:1 Warning: 'Minimum' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:314:21 * at src/Algebra/Graph/Label.hs:314: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:314:1 Warning: 'Capacity' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:176:22 * at src/Algebra/Graph/Label.hs:176: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:176:1 Warning: 'Count' is ambiguous. It is defined * at src/Algebra/Graph/Label.hs:209:19 * at src/Algebra/Graph/Label.hs:209: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:209:1 100% ( 37 / 37) 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:228) 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:157:19 * at src/Algebra/Graph/Relation.hs:157: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:157:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Relation.hs:243: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:243: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:423:1 * at src/Algebra/Graph/Relation/Symmetric.hs:372: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:372:1 Warning: 'edgeCount' is ambiguous. It is defined * at src/Algebra/Graph/Relation.hs:435:1 * at src/Algebra/Graph/Relation/Symmetric.hs:384: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:384:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Relation/Symmetric.hs:188: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:188: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. 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:675:20 * at src/Algebra/Graph/Labelled.hs:675: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:675:1 Warning: 'empty' is ambiguous. It is defined * at src/Algebra/Graph/Labelled.hs:191: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:191:1 Warning: 'Focus' is ambiguous. It is defined * at src/Algebra/Graph/Labelled.hs:642:18 * at src/Algebra/Graph/Labelled.hs:642: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:642: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' 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo' Missing documentation for: Module header Todo (src/Algebra/Graph/Example/Todo.hs:13) todo (src/Algebra/Graph/Example/Todo.hs:42) low (src/Algebra/Graph/Example/Todo.hs:23) high (src/Algebra/Graph/Example/Todo.hs:27) ~*~ (src/Algebra/Graph/Example/Todo.hs:35) >*< (src/Algebra/Graph/Example/Todo.hs:39) priority (src/Algebra/Graph/Example/Todo.hs:31) 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.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.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.Label: could not find link destinations for: - 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.7-AFIbDAA3vvTEB4Elc7hshy Completed algebraic-graphs-0.7 Configuring cabal-doctest-1.0.11... Preprocessing library for cabal-doctest-1.0.11.. Building library for cabal-doctest-1.0.11.. [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o ) Preprocessing library for cabal-doctest-1.0.11.. Running Haddock on library for cabal-doctest-1.0.11.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing ) Haddock coverage: Warning: 'UserHooks' is ambiguous. It is defined * in Distribution.Simple.UserHooks * in Distribution.Simple.UserHooks You may be able to disambiguate the identifier by qualifying it or by specifying the type/value namespace explicitly. Defaulting to the one defined in Distribution.Simple.UserHooks 100% ( 6 / 6) in 'Distribution.Extra.Doctest' Documentation created: dist/doc/html/cabal-doctest/, dist/doc/html/cabal-doctest/cabal-doctest.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/cabal-doctest-1.0.11-IvoWRFSTSKhGJZCaZeSFzU Completed cabal-doctest-1.0.11 [1 of 2] Compiling Main ( /tmp/cabal-tmp-2000429/no-recursion-0.3.0.0/dist/setup/setup.hs, /tmp/cabal-tmp-2000429/no-recursion-0.3.0.0/dist/setup/Main.o ) [2 of 2] Linking /tmp/cabal-tmp-2000429/no-recursion-0.3.0.0/dist/setup/setup Configuring no-recursion-0.3.0.0... Preprocessing library for no-recursion-0.3.0.0.. Building library for no-recursion-0.3.0.0.. [1 of 2] Compiling PluginUtils ( src/PluginUtils.hs, dist/build/PluginUtils.o, dist/build/PluginUtils.dyn_o ) [2 of 2] Compiling NoRecursion ( src/NoRecursion.hs, dist/build/NoRecursion.o, dist/build/NoRecursion.dyn_o ) Preprocessing library for no-recursion-0.3.0.0.. Running Haddock on library for no-recursion-0.3.0.0.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [1 of 2] Compiling PluginUtils ( src/PluginUtils.hs, nothing ) [2 of 2] Compiling NoRecursion ( src/NoRecursion.hs, nothing ) Haddock coverage: Warning: 'fst' 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. Warning: 'Opts' is ambiguous. It is defined * at src/NoRecursion.hs:50:13 * at src/NoRecursion.hs:50: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/NoRecursion.hs:50:1 100% ( 2 / 2) in 'NoRecursion' Documentation created: dist/doc/html/no-recursion/, dist/doc/html/no-recursion/no-recursion.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/no-recursion-0.3.0.0-KMOtmp8GBfg7athaeNX5mb Completed no-recursion-0.3.0.0 [1 of 2] Compiling Main ( /tmp/cabal-tmp-2000429/duoids-0.0.1.0/dist/setup/setup.hs, /tmp/cabal-tmp-2000429/duoids-0.0.1.0/dist/setup/Main.o ) [2 of 2] Linking /tmp/cabal-tmp-2000429/duoids-0.0.1.0/dist/setup/setup Configuring duoids-0.0.1.0... Preprocessing library for duoids-0.0.1.0.. Building library for duoids-0.0.1.0.. [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o ) [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o ) [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o ) [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o ) [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o ) [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o ) Preprocessing library for duoids-0.0.1.0.. Running Haddock on library for duoids-0.0.1.0.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing ) [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing ) [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing ) [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing ) [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing ) [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing ) Haddock coverage: Warning: 'cancel' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'Par' is ambiguous. It is defined * at src/Data/Duoid.hs:53:17 * at src/Data/Duoid.hs:53: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/Duoid.hs:53:1 Warning: 'Seq' is ambiguous. It is defined * at src/Data/Duoid.hs:59:17 * at src/Data/Duoid.hs:59: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/Duoid.hs:59:1 100% ( 10 / 10) in 'Data.Duoid' Warning: 'ExceptT' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'Parallel' is ambiguous. It is defined * at src/Control/Duoidal.hs:212:24 * at src/Control/Duoidal.hs:212: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/Control/Duoidal.hs:212:1 Warning: 'Sequential' is ambiguous. It is defined * at src/Control/Duoidal.hs:227:26 * at src/Control/Duoidal.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/Control/Duoidal.hs:227:1 Warning: 'NoDefaultPrelude' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'Validation' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'fail' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'MonadFail' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'Normal' is ambiguous. It is defined * at src/Control/Duoidal.hs:263:1 * at src/Data/Duoid.hs:74: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/Duoid.hs:74:1 48% ( 28 / 58) in 'Control.Duoidal' Missing documentation for: DuoidalIO (src/Control/Duoidal.hs:454) Parallel (src/Control/Duoidal.hs:212) traverse_ (src/Control/Duoidal.hs:379) for (src/Control/Duoidal.hs:385) for_ (src/Control/Duoidal.hs:391) forever (src/Control/Duoidal.hs:411) Sequential (src/Control/Duoidal.hs:227) >> (src/Control/Duoidal.hs:323) >>= (src/Control/Duoidal.hs:434) >=> (src/Control/Duoidal.hs:444) =<< (src/Control/Duoidal.hs:439) <=< (src/Control/Duoidal.hs:449) join (src/Control/Duoidal.hs:431) ap (src/Control/Duoidal.hs:298) return (src/Control/Duoidal.hs:274) liftM2 (src/Control/Duoidal.hs:281) liftM3 (src/Control/Duoidal.hs:288) mapM (src/Control/Duoidal.hs:376) mapM_ (src/Control/Duoidal.hs:382) forM (src/Control/Duoidal.hs:388) forM_ (src/Control/Duoidal.hs:394) sequence (src/Control/Duoidal.hs:401) sequence_ (src/Control/Duoidal.hs:408) forever' (src/Control/Duoidal.hs:414) unless' (src/Control/Duoidal.hs:421) when' (src/Control/Duoidal.hs:428) normalPure (src/Control/Duoidal.hs:458) sequentialBind (src/Control/Duoidal.hs:473) sequentialLiftA2 (src/Control/Duoidal.hs:469) sequentialPure (src/Control/Duoidal.hs:461) 100% ( 2 / 2) in 'Control.Duoidal.Either' 16% ( 2 / 12) in 'Data.Duoid.Laws' Missing documentation for: Law (src/Data/Duoid/Laws.hs:27) Laws (src/Data/Duoid/Laws.hs:49) getLaws (src/Data/Duoid/Laws.hs:57) NormalLaws (src/Data/Duoid/Laws.hs:70) getNormalLaws (src/Data/Duoid/Laws.hs:76) checkLaw (src/Data/Duoid/Laws.hs:30) interchangeLaw (src/Data/Duoid/Laws.hs:33) joinUnitLaw (src/Data/Duoid/Laws.hs:43) splitUnitLaw (src/Data/Duoid/Laws.hs:40) swapUnitLaw (src/Data/Duoid/Laws.hs:46) 50% ( 3 / 6) in 'Control.Duoidal.Laws' Missing documentation for: joinUnit (src/Control/Duoidal/Laws.hs:67) splitUnit (src/Control/Duoidal/Laws.hs:63) swapUnit (src/Control/Duoidal/Laws.hs:74) Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/duoids-0.0.1.0-6LCx9lkQdz0Eo9ZTOAOonT Completed duoids-0.0.1.0 Downloading algebraic-graph-duoids-0.0.1.0 Downloaded algebraic-graph-duoids-0.0.1.0 [1 of 2] Compiling Main ( /tmp/cabal-tmp-2000429/algebraic-graph-duoids-0.0.1.0/dist/setup/setup.hs, /tmp/cabal-tmp-2000429/algebraic-graph-duoids-0.0.1.0/dist/setup/Main.o ) [2 of 2] Linking /tmp/cabal-tmp-2000429/algebraic-graph-duoids-0.0.1.0/dist/setup/setup Configuring algebraic-graph-duoids-0.0.1.0... Preprocessing library for algebraic-graph-duoids-0.0.1.0.. Building library for algebraic-graph-duoids-0.0.1.0.. [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 ) [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 ) Preprocessing library for algebraic-graph-duoids-0.0.1.0.. Running Haddock on library for algebraic-graph-duoids-0.0.1.0.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing ) [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing ) Haddock coverage: 20% ( 1 / 5) in 'Algebra.Graph.Duoid' Missing documentation for: parEmptyGraph (src/Algebra/Graph/Duoid.hs:24) seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27) parGraph (src/Algebra/Graph/Duoid.hs:30) seqGraph (src/Algebra/Graph/Duoid.hs:33) 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans' Documentation created: dist/doc/html/algebraic-graph-duoids/, dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/algebraic-graph-duoids-0.0.1.0-TjdW0lRvLqAhBYnJEt5eR Completed algebraic-graph-duoids-0.0.1.0