Build #1 for int-like-0.3.1
| Package | int-like-0.3.1 |
|---|
| Install | InstallOk |
|---|---|
| Docs | Ok |
| Tests | NotTried |
| Time submitted | 2025-06-26 15:11:22.314156148 UTC |
|---|---|
| Compiler | ghc-9.8.4 |
| OS | linux |
| Arch | x86_64 |
| Dependencies | algebraic-graphs-0.7, base-4.19.2.0, containers-0.6.8, deepseq-1.5.1.0, hashable-1.5.0.0 |
| Flags | none |
Code Coverage
No Code Coverage was submitted for this report.
Build log
[view raw]
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 os-string-2.0.7...
Preprocessing library for os-string-2.0.7..
Building library for os-string-2.0.7..
[ 1 of 11] Compiling System.OsString.Data.ByteString.Short.Internal ( System/OsString/Data/ByteString/Short/Internal.hs, dist/build/System/OsString/Data/ByteString/Short/Internal.o, dist/build/System/OsString/Data/ByteString/Short/Internal.dyn_o )
[ 2 of 11] Compiling System.OsString.Data.ByteString.Short ( System/OsString/Data/ByteString/Short.hs, dist/build/System/OsString/Data/ByteString/Short.o, dist/build/System/OsString/Data/ByteString/Short.dyn_o )
[ 3 of 11] Compiling System.OsString.Data.ByteString.Short.Word16 ( System/OsString/Data/ByteString/Short/Word16.hs, dist/build/System/OsString/Data/ByteString/Short/Word16.o, dist/build/System/OsString/Data/ByteString/Short/Word16.dyn_o )
[ 4 of 11] Compiling System.OsString.Internal.Exception ( System/OsString/Internal/Exception.hs, dist/build/System/OsString/Internal/Exception.o, dist/build/System/OsString/Internal/Exception.dyn_o )
[ 5 of 11] Compiling System.OsString.Encoding.Internal ( System/OsString/Encoding/Internal.hs, dist/build/System/OsString/Encoding/Internal.o, dist/build/System/OsString/Encoding/Internal.dyn_o )
System/OsString/Encoding/Internal.hs:23:42: warning: [GHC-38856] [-Wunused-imports]
The import of try from module Control.Exception is redundant
|
23 | import Control.Exception (SomeException, try, Exception (displayException), evaluate)
| ^^^
[ 6 of 11] Compiling System.OsString.Encoding ( System/OsString/Encoding.hs, dist/build/System/OsString/Encoding.o, dist/build/System/OsString/Encoding.dyn_o )
[ 7 of 11] Compiling System.OsString.Internal.Types ( System/OsString/Internal/Types.hs, dist/build/System/OsString/Internal/Types.o, dist/build/System/OsString/Internal/Types.dyn_o )
[ 8 of 11] Compiling System.OsString.Posix ( System/OsString/Posix.hs, dist/build/System/OsString/Posix.o, dist/build/System/OsString/Posix.dyn_o )
[ 9 of 11] Compiling System.OsString.Internal ( System/OsString/Internal.hs, dist/build/System/OsString/Internal.o, dist/build/System/OsString/Internal.dyn_o )
[10 of 11] Compiling System.OsString ( System/OsString.hs, dist/build/System/OsString.o, dist/build/System/OsString.dyn_o )
[11 of 11] Compiling System.OsString.Windows ( System/OsString/Windows.hs, dist/build/System/OsString/Windows.o, dist/build/System/OsString/Windows.dyn_o )
Preprocessing library for os-string-2.0.7..
Running Haddock on library for os-string-2.0.7..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 11] Compiling System.OsString.Data.ByteString.Short.Internal ( System/OsString/Data/ByteString/Short/Internal.hs, nothing )
[ 2 of 11] Compiling System.OsString.Data.ByteString.Short ( System/OsString/Data/ByteString/Short.hs, nothing )
[ 3 of 11] Compiling System.OsString.Data.ByteString.Short.Word16 ( System/OsString/Data/ByteString/Short/Word16.hs, nothing )
[ 4 of 11] Compiling System.OsString.Internal.Exception ( System/OsString/Internal/Exception.hs, nothing )
[ 5 of 11] Compiling System.OsString.Encoding.Internal ( System/OsString/Encoding/Internal.hs, nothing )
System/OsString/Encoding/Internal.hs:23:42: warning: [GHC-38856] [-Wunused-imports]
The import of try from module Control.Exception is redundant
|
23 | import Control.Exception (SomeException, try, Exception (displayException), evaluate)
| ^^^
[ 6 of 11] Compiling System.OsString.Encoding ( System/OsString/Encoding.hs, nothing )
[ 7 of 11] Compiling System.OsString.Internal.Types ( System/OsString/Internal/Types.hs, nothing )
[ 8 of 11] Compiling System.OsString.Posix ( System/OsString/Posix.hs, nothing )
[ 9 of 11] Compiling System.OsString.Internal ( System/OsString/Internal.hs, nothing )
[10 of 11] Compiling System.OsString ( System/OsString.hs, nothing )
[11 of 11] Compiling System.OsString.Windows ( System/OsString/Windows.hs, nothing )
Haddock coverage:
Warning: 'ShortByteString' is ambiguous. It is defined
* in Data.ByteString.Short.Internal
* in Data.ByteString.Short.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 in Data.ByteString.Short.Internal
26% ( 11 / 41) in 'System.OsString.Data.ByteString.Short.Internal'
Missing documentation for:
_nul (System/OsString/Data/ByteString/Short/Internal.hs:60)
isSpace (System/OsString/Data/ByteString/Short/Internal.hs:63)
create (System/OsString/Data/ByteString/Short/Internal.hs:70)
asBA (System/OsString/Data/ByteString/Short/Internal.hs:80)
BA (System/OsString/Data/ByteString/Short/Internal.hs:84)
MBA (System/OsString/Data/ByteString/Short/Internal.hs:85)
newPinnedByteArray (System/OsString/Data/ByteString/Short/Internal.hs:89)
newByteArray (System/OsString/Data/ByteString/Short/Internal.hs:94)
copyByteArray (System/OsString/Data/ByteString/Short/Internal.hs:99)
unsafeFreezeByteArray (System/OsString/Data/ByteString/Short/Internal.hs:104)
copyAddrToByteArray (System/OsString/Data/ByteString/Short/Internal.hs:109)
moduleErrorIO (System/OsString/Data/ByteString/Short/Internal.hs:244)
moduleErrorMsg (System/OsString/Data/ByteString/Short/Internal.hs:248)
packWord16 (System/OsString/Data/ByteString/Short/Internal.hs:251)
packLenWord16 (System/OsString/Data/ByteString/Short/Internal.hs:254)
unpackWord16 (System/OsString/Data/ByteString/Short/Internal.hs:265)
packWord16Rev (System/OsString/Data/ByteString/Short/Internal.hs:274)
packLenWord16Rev (System/OsString/Data/ByteString/Short/Internal.hs:277)
indexWord8Array (System/OsString/Data/ByteString/Short/Internal.hs:299)
word16ToLE# (System/OsString/Data/ByteString/Short/Internal.hs:320)
word16FromLE# (System/OsString/Data/ByteString/Short/Internal.hs:322)
setByteArray (System/OsString/Data/ByteString/Short/Internal.hs:325)
copyMutableByteArray (System/OsString/Data/ByteString/Short/Internal.hs:330)
createAndTrim' (System/OsString/Data/ByteString/Short/Internal.hs:356)
createAndTrim'' (System/OsString/Data/ByteString/Short/Internal.hs:372)
findIndexOrLength (System/OsString/Data/ByteString/Short/Internal.hs:397)
assertEven (System/OsString/Data/ByteString/Short/Internal.hs:422)
errorEmptySBS (System/OsString/Data/ByteString/Short/Internal.hs:430)
moduleError (System/OsString/Data/ByteString/Short/Internal.hs:434)
compareByteArraysOff (System/OsString/Data/ByteString/Short/Internal.hs:444)
Warning: 'ShortByteString' is ambiguous. It is defined
* in Data.ByteString.Short.Internal
* in Data.ByteString.Short.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 in Data.ByteString.Short.Internal
96% ( 93 / 96) in 'System.OsString.Data.ByteString.Short'
Missing documentation for:
append
uncons2 (System/OsString/Data/ByteString/Short.hs:184)
concat
Warning: 'ShortByteString' is ambiguous. It is defined
* in Data.ByteString.Short.Internal
* in Data.ByteString.Short.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 in Data.ByteString.Short.Internal
Warning: 'ByteString' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'CString' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
96% ( 92 / 95) in 'System.OsString.Data.ByteString.Short.Word16'
Missing documentation for:
append
concat
breakSubstring (System/OsString/Data/ByteString/Short/Word16.hs:663)
Warning: 'try' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
33% ( 1 / 3) in 'System.OsString.Internal.Exception'
Missing documentation for:
Module header
isAsyncException (System/OsString/Internal/Exception.hs:17)
Warning: 'TextEncoding' is ambiguous. It is defined
* in GHC.IO.Encoding.Types
* in GHC.IO.Encoding.Types
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 GHC.IO.Encoding.Types
27% ( 9 / 33) in 'System.OsString.Encoding.Internal'
Missing documentation for:
Module header
ucs2le (System/OsString/Encoding/Internal.hs:42)
mkUcs2le (System/OsString/Encoding/Internal.hs:45)
ucs2le_DF (System/OsString/Encoding/Internal.hs:50)
ucs2le_EF (System/OsString/Encoding/Internal.hs:60)
ucs2le_decode (System/OsString/Encoding/Internal.hs:71)
ucs2le_encode (System/OsString/Encoding/Internal.hs:96)
mkUTF16le_b (System/OsString/Encoding/Internal.hs:131)
utf16le_b_DF (System/OsString/Encoding/Internal.hs:136)
utf16le_b_EF (System/OsString/Encoding/Internal.hs:146)
utf16le_b_decode (System/OsString/Encoding/Internal.hs:157)
utf16le_b_encode (System/OsString/Encoding/Internal.hs:195)
cWcharsToChars_UCS2 (System/OsString/Encoding/Internal.hs:231)
cWcharsToChars (System/OsString/Encoding/Internal.hs:238)
charsToCWchars (System/OsString/Encoding/Internal.hs:248)
withWindowsString (System/OsString/Encoding/Internal.hs:264)
peekWindowsString (System/OsString/Encoding/Internal.hs:267)
withPosixString (System/OsString/Encoding/Internal.hs:272)
withPosixString' (System/OsString/Encoding/Internal.hs:275)
peekPosixString (System/OsString/Encoding/Internal.hs:278)
peekPosixString' (System/OsString/Encoding/Internal.hs:281)
EncodingException (System/OsString/Encoding/Internal.hs:340)
showEncodingException (System/OsString/Encoding/Internal.hs:348)
wNUL (System/OsString/Encoding/Internal.hs:367)
44% ( 11 / 25) in 'System.OsString.Encoding'
Missing documentation for:
Module header
EncodingException (System/OsString/Encoding/Internal.hs:340)
showEncodingException (System/OsString/Encoding/Internal.hs:348)
ucs2le (System/OsString/Encoding/Internal.hs:42)
mkUcs2le (System/OsString/Encoding/Internal.hs:45)
ucs2le_DF (System/OsString/Encoding/Internal.hs:50)
ucs2le_EF (System/OsString/Encoding/Internal.hs:60)
ucs2le_decode (System/OsString/Encoding/Internal.hs:71)
ucs2le_encode (System/OsString/Encoding/Internal.hs:96)
mkUTF16le_b (System/OsString/Encoding/Internal.hs:131)
utf16le_b_DF (System/OsString/Encoding/Internal.hs:136)
utf16le_b_EF (System/OsString/Encoding/Internal.hs:146)
utf16le_b_decode (System/OsString/Encoding/Internal.hs:157)
utf16le_b_encode (System/OsString/Encoding/Internal.hs:195)
Warning: 'WindowsString' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:60:25
* at System/OsString/Internal/Types.hs:60: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 System/OsString/Internal/Types.hs:60:1
Warning: 'PosixString' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:87:23
* at System/OsString/Internal/Types.hs:87: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 System/OsString/Internal/Types.hs:87:1
Warning: 'ShortByteString' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'PosixChar' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:123:23
* at System/OsString/Internal/Types.hs:123: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 System/OsString/Internal/Types.hs:123:1
Warning: 'WindowsChar' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:117:23
* at System/OsString/Internal/Types.hs:117: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 System/OsString/Internal/Types.hs:117:1
Warning: 'OsChar' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:210:18
* at System/OsString/Internal/Types.hs:210: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 System/OsString/Internal/Types.hs:210:1
Warning: 'OsString' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:161:20
* at System/OsString/Internal/Types.hs:161: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 System/OsString/Internal/Types.hs:161:1
Warning: '(</>)' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
50% ( 9 / 18) in 'System.OsString.Internal.Types'
Missing documentation for:
Module header
unWS (System/OsString/Internal/Types.hs:70)
unPS (System/OsString/Internal/Types.hs:96)
PlatformString (System/OsString/Internal/Types.hs:114)
WindowsChar (System/OsString/Internal/Types.hs:117)
unWW (System/OsString/Internal/Types.hs:131)
PosixChar (System/OsString/Internal/Types.hs:123)
unPW (System/OsString/Internal/Types.hs:139)
PlatformChar (System/OsString/Internal/Types.hs:148)
Warning: 'setFileSystemEncoding' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'getLocaleEncoding' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'PosixString' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:87:23
* at System/OsString/Internal/Types.hs:87: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 System/OsString/Internal/Types.hs:87:1
Warning: 'OsString' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
94% ( 93 / 98) in 'System.OsString.Posix'
Missing documentation for:
Module header
PosixChar (System/OsString/Internal/Types.hs:123)
singleton (System/OsString/Common.hs:495)
empty (System/OsString/Common.hs:498)
concat (System/OsString/Common.hs:706)
Warning: 'setFileSystemEncoding' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'unsafePerformIO' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'getLocaleEncoding' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'OsString' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:161:20
* at System/OsString/Internal/Types.hs:161: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 System/OsString/Internal/Types.hs:161:1
Warning: 'OsChar' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:210:18
* at System/OsString/Internal/Types.hs:210: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 System/OsString/Internal/Types.hs:210:1
Warning: 'head' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:281: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 System/OsString/Internal.hs:281:1
Warning: 'tail' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:265: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 System/OsString/Internal.hs:265:1
Warning: 'init' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:290: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 System/OsString/Internal.hs:290:1
Warning: 'last' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:256: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 System/OsString/Internal.hs:256:1
Warning: 'map' is ambiguous. It is defined
* in GHC.Base
* at System/OsString/Internal.hs:316: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 System/OsString/Internal.hs:316:1
Warning: 'reverse' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:322: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 System/OsString/Internal.hs:322:1
Warning: 'foldl' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.hs:338: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 System/OsString/Internal.hs:338:1
Warning: 'foldl1' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.hs:352: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 System/OsString/Internal.hs:352:1
Warning: 'foldr' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.hs:368: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 System/OsString/Internal.hs:368:1
Warning: 'foldr1' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.hs:382: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 System/OsString/Internal.hs:382:1
Warning: 'all' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.hs:396: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 System/OsString/Internal.hs:396:1
Warning: 'any' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.hs:403: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 System/OsString/Internal.hs:403:1
Warning: 'replicate' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:418: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 System/OsString/Internal.hs:418:1
Warning: 'take' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:460: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 System/OsString/Internal.hs:460:1
Warning: 'length' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.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 System/OsString/Internal.hs:309:1
Warning: 'drop' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:497: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 System/OsString/Internal.hs:497:1
Warning: 'takeWhile' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:491: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 System/OsString/Internal.hs:491:1
Warning: 'dropWhile' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:519: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 System/OsString/Internal.hs:519:1
Warning: 'break' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:548: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 System/OsString/Internal.hs:548:1
Warning: 'span' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:558: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 System/OsString/Internal.hs:558:1
Warning: 'splitAt' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:583: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 System/OsString/Internal.hs:583:1
Warning: 'elem' is ambiguous. It is defined
* in Data.Foldable
* at System/OsString/Internal.hs:686: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 System/OsString/Internal.hs:686:1
Warning: 'filter' is ambiguous. It is defined
* in GHC.List
* at System/OsString/Internal.hs:704: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 System/OsString/Internal.hs:704:1
94% ( 74 / 78) in 'System.OsString.Internal'
Missing documentation for:
Module header
empty (System/OsString/Internal.hs:221)
singleton (System/OsString/Internal.hs:224)
concat (System/OsString/Internal.hs:409)
Warning: 'setFileSystemEncoding' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'unsafePerformIO' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
96% ( 96 / 99) in 'System.OsString'
Missing documentation for:
empty (System/OsString/Internal.hs:221)
singleton (System/OsString/Internal.hs:224)
concat (System/OsString/Internal.hs:409)
Warning: 'unsafeDupablePerformIO' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'WindowsString' is ambiguous. It is defined
* at System/OsString/Internal/Types.hs:60:25
* at System/OsString/Internal/Types.hs:60: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 System/OsString/Internal/Types.hs:60:1
Warning: 'OsString' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
94% ( 93 / 98) in 'System.OsString.Windows'
Missing documentation for:
Module header
WindowsChar (System/OsString/Internal/Types.hs:117)
singleton (System/OsString/Common.hs:495)
empty (System/OsString/Common.hs:498)
concat (System/OsString/Common.hs:706)
Warning: System.OsString.Data.ByteString.Short: could not find link destinations for:
- Data.ByteString.Short.Internal.Rep_ShortByteString
- Data.ByteString.Short.Internal.D:R:ItemShortByteString
Warning: System.OsString.Data.ByteString.Short.Word16: could not find link destinations for:
- Data.ByteString.Short.Internal.Rep_ShortByteString
- Data.ByteString.Short.Internal.D:R:ItemShortByteString
Warning: System.OsString.Internal.Types: could not find link destinations for:
- System.OsString.Internal.Types.Rep_OsChar
- System.OsString.Internal.Types.Rep_OsString
- System.OsString.Internal.Types.Rep_PosixChar
- System.OsString.Internal.Types.Rep_WindowsChar
- System.OsString.Internal.Types.Rep_PosixString
- System.OsString.Internal.Types.Rep_WindowsString
Warning: System.OsString.Posix: could not find link destinations for:
- System.OsString.Internal.Types.Rep_PosixChar
- System.OsString.Internal.Types.Rep_PosixString
Warning: System.OsString: could not find link destinations for:
- System.OsString.Internal.Types.Rep_OsChar
- System.OsString.Internal.Types.Rep_OsString
Warning: System.OsString.Windows: could not find link destinations for:
- System.OsString.Internal.Types.Rep_WindowsChar
- System.OsString.Internal.Types.Rep_WindowsString
Documentation created: dist/doc/html/os-string/,
dist/doc/html/os-string/os-string.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/os-string-2.0.7-5BBZgm2IGGO8ifbVrttmLE
Completed os-string-2.0.7
Configuring hashable-1.5.0.0...
Preprocessing library for hashable-1.5.0.0..
Building library for hashable-1.5.0.0..
[ 1 of 10] Compiling Data.Hashable.FFI ( src/Data/Hashable/FFI.hs, dist/build/Data/Hashable/FFI.o, dist/build/Data/Hashable/FFI.dyn_o )
[ 2 of 10] Compiling Data.Hashable.Imports ( src/Data/Hashable/Imports.hs, dist/build/Data/Hashable/Imports.o, dist/build/Data/Hashable/Imports.dyn_o )
[ 3 of 10] Compiling Data.Hashable.Mix ( src/Data/Hashable/Mix.hs, dist/build/Data/Hashable/Mix.o, dist/build/Data/Hashable/Mix.dyn_o )
[ 4 of 10] Compiling Data.Hashable.XXH3 ( src/Data/Hashable/XXH3.hs, dist/build/Data/Hashable/XXH3.o, dist/build/Data/Hashable/XXH3.dyn_o )
[ 5 of 10] Compiling Data.Hashable.LowLevel ( src/Data/Hashable/LowLevel.hs, dist/build/Data/Hashable/LowLevel.o, dist/build/Data/Hashable/LowLevel.dyn_o )
[ 6 of 10] Compiling Data.Hashable.Class ( src/Data/Hashable/Class.hs, dist/build/Data/Hashable/Class.o, dist/build/Data/Hashable/Class.dyn_o )
[ 7 of 10] Compiling Data.Hashable.Lifted ( src/Data/Hashable/Lifted.hs, dist/build/Data/Hashable/Lifted.o, dist/build/Data/Hashable/Lifted.dyn_o )
[ 8 of 10] Compiling Data.Hashable.Generic.Instances ( src/Data/Hashable/Generic/Instances.hs, dist/build/Data/Hashable/Generic/Instances.o, dist/build/Data/Hashable/Generic/Instances.dyn_o )
src/Data/Hashable/Generic/Instances.hs:5:14: warning: [GHC-19244] [-Wtrustworthy-safe]
Data.Hashable.Generic.Instances is marked as Trustworthy but has been inferred as safe!
|
5 | {-# LANGUAGE Trustworthy #-}
| ^^^^^^^^^^^
[ 9 of 10] Compiling Data.Hashable.Generic ( src/Data/Hashable/Generic.hs, dist/build/Data/Hashable/Generic.o, dist/build/Data/Hashable/Generic.dyn_o )
[10 of 10] Compiling Data.Hashable ( src/Data/Hashable.hs, dist/build/Data/Hashable.o, dist/build/Data/Hashable.dyn_o )
Preprocessing library for hashable-1.5.0.0..
Running Haddock on library for hashable-1.5.0.0..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 10] Compiling Data.Hashable.FFI ( src/Data/Hashable/FFI.hs, nothing )
[ 2 of 10] Compiling Data.Hashable.Imports ( src/Data/Hashable/Imports.hs, nothing )
[ 3 of 10] Compiling Data.Hashable.Mix ( src/Data/Hashable/Mix.hs, nothing )
[ 4 of 10] Compiling Data.Hashable.XXH3 ( src/Data/Hashable/XXH3.hs, nothing )
[ 5 of 10] Compiling Data.Hashable.LowLevel ( src/Data/Hashable/LowLevel.hs, nothing )
[ 6 of 10] Compiling Data.Hashable.Class ( src/Data/Hashable/Class.hs, nothing )
[ 7 of 10] Compiling Data.Hashable.Lifted ( src/Data/Hashable/Lifted.hs, nothing )
[ 8 of 10] Compiling Data.Hashable.Generic.Instances ( src/Data/Hashable/Generic/Instances.hs, nothing )
src/Data/Hashable/Generic/Instances.hs:5:14: warning: [GHC-19244] [-Wtrustworthy-safe]
Data.Hashable.Generic.Instances is marked as Trustworthy but has been inferred as safe!
|
5 | {-# LANGUAGE Trustworthy #-}
| ^^^^^^^^^^^
[ 9 of 10] Compiling Data.Hashable.Generic ( src/Data/Hashable/Generic.hs, nothing )
[10 of 10] Compiling Data.Hashable ( src/Data/Hashable.hs, nothing )
Haddock coverage:
Warning: 'ByteArray' is ambiguous. It is defined
* in Data.Array.Byte
* in Data.Array.Byte
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 Data.Array.Byte
Warning: 'hash' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'defaultHashWith' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'Hashed' is ambiguous. It is defined
* at src/Data/Hashable/Class.hs:860:17
* at src/Data/Hashable/Class.hs:860: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/Hashable/Class.hs:860:1
Warning: 'Arg' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
80% ( 8 / 10) in 'Data.Hashable.Lifted'
Missing documentation for:
Hashable1 (src/Data/Hashable/Class.hs:252)
Hashable2 (src/Data/Hashable/Class.hs:267)
66% ( 6 / 9) in 'Data.Hashable.Generic'
Missing documentation for:
One (src/Data/Hashable/Class.hs:242)
Zero (src/Data/Hashable/Class.hs:241)
HashArgs (src/Data/Hashable/Class.hs:244)
Warning: 'Generic' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 31 / 31) in 'Data.Hashable'
Warning: Data.Hashable.Generic: could not find link destinations for:
- Data.Hashable.Class.D:R:HashArgsOnea0
- Data.Hashable.Class.D:R:HashArgsZeroa0
- Data.Hashable.Generic.Instances.GSum
Warning: Data.Hashable: could not find link destinations for:
- Data.Hashable.Mix.Salt
Documentation created: dist/doc/html/hashable/,
dist/doc/html/hashable/hashable.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/hashable-1.5.0.0-CJcCLhsCpdHlEFddjHE51
Completed hashable-1.5.0.0
Downloading int-like-0.3.1
Downloaded int-like-0.3.1
Configuring int-like-0.3.1...
Preprocessing library for int-like-0.3.1..
Building library for int-like-0.3.1..
[1 of 6] Compiling IntLike.Set ( src/IntLike/Set.hs, dist/build/IntLike/Set.o, dist/build/IntLike/Set.dyn_o )
[2 of 6] Compiling IntLike.Map ( src/IntLike/Map.hs, dist/build/IntLike/Map.o, dist/build/IntLike/Map.dyn_o )
[3 of 6] Compiling IntLike.MultiMap ( src/IntLike/MultiMap.hs, dist/build/IntLike/MultiMap.o, dist/build/IntLike/MultiMap.dyn_o )
[4 of 6] Compiling IntLike.Equiv ( src/IntLike/Equiv.hs, dist/build/IntLike/Equiv.o, dist/build/IntLike/Equiv.dyn_o )
[5 of 6] Compiling IntLike.Graph ( src/IntLike/Graph.hs, dist/build/IntLike/Graph.o, dist/build/IntLike/Graph.dyn_o )
[6 of 6] Compiling Paths_int_like ( dist/build/autogen/Paths_int_like.hs, dist/build/Paths_int_like.o, dist/build/Paths_int_like.dyn_o )
Preprocessing library for int-like-0.3.1..
Running Haddock on library for int-like-0.3.1..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 6] Compiling IntLike.Set ( src/IntLike/Set.hs, /tmp/ghc3872001_0/ghc_18.o, /tmp/ghc3872001_0/ghc_18.dyn_o )
[2 of 6] Compiling IntLike.Map ( src/IntLike/Map.hs, /tmp/ghc3872001_0/ghc_14.o, /tmp/ghc3872001_0/ghc_14.dyn_o )
[3 of 6] Compiling IntLike.MultiMap ( src/IntLike/MultiMap.hs, /tmp/ghc3872001_0/ghc_16.o, /tmp/ghc3872001_0/ghc_16.dyn_o )
[4 of 6] Compiling IntLike.Equiv ( src/IntLike/Equiv.hs, /tmp/ghc3872001_0/ghc_12.o, /tmp/ghc3872001_0/ghc_12.dyn_o )
[5 of 6] Compiling IntLike.Graph ( src/IntLike/Graph.hs, nothing )
[6 of 6] Compiling Paths_int_like ( dist/build/autogen/Paths_int_like.hs, nothing )
Haddock coverage:
22% ( 16 / 72) in 'IntLike.Set'
Missing documentation for:
Module header
IntLikeSet (src/IntLike/Set.hs:130)
empty (src/IntLike/Set.hs:135)
singleton (src/IntLike/Set.hs:139)
fromList (src/IntLike/Set.hs:143)
fromAscList (src/IntLike/Set.hs:152)
fromDistinctAscList (src/IntLike/Set.hs:155)
insert (src/IntLike/Set.hs:158)
delete (src/IntLike/Set.hs:162)
alterF (src/IntLike/Set.hs:174)
member (src/IntLike/Set.hs:178)
notMember (src/IntLike/Set.hs:182)
lookupLT (src/IntLike/Set.hs:186)
lookupGT (src/IntLike/Set.hs:190)
lookupLE (src/IntLike/Set.hs:194)
lookupGE (src/IntLike/Set.hs:198)
null (src/IntLike/Set.hs:202)
size (src/IntLike/Set.hs:206)
isSubsetOf (src/IntLike/Set.hs:210)
isProperSubsetOf (src/IntLike/Set.hs:214)
disjoint (src/IntLike/Set.hs:218)
union (src/IntLike/Set.hs:222)
unions (src/IntLike/Set.hs:231)
difference (src/IntLike/Set.hs:235)
\\ (src/IntLike/Set.hs:239)
intersection (src/IntLike/Set.hs:243)
filter (src/IntLike/Set.hs:263)
partition (src/IntLike/Set.hs:267)
takeWhileAntitone (src/IntLike/Set.hs:271)
dropWhileAntitone (src/IntLike/Set.hs:275)
spanAntitone (src/IntLike/Set.hs:279)
split (src/IntLike/Set.hs:283)
splitMember (src/IntLike/Set.hs:287)
splitRoot (src/IntLike/Set.hs:291)
map (src/IntLike/Set.hs:295)
mapMonotonic (src/IntLike/Set.hs:299)
foldr (src/IntLike/Set.hs:303)
foldl (src/IntLike/Set.hs:307)
foldr' (src/IntLike/Set.hs:317)
foldl' (src/IntLike/Set.hs:321)
fold (src/IntLike/Set.hs:330)
findMin (src/IntLike/Set.hs:346)
findMax (src/IntLike/Set.hs:350)
deleteMin (src/IntLike/Set.hs:354)
deleteMax (src/IntLike/Set.hs:358)
deleteFindMin (src/IntLike/Set.hs:362)
deleteFindMax (src/IntLike/Set.hs:366)
maxView (src/IntLike/Set.hs:370)
minView (src/IntLike/Set.hs:374)
elems (src/IntLike/Set.hs:378)
toList (src/IntLike/Set.hs:382)
toAscList (src/IntLike/Set.hs:386)
toDescList (src/IntLike/Set.hs:390)
insertState (src/IntLike/Set.hs:396)
orderedPairs (src/IntLike/Set.hs:400)
unorderedPairs (src/IntLike/Set.hs:403)
19% ( 28 /143) in 'IntLike.Map'
Missing documentation for:
Module header
IntLikeMap (src/IntLike/Map.hs:201)
empty (src/IntLike/Map.hs:206)
singleton (src/IntLike/Map.hs:210)
fromSet (src/IntLike/Map.hs:214)
fromList (src/IntLike/Map.hs:218)
fromListWith (src/IntLike/Map.hs:222)
fromListWithKey (src/IntLike/Map.hs:226)
fromAscList (src/IntLike/Map.hs:230)
fromAscListWith (src/IntLike/Map.hs:234)
fromAscListWithKey (src/IntLike/Map.hs:238)
fromDistinctAscList (src/IntLike/Map.hs:242)
insert (src/IntLike/Map.hs:246)
insertWith (src/IntLike/Map.hs:250)
insertWithKey (src/IntLike/Map.hs:254)
insertLookupWithKey (src/IntLike/Map.hs:259)
delete (src/IntLike/Map.hs:263)
adjust (src/IntLike/Map.hs:267)
adjustWithKey (src/IntLike/Map.hs:271)
update (src/IntLike/Map.hs:275)
updateWithKey (src/IntLike/Map.hs:279)
updateLookupWithKey (src/IntLike/Map.hs:284)
alter (src/IntLike/Map.hs:288)
alterF (src/IntLike/Map.hs:300)
lookup (src/IntLike/Map.hs:304)
!? (src/IntLike/Map.hs:308)
! (src/IntLike/Map.hs:312)
findWithDefault (src/IntLike/Map.hs:316)
member (src/IntLike/Map.hs:320)
notMember (src/IntLike/Map.hs:324)
lookupLT (src/IntLike/Map.hs:328)
lookupGT (src/IntLike/Map.hs:332)
lookupLE (src/IntLike/Map.hs:336)
lookupGE (src/IntLike/Map.hs:340)
null (src/IntLike/Map.hs:344)
size (src/IntLike/Map.hs:348)
union (src/IntLike/Map.hs:352)
unionWith (src/IntLike/Map.hs:356)
unionWithKey (src/IntLike/Map.hs:361)
unions (src/IntLike/Map.hs:370)
unionsWith (src/IntLike/Map.hs:380)
difference (src/IntLike/Map.hs:384)
\\ (src/IntLike/Map.hs:388)
differenceWith (src/IntLike/Map.hs:393)
differenceWithKey (src/IntLike/Map.hs:398)
intersection (src/IntLike/Map.hs:402)
intersectionWith (src/IntLike/Map.hs:406)
intersectionWithKey (src/IntLike/Map.hs:411)
disjoint (src/IntLike/Map.hs:421)
compose (src/IntLike/Map.hs:425)
mergeWithKey (src/IntLike/Map.hs:437)
map (src/IntLike/Map.hs:441)
mapWithKey (src/IntLike/Map.hs:445)
traverseWithKey (src/IntLike/Map.hs:456)
traverseMaybeWithKey (src/IntLike/Map.hs:467)
mapAccum (src/IntLike/Map.hs:471)
mapAccumWithKey (src/IntLike/Map.hs:476)
mapAccumRWithKey (src/IntLike/Map.hs:481)
mapKeys (src/IntLike/Map.hs:485)
mapKeysWith (src/IntLike/Map.hs:489)
mapKeysMonotonic (src/IntLike/Map.hs:493)
foldr (src/IntLike/Map.hs:497)
foldl (src/IntLike/Map.hs:501)
foldrWithKey (src/IntLike/Map.hs:505)
foldlWithKey (src/IntLike/Map.hs:509)
foldMapWithKey (src/IntLike/Map.hs:513)
foldr' (src/IntLike/Map.hs:517)
foldl' (src/IntLike/Map.hs:521)
foldrWithKey' (src/IntLike/Map.hs:525)
foldlWithKey' (src/IntLike/Map.hs:529)
elems (src/IntLike/Map.hs:533)
keys (src/IntLike/Map.hs:537)
assocs (src/IntLike/Map.hs:541)
keysSet (src/IntLike/Map.hs:545)
toList (src/IntLike/Map.hs:549)
toAscList (src/IntLike/Map.hs:553)
toDescList (src/IntLike/Map.hs:557)
filter (src/IntLike/Map.hs:561)
filterWithKey (src/IntLike/Map.hs:571)
restrictKeys (src/IntLike/Map.hs:575)
withoutKeys (src/IntLike/Map.hs:579)
partition (src/IntLike/Map.hs:583)
partitionWithKey (src/IntLike/Map.hs:588)
takeWhileAntitone (src/IntLike/Map.hs:592)
dropWhileAntitone (src/IntLike/Map.hs:596)
spanAntitone (src/IntLike/Map.hs:600)
mapMaybe (src/IntLike/Map.hs:604)
mapMaybeWithKey (src/IntLike/Map.hs:608)
mapEither (src/IntLike/Map.hs:613)
mapEitherWithKey (src/IntLike/Map.hs:618)
split (src/IntLike/Map.hs:622)
splitLookup (src/IntLike/Map.hs:626)
splitRoot (src/IntLike/Map.hs:630)
isSubmapOf (src/IntLike/Map.hs:634)
isSubmapOfBy (src/IntLike/Map.hs:638)
isProperSubmapOf (src/IntLike/Map.hs:642)
isProperSubmapOfBy (src/IntLike/Map.hs:646)
lookupMin (src/IntLike/Map.hs:650)
lookupMax (src/IntLike/Map.hs:654)
findMin (src/IntLike/Map.hs:658)
findMax (src/IntLike/Map.hs:662)
deleteMin (src/IntLike/Map.hs:666)
deleteMax (src/IntLike/Map.hs:670)
deleteFindMin (src/IntLike/Map.hs:674)
deleteFindMax (src/IntLike/Map.hs:678)
updateMin (src/IntLike/Map.hs:682)
updateMax (src/IntLike/Map.hs:686)
updateMinWithKey (src/IntLike/Map.hs:690)
updateMaxWithKey (src/IntLike/Map.hs:694)
minView (src/IntLike/Map.hs:698)
maxView (src/IntLike/Map.hs:702)
minViewWithKey (src/IntLike/Map.hs:706)
maxViewWithKey (src/IntLike/Map.hs:710)
partialLookup (src/IntLike/Map.hs:716)
insertState (src/IntLike/Map.hs:720)
0% ( 0 / 10) in 'IntLike.MultiMap'
Missing documentation for:
Module header
IntLikeMultiMap (src/IntLike/MultiMap.hs:26)
empty (src/IntLike/MultiMap.hs:29)
size (src/IntLike/MultiMap.hs:33)
toList (src/IntLike/MultiMap.hs:37)
insert (src/IntLike/MultiMap.hs:41)
member (src/IntLike/MultiMap.hs:45)
invertDisjoint (src/IntLike/MultiMap.hs:49)
unsafeInvertDisjoint (src/IntLike/MultiMap.hs:58)
fromInvertedMap (src/IntLike/MultiMap.hs:64)
0% ( 0 / 9) in 'IntLike.Equiv'
Missing documentation for:
Module header
IntLikeEquiv (src/IntLike/Equiv.hs:24)
fwdView
bwdView
empty (src/IntLike/Equiv.hs:32)
insert (src/IntLike/Equiv.hs:36)
partialInsert (src/IntLike/Equiv.hs:42)
member (src/IntLike/Equiv.hs:45)
lookupClass (src/IntLike/Equiv.hs:48)
0% ( 0 / 9) in 'IntLike.Graph'
Missing documentation for:
Module header
IntLikeGraph (src/IntLike/Graph.hs:35)
adjacencyIntMultiMap (src/IntLike/Graph.hs:46)
vertexList (src/IntLike/Graph.hs:50)
fromDirectedEdges (src/IntLike/Graph.hs:54)
fromUndirectedEdges (src/IntLike/Graph.hs:58)
reachable (src/IntLike/Graph.hs:62)
Component (src/IntLike/Graph.hs:65)
undirectedComponents (src/IntLike/Graph.hs:70)
Warning: IntLike.Equiv: could not find link destinations for:
- IntLike.Equiv.Rep_IntLikeEquiv
Warning: IntLike.Graph: could not find link destinations for:
- IntLike.Graph.D:R:VertexIntLikeGraph
Documentation created: dist/doc/html/int-like/,
dist/doc/html/int-like/int-like.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/int-like-0.3.1-KApLc6YzPR54yWAS9J5Zrk
Completed int-like-0.3.1
Test log
[view raw]
Resolving dependencies... No tests to run for all the packages in the project