Build #1 for algebraic-graphs-0.8
| Package | algebraic-graphs-0.8 |
|---|
| Install | InstallOk |
|---|---|
| Docs | Ok |
| Tests | NotTried |
| Time submitted | 2026-01-18 02:17:20.095626258 UTC |
|---|---|
| Compiler | ghc-9.8.4 |
| OS | linux |
| Arch | x86_64 |
| Dependencies | array-0.5.8.0, base-4.19.2.0, containers-0.6.8, deepseq-1.5.1.0, transformers-0.6.1.0 |
| Flags | none |
Code Coverage
No Code Coverage was submitted for this report.
Build log
[view raw]
Resolving dependencies...
Downloading algebraic-graphs-0.8
Downloaded algebraic-graphs-0.8
Configuring algebraic-graphs-0.8...
Preprocessing library for algebraic-graphs-0.8..
Building library for algebraic-graphs-0.8..
[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
[ 4 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
[ 5 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
[ 6 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
[ 7 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
[ 8 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
[19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
[20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
Preprocessing library for algebraic-graphs-0.8..
Running Haddock on library for algebraic-graphs-0.8..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
[ 4 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
[ 5 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
[ 6 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
[ 7 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
[ 8 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
[19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
[20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
Haddock coverage:
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/AdjacencyMap.hs:227:1
* in Data.Map.Internal
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
* in Data.IntMap.Internal
* in Data.IntSet.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
Warning: 'nub' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'sort' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
Missing documentation for:
Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1
* in Data.Map.Internal
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1
Warning: 'nub' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'swap' is ambiguous. It is defined
* at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:412:1
* in Data.Tuple
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:412:1
100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
Warning: 'isRight' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'Matching' is ambiguous. It is defined
* at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
* at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:244:1
100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
Warning: 'List' is ambiguous. It is defined
* at src/Algebra/Graph/Internal.hs:48:18
* at src/Algebra/Graph/Internal.hs:48:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Internal.hs:48:1
Warning: 'IsList' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 19 / 19) in 'Algebra.Graph.Internal'
Warning: 'Context' is ambiguous. It is defined
* at src/Algebra/Graph.hs:1400:18
* at src/Algebra/Graph.hs:1400:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph.hs:316:1
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph.hs:316:1
100% ( 61 / 61) in 'Algebra.Graph'
Warning: 'mplus' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'vertexCount' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'hasVertex' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'vertexSet' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'isEmpty' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'edgeList' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'adjacencyList' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'box' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'edgeCount' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
Warning: 'Optimum' is ambiguous. It is defined
* at src/Algebra/Graph/Label.hs:449:20
* at src/Algebra/Graph/Label.hs:449:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Label.hs:449:1
Warning: 'Distance' is ambiguous. It is defined
* at src/Algebra/Graph/Label.hs:240:22
* at src/Algebra/Graph/Label.hs:240:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Label.hs:240:1
Warning: 'Minimum' is ambiguous. It is defined
* at src/Algebra/Graph/Label.hs:313:21
* at src/Algebra/Graph/Label.hs:313:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Label.hs:313:1
Warning: 'Capacity' is ambiguous. It is defined
* at src/Algebra/Graph/Label.hs:175:22
* at src/Algebra/Graph/Label.hs:175:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Label.hs:175:1
Warning: 'Count' is ambiguous. It is defined
* at src/Algebra/Graph/Label.hs:208:19
* at src/Algebra/Graph/Label.hs:208:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Label.hs:208:1
100% ( 39 / 39) in 'Algebra.Graph.Label'
Warning: 'AdjacencyMap' is ambiguous. It is defined
* at src/Algebra/Graph/AdjacencyMap.hs:157:1
* at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
Warning: 'isEmpty' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'empty' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'vertexList' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'edges' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'adjacencyList' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'stars' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
Warning: 'nub' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'sort' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'vertex' is ambiguous. It is defined
* at src/Algebra/Graph/AdjacencyMap.hs:239:1
* at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
Warning: 'edge' is ambiguous. It is defined
* at src/Algebra/Graph/AdjacencyMap.hs:252:1
* at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
Missing documentation for:
Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:227)
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
* at src/Algebra/Graph/AdjacencyMap.hs:227:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
Warning: 'vertex' is ambiguous. It is defined
* at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
* at src/Algebra/Graph/AdjacencyMap.hs:239:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
Warning: 'vertexCount' is ambiguous. It is defined
* at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
* at src/Algebra/Graph/AdjacencyMap.hs:417:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
Warning: 'edgeCount' is ambiguous. It is defined
* at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
* at src/Algebra/Graph/AdjacencyMap.hs:429:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
Warning: 'vertices' is ambiguous. It is defined
* at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
* at src/Algebra/Graph/AdjacencyMap.hs:309:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
Warning: 'foldg' is ambiguous. It is defined
* at src/Algebra/Graph.hs:482:1
* at src/Algebra/Graph/ToGraph.hs:98:5
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
Warning: 'Relation' is ambiguous. It is defined
* at src/Algebra/Graph/Relation.hs:155:19
* at src/Algebra/Graph/Relation.hs:155:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation.hs:155:1
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Relation.hs:241:1
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation.hs:241:1
Warning: 'AdjacencyMap' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 56 / 56) in 'Algebra.Graph.Relation'
Warning: 'vertexCount' is ambiguous. It is defined
* at src/Algebra/Graph/Relation.hs:421:1
* at src/Algebra/Graph/Relation/Symmetric.hs:369:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:369:1
Warning: 'edgeCount' is ambiguous. It is defined
* at src/Algebra/Graph/Relation.hs:433:1
* at src/Algebra/Graph/Relation/Symmetric.hs:381:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:381:1
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Relation/Symmetric.hs:185:1
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:185:1
100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
Warning: 'vertexList' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: '>=>' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
* in Data.Map.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
Warning: 'hasEdge' is ambiguous. It is defined
* at src/Algebra/Graph/AdjacencyMap.hs:403:1
* at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
Warning: 'Context' is ambiguous. It is defined
* at src/Algebra/Graph/Labelled.hs:674:20
* at src/Algebra/Graph/Labelled.hs:674:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:674:1
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Labelled.hs:190:1
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:190:1
Warning: 'Focus' is ambiguous. It is defined
* at src/Algebra/Graph/Labelled.hs:641:18
* at src/Algebra/Graph/Labelled.hs:641:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:641:1
100% ( 49 / 49) in 'Algebra.Graph.Labelled'
100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
Warning: 'Doc' is ambiguous. It is defined
* at src/Algebra/Graph/Export.hs:57:17
* at src/Algebra/Graph/Export.hs:57:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
100% ( 14 / 14) in 'Algebra.Graph.Export'
Warning: 'Style' is ambiguous. It is defined
* at src/Algebra/Graph/Export/Dot.hs:49:18
* at src/Algebra/Graph/Export/Dot.hs:49:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
Warning: 'Graph' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
Warning: 'empty' is ambiguous. It is defined
* at src/Algebra/Graph/Undirected.hs:253:1
* in Data.Set.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
100% ( 50 / 50) in 'Algebra.Graph.Undirected'
100% ( 27 / 27) in 'Algebra.Graph.Class'
Warning: 'TransitiveRelation' is ambiguous. It is defined
* at src/Algebra/Graph/Relation/Transitive.hs:39:32
* at src/Algebra/Graph/Relation/Transitive.hs:39:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
Warning: 'Transitive' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
Warning: 'ReflexiveRelation' is ambiguous. It is defined
* at src/Algebra/Graph/Relation/Reflexive.hs:34:31
* at src/Algebra/Graph/Relation/Reflexive.hs:34:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
Warning: 'Reflexive' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
Warning: 'PreorderRelation' is ambiguous. It is defined
* at src/Algebra/Graph/Relation/Preorder.hs:44:30
* at src/Algebra/Graph/Relation/Preorder.hs:44:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
Warning: 'Preorder' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
16% ( 2 / 12) in 'Algebra.Graph.Example.Todo'
Missing documentation for:
Module header
Todo (src/Algebra/Graph/Example/Todo.hs:21)
todo (src/Algebra/Graph/Example/Todo.hs:50)
low (src/Algebra/Graph/Example/Todo.hs:31)
high (src/Algebra/Graph/Example/Todo.hs:35)
~*~ (src/Algebra/Graph/Example/Todo.hs:43)
>*< (src/Algebra/Graph/Example/Todo.hs:47)
priority (src/Algebra/Graph/Example/Todo.hs:39)
shopping (src/Algebra/Graph/Example/Todo.hs:75)
holiday (src/Algebra/Graph/Example/Todo.hs:80)
Warning: 'GraphKL' is ambiguous. It is defined
* at src/Data/Graph/Typed.hs:40:18
* at src/Data/Graph/Typed.hs:40:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
Warning: 'array' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
90% ( 10 / 11) in 'Data.Graph.Typed'
Missing documentation for:
scc (src/Data/Graph/Typed.hs:192)
Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
- Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
- Algebra.Graph.Class.D:R:VertexAdjacencyMap0
Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
- Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
- Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
- Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
- Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
- Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
- Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
Warning: Algebra.Graph.Internal: could not find link destinations for:
- Algebra.Graph.Internal.D:R:ItemList
Warning: Algebra.Graph: could not find link destinations for:
- Algebra.Graph.Rep_Graph
- Algebra.Graph.ToGraph.D:R:ToVertexGraph
- Algebra.Graph.Class.D:R:VertexGraph1
Warning: Algebra.Graph.Label: could not find link destinations for:
- Algebra.Graph.Label.Zero
- Algebra.Graph.Label.Symbol
- Algebra.Graph.Label.D:R:ItemMinimum
- Algebra.Graph.Label.D:R:ItemLabel
Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
- Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
Warning: Algebra.Graph.ToGraph: could not find link destinations for:
- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
- Algebra.Graph.ToGraph.D:R:ToVertexGraph
- Algebra.Graph.Relation.D:R:ToVertexRelation
- Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
- Algebra.Graph.NonEmpty.D:R:ToVertexGraph
- Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
- Algebra.Graph.Labelled.D:R:ToVertexGraph
Warning: Algebra.Graph.Relation: could not find link destinations for:
- Algebra.Graph.Relation.D:R:ToVertexRelation
- Algebra.Graph.Class.D:R:VertexRelation0
Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
- Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
- Algebra.Graph.Class.D:R:VertexRelation
Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
- Algebra.Graph.NonEmpty.D:R:ToVertexGraph
Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
- Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
- Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
- Algebra.Graph.Class.D:R:VertexAdjacencyMap
Warning: Algebra.Graph.Labelled: could not find link destinations for:
- Algebra.Graph.Labelled.D:R:ToVertexGraph
- Algebra.Graph.Labelled.Rep_Graph
- Algebra.Graph.Class.D:R:VertexGraph
Warning: Algebra.Graph.Undirected: could not find link destinations for:
- Algebra.Graph.Undirected.Rep_Graph
- Algebra.Graph.Class.D:R:VertexGraph0
Warning: Algebra.Graph.Class: could not find link destinations for:
- Algebra.Graph.Class.D:R:VertexTuple3
- Algebra.Graph.Class.D:R:VertexTuple2
- Algebra.Graph.Class.D:R:VertexFUN
- Algebra.Graph.Class.D:R:VertexMaybe
- Algebra.Graph.Class.D:R:VertexUnit
- Algebra.Graph.Class.D:R:VertexRelation
- Algebra.Graph.Class.D:R:VertexRelation0
- Algebra.Graph.Class.D:R:VertexAdjacencyMap
- Algebra.Graph.Class.D:R:VertexGraph
- Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
- Algebra.Graph.Class.D:R:VertexAdjacencyMap0
- Algebra.Graph.Class.D:R:VertexGraph0
- Algebra.Graph.Class.D:R:VertexGraph1
- Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
- Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
- Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
- Algebra.Graph.Example.Todo.D:R:VertexTodo
Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
- Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
- Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
- Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
- Algebra.Graph.Example.Todo.D:R:VertexTodo
Documentation created: dist/doc/html/algebraic-graphs/,
dist/doc/html/algebraic-graphs/algebraic-graphs.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.8-Lkj7u0xtmKaB64xP8hCQNy
Completed algebraic-graphs-0.8
Test log
[view raw]
Resolving dependencies...
Build profile: -w ghc-9.8.4 -O0
In order, the following will be built (use -v for more details):
- clock-0.8.4 (lib:clock) (requires build)
- inspection-testing-0.6.3 (lib:inspection-testing) (requires build)
- splitmix-0.1.3.2 (lib:splitmix) (requires build)
- extra-1.8.1 (lib:extra) (requires build)
- random-1.3.1 (lib:random) (requires build)
- QuickCheck-2.15.0.1 (lib:QuickCheck) (requires build)
- algebraic-graphs-0.8 (first run)
Configuring clock-0.8.4...
Preprocessing library for clock-0.8.4..
Building library for clock-0.8.4..
[1 of 2] Compiling System.Clock ( dist/build/System/Clock.hs, dist/build/System/Clock.o, dist/build/System/Clock.dyn_o )
[2 of 2] Compiling System.Clock.Seconds ( System/Clock/Seconds.hs, dist/build/System/Clock/Seconds.o, dist/build/System/Clock/Seconds.dyn_o )
Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/clock-0.8.4-50567b232a8e29a643951f1741a5e46e3a9b91c0b9707decae64a8c4bd1cbb2b/lib
Configuring inspection-testing-0.6.3...
Preprocessing library for inspection-testing-0.6.3..
Building library for inspection-testing-0.6.3..
[1 of 3] Compiling Test.Inspection ( src/Test/Inspection.hs, dist/build/Test/Inspection.o, dist/build/Test/Inspection.dyn_o )
[2 of 3] Compiling Test.Inspection.Core ( src/Test/Inspection/Core.hs, dist/build/Test/Inspection/Core.o, dist/build/Test/Inspection/Core.dyn_o )
[3 of 3] Compiling Test.Inspection.Plugin ( src/Test/Inspection/Plugin.hs, dist/build/Test/Inspection/Plugin.o, dist/build/Test/Inspection/Plugin.dyn_o )
Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/inspection-testing-0.6.3-92514d656fc1b832fe73e36afa3f035404337e60be207891f68f4c577735e5b2/lib
Configuring splitmix-0.1.3.2...
Preprocessing library for splitmix-0.1.3.2..
Building library for splitmix-0.1.3.2..
[1 of 3] Compiling System.Random.SplitMix.Init ( src/System/Random/SplitMix/Init.hs, dist/build/System/Random/SplitMix/Init.o, dist/build/System/Random/SplitMix/Init.dyn_o )
[2 of 3] Compiling System.Random.SplitMix ( src/System/Random/SplitMix.hs, dist/build/System/Random/SplitMix.o, dist/build/System/Random/SplitMix.dyn_o )
[3 of 3] Compiling System.Random.SplitMix32 ( src/System/Random/SplitMix32.hs, dist/build/System/Random/SplitMix32.o, dist/build/System/Random/SplitMix32.dyn_o )
Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/splitmix-0.1.3.2-58699aacc13c4e36b3742000d11b8933a456dac329521aa0a8cb8d048d296d12/lib
Configuring extra-1.8.1...
Preprocessing library for extra-1.8.1..
Building library for extra-1.8.1..
[ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.o, dist/build/Data/IORef/Extra.dyn_o )
[ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.o, dist/build/Data/Monoid/Extra.dyn_o )
[ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.o, dist/build/Data/Tuple/Extra.dyn_o )
[ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.o, dist/build/Data/Typeable/Extra.dyn_o )
[ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
[ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
[ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.o, dist/build/Data/List/Extra.dyn_o )
[ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.o, dist/build/Data/Version/Extra.dyn_o )
[ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.o, dist/build/Data/List/NonEmpty/Extra.dyn_o )
[10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.o, dist/build/Data/Either/Extra.dyn_o )
[11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.o, dist/build/Control/Exception/Extra.dyn_o )
[12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.o, dist/build/Control/Monad/Extra.dyn_o )
[13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.o, dist/build/Data/Foldable/Extra.dyn_o )
[14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
[15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.o, dist/build/System/Directory/Extra.dyn_o )
[16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.o, dist/build/System/Environment/Extra.dyn_o )
[17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.o, dist/build/System/IO/Extra.dyn_o )
[18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.o, dist/build/System/Info/Extra.dyn_o )
[19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.o, dist/build/System/Process/Extra.dyn_o )
[20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.o, dist/build/System/Time/Extra.dyn_o )
[21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
[22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.o, dist/build/Text/Read/Extra.dyn_o )
Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/extra-1.8.1-dd6e50270984ba2b8ab12a9a00da1f6c8e31f62ccf78538163f9a6a8bd208e7a/lib
Configuring random-1.3.1...
Preprocessing library for random-1.3.1..
Building library for random-1.3.1..
[1 of 6] Compiling System.Random.Array ( src/System/Random/Array.hs, dist/build/System/Random/Array.o, dist/build/System/Random/Array.dyn_o )
[2 of 6] Compiling System.Random.GFinite ( src/System/Random/GFinite.hs, dist/build/System/Random/GFinite.o, dist/build/System/Random/GFinite.dyn_o )
[3 of 6] Compiling System.Random.Internal ( src/System/Random/Internal.hs, dist/build/System/Random/Internal.o, dist/build/System/Random/Internal.dyn_o )
[4 of 6] Compiling System.Random.Seed ( src/System/Random/Seed.hs, dist/build/System/Random/Seed.o, dist/build/System/Random/Seed.dyn_o )
[5 of 6] Compiling System.Random ( src/System/Random.hs, dist/build/System/Random.o, dist/build/System/Random.dyn_o )
[6 of 6] Compiling System.Random.Stateful ( src/System/Random/Stateful.hs, dist/build/System/Random/Stateful.o, dist/build/System/Random/Stateful.dyn_o )
Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/random-1.3.1-79b1fed16911015b00c8c7a45b14fb4ffea87308faf27dc110c73daa7a9a78c6/lib
Configuring QuickCheck-2.15.0.1...
Preprocessing library for QuickCheck-2.15.0.1..
Building library for QuickCheck-2.15.0.1..
[ 1 of 16] Compiling Test.QuickCheck.Exception ( src/Test/QuickCheck/Exception.hs, dist/build/Test/QuickCheck/Exception.o, dist/build/Test/QuickCheck/Exception.dyn_o )
[ 2 of 16] Compiling Test.QuickCheck.Random ( src/Test/QuickCheck/Random.hs, dist/build/Test/QuickCheck/Random.o, dist/build/Test/QuickCheck/Random.dyn_o )
src/Test/QuickCheck/Random.hs:50:37: warning: [GHC-68441] [-Wdeprecations]
In the use of genShortByteString
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `System.Random.uniformShortByteString`"
|
50 | genShortByteString n = wrapQCGen (genShortByteString n)
| ^^^^^^^^^^^^^^^^^^
src/Test/QuickCheck/Random.hs:83:16: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
83 | left = fst . split
| ^^^^^
src/Test/QuickCheck/Random.hs:84:17: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
84 | right = snd . split
| ^^^^^
[ 3 of 16] Compiling Test.QuickCheck.Gen ( src/Test/QuickCheck/Gen.hs, dist/build/Test/QuickCheck/Gen.o, dist/build/Test/QuickCheck/Gen.dyn_o )
src/Test/QuickCheck/Gen.hs:92:12: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
92 | case split r of
| ^^^^^
[ 4 of 16] Compiling Test.QuickCheck.Gen.Unsafe ( src/Test/QuickCheck/Gen/Unsafe.hs, dist/build/Test/QuickCheck/Gen/Unsafe.o, dist/build/Test/QuickCheck/Gen/Unsafe.dyn_o )
[ 5 of 16] Compiling Test.QuickCheck.Arbitrary ( src/Test/QuickCheck/Arbitrary.hs, dist/build/Test/QuickCheck/Arbitrary.o, dist/build/Test/QuickCheck/Arbitrary.dyn_o )
[ 6 of 16] Compiling Test.QuickCheck.Poly ( src/Test/QuickCheck/Poly.hs, dist/build/Test/QuickCheck/Poly.o, dist/build/Test/QuickCheck/Poly.dyn_o )
[ 7 of 16] Compiling Test.QuickCheck.Modifiers ( src/Test/QuickCheck/Modifiers.hs, dist/build/Test/QuickCheck/Modifiers.o, dist/build/Test/QuickCheck/Modifiers.dyn_o )
[ 8 of 16] Compiling Test.QuickCheck.Function ( src/Test/QuickCheck/Function.hs, dist/build/Test/QuickCheck/Function.o, dist/build/Test/QuickCheck/Function.dyn_o )
[ 9 of 16] Compiling Test.QuickCheck.Text ( src/Test/QuickCheck/Text.hs, dist/build/Test/QuickCheck/Text.o, dist/build/Test/QuickCheck/Text.dyn_o )
[10 of 16] Compiling Test.QuickCheck.State ( src/Test/QuickCheck/State.hs, dist/build/Test/QuickCheck/State.o, dist/build/Test/QuickCheck/State.dyn_o )
[11 of 16] Compiling Test.QuickCheck.Property ( src/Test/QuickCheck/Property.hs, dist/build/Test/QuickCheck/Property.o, dist/build/Test/QuickCheck/Property.dyn_o )
[12 of 16] Compiling Test.QuickCheck.Test ( src/Test/QuickCheck/Test.hs, dist/build/Test/QuickCheck/Test.o, dist/build/Test/QuickCheck/Test.dyn_o )
src/Test/QuickCheck/Test.hs:501:17: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
501 | (rnd1,rnd2) = split (randomSeed st)
| ^^^^^
[13 of 16] Compiling Test.QuickCheck.Monadic ( src/Test/QuickCheck/Monadic.hs, dist/build/Test/QuickCheck/Monadic.o, dist/build/Test/QuickCheck/Monadic.dyn_o )
[14 of 16] Compiling Test.QuickCheck.All ( src/Test/QuickCheck/All.hs, dist/build/Test/QuickCheck/All.o, dist/build/Test/QuickCheck/All.dyn_o )
[15 of 16] Compiling Test.QuickCheck.Features ( src/Test/QuickCheck/Features.hs, dist/build/Test/QuickCheck/Features.o, dist/build/Test/QuickCheck/Features.dyn_o )
[16 of 16] Compiling Test.QuickCheck ( src/Test/QuickCheck.hs, dist/build/Test/QuickCheck.o, dist/build/Test/QuickCheck.dyn_o )
Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/QuickCheck-2.15.0.1-d08e72457aefbddbd89c07c36525d4dd83ca2912f566de09043e650fa635f13d/lib
Configuring algebraic-graphs-0.8...
Preprocessing library for algebraic-graphs-0.8..
Building library for algebraic-graphs-0.8..
[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap.dyn_o )
[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
[ 4 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
[ 5 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
[ 6 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Internal.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Internal.dyn_o )
[ 7 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph.dyn_o )
[ 8 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/HigherKinded/Class.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/HigherKinded/Class.dyn_o )
[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Label.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Label.dyn_o )
[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap/Algorithm.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Acyclic/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/ToGraph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/ToGraph.dyn_o )
[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation.dyn_o )
[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Symmetric.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Symmetric.dyn_o )
[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty.dyn_o )
[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled.dyn_o )
[19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Network.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
[20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Automaton.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export.dyn_o )
[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export/Dot.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export/Dot.dyn_o )
[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Undirected.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Undirected.dyn_o )
[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Class.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Class.dyn_o )
[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Transitive.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Transitive.dyn_o )
[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Reflexive.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Reflexive.dyn_o )
[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Preorder.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Preorder.dyn_o )
[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Example/Todo.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Example/Todo.dyn_o )
[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Data/Graph/Typed.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Data/Graph/Typed.dyn_o )
Preprocessing test suite 'main' for algebraic-graphs-0.8..
Building test suite 'main' for algebraic-graphs-0.8..
[ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
[ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/API.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
[ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
[ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
[ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
[ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
[ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Export.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
[ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Generic.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
[ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
[10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
[11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
[12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Internal.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
[13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Label.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
[14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
[15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
[16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
[17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
[18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
[19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
[20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR failed:
inequal ticks
LHS:
emptyI
= ... hpc<Algebra.Graph.Test.RewriteRules,475>
hpc<Algebra.Graph.Test.RewriteRules,474>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,469> e)
(hpc<Algebra.Graph.Test.RewriteRules,470> ds_d59Gm)
(hpc<Algebra.Graph.Test.RewriteRules,471> ds_d59Gn)
(hpc<Algebra.Graph.Test.RewriteRules,472> ds_d59Go)
((hpc<Algebra.Graph.Test.RewriteRules,473> Algebra.Graph.Empty) @a)
RHS:
emptyIR
= ... hpc<Algebra.Graph.Test.RewriteRules,468>
hpc<Algebra.Graph.Test.RewriteRules,467> e
test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR failed:
inequal ticks
LHS:
vertexI
= ... hpc<Algebra.Graph.Test.RewriteRules,466>
hpc<Algebra.Graph.Test.RewriteRules,465>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,459> ds_d59Gi)
(hpc<Algebra.Graph.Test.RewriteRules,460> v)
(hpc<Algebra.Graph.Test.RewriteRules,461> ds_d59Gj)
(hpc<Algebra.Graph.Test.RewriteRules,462> ds_d59Gk)
(hpc<Algebra.Graph.Test.RewriteRules,464>
Algebra.Graph.Vertex
@a (hpc<Algebra.Graph.Test.RewriteRules,463> x))
RHS:
vertexIR
= ... hpc<Algebra.Graph.Test.RewriteRules,458>
hpc<Algebra.Graph.Test.RewriteRules,457>
v (hpc<Algebra.Graph.Test.RewriteRules,456> x)
test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR failed:
inequal ticks
LHS:
overlayI
= ... hpc<Algebra.Graph.Test.RewriteRules,455>
hpc<Algebra.Graph.Test.RewriteRules,454>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,447> e)
(hpc<Algebra.Graph.Test.RewriteRules,448> v)
(hpc<Algebra.Graph.Test.RewriteRules,449> o)
(hpc<Algebra.Graph.Test.RewriteRules,450> c)
(hpc<Algebra.Graph.Test.RewriteRules,453>
Algebra.Graph.Overlay
@a
(hpc<Algebra.Graph.Test.RewriteRules,451> x)
(hpc<Algebra.Graph.Test.RewriteRules,452> y))
RHS:
overlayIR
= ... hpc<Algebra.Graph.Test.RewriteRules,446>
hpc<Algebra.Graph.Test.RewriteRules,445>
o (hpc<Algebra.Graph.Test.RewriteRules,438>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,433> e)
(hpc<Algebra.Graph.Test.RewriteRules,434> v)
(hpc<Algebra.Graph.Test.RewriteRules,435> o)
(hpc<Algebra.Graph.Test.RewriteRules,436> c)
(hpc<Algebra.Graph.Test.RewriteRules,437> x))
(hpc<Algebra.Graph.Test.RewriteRules,444>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,439> e)
(hpc<Algebra.Graph.Test.RewriteRules,440> v)
(hpc<Algebra.Graph.Test.RewriteRules,441> o)
(hpc<Algebra.Graph.Test.RewriteRules,442> c)
(hpc<Algebra.Graph.Test.RewriteRules,443> y))
test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR failed:
inequal ticks
LHS:
connectI
= ... hpc<Algebra.Graph.Test.RewriteRules,432>
hpc<Algebra.Graph.Test.RewriteRules,431>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,424> e)
(hpc<Algebra.Graph.Test.RewriteRules,425> v)
(hpc<Algebra.Graph.Test.RewriteRules,426> o)
(hpc<Algebra.Graph.Test.RewriteRules,427> c)
(hpc<Algebra.Graph.Test.RewriteRules,430>
Algebra.Graph.Connect
@a
(hpc<Algebra.Graph.Test.RewriteRules,428> x)
(hpc<Algebra.Graph.Test.RewriteRules,429> y))
RHS:
connectIR
= ... hpc<Algebra.Graph.Test.RewriteRules,423>
hpc<Algebra.Graph.Test.RewriteRules,422>
c (hpc<Algebra.Graph.Test.RewriteRules,415>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,410> e)
(hpc<Algebra.Graph.Test.RewriteRules,411> v)
(hpc<Algebra.Graph.Test.RewriteRules,412> o)
(hpc<Algebra.Graph.Test.RewriteRules,413> c)
(hpc<Algebra.Graph.Test.RewriteRules,414> x))
(hpc<Algebra.Graph.Test.RewriteRules,421>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,416> e)
(hpc<Algebra.Graph.Test.RewriteRules,417> v)
(hpc<Algebra.Graph.Test.RewriteRules,418> o)
(hpc<Algebra.Graph.Test.RewriteRules,419> c)
(hpc<Algebra.Graph.Test.RewriteRules,420> y))
test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List failed:
overlaysC :: forall a. Build (Graph a) -> Graph a
[LclIdX,
Arity=1,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=ALWAYS_IF(arity=1,unsat_ok=True,boring_ok=True)}]
overlaysC
= \ (@a) (xs :: Build (Graph a)) ->
hpc<Algebra.Graph.Test.RewriteRules,409>
hpc<Algebra.Graph.Test.RewriteRules,408>
overlays
@a
(hpc<Algebra.Graph.Test.RewriteRules,407>
build @(Graph a) (hpc<Algebra.Graph.Test.RewriteRules,406> xs))
test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR failed:
inequal ticks
LHS:
overlaysP
= ... hpc<Algebra.Graph.Test.RewriteRules,405>
hpc<Algebra.Graph.Test.RewriteRules,404>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,398> e)
(hpc<Algebra.Graph.Test.RewriteRules,399> v)
(hpc<Algebra.Graph.Test.RewriteRules,400> o)
(hpc<Algebra.Graph.Test.RewriteRules,401> c)
(hpc<Algebra.Graph.Test.RewriteRules,403>
overlays @a (hpc<Algebra.Graph.Test.RewriteRules,402> xs))
RHS:
overlaysPR
= ... hpc<Algebra.Graph.Test.RewriteRules,397>
hpc<Algebra.Graph.Test.RewriteRules,396>
fromMaybe
@b
(hpc<Algebra.Graph.Test.RewriteRules,384> e)
(hpc<Algebra.Graph.Test.RewriteRules,395>
foldr
@[]
Data.Foldable.$fFoldableList
@(Graph a)
@(Maybe b)
(hpc<Algebra.Graph.Test.RewriteRules,392>
. @b
@(Maybe b -> Maybe b)
@(Graph a)
(hpc<Algebra.Graph.Test.RewriteRules,386>
maybeF @b @b (hpc<Algebra.Graph.Test.RewriteRules,385> o))
(hpc<Algebra.Graph.Test.RewriteRules,391>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,387> e)
(hpc<Algebra.Graph.Test.RewriteRules,388> v)
(hpc<Algebra.Graph.Test.RewriteRules,389> o)
(hpc<Algebra.Graph.Test.RewriteRules,390> c)))
((hpc<Algebra.Graph.Test.RewriteRules,393> GHC.Maybe.Nothing) @b)
(hpc<Algebra.Graph.Test.RewriteRules,394> xs))
test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List failed:
verticesCP
:: forall b a.
b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
verticesCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,383>
hpc<Algebra.Graph.Test.RewriteRules,382>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,375> e)
(hpc<Algebra.Graph.Test.RewriteRules,376> v)
(hpc<Algebra.Graph.Test.RewriteRules,377> o)
(hpc<Algebra.Graph.Test.RewriteRules,378> c)
(hpc<Algebra.Graph.Test.RewriteRules,381>
vertices
@a
(hpc<Algebra.Graph.Test.RewriteRules,380>
build @a (hpc<Algebra.Graph.Test.RewriteRules,379> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph failed:
verticesCP
:: forall b a.
b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
verticesCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,383>
hpc<Algebra.Graph.Test.RewriteRules,382>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,375> e)
(hpc<Algebra.Graph.Test.RewriteRules,376> v)
(hpc<Algebra.Graph.Test.RewriteRules,377> o)
(hpc<Algebra.Graph.Test.RewriteRules,378> c)
(hpc<Algebra.Graph.Test.RewriteRules,381>
vertices
@a
(hpc<Algebra.Graph.Test.RewriteRules,380>
build @a (hpc<Algebra.Graph.Test.RewriteRules,379> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List failed:
connectsC :: forall a. Build (Graph a) -> Graph a
[LclIdX,
Arity=1,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=ALWAYS_IF(arity=1,unsat_ok=True,boring_ok=True)}]
connectsC
= \ (@a) (xs :: Build (Graph a)) ->
hpc<Algebra.Graph.Test.RewriteRules,374>
hpc<Algebra.Graph.Test.RewriteRules,373>
connects
@a
(hpc<Algebra.Graph.Test.RewriteRules,372>
build @(Graph a) (hpc<Algebra.Graph.Test.RewriteRules,371> xs))
test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR failed:
inequal ticks
LHS:
connectsP
= ... hpc<Algebra.Graph.Test.RewriteRules,370>
hpc<Algebra.Graph.Test.RewriteRules,369>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,363> e)
(hpc<Algebra.Graph.Test.RewriteRules,364> v)
(hpc<Algebra.Graph.Test.RewriteRules,365> o)
(hpc<Algebra.Graph.Test.RewriteRules,366> c)
(hpc<Algebra.Graph.Test.RewriteRules,368>
connects @a (hpc<Algebra.Graph.Test.RewriteRules,367> xs))
RHS:
connectsPR
= ... hpc<Algebra.Graph.Test.RewriteRules,362>
hpc<Algebra.Graph.Test.RewriteRules,361>
fromMaybe
@b
(hpc<Algebra.Graph.Test.RewriteRules,349> e)
(hpc<Algebra.Graph.Test.RewriteRules,360>
foldr
@[]
Data.Foldable.$fFoldableList
@(Graph a)
@(Maybe b)
(hpc<Algebra.Graph.Test.RewriteRules,357>
. @b
@(Maybe b -> Maybe b)
@(Graph a)
(hpc<Algebra.Graph.Test.RewriteRules,351>
maybeF @b @b (hpc<Algebra.Graph.Test.RewriteRules,350> c))
(hpc<Algebra.Graph.Test.RewriteRules,356>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,352> e)
(hpc<Algebra.Graph.Test.RewriteRules,353> v)
(hpc<Algebra.Graph.Test.RewriteRules,354> o)
(hpc<Algebra.Graph.Test.RewriteRules,355> c)))
((hpc<Algebra.Graph.Test.RewriteRules,358> GHC.Maybe.Nothing) @b)
(hpc<Algebra.Graph.Test.RewriteRules,359> xs))
test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph failed:
isSubgraphOfC :: forall a. Ord a => Buildg a -> Buildg a -> Bool
[LclIdX,
Arity=3,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0] 80 0}]
isSubgraphOfC
= \ (@a) ($dOrd_a4Qnl :: Ord a) (x :: Buildg a) (y :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,348>
hpc<Algebra.Graph.Test.RewriteRules,347>
isSubgraphOf
@a
$dOrd_a4Qnl
(hpc<Algebra.Graph.Test.RewriteRules,344>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,343> x))
(hpc<Algebra.Graph.Test.RewriteRules,346>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,345> y))
test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List failed:
cliqueCP
:: forall b a.
b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
cliqueCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,342>
hpc<Algebra.Graph.Test.RewriteRules,341>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,334> e)
(hpc<Algebra.Graph.Test.RewriteRules,335> v)
(hpc<Algebra.Graph.Test.RewriteRules,336> o)
(hpc<Algebra.Graph.Test.RewriteRules,337> c)
(hpc<Algebra.Graph.Test.RewriteRules,340>
clique
@a
(hpc<Algebra.Graph.Test.RewriteRules,339>
build @a (hpc<Algebra.Graph.Test.RewriteRules,338> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph failed:
cliqueCP
:: forall b a.
b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
cliqueCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,342>
hpc<Algebra.Graph.Test.RewriteRules,341>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,334> e)
(hpc<Algebra.Graph.Test.RewriteRules,335> v)
(hpc<Algebra.Graph.Test.RewriteRules,336> o)
(hpc<Algebra.Graph.Test.RewriteRules,337> c)
(hpc<Algebra.Graph.Test.RewriteRules,340>
clique
@a
(hpc<Algebra.Graph.Test.RewriteRules,339>
build @a (hpc<Algebra.Graph.Test.RewriteRules,338> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List failed:
edgesCP
:: forall b a.
b
-> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build (a, a) -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
edgesCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build (a, a)) ->
hpc<Algebra.Graph.Test.RewriteRules,333>
hpc<Algebra.Graph.Test.RewriteRules,332>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,325> e)
(hpc<Algebra.Graph.Test.RewriteRules,326> v)
(hpc<Algebra.Graph.Test.RewriteRules,327> o)
(hpc<Algebra.Graph.Test.RewriteRules,328> c)
(hpc<Algebra.Graph.Test.RewriteRules,331>
edges
@a
(hpc<Algebra.Graph.Test.RewriteRules,330>
build @(a, a) (hpc<Algebra.Graph.Test.RewriteRules,329> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph failed:
edgesCP
:: forall b a.
b
-> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build (a, a) -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
edgesCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build (a, a)) ->
hpc<Algebra.Graph.Test.RewriteRules,333>
hpc<Algebra.Graph.Test.RewriteRules,332>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,325> e)
(hpc<Algebra.Graph.Test.RewriteRules,326> v)
(hpc<Algebra.Graph.Test.RewriteRules,327> o)
(hpc<Algebra.Graph.Test.RewriteRules,328> c)
(hpc<Algebra.Graph.Test.RewriteRules,331>
edges
@a
(hpc<Algebra.Graph.Test.RewriteRules,330>
build @(a, a) (hpc<Algebra.Graph.Test.RewriteRules,329> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List failed:
starCP
:: forall b a.
b
-> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> a -> Build a -> b
[LclIdX,
Arity=6,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}]
starCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(x :: a)
(xs :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,324>
hpc<Algebra.Graph.Test.RewriteRules,323>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,315> e)
(hpc<Algebra.Graph.Test.RewriteRules,316> v)
(hpc<Algebra.Graph.Test.RewriteRules,317> o)
(hpc<Algebra.Graph.Test.RewriteRules,318> c)
(hpc<Algebra.Graph.Test.RewriteRules,322>
star
@a
(hpc<Algebra.Graph.Test.RewriteRules,319> x)
(hpc<Algebra.Graph.Test.RewriteRules,321>
build @a (hpc<Algebra.Graph.Test.RewriteRules,320> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph failed:
starCP
:: forall b a.
b
-> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> a -> Build a -> b
[LclIdX,
Arity=6,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}]
starCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(x :: a)
(xs :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,324>
hpc<Algebra.Graph.Test.RewriteRules,323>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,315> e)
(hpc<Algebra.Graph.Test.RewriteRules,316> v)
(hpc<Algebra.Graph.Test.RewriteRules,317> o)
(hpc<Algebra.Graph.Test.RewriteRules,318> c)
(hpc<Algebra.Graph.Test.RewriteRules,322>
star
@a
(hpc<Algebra.Graph.Test.RewriteRules,319> x)
(hpc<Algebra.Graph.Test.RewriteRules,321>
build @a (hpc<Algebra.Graph.Test.RewriteRules,320> xs)))
test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph failed:
fmapCP
:: forall b a c.
b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> (c -> a)
-> Buildg c
-> b
[LclIdX,
Arity=6,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0] 120 0}]
fmapCP
= \ (@b)
(@a)
(@c)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(f :: c -> a)
(g :: Buildg c) ->
hpc<Algebra.Graph.Test.RewriteRules,314>
hpc<Algebra.Graph.Test.RewriteRules,313>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,305> e)
(hpc<Algebra.Graph.Test.RewriteRules,306> v)
(hpc<Algebra.Graph.Test.RewriteRules,307> o)
(hpc<Algebra.Graph.Test.RewriteRules,308> c)
(hpc<Algebra.Graph.Test.RewriteRules,312>
fmap
@Graph
$fFunctorGraph
@c
@a
(hpc<Algebra.Graph.Test.RewriteRules,309> f)
(hpc<Algebra.Graph.Test.RewriteRules,311>
buildg @c (hpc<Algebra.Graph.Test.RewriteRules,310> g)))
test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR failed:
inequal ticks
LHS:
bindC
= ... hpc<Algebra.Graph.Test.RewriteRules,304>
hpc<Algebra.Graph.Test.RewriteRules,303>
>>=
@Graph
Algebra.Graph.$fMonadGraph
@a
@b
(hpc<Algebra.Graph.Test.RewriteRules,301>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,300> g))
(hpc<Algebra.Graph.Test.RewriteRules,302> f)
RHS:
bindCR
= ... hpc<Algebra.Graph.Test.RewriteRules,299>
hpc<Algebra.Graph.Test.RewriteRules,298>
g @(Graph b)
((hpc<Algebra.Graph.Test.RewriteRules,292> Algebra.Graph.Empty) @b)
(hpc<Algebra.Graph.Test.RewriteRules,295>
\ (x :: a) ->
hpc<Algebra.Graph.Test.RewriteRules,294>
f (hpc<Algebra.Graph.Test.RewriteRules,293> x))
(hpc<Algebra.Graph.Test.RewriteRules,296>
\ (ds_d59G7 :: Graph b) (ds_d59G8 :: Graph b) ->
Algebra.Graph.Overlay @b ds_d59G7 ds_d59G8)
(hpc<Algebra.Graph.Test.RewriteRules,297>
\ (ds_d59G9 :: Graph b) (ds_d59Ga :: Graph b) ->
Algebra.Graph.Connect @b ds_d59G9 ds_d59Ga)
test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR failed:
inequal ticks
LHS:
bindP
= ... hpc<Algebra.Graph.Test.RewriteRules,291>
hpc<Algebra.Graph.Test.RewriteRules,290>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,283> e)
(hpc<Algebra.Graph.Test.RewriteRules,284> v)
(hpc<Algebra.Graph.Test.RewriteRules,285> o)
(hpc<Algebra.Graph.Test.RewriteRules,286> c)
(hpc<Algebra.Graph.Test.RewriteRules,289>
>>=
@Graph
Algebra.Graph.$fMonadGraph
@c
@a
(hpc<Algebra.Graph.Test.RewriteRules,287> g)
(hpc<Algebra.Graph.Test.RewriteRules,288> f))
RHS:
bindPR
= ... hpc<Algebra.Graph.Test.RewriteRules,282>
hpc<Algebra.Graph.Test.RewriteRules,281>
foldg
@b
@c
(hpc<Algebra.Graph.Test.RewriteRules,270> e)
(hpc<Algebra.Graph.Test.RewriteRules,277>
. @(Graph a)
@b
@c
(hpc<Algebra.Graph.Test.RewriteRules,275>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,271> e)
(hpc<Algebra.Graph.Test.RewriteRules,272> v)
(hpc<Algebra.Graph.Test.RewriteRules,273> o)
(hpc<Algebra.Graph.Test.RewriteRules,274> c))
(hpc<Algebra.Graph.Test.RewriteRules,276> f))
(hpc<Algebra.Graph.Test.RewriteRules,278> o)
(hpc<Algebra.Graph.Test.RewriteRules,279> c)
(hpc<Algebra.Graph.Test.RewriteRules,280> g)
test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR failed:
inequal ticks
LHS:
apC
= ... hpc<Algebra.Graph.Test.RewriteRules,269>
hpc<Algebra.Graph.Test.RewriteRules,268>
<*>
@Graph
Algebra.Graph.$fApplicativeGraph
@a
@b
(hpc<Algebra.Graph.Test.RewriteRules,266>
buildg @(a -> b) (hpc<Algebra.Graph.Test.RewriteRules,265> f))
(hpc<Algebra.Graph.Test.RewriteRules,267> x)
RHS:
apCR
= ... hpc<Algebra.Graph.Test.RewriteRules,264>
hpc<Algebra.Graph.Test.RewriteRules,263>
f @(Graph b)
((hpc<Algebra.Graph.Test.RewriteRules,251> Algebra.Graph.Empty) @b)
(hpc<Algebra.Graph.Test.RewriteRules,260>
\ (v :: a -> b) ->
hpc<Algebra.Graph.Test.RewriteRules,259>
foldg
@(Graph b)
@a
((hpc<Algebra.Graph.Test.RewriteRules,252> Algebra.Graph.Empty) @b)
(hpc<Algebra.Graph.Test.RewriteRules,255>
. @b
@(Graph b)
@a
(hpc<Algebra.Graph.Test.RewriteRules,253>
\ (ds_d59FY :: b) -> Algebra.Graph.Vertex @b ds_d59FY)
(hpc<Algebra.Graph.Test.RewriteRules,254> v))
(hpc<Algebra.Graph.Test.RewriteRules,256>
\ (ds_d59FZ :: Graph b) (ds_d59G0 :: Graph b) ->
Algebra.Graph.Overlay @b ds_d59FZ ds_d59G0)
(hpc<Algebra.Graph.Test.RewriteRules,257>
\ (ds_d59G1 :: Graph b) (ds_d59G2 :: Graph b) ->
Algebra.Graph.Connect @b ds_d59G1 ds_d59G2)
(hpc<Algebra.Graph.Test.RewriteRules,258> x))
(hpc<Algebra.Graph.Test.RewriteRules,261>
\ (ds_d59G3 :: Graph b) (ds_d59G4 :: Graph b) ->
Algebra.Graph.Overlay @b ds_d59G3 ds_d59G4)
(hpc<Algebra.Graph.Test.RewriteRules,262>
\ (ds_d59G5 :: Graph b) (ds_d59G6 :: Graph b) ->
Algebra.Graph.Connect @b ds_d59G5 ds_d59G6)
test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR failed:
inequal ticks
LHS:
apP
= ... hpc<Algebra.Graph.Test.RewriteRules,250>
hpc<Algebra.Graph.Test.RewriteRules,249>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,242> e)
(hpc<Algebra.Graph.Test.RewriteRules,243> v)
(hpc<Algebra.Graph.Test.RewriteRules,244> o)
(hpc<Algebra.Graph.Test.RewriteRules,245> c)
(hpc<Algebra.Graph.Test.RewriteRules,248>
<*>
@Graph
Algebra.Graph.$fApplicativeGraph
@c
@a
(hpc<Algebra.Graph.Test.RewriteRules,246> f)
(hpc<Algebra.Graph.Test.RewriteRules,247> x))
RHS:
apPR
= ... hpc<Algebra.Graph.Test.RewriteRules,241>
hpc<Algebra.Graph.Test.RewriteRules,240>
foldg
@b
@(c -> a)
(hpc<Algebra.Graph.Test.RewriteRules,227> e)
(hpc<Algebra.Graph.Test.RewriteRules,236>
\ (w :: c -> a) ->
hpc<Algebra.Graph.Test.RewriteRules,235>
foldg
@b
@c
(hpc<Algebra.Graph.Test.RewriteRules,228> e)
(hpc<Algebra.Graph.Test.RewriteRules,231>
. @a
@b
@c
(hpc<Algebra.Graph.Test.RewriteRules,229> v)
(hpc<Algebra.Graph.Test.RewriteRules,230> w))
(hpc<Algebra.Graph.Test.RewriteRules,232> o)
(hpc<Algebra.Graph.Test.RewriteRules,233> c)
(hpc<Algebra.Graph.Test.RewriteRules,234> x))
(hpc<Algebra.Graph.Test.RewriteRules,237> o)
(hpc<Algebra.Graph.Test.RewriteRules,238> c)
(hpc<Algebra.Graph.Test.RewriteRules,239> f)
test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph failed:
eqC :: forall a. Ord a => Buildg a -> Buildg a -> Bool
[LclIdX,
Arity=1,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0] 130 60}]
eqC
= \ (@a) ($dOrd_a4UYM :: Ord a) ->
let {
$dEq_a4UYP :: Eq (Graph a)
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=True,
Guidance=IF_ARGS [] 20 0}]
$dEq_a4UYP = $fEqGraph @a $dOrd_a4UYM } in
\ (x :: Buildg a) (y :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,226>
hpc<Algebra.Graph.Test.RewriteRules,225>
==
@(Graph a)
$dEq_a4UYP
(hpc<Algebra.Graph.Test.RewriteRules,222>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,221> x))
(hpc<Algebra.Graph.Test.RewriteRules,224>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,223> y))
test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph failed:
ordC :: forall a. Ord a => Buildg a -> Buildg a -> Ordering
[LclIdX,
Arity=1,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0] 130 60}]
ordC
= \ (@a) ($dOrd_a4VJv :: Ord a) ->
let {
$dOrd_a4VJy :: Ord (Graph a)
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=True,
Guidance=IF_ARGS [] 20 0}]
$dOrd_a4VJy = $fOrdGraph @a $dOrd_a4VJv } in
\ (x :: Buildg a) (y :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,216>
hpc<Algebra.Graph.Test.RewriteRules,215>
compare
@(Graph a)
$dOrd_a4VJy
(hpc<Algebra.Graph.Test.RewriteRules,212>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,211> x))
(hpc<Algebra.Graph.Test.RewriteRules,214>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,213> y))
test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph failed:
isEmptyC :: forall a. Buildg a -> Bool
[LclIdX,
Arity=1,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0] 40 0}]
isEmptyC
= \ (@a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,206>
hpc<Algebra.Graph.Test.RewriteRules,205>
isEmpty
@a
(hpc<Algebra.Graph.Test.RewriteRules,204>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,203> g))
test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph failed:
sizeC :: forall a. Buildg a -> Int
[LclIdX,
Arity=1,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0] 40 0}]
sizeC
= \ (@a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,202>
hpc<Algebra.Graph.Test.RewriteRules,201>
size
@a
(hpc<Algebra.Graph.Test.RewriteRules,200>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,199> g))
test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph failed:
vertexSetC :: forall a. Ord a => Buildg a -> Set a
[LclIdX,
Arity=2,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0] 50 0}]
vertexSetC
= \ (@a) ($dOrd_a4XmH :: Ord a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,198>
hpc<Algebra.Graph.Test.RewriteRules,197>
vertexSet
@a
$dOrd_a4XmH
(hpc<Algebra.Graph.Test.RewriteRules,196>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,195> g))
test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph failed:
vertexSetC :: forall a. Ord a => Buildg a -> Set a
[LclIdX,
Arity=2,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0] 50 0}]
vertexSetC
= \ (@a) ($dOrd_a4XmH :: Ord a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,198>
hpc<Algebra.Graph.Test.RewriteRules,197>
vertexSet
@a
$dOrd_a4XmH
(hpc<Algebra.Graph.Test.RewriteRules,196>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,195> g))
test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph failed:
edgeCountC :: forall a. Ord a => Buildg a -> Int
[LclIdX,
Arity=2,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0] 50 0}]
edgeCountC
= \ (@a) ($dOrd_a4Yy1 :: Ord a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,187>
hpc<Algebra.Graph.Test.RewriteRules,186>
edgeCount
@a
$dOrd_a4Yy1
(hpc<Algebra.Graph.Test.RewriteRules,185>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,184> g))
test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph failed:
vertexListCP
:: forall a b. Ord a => (a -> b -> b) -> b -> Buildg a -> b
[LclIdX,
Arity=4,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0] 100 0}]
vertexListCP
= \ (@a)
(@b)
($dOrd_a4Zlm :: Ord a)
(k :: a -> b -> b)
(c :: b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,180>
hpc<Algebra.Graph.Test.RewriteRules,179>
foldr
@[]
$fFoldableList
@a
@b
(hpc<Algebra.Graph.Test.RewriteRules,174> k)
(hpc<Algebra.Graph.Test.RewriteRules,175> c)
(hpc<Algebra.Graph.Test.RewriteRules,178>
vertexList
@a
$dOrd_a4Zlm
(hpc<Algebra.Graph.Test.RewriteRules,177>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,176> g)))
test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List failed:
vertexListCP
:: forall a b. Ord a => (a -> b -> b) -> b -> Buildg a -> b
[LclIdX,
Arity=4,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0] 100 0}]
vertexListCP
= \ (@a)
(@b)
($dOrd_a4Zlm :: Ord a)
(k :: a -> b -> b)
(c :: b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,180>
hpc<Algebra.Graph.Test.RewriteRules,179>
foldr
@[]
$fFoldableList
@a
@b
(hpc<Algebra.Graph.Test.RewriteRules,174> k)
(hpc<Algebra.Graph.Test.RewriteRules,175> c)
(hpc<Algebra.Graph.Test.RewriteRules,178>
vertexList
@a
$dOrd_a4Zlm
(hpc<Algebra.Graph.Test.RewriteRules,177>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,176> g)))
test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph failed:
edgeSetC :: forall a. Ord a => Buildg a -> Set (a, a)
[LclIdX,
Arity=2,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0] 50 0}]
edgeSetC
= \ (@a) ($dOrd_a50tE :: Ord a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,170>
hpc<Algebra.Graph.Test.RewriteRules,169>
edgeSet
@a
$dOrd_a50tE
(hpc<Algebra.Graph.Test.RewriteRules,168>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,167> g))
test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph failed:
edgeListCP
:: forall a b. Ord a => ((a, a) -> b -> b) -> b -> Buildg a -> b
[LclIdX,
Arity=4,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0] 100 0}]
edgeListCP
= \ (@a)
(@b)
($dOrd_a51gz :: Ord a)
(k :: (a, a) -> b -> b)
(c :: b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,163>
hpc<Algebra.Graph.Test.RewriteRules,162>
foldr
@[]
$fFoldableList
@(a, a)
@b
(hpc<Algebra.Graph.Test.RewriteRules,157> k)
(hpc<Algebra.Graph.Test.RewriteRules,158> c)
(hpc<Algebra.Graph.Test.RewriteRules,161>
edgeList
@a
$dOrd_a51gz
(hpc<Algebra.Graph.Test.RewriteRules,160>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,159> g)))
test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List failed:
edgeListCP
:: forall a b. Ord a => ((a, a) -> b -> b) -> b -> Buildg a -> b
[LclIdX,
Arity=4,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0] 100 0}]
edgeListCP
= \ (@a)
(@b)
($dOrd_a51gz :: Ord a)
(k :: (a, a) -> b -> b)
(c :: b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,163>
hpc<Algebra.Graph.Test.RewriteRules,162>
foldr
@[]
$fFoldableList
@(a, a)
@b
(hpc<Algebra.Graph.Test.RewriteRules,157> k)
(hpc<Algebra.Graph.Test.RewriteRules,158> c)
(hpc<Algebra.Graph.Test.RewriteRules,161>
edgeList
@a
$dOrd_a51gz
(hpc<Algebra.Graph.Test.RewriteRules,160>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,159> g)))
test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph failed:
hasVertexC :: forall a. Eq a => a -> Buildg a -> Bool
[LclIdX,
Arity=3,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0] 60 0}]
hasVertexC
= \ (@a) ($dEq_a52rl :: Eq a) (x :: a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,153>
hpc<Algebra.Graph.Test.RewriteRules,152>
hasVertex
@a
$dEq_a52rl
(hpc<Algebra.Graph.Test.RewriteRules,149> x)
(hpc<Algebra.Graph.Test.RewriteRules,151>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,150> g))
test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph failed:
hasEdgeC :: forall a. Eq a => a -> a -> Buildg a -> Bool
[LclIdX,
Arity=4,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0] 70 0}]
hasEdgeC
= \ (@a) ($dEq_a52SA :: Eq a) (x :: a) (y :: a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,148>
hpc<Algebra.Graph.Test.RewriteRules,147>
hasEdge
@a
$dEq_a52SA
(hpc<Algebra.Graph.Test.RewriteRules,143> x)
(hpc<Algebra.Graph.Test.RewriteRules,144> y)
(hpc<Algebra.Graph.Test.RewriteRules,146>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,145> g))
test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph failed:
adjacencyListC :: forall a. Ord a => Buildg a -> [(a, [a])]
[LclIdX,
Arity=2,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0] 50 0}]
adjacencyListC
= \ (@a) ($dOrd_a53hj :: Ord a) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,142>
hpc<Algebra.Graph.Test.RewriteRules,141>
adjacencyList
@a
$dOrd_a53hj
(hpc<Algebra.Graph.Test.RewriteRules,140>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,139> g))
test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph failed:
pathP
:: forall b a.
b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> [a] -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
pathP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: [a]) ->
hpc<Algebra.Graph.Test.RewriteRules,138>
hpc<Algebra.Graph.Test.RewriteRules,137>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,131> e)
(hpc<Algebra.Graph.Test.RewriteRules,132> v)
(hpc<Algebra.Graph.Test.RewriteRules,133> o)
(hpc<Algebra.Graph.Test.RewriteRules,134> c)
(hpc<Algebra.Graph.Test.RewriteRules,136>
path @a (hpc<Algebra.Graph.Test.RewriteRules,135> xs))
test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph failed:
circuitP
:: forall b a.
b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> [a] -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 80 0}]
circuitP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: [a]) ->
hpc<Algebra.Graph.Test.RewriteRules,130>
hpc<Algebra.Graph.Test.RewriteRules,129>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,123> e)
(hpc<Algebra.Graph.Test.RewriteRules,124> v)
(hpc<Algebra.Graph.Test.RewriteRules,125> o)
(hpc<Algebra.Graph.Test.RewriteRules,126> c)
(hpc<Algebra.Graph.Test.RewriteRules,128>
circuit @a (hpc<Algebra.Graph.Test.RewriteRules,127> xs))
test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List failed:
bicliqueCP
:: forall b a.
b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Build a
-> Build a
-> b
[LclIdX,
Arity=6,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}]
bicliqueCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build a)
(ys :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,122>
hpc<Algebra.Graph.Test.RewriteRules,121>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,112> e)
(hpc<Algebra.Graph.Test.RewriteRules,113> v)
(hpc<Algebra.Graph.Test.RewriteRules,114> o)
(hpc<Algebra.Graph.Test.RewriteRules,115> c)
(hpc<Algebra.Graph.Test.RewriteRules,120>
biclique
@a
(hpc<Algebra.Graph.Test.RewriteRules,117>
build @a (hpc<Algebra.Graph.Test.RewriteRules,116> xs))
(hpc<Algebra.Graph.Test.RewriteRules,119>
build @a (hpc<Algebra.Graph.Test.RewriteRules,118> ys)))
test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph failed:
bicliqueCP
:: forall b a.
b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Build a
-> Build a
-> b
[LclIdX,
Arity=6,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}]
bicliqueCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(xs :: Build a)
(ys :: Build a) ->
hpc<Algebra.Graph.Test.RewriteRules,122>
hpc<Algebra.Graph.Test.RewriteRules,121>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,112> e)
(hpc<Algebra.Graph.Test.RewriteRules,113> v)
(hpc<Algebra.Graph.Test.RewriteRules,114> o)
(hpc<Algebra.Graph.Test.RewriteRules,115> c)
(hpc<Algebra.Graph.Test.RewriteRules,120>
biclique
@a
(hpc<Algebra.Graph.Test.RewriteRules,117>
build @a (hpc<Algebra.Graph.Test.RewriteRules,116> xs))
(hpc<Algebra.Graph.Test.RewriteRules,119>
build @a (hpc<Algebra.Graph.Test.RewriteRules,118> ys)))
test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph failed:
replaceVertexCP
:: forall a b.
Eq a =>
a
-> a
-> b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Buildg a
-> b
[LclIdX,
Arity=8,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0 0 0] 130 0}]
replaceVertexCP
= \ (@a)
(@b)
($dEq_a55e4 :: Eq a)
(u :: a)
(v :: a)
(e :: b)
(v' :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,111>
hpc<Algebra.Graph.Test.RewriteRules,110>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,101> e)
(hpc<Algebra.Graph.Test.RewriteRules,102> v')
(hpc<Algebra.Graph.Test.RewriteRules,103> o)
(hpc<Algebra.Graph.Test.RewriteRules,104> c)
(hpc<Algebra.Graph.Test.RewriteRules,109>
replaceVertex
@a
$dEq_a55e4
(hpc<Algebra.Graph.Test.RewriteRules,105> u)
(hpc<Algebra.Graph.Test.RewriteRules,106> v)
(hpc<Algebra.Graph.Test.RewriteRules,108>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,107> g)))
test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph failed:
mergeVerticesCP
:: forall a b.
(a -> Bool)
-> a
-> b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Buildg a
-> b
[LclIdX,
Arity=7,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0 0] 120 0}]
mergeVerticesCP
= \ (@a)
(@b)
(p :: a -> Bool)
(v :: a)
(e :: b)
(v' :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,100>
hpc<Algebra.Graph.Test.RewriteRules,99>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,90> e)
(hpc<Algebra.Graph.Test.RewriteRules,91> v')
(hpc<Algebra.Graph.Test.RewriteRules,92> o)
(hpc<Algebra.Graph.Test.RewriteRules,93> c)
(hpc<Algebra.Graph.Test.RewriteRules,98>
mergeVertices
@a
(hpc<Algebra.Graph.Test.RewriteRules,94> p)
(hpc<Algebra.Graph.Test.RewriteRules,95> v)
(hpc<Algebra.Graph.Test.RewriteRules,97>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,96> g)))
test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List failed:
splitVertexCP
:: forall a b.
Eq a =>
a
-> Build a
-> b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Buildg a
-> b
[LclIdX,
Arity=8,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0 0 0] 130 0}]
splitVertexCP
= \ (@a)
(@b)
($dEq_a563n :: Eq a)
(x :: a)
(us :: Build a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,89>
hpc<Algebra.Graph.Test.RewriteRules,88>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,78> e)
(hpc<Algebra.Graph.Test.RewriteRules,79> v)
(hpc<Algebra.Graph.Test.RewriteRules,80> o)
(hpc<Algebra.Graph.Test.RewriteRules,81> c)
(hpc<Algebra.Graph.Test.RewriteRules,87>
splitVertex
@a
$dEq_a563n
(hpc<Algebra.Graph.Test.RewriteRules,82> x)
(hpc<Algebra.Graph.Test.RewriteRules,84>
build @a (hpc<Algebra.Graph.Test.RewriteRules,83> us))
(hpc<Algebra.Graph.Test.RewriteRules,86>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,85> g)))
test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph failed:
splitVertexCP
:: forall a b.
Eq a =>
a
-> Build a
-> b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Buildg a
-> b
[LclIdX,
Arity=8,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0 0 0] 130 0}]
splitVertexCP
= \ (@a)
(@b)
($dEq_a563n :: Eq a)
(x :: a)
(us :: Build a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,89>
hpc<Algebra.Graph.Test.RewriteRules,88>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,78> e)
(hpc<Algebra.Graph.Test.RewriteRules,79> v)
(hpc<Algebra.Graph.Test.RewriteRules,80> o)
(hpc<Algebra.Graph.Test.RewriteRules,81> c)
(hpc<Algebra.Graph.Test.RewriteRules,87>
splitVertex
@a
$dEq_a563n
(hpc<Algebra.Graph.Test.RewriteRules,82> x)
(hpc<Algebra.Graph.Test.RewriteRules,84>
build @a (hpc<Algebra.Graph.Test.RewriteRules,83> us))
(hpc<Algebra.Graph.Test.RewriteRules,86>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,85> g)))
test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph failed:
transposeCP
:: forall b a.
b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg a -> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 100 0}]
transposeCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,77>
hpc<Algebra.Graph.Test.RewriteRules,76>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,69> e)
(hpc<Algebra.Graph.Test.RewriteRules,70> v)
(hpc<Algebra.Graph.Test.RewriteRules,71> o)
(hpc<Algebra.Graph.Test.RewriteRules,72> c)
(hpc<Algebra.Graph.Test.RewriteRules,75>
transpose
@a
(hpc<Algebra.Graph.Test.RewriteRules,74>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,73> g)))
test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR failed:
inequal terms:
\ (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,39>
hpc<Algebra.Graph.Test.RewriteRules,38>
simplify
@a
$dOrd_a57eB
(hpc<Algebra.Graph.Test.RewriteRules,37>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,36> g))
and
let {
$dEq_a57fn :: Eq (Graph a)
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=True,
Guidance=IF_ARGS [] 20 0}]
$dEq_a57fn = Algebra.Graph.$fEqGraph @a $dOrd_a57fd } in
\ (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,68>
hpc<Algebra.Graph.Test.RewriteRules,67>
g @(Graph a)
((hpc<Algebra.Graph.Test.RewriteRules,61> Algebra.Graph.Empty) @a)
(hpc<Algebra.Graph.Test.RewriteRules,62>
\ (ds_d59Fk :: a) -> Algebra.Graph.Vertex @a ds_d59Fk)
(let {
op :: Graph a -> Graph a -> Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 60}]
op
= hpc<Algebra.Graph.Test.RewriteRules,63>
\ (ds_d59Fl :: Graph a) (ds_d59Fm :: Graph a) ->
Algebra.Graph.Overlay @a ds_d59Fl ds_d59Fm } in
hpc<Algebra.Graph.Test.RewriteRules,64>
\ (x :: Graph a) (y :: Graph a) ->
let {
z :: Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 0}]
z = hpc<Algebra.Graph.Test.RewriteRules,43>
hpc<Algebra.Graph.Test.RewriteRules,42>
op
(hpc<Algebra.Graph.Test.RewriteRules,40> x)
(hpc<Algebra.Graph.Test.RewriteRules,41> y) } in
hpc<Algebra.Graph.Test.RewriteRules,60>
hpc<Algebra.Graph.Test.RewriteRules,48>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,44> x)
(hpc<Algebra.Graph.Test.RewriteRules,45> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,47>
hpc<Algebra.Graph.Test.RewriteRules,54>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,50> y)
(hpc<Algebra.Graph.Test.RewriteRules,51> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,53>
hpc<Algebra.Graph.Test.RewriteRules,58>
hpc<Algebra.Graph.Test.RewriteRules,56>
hpc<Algebra.Graph.Test.RewriteRules,59> z;
True ->
hpc<Algebra.Graph.Test.RewriteRules,52>
hpc<Algebra.Graph.Test.RewriteRules,55> y
};
True ->
hpc<Algebra.Graph.Test.RewriteRules,46>
hpc<Algebra.Graph.Test.RewriteRules,49> x
})
(let {
op :: Graph a -> Graph a -> Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 60}]
op
= hpc<Algebra.Graph.Test.RewriteRules,65>
\ (ds_d59Fn :: Graph a) (ds_d59Fo :: Graph a) ->
Algebra.Graph.Connect @a ds_d59Fn ds_d59Fo } in
hpc<Algebra.Graph.Test.RewriteRules,66>
\ (x :: Graph a) (y :: Graph a) ->
let {
z :: Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 0}]
z = hpc<Algebra.Graph.Test.RewriteRules,43>
hpc<Algebra.Graph.Test.RewriteRules,42>
op
(hpc<Algebra.Graph.Test.RewriteRules,40> x)
(hpc<Algebra.Graph.Test.RewriteRules,41> y) } in
hpc<Algebra.Graph.Test.RewriteRules,60>
hpc<Algebra.Graph.Test.RewriteRules,48>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,44> x)
(hpc<Algebra.Graph.Test.RewriteRules,45> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,47>
hpc<Algebra.Graph.Test.RewriteRules,54>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,50> y)
(hpc<Algebra.Graph.Test.RewriteRules,51> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,53>
hpc<Algebra.Graph.Test.RewriteRules,58>
hpc<Algebra.Graph.Test.RewriteRules,56>
hpc<Algebra.Graph.Test.RewriteRules,59> z;
True ->
hpc<Algebra.Graph.Test.RewriteRules,52>
hpc<Algebra.Graph.Test.RewriteRules,55> y
};
True ->
hpc<Algebra.Graph.Test.RewriteRules,46>
hpc<Algebra.Graph.Test.RewriteRules,49> x
})
LHS:
simplifyC
= ... \ (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,39>
hpc<Algebra.Graph.Test.RewriteRules,38>
simplify
@a
$dOrd_a57fd
(hpc<Algebra.Graph.Test.RewriteRules,37>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,36> g))
RHS:
simplifyCR
= ... let {
$dEq_a57fn :: Eq (Graph a)
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=True,
Guidance=IF_ARGS [] 20 0}]
$dEq_a57fn = Algebra.Graph.$fEqGraph @a $dOrd_a57fd } in
\ (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,68>
hpc<Algebra.Graph.Test.RewriteRules,67>
g @(Graph a)
((hpc<Algebra.Graph.Test.RewriteRules,61> Algebra.Graph.Empty) @a)
(hpc<Algebra.Graph.Test.RewriteRules,62>
\ (ds_d59Fk :: a) -> Algebra.Graph.Vertex @a ds_d59Fk)
(let {
op :: Graph a -> Graph a -> Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 60}]
op
= hpc<Algebra.Graph.Test.RewriteRules,63>
\ (ds_d59Fl :: Graph a) (ds_d59Fm :: Graph a) ->
Algebra.Graph.Overlay @a ds_d59Fl ds_d59Fm } in
hpc<Algebra.Graph.Test.RewriteRules,64>
\ (x :: Graph a) (y :: Graph a) ->
let {
z :: Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 0}]
z = hpc<Algebra.Graph.Test.RewriteRules,43>
hpc<Algebra.Graph.Test.RewriteRules,42>
op
(hpc<Algebra.Graph.Test.RewriteRules,40> x)
(hpc<Algebra.Graph.Test.RewriteRules,41> y) } in
hpc<Algebra.Graph.Test.RewriteRules,60>
hpc<Algebra.Graph.Test.RewriteRules,48>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,44> x)
(hpc<Algebra.Graph.Test.RewriteRules,45> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,47>
hpc<Algebra.Graph.Test.RewriteRules,54>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,50> y)
(hpc<Algebra.Graph.Test.RewriteRules,51> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,53>
hpc<Algebra.Graph.Test.RewriteRules,58>
hpc<Algebra.Graph.Test.RewriteRules,56>
hpc<Algebra.Graph.Test.RewriteRules,59> z;
True ->
hpc<Algebra.Graph.Test.RewriteRules,52>
hpc<Algebra.Graph.Test.RewriteRules,55> y
};
True ->
hpc<Algebra.Graph.Test.RewriteRules,46>
hpc<Algebra.Graph.Test.RewriteRules,49> x
})
(let {
op :: Graph a -> Graph a -> Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 60}]
op
= hpc<Algebra.Graph.Test.RewriteRules,65>
\ (ds_d59Fn :: Graph a) (ds_d59Fo :: Graph a) ->
Algebra.Graph.Connect @a ds_d59Fn ds_d59Fo } in
hpc<Algebra.Graph.Test.RewriteRules,66>
\ (x :: Graph a) (y :: Graph a) ->
let {
z :: Graph a
[LclId,
Unf=Unf{Src=<vanilla>, TopLvl=False,
Value=False, ConLike=False, WorkFree=False, Expandable=False,
Guidance=IF_ARGS [] 30 0}]
z = hpc<Algebra.Graph.Test.RewriteRules,43>
hpc<Algebra.Graph.Test.RewriteRules,42>
op
(hpc<Algebra.Graph.Test.RewriteRules,40> x)
(hpc<Algebra.Graph.Test.RewriteRules,41> y) } in
hpc<Algebra.Graph.Test.RewriteRules,60>
hpc<Algebra.Graph.Test.RewriteRules,48>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,44> x)
(hpc<Algebra.Graph.Test.RewriteRules,45> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,47>
hpc<Algebra.Graph.Test.RewriteRules,54>
case ==
@(Graph a)
$dEq_a57fn
(hpc<Algebra.Graph.Test.RewriteRules,50> y)
(hpc<Algebra.Graph.Test.RewriteRules,51> z)
of {
False ->
hpc<Algebra.Graph.Test.RewriteRules,53>
hpc<Algebra.Graph.Test.RewriteRules,58>
hpc<Algebra.Graph.Test.RewriteRules,56>
hpc<Algebra.Graph.Test.RewriteRules,59> z;
True ->
hpc<Algebra.Graph.Test.RewriteRules,52>
hpc<Algebra.Graph.Test.RewriteRules,55> y
};
True ->
hpc<Algebra.Graph.Test.RewriteRules,46>
hpc<Algebra.Graph.Test.RewriteRules,49> x
})
test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph failed:
composeCP
:: forall a b.
Ord a =>
b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Buildg a
-> Buildg a
-> b
[LclIdX,
Arity=7,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0 0] 160 0}]
composeCP
= \ (@a)
(@b)
($dOrd_a57EL :: Ord a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(x :: Buildg a)
(y :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,35>
hpc<Algebra.Graph.Test.RewriteRules,34>
$ @LiftedRep
@LiftedRep
@(Graph a)
@b
(hpc<Algebra.Graph.Test.RewriteRules,28>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,24> e)
(hpc<Algebra.Graph.Test.RewriteRules,25> v)
(hpc<Algebra.Graph.Test.RewriteRules,26> o)
(hpc<Algebra.Graph.Test.RewriteRules,27> c))
(hpc<Algebra.Graph.Test.RewriteRules,33>
compose
@a
$dOrd_a57EL
(hpc<Algebra.Graph.Test.RewriteRules,30>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,29> x))
(hpc<Algebra.Graph.Test.RewriteRules,32>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,31> y)))
test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph failed:
induceCP
:: forall b a.
b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> (a -> Bool)
-> Buildg a
-> b
[LclIdX,
Arity=6,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0 0] 110 0}]
induceCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(p :: a -> Bool)
(g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,23>
hpc<Algebra.Graph.Test.RewriteRules,22>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,14> e)
(hpc<Algebra.Graph.Test.RewriteRules,15> v)
(hpc<Algebra.Graph.Test.RewriteRules,16> o)
(hpc<Algebra.Graph.Test.RewriteRules,17> c)
(hpc<Algebra.Graph.Test.RewriteRules,21>
induce
@a
(hpc<Algebra.Graph.Test.RewriteRules,18> p)
(hpc<Algebra.Graph.Test.RewriteRules,20>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,19> g)))
test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph failed:
induceJustCP
:: forall b a.
b
-> (a -> b)
-> (b -> b -> b)
-> (b -> b -> b)
-> Buildg (Maybe a)
-> b
[LclIdX,
Arity=5,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0 0 0 0] 100 0}]
induceJustCP
= \ (@b)
(@a)
(e :: b)
(v :: a -> b)
(o :: b -> b -> b)
(c :: b -> b -> b)
(g :: Buildg (Maybe a)) ->
hpc<Algebra.Graph.Test.RewriteRules,13>
hpc<Algebra.Graph.Test.RewriteRules,12>
foldg
@b
@a
(hpc<Algebra.Graph.Test.RewriteRules,5> e)
(hpc<Algebra.Graph.Test.RewriteRules,6> v)
(hpc<Algebra.Graph.Test.RewriteRules,7> o)
(hpc<Algebra.Graph.Test.RewriteRules,8> c)
(hpc<Algebra.Graph.Test.RewriteRules,11>
induceJust
@a
(hpc<Algebra.Graph.Test.RewriteRules,10>
buildg @(Maybe a) (hpc<Algebra.Graph.Test.RewriteRules,9> g)))
test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph failed:
contextC :: forall a. (a -> Bool) -> Buildg a -> Maybe (Context a)
[LclIdX,
Arity=2,
Unf=Unf{Src=<vanilla>, TopLvl=True,
Value=True, ConLike=True, WorkFree=True, Expandable=True,
Guidance=IF_ARGS [0 0] 50 0}]
contextC
= \ (@a) (p :: a -> Bool) (g :: Buildg a) ->
hpc<Algebra.Graph.Test.RewriteRules,4>
hpc<Algebra.Graph.Test.RewriteRules,3>
context
@a
(hpc<Algebra.Graph.Test.RewriteRules,0> p)
(hpc<Algebra.Graph.Test.RewriteRules,2>
buildg @a (hpc<Algebra.Graph.Test.RewriteRules,1> g))
test/Algebra/Graph/Test/RewriteRules.hs: error:
inspection testing unsuccessful
expected successes: 7
unexpected failures: 51
<no location info>: error: ExitFailure 1
[21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
[22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Data/Graph/Test/Typed.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
[23 of 23] Compiling Main ( test/Main.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Main.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Main.dyn_o )