Build #2 for marxup-3.0.0.1
| Package | marxup-3.0.0.1 |
|---|
| Install | DependencyFailed typography-geometry-1.0.0 |
|---|---|
| Docs | NotTried |
| Tests | NotTried |
| Time submitted | 2015-09-27 05:30:14.467229 UTC |
|---|---|
| Compiler | ghc-7.10.2 |
| OS | linux |
| Arch | x86_64 |
| Dependencies | vector-0.11.0.0, typography-geometry-1.0.0, text-1.2.1.3, process-1.3.0.0, pretty-1.1.2.0, polynomials-bernstein-1.1.1, parsek-1.0.1.3, mtl-2.2.1, lens-4.13, labeled-tree-1.0.0.0, graphviz-2999.18.0.1, glpk-hs-0.3.5, filepath-1.3.0.1, dlist-0.7.1.2, directory-1.2.4.0, cubicbezier-0.4.0.2, containers-0.5.6.2, configurator-0.3.0.0, base-4.8.1.0 |
| Flags | none |
Code Coverage
No Code Coverage was submitted for this report.
Build log
[view raw]
Resolving dependencies...
Configuring base-orphans-0.4.4...
Building base-orphans-0.4.4...
Preprocessing library base-orphans-0.4.4...
[1 of 2] Compiling Data.Orphans.Prelude ( src/Data/Orphans/Prelude.hs, dist/build/Data/Orphans/Prelude.o )
[2 of 2] Compiling Data.Orphans ( src/Data/Orphans.hs, dist/build/Data/Orphans.o )
In-place registering base-orphans-0.4.4...
Running Haddock for base-orphans-0.4.4...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-base-orphans-0.4336465782861021530.4
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/base-orphans-0.4.4-E55c3OEBLyu45sND7mOuE9
Registering base-orphans-0.4.4...
Installed base-orphans-0.4.4
Configuring colour-2.3.3...
Building colour-2.3.3...
Preprocessing library colour-2.3.3...
[ 1 of 14] Compiling Data.Colour.Matrix ( Data/Colour/Matrix.hs, dist/build/Data/Colour/Matrix.o )
[ 2 of 14] Compiling Data.Colour.Chan ( Data/Colour/Chan.hs, dist/build/Data/Colour/Chan.o )
[ 3 of 14] Compiling Data.Colour.CIE.Chromaticity ( Data/Colour/CIE/Chromaticity.hs, dist/build/Data/Colour/CIE/Chromaticity.o )
[ 4 of 14] Compiling Data.Colour.RGB ( Data/Colour/RGB.hs, dist/build/Data/Colour/RGB.o )
[ 5 of 14] Compiling Data.Colour.RGBSpace.HSL ( Data/Colour/RGBSpace/HSL.hs, dist/build/Data/Colour/RGBSpace/HSL.o )
[ 6 of 14] Compiling Data.Colour.RGBSpace.HSV ( Data/Colour/RGBSpace/HSV.hs, dist/build/Data/Colour/RGBSpace/HSV.o )
[ 7 of 14] Compiling Data.Colour.CIE.Illuminant ( Data/Colour/CIE/Illuminant.hs, dist/build/Data/Colour/CIE/Illuminant.o )
[ 8 of 14] Compiling Data.Colour.Internal ( Data/Colour/Internal.hs, dist/build/Data/Colour/Internal.o )
[ 9 of 14] Compiling Data.Colour.SRGB.Linear ( Data/Colour/SRGB/Linear.hs, dist/build/Data/Colour/SRGB/Linear.o )
[10 of 14] Compiling Data.Colour.RGBSpace ( Data/Colour/RGBSpace.hs, dist/build/Data/Colour/RGBSpace.o )
[11 of 14] Compiling Data.Colour.SRGB ( Data/Colour/SRGB.hs, dist/build/Data/Colour/SRGB.o )
[12 of 14] Compiling Data.Colour ( Data/Colour.hs, dist/build/Data/Colour.o )
[13 of 14] Compiling Data.Colour.CIE ( Data/Colour/CIE.hs, dist/build/Data/Colour/CIE.o )
[14 of 14] Compiling Data.Colour.Names ( Data/Colour/Names.hs, dist/build/Data/Colour/Names.o )
In-place registering colour-2.3.3...
Running Haddock for colour-2.3.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-colour-2.35117023052084420925.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/colour-2.3.3-4TwxYYIWlRc4y14QiEhTww
Registering colour-2.3.3...
Installed colour-2.3.3
Configuring dlist-0.7.1.2...
Building dlist-0.7.1.2...
Preprocessing library dlist-0.7.1.2...
[1 of 1] Compiling Data.DList ( Data/DList.hs, dist/build/Data/DList.o )
In-place registering dlist-0.7.1.2...
Running Haddock for dlist-0.7.1.2...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-dlist-0.7.114099597082077486715.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/dlist-0.7.1.2-7AixcwRWCwX32HiPCcE7zz
Registering dlist-0.7.1.2...
Installed dlist-0.7.1.2
Configuring fgl-5.5.2.3...
Building fgl-5.5.2.3...
Preprocessing library fgl-5.5.2.3...
[ 1 of 28] Compiling Paths_fgl ( dist/build/autogen/Paths_fgl.hs, dist/build/Paths_fgl.o )
[ 2 of 28] Compiling Data.Graph.Inductive.Internal.Thread ( Data/Graph/Inductive/Internal/Thread.hs, dist/build/Data/Graph/Inductive/Internal/Thread.o )
[ 3 of 28] Compiling Data.Graph.Inductive.Graph ( Data/Graph/Inductive/Graph.hs, dist/build/Data/Graph/Inductive/Graph.o )
[ 4 of 28] Compiling Data.Graph.Inductive.Basic ( Data/Graph/Inductive/Basic.hs, dist/build/Data/Graph/Inductive/Basic.o )
[ 5 of 28] Compiling Data.Graph.Inductive.PatriciaTree ( Data/Graph/Inductive/PatriciaTree.hs, dist/build/Data/Graph/Inductive/PatriciaTree.o )
[ 6 of 28] Compiling Data.Graph.Inductive.Monad ( Data/Graph/Inductive/Monad.hs, dist/build/Data/Graph/Inductive/Monad.o )
[ 7 of 28] Compiling Data.Graph.Inductive.Monad.IOArray ( Data/Graph/Inductive/Monad/IOArray.hs, dist/build/Data/Graph/Inductive/Monad/IOArray.o )
[ 8 of 28] Compiling Data.Graph.Inductive.Example ( Data/Graph/Inductive/Example.hs, dist/build/Data/Graph/Inductive/Example.o )
[ 9 of 28] Compiling Data.Graph.Inductive.NodeMap ( Data/Graph/Inductive/NodeMap.hs, dist/build/Data/Graph/Inductive/NodeMap.o )
[10 of 28] Compiling Data.Graph.Inductive.Query.ArtPoint ( Data/Graph/Inductive/Query/ArtPoint.hs, dist/build/Data/Graph/Inductive/Query/ArtPoint.o )
[11 of 28] Compiling Data.Graph.Inductive.Query.DFS ( Data/Graph/Inductive/Query/DFS.hs, dist/build/Data/Graph/Inductive/Query/DFS.o )
[12 of 28] Compiling Data.Graph.Inductive.Query.BCC ( Data/Graph/Inductive/Query/BCC.hs, dist/build/Data/Graph/Inductive/Query/BCC.o )
[13 of 28] Compiling Data.Graph.Inductive.Query.Dominators ( Data/Graph/Inductive/Query/Dominators.hs, dist/build/Data/Graph/Inductive/Query/Dominators.o )
[14 of 28] Compiling Data.Graph.Inductive.Query.Indep ( Data/Graph/Inductive/Query/Indep.hs, dist/build/Data/Graph/Inductive/Query/Indep.o )
[15 of 28] Compiling Data.Graph.Inductive.Query.Monad ( Data/Graph/Inductive/Query/Monad.hs, dist/build/Data/Graph/Inductive/Query/Monad.o )
[16 of 28] Compiling Data.Graph.Inductive.Query.TransClos ( Data/Graph/Inductive/Query/TransClos.hs, dist/build/Data/Graph/Inductive/Query/TransClos.o )
[17 of 28] Compiling Data.Graph.Inductive.Tree ( Data/Graph/Inductive/Tree.hs, dist/build/Data/Graph/Inductive/Tree.o )
[18 of 28] Compiling Data.Graph.Inductive.Internal.RootPath ( Data/Graph/Inductive/Internal/RootPath.hs, dist/build/Data/Graph/Inductive/Internal/RootPath.o )
[19 of 28] Compiling Data.Graph.Inductive.Internal.Queue ( Data/Graph/Inductive/Internal/Queue.hs, dist/build/Data/Graph/Inductive/Internal/Queue.o )
[20 of 28] Compiling Data.Graph.Inductive.Query.BFS ( Data/Graph/Inductive/Query/BFS.hs, dist/build/Data/Graph/Inductive/Query/BFS.o )
[21 of 28] Compiling Data.Graph.Inductive.Query.MaxFlow ( Data/Graph/Inductive/Query/MaxFlow.hs, dist/build/Data/Graph/Inductive/Query/MaxFlow.o )
[22 of 28] Compiling Data.Graph.Inductive.Query.MaxFlow2 ( Data/Graph/Inductive/Query/MaxFlow2.hs, dist/build/Data/Graph/Inductive/Query/MaxFlow2.o )
[23 of 28] Compiling Data.Graph.Inductive.Internal.Heap ( Data/Graph/Inductive/Internal/Heap.hs, dist/build/Data/Graph/Inductive/Internal/Heap.o )
[24 of 28] Compiling Data.Graph.Inductive.Query.MST ( Data/Graph/Inductive/Query/MST.hs, dist/build/Data/Graph/Inductive/Query/MST.o )
[25 of 28] Compiling Data.Graph.Inductive.Query.SP ( Data/Graph/Inductive/Query/SP.hs, dist/build/Data/Graph/Inductive/Query/SP.o )
[26 of 28] Compiling Data.Graph.Inductive.Query.GVD ( Data/Graph/Inductive/Query/GVD.hs, dist/build/Data/Graph/Inductive/Query/GVD.o )
[27 of 28] Compiling Data.Graph.Inductive.Query ( Data/Graph/Inductive/Query.hs, dist/build/Data/Graph/Inductive/Query.o )
[28 of 28] Compiling Data.Graph.Inductive ( Data/Graph/Inductive.hs, dist/build/Data/Graph/Inductive.o )
In-place registering fgl-5.5.2.3...
Running Haddock for fgl-5.5.2.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-fgl-5.5.27711514321186452551.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/fgl-5.5.2.3-5kh7Ffsnjax0Ppv4qaraEf
Registering fgl-5.5.2.3...
Installed fgl-5.5.2.3
Configuring filepath-1.3.0.1...
Building filepath-1.3.0.1...
Preprocessing library filepath-1.3.0.1...
[1 of 3] Compiling System.FilePath.Windows ( System/FilePath/Windows.hs, dist/build/System/FilePath/Windows.o )
[2 of 3] Compiling System.FilePath.Posix ( System/FilePath/Posix.hs, dist/build/System/FilePath/Posix.o )
[3 of 3] Compiling System.FilePath ( System/FilePath.hs, dist/build/System/FilePath.o )
In-place registering filepath-1.3.0.1...
Running Haddock for filepath-1.3.0.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-filepath-1.3.017998782061555319301.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/filepath-1.3.0.1-A0ShU8E4xGyA19EI3CqHII
Registering filepath-1.3.0.1...
Installed filepath-1.3.0.1
Configuring labeled-tree-1.0.0.0...
Building labeled-tree-1.0.0.0...
Preprocessing library labeled-tree-1.0.0.0...
[1 of 1] Compiling Data.LabeledTree ( Data/LabeledTree.hs, dist/build/Data/LabeledTree.o )
In-place registering labeled-tree-1.0.0.0...
Running Haddock for labeled-tree-1.0.0.0...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-labeled-tree-1.0.01197352298915256190.0
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/labeled-tree-1.0.0.0-CeYkwLKmN1eKs5MQQEq3Wi
Registering labeled-tree-1.0.0.0...
Installed labeled-tree-1.0.0.0
Configuring microlens-0.3.4.1...
Building microlens-0.3.4.1...
Preprocessing library microlens-0.3.4.1...
[1 of 3] Compiling Lens.Micro.Type ( src/Lens/Micro/Type.hs, dist/build/Lens/Micro/Type.o )
[2 of 3] Compiling Lens.Micro.Internal ( src/Lens/Micro/Internal.hs, dist/build/Lens/Micro/Internal.o )
[3 of 3] Compiling Lens.Micro ( src/Lens/Micro.hs, dist/build/Lens/Micro.o )
In-place registering microlens-0.3.4.1...
Running Haddock for microlens-0.3.4.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-microlens-0.3.41737518944282828202.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/microlens-0.3.4.1-F5XcP7OyP8S5C7dn1LebRH
Registering microlens-0.3.4.1...
Installed microlens-0.3.4.1
Configuring mtl-2.2.1...
Building mtl-2.2.1...
Preprocessing library mtl-2.2.1...
[ 1 of 22] Compiling Control.Monad.Writer.Class ( Control/Monad/Writer/Class.hs, dist/build/Control/Monad/Writer/Class.o )
[ 2 of 22] Compiling Control.Monad.State.Class ( Control/Monad/State/Class.hs, dist/build/Control/Monad/State/Class.o )
[ 3 of 22] Compiling Control.Monad.Reader.Class ( Control/Monad/Reader/Class.hs, dist/build/Control/Monad/Reader/Class.o )
[ 4 of 22] Compiling Control.Monad.RWS.Class ( Control/Monad/RWS/Class.hs, dist/build/Control/Monad/RWS/Class.o )
[ 5 of 22] Compiling Control.Monad.Identity ( Control/Monad/Identity.hs, dist/build/Control/Monad/Identity.o )
[ 6 of 22] Compiling Control.Monad.Error.Class ( Control/Monad/Error/Class.hs, dist/build/Control/Monad/Error/Class.o )
[ 7 of 22] Compiling Control.Monad.Cont.Class ( Control/Monad/Cont/Class.hs, dist/build/Control/Monad/Cont/Class.o )
[ 8 of 22] Compiling Control.Monad.Trans ( Control/Monad/Trans.hs, dist/build/Control/Monad/Trans.o )
[ 9 of 22] Compiling Control.Monad.Error ( Control/Monad/Error.hs, dist/build/Control/Monad/Error.o )
[10 of 22] Compiling Control.Monad.Except ( Control/Monad/Except.hs, dist/build/Control/Monad/Except.o )
[11 of 22] Compiling Control.Monad.List ( Control/Monad/List.hs, dist/build/Control/Monad/List.o )
[12 of 22] Compiling Control.Monad.RWS.Lazy ( Control/Monad/RWS/Lazy.hs, dist/build/Control/Monad/RWS/Lazy.o )
[13 of 22] Compiling Control.Monad.RWS ( Control/Monad/RWS.hs, dist/build/Control/Monad/RWS.o )
[14 of 22] Compiling Control.Monad.Reader ( Control/Monad/Reader.hs, dist/build/Control/Monad/Reader.o )
[15 of 22] Compiling Control.Monad.RWS.Strict ( Control/Monad/RWS/Strict.hs, dist/build/Control/Monad/RWS/Strict.o )
[16 of 22] Compiling Control.Monad.State.Lazy ( Control/Monad/State/Lazy.hs, dist/build/Control/Monad/State/Lazy.o )
[17 of 22] Compiling Control.Monad.State ( Control/Monad/State.hs, dist/build/Control/Monad/State.o )
[18 of 22] Compiling Control.Monad.State.Strict ( Control/Monad/State/Strict.hs, dist/build/Control/Monad/State/Strict.o )
[19 of 22] Compiling Control.Monad.Writer.Lazy ( Control/Monad/Writer/Lazy.hs, dist/build/Control/Monad/Writer/Lazy.o )
[20 of 22] Compiling Control.Monad.Writer ( Control/Monad/Writer.hs, dist/build/Control/Monad/Writer.o )
[21 of 22] Compiling Control.Monad.Writer.Strict ( Control/Monad/Writer/Strict.hs, dist/build/Control/Monad/Writer/Strict.o )
[22 of 22] Compiling Control.Monad.Cont ( Control/Monad/Cont.hs, dist/build/Control/Monad/Cont.o )
In-place registering mtl-2.2.1...
Running Haddock for mtl-2.2.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file: /tmp/pkgConf-mtl-2.213442476861795519125.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/mtl-2.2.1-KMpng31YRYc5JfMWFZ3FCU
Registering mtl-2.2.1...
Installed mtl-2.2.1
Configuring nats-1...
Building nats-1...
Preprocessing library nats-1...
In-place registering nats-1...
Running Haddock for nats-1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file: /tmp/pkgConf-nats-117880144121106059479
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/nats-1-Fmk0Emc1i6fF1ZuCqfyZlm
Registering nats-1...
Installed nats-1
Configuring parallel-3.2.0.6...
Building parallel-3.2.0.6...
Preprocessing library parallel-3.2.0.6...
[1 of 3] Compiling Control.Parallel ( Control/Parallel.hs, dist/build/Control/Parallel.o )
[2 of 3] Compiling Control.Seq ( Control/Seq.hs, dist/build/Control/Seq.o )
[3 of 3] Compiling Control.Parallel.Strategies ( Control/Parallel/Strategies.hs, dist/build/Control/Parallel/Strategies.o )
In-place registering parallel-3.2.0.6...
Running Haddock for parallel-3.2.0.6...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-parallel-3.2.013760352171282648518.6
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/parallel-3.2.0.6-6L9FbzO2lwB9ZhSC6B30xj
Registering parallel-3.2.0.6...
Installed parallel-3.2.0.6
Configuring parsek-1.0.1.3...
Building parsek-1.0.1.3...
Preprocessing library parsek-1.0.1.3...
[1 of 3] Compiling Text.ParserCombinators.Class ( Text/ParserCombinators/Class.hs, dist/build/Text/ParserCombinators/Class.o )
[2 of 3] Compiling Text.ParserCombinators.Parsek ( Text/ParserCombinators/Parsek.hs, dist/build/Text/ParserCombinators/Parsek.o )
[3 of 3] Compiling Text.ParserCombinators.Parsek.Position ( Text/ParserCombinators/Parsek/Position.hs, dist/build/Text/ParserCombinators/Parsek/Position.o )
In-place registering parsek-1.0.1.3...
Running Haddock for parsek-1.0.1.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-parsek-1.0.14524566821302539390.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/parsek-1.0.1.3-1a6r4AUSOY27spIOnoZQ1t
Registering parsek-1.0.1.3...
Installed parsek-1.0.1.3
Configuring prelude-extras-0.4.0.2...
Building prelude-extras-0.4.0.2...
Preprocessing library prelude-extras-0.4.0.2...
[1 of 1] Compiling Prelude.Extras ( src/Prelude/Extras.hs, dist/build/Prelude/Extras.o )
In-place registering prelude-extras-0.4.0.2...
Running Haddock for prelude-extras-0.4.0.2...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-prelude-extras-0.4.015433241761985433483.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/prelude-extras-0.4.0.2-57eavILAbKD5CaKv31zEDY
Registering prelude-extras-0.4.0.2...
Installed prelude-extras-0.4.0.2
Configuring primitive-0.6.1.0...
Building primitive-0.6.1.0...
Preprocessing library primitive-0.6.1.0...
[ 1 of 10] Compiling Data.Primitive.Internal.Compat ( Data/Primitive/Internal/Compat.hs, dist/build/Data/Primitive/Internal/Compat.o )
[ 2 of 10] Compiling Data.Primitive.MachDeps ( Data/Primitive/MachDeps.hs, dist/build/Data/Primitive/MachDeps.o )
[ 3 of 10] Compiling Data.Primitive.Internal.Operations ( Data/Primitive/Internal/Operations.hs, dist/build/Data/Primitive/Internal/Operations.o )
[ 4 of 10] Compiling Control.Monad.Primitive ( Control/Monad/Primitive.hs, dist/build/Control/Monad/Primitive.o )
Control/Monad/Primitive.hs:41:1: Warning:
Module ‘Control.Monad.Trans.Error’ is deprecated:
Use Control.Monad.Trans.Except instead
Control/Monad/Primitive.hs:100:11: Warning:
In the use of type constructor or class ‘Error’
(imported from Control.Monad.Trans.Error):
Deprecated: "Use Control.Monad.Trans.Except instead"
Control/Monad/Primitive.hs:100:47: Warning:
In the use of type constructor or class ‘ErrorT’
(imported from Control.Monad.Trans.Error):
Deprecated: "Use Control.Monad.Trans.Except instead"
Control/Monad/Primitive.hs:101:19: Warning:
In the use of type constructor or class ‘ErrorT’
(imported from Control.Monad.Trans.Error):
Deprecated: "Use Control.Monad.Trans.Except instead"
[ 5 of 10] Compiling Data.Primitive.Types ( Data/Primitive/Types.hs, dist/build/Data/Primitive/Types.o )
[ 6 of 10] Compiling Data.Primitive.Array ( Data/Primitive/Array.hs, dist/build/Data/Primitive/Array.o )
[ 7 of 10] Compiling Data.Primitive.ByteArray ( Data/Primitive/ByteArray.hs, dist/build/Data/Primitive/ByteArray.o )
[ 8 of 10] Compiling Data.Primitive.Addr ( Data/Primitive/Addr.hs, dist/build/Data/Primitive/Addr.o )
[ 9 of 10] Compiling Data.Primitive ( Data/Primitive.hs, dist/build/Data/Primitive.o )
[10 of 10] Compiling Data.Primitive.MutVar ( Data/Primitive/MutVar.hs, dist/build/Data/Primitive/MutVar.o )
In-place registering primitive-0.6.1.0...
Running Haddock for primitive-0.6.1.0...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-primitive-0.6.17653267172143124030.0
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/primitive-0.6.1.0-5Jnw7oEuYtM9dmKXelGXVb
Registering primitive-0.6.1.0...
Installed primitive-0.6.1.0
Configuring reflection-2.1...
Building reflection-2.1...
Preprocessing library reflection-2.1...
[1 of 1] Compiling Data.Reflection ( fast/Data/Reflection.hs, dist/build/Data/Reflection.o )
In-place registering reflection-2.1...
Running Haddock for reflection-2.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-reflection-26903677701434433518.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/reflection-2.1-2R8D1icnYri0V2GprJlDMF
Registering reflection-2.1...
Installed reflection-2.1
Configuring stm-2.4.4...
Building stm-2.4.4...
Preprocessing library stm-2.4.4...
[ 1 of 10] Compiling Control.Sequential.STM ( Control/Sequential/STM.hs, dist/build/Control/Sequential/STM.o )
[ 2 of 10] Compiling Control.Concurrent.STM.TBQueue ( Control/Concurrent/STM/TBQueue.hs, dist/build/Control/Concurrent/STM/TBQueue.o )
[ 3 of 10] Compiling Control.Concurrent.STM.TQueue ( Control/Concurrent/STM/TQueue.hs, dist/build/Control/Concurrent/STM/TQueue.o )
[ 4 of 10] Compiling Control.Concurrent.STM.TChan ( Control/Concurrent/STM/TChan.hs, dist/build/Control/Concurrent/STM/TChan.o )
[ 5 of 10] Compiling Control.Concurrent.STM.TMVar ( Control/Concurrent/STM/TMVar.hs, dist/build/Control/Concurrent/STM/TMVar.o )
[ 6 of 10] Compiling Control.Concurrent.STM.TVar ( Control/Concurrent/STM/TVar.hs, dist/build/Control/Concurrent/STM/TVar.o )
[ 7 of 10] Compiling Control.Concurrent.STM.TArray ( Control/Concurrent/STM/TArray.hs, dist/build/Control/Concurrent/STM/TArray.o )
[ 8 of 10] Compiling Control.Monad.STM ( Control/Monad/STM.hs, dist/build/Control/Monad/STM.o )
[ 9 of 10] Compiling Control.Concurrent.STM ( Control/Concurrent/STM.hs, dist/build/Control/Concurrent/STM.o )
[10 of 10] Compiling Control.Concurrent.STM.TSem ( Control/Concurrent/STM/TSem.hs, dist/build/Control/Concurrent/STM/TSem.o )
In-place registering stm-2.4.4...
Running Haddock for stm-2.4.4...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file: /tmp/pkgConf-stm-2.415276229541312630443.4
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/stm-2.4.4-C1kFMnPqFjvDhFjgMZGUpr
Registering stm-2.4.4...
Installed stm-2.4.4
Configuring tagged-0.8.1...
Building tagged-0.8.1...
Preprocessing library tagged-0.8.1...
[1 of 2] Compiling Data.Proxy.TH ( src/Data/Proxy/TH.hs, dist/build/Data/Proxy/TH.o )
[2 of 2] Compiling Data.Tagged ( src/Data/Tagged.hs, dist/build/Data/Tagged.o )
In-place registering tagged-0.8.1...
Running Haddock for tagged-0.8.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-tagged-0.819546965321862292122.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/tagged-0.8.1-6Tf46oJAk552xT73wGffBW
Registering tagged-0.8.1...
Installed tagged-0.8.1
Configuring text-1.2.1.3...
Building text-1.2.1.3...
Preprocessing library text-1.2.1.3...
[ 1 of 44] Compiling Data.Text.Internal.Read ( Data/Text/Internal/Read.hs, dist/build/Data/Text/Internal/Read.o )
Data/Text/Internal/Read.hs:21:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
[ 2 of 44] Compiling Data.Text.Internal.Encoding.Utf32 ( Data/Text/Internal/Encoding/Utf32.hs, dist/build/Data/Text/Internal/Encoding/Utf32.o )
[ 3 of 44] Compiling Data.Text.Internal.Builder.RealFloat.Functions ( Data/Text/Internal/Builder/RealFloat/Functions.hs, dist/build/Data/Text/Internal/Builder/RealFloat/Functions.o )
[ 4 of 44] Compiling Data.Text.Internal.Builder.Int.Digits ( Data/Text/Internal/Builder/Int/Digits.hs, dist/build/Data/Text/Internal/Builder/Int/Digits.o )
[ 5 of 44] Compiling Data.Text.Encoding.Error ( Data/Text/Encoding/Error.hs, dist/build/Data/Text/Encoding/Error.o )
Data/Text/Encoding/Error.hs:3:14: Warning:
‘Data.Text.Encoding.Error’ is marked as Trustworthy but has been inferred as safe!
[ 6 of 44] Compiling Data.Text.Internal.Unsafe.Shift ( Data/Text/Internal/Unsafe/Shift.hs, dist/build/Data/Text/Internal/Unsafe/Shift.o )
[ 7 of 44] Compiling Data.Text.Internal.Encoding.Utf16 ( Data/Text/Internal/Encoding/Utf16.hs, dist/build/Data/Text/Internal/Encoding/Utf16.o )
[ 8 of 44] Compiling Data.Text.Internal.Functions ( Data/Text/Internal/Functions.hs, dist/build/Data/Text/Internal/Functions.o )
[ 9 of 44] Compiling Data.Text.Internal.Unsafe ( Data/Text/Internal/Unsafe.hs, dist/build/Data/Text/Internal/Unsafe.o )
[10 of 44] Compiling Data.Text.Array ( Data/Text/Array.hs, dist/build/Data/Text/Array.o )
[11 of 44] Compiling Data.Text.Internal.Unsafe.Char ( Data/Text/Internal/Unsafe/Char.hs, dist/build/Data/Text/Internal/Unsafe/Char.o )
[12 of 44] Compiling Data.Text.Internal ( Data/Text/Internal.hs, dist/build/Data/Text/Internal.o )
[13 of 44] Compiling Data.Text.Internal.Fusion.Size ( Data/Text/Internal/Fusion/Size.hs, dist/build/Data/Text/Internal/Fusion/Size.o )
[14 of 44] Compiling Data.Text.Internal.Fusion.Types ( Data/Text/Internal/Fusion/Types.hs, dist/build/Data/Text/Internal/Fusion/Types.o )
[15 of 44] Compiling Data.Text.Internal.Fusion.CaseMapping ( Data/Text/Internal/Fusion/CaseMapping.hs, dist/build/Data/Text/Internal/Fusion/CaseMapping.o )
[16 of 44] Compiling Data.Text.Internal.Fusion.Common ( Data/Text/Internal/Fusion/Common.hs, dist/build/Data/Text/Internal/Fusion/Common.o )
[17 of 44] Compiling Data.Text.Unsafe ( Data/Text/Unsafe.hs, dist/build/Data/Text/Unsafe.o )
[18 of 44] Compiling Data.Text.Internal.Private ( Data/Text/Internal/Private.hs, dist/build/Data/Text/Internal/Private.o )
[19 of 44] Compiling Data.Text.Internal.Fusion ( Data/Text/Internal/Fusion.hs, dist/build/Data/Text/Internal/Fusion.o )
[20 of 44] Compiling Data.Text.Show ( Data/Text/Show.hs, dist/build/Data/Text/Show.o )
[21 of 44] Compiling Data.Text.Internal.Encoding.Fusion.Common ( Data/Text/Internal/Encoding/Fusion/Common.hs, dist/build/Data/Text/Internal/Encoding/Fusion/Common.o )
[22 of 44] Compiling Data.Text.Internal.Encoding.Utf8 ( Data/Text/Internal/Encoding/Utf8.hs, dist/build/Data/Text/Internal/Encoding/Utf8.o )
[23 of 44] Compiling Data.Text.Internal.Encoding.Fusion ( Data/Text/Internal/Encoding/Fusion.hs, dist/build/Data/Text/Internal/Encoding/Fusion.o )
[24 of 44] Compiling Data.Text.Encoding ( Data/Text/Encoding.hs, dist/build/Data/Text/Encoding.o )
[25 of 44] Compiling Data.Text.Internal.Lazy.Encoding.Fusion ( Data/Text/Internal/Lazy/Encoding/Fusion.hs, dist/build/Data/Text/Internal/Lazy/Encoding/Fusion.o )
[26 of 44] Compiling Data.Text.Internal.Search ( Data/Text/Internal/Search.hs, dist/build/Data/Text/Internal/Search.o )
[27 of 44] Compiling Data.Text.Foreign ( Data/Text/Foreign.hs, dist/build/Data/Text/Foreign.o )
[28 of 44] Compiling Data.Text ( Data/Text.hs, dist/build/Data/Text.o )
[29 of 44] Compiling Data.Text.Internal.IO ( Data/Text/Internal/IO.hs, dist/build/Data/Text/Internal/IO.o )
[30 of 44] Compiling Data.Text.IO ( Data/Text/IO.hs, dist/build/Data/Text/IO.o )
[31 of 44] Compiling Data.Text.Internal.Lazy ( Data/Text/Internal/Lazy.hs, dist/build/Data/Text/Internal/Lazy.o )
[32 of 44] Compiling Data.Text.Internal.Lazy.Fusion ( Data/Text/Internal/Lazy/Fusion.hs, dist/build/Data/Text/Internal/Lazy/Fusion.o )
[33 of 44] Compiling Data.Text.Internal.Lazy.Search ( Data/Text/Internal/Lazy/Search.hs, dist/build/Data/Text/Internal/Lazy/Search.o )
[34 of 44] Compiling Data.Text.Lazy.Internal ( Data/Text/Lazy/Internal.hs, dist/build/Data/Text/Lazy/Internal.o )
[35 of 44] Compiling Data.Text.Lazy.Encoding ( Data/Text/Lazy/Encoding.hs, dist/build/Data/Text/Lazy/Encoding.o )
Data/Text/Lazy/Encoding.hs:65:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[36 of 44] Compiling Data.Text.Lazy ( Data/Text/Lazy.hs, dist/build/Data/Text/Lazy.o )
[37 of 44] Compiling Data.Text.Internal.Builder ( Data/Text/Internal/Builder.hs, dist/build/Data/Text/Internal/Builder.o )
Data/Text/Internal/Builder.hs:61:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[38 of 44] Compiling Data.Text.Lazy.Builder ( Data/Text/Lazy/Builder.hs, dist/build/Data/Text/Lazy/Builder.o )
[39 of 44] Compiling Data.Text.Internal.Builder.Functions ( Data/Text/Internal/Builder/Functions.hs, dist/build/Data/Text/Internal/Builder/Functions.o )
Data/Text/Internal/Builder/Functions.hs:24:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[40 of 44] Compiling Data.Text.Lazy.Builder.Int ( Data/Text/Lazy/Builder/Int.hs, dist/build/Data/Text/Lazy/Builder/Int.o )
Data/Text/Lazy/Builder/Int.hs:24:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
Data/Text/Lazy/Builder/Int.hs:30:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
Data/Text/Lazy/Builder/Int.hs:32:1: Warning:
The import of ‘GHC.Num’ is redundant
except perhaps to import instances from ‘GHC.Num’
To import instances alone, use: import GHC.Num()
[41 of 44] Compiling Data.Text.Lazy.IO ( Data/Text/Lazy/IO.hs, dist/build/Data/Text/Lazy/IO.o )
[42 of 44] Compiling Data.Text.Lazy.Read ( Data/Text/Lazy/Read.hs, dist/build/Data/Text/Lazy/Read.o )
Data/Text/Lazy/Read.hs:3:14: Warning:
‘Data.Text.Lazy.Read’ is marked as Trustworthy but has been inferred as safe!
Data/Text/Lazy/Read.hs:32:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
[43 of 44] Compiling Data.Text.Lazy.Builder.RealFloat ( Data/Text/Lazy/Builder/RealFloat.hs, dist/build/Data/Text/Lazy/Builder/RealFloat.o )
[44 of 44] Compiling Data.Text.Read ( Data/Text/Read.hs, dist/build/Data/Text/Read.o )
Data/Text/Read.hs:33:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
In-place registering text-1.2.1.3...
Running Haddock for text-1.2.1.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-text-1.2.116233805951287859999.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/text-1.2.1.3-1l1AN4I48k37RaQ6fm6CEh
Registering text-1.2.1.3...
Installed text-1.2.1.3
Configuring transformers-compat-0.4.0.4...
Building transformers-compat-0.4.0.4...
Preprocessing library transformers-compat-0.4.0.4...
[1 of 1] Compiling Paths_transformers_compat ( dist/build/autogen/Paths_transformers_compat.hs, dist/build/Paths_transformers_compat.o )
In-place registering transformers-compat-0.4.0.4...
Running Haddock for transformers-compat-0.4.0.4...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-transformers-compat-0.4.01872666833612353198.4
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/transformers-compat-0.4.0.4-DCQioW2d4vYEa3T0AmFBPv
Registering transformers-compat-0.4.0.4...
Installed transformers-compat-0.4.0.4
Configuring unix-compat-0.4.1.4...
Building unix-compat-0.4.1.4...
Preprocessing library unix-compat-0.4.1.4...
[1 of 8] Compiling System.PosixCompat.User ( dist/build/System/PosixCompat/User.hs, dist/build/System/PosixCompat/User.o )
[2 of 8] Compiling System.PosixCompat.Unistd ( src/System/PosixCompat/Unistd.hs, dist/build/System/PosixCompat/Unistd.o )
[3 of 8] Compiling System.PosixCompat.Types ( src/System/PosixCompat/Types.hs, dist/build/System/PosixCompat/Types.o )
[4 of 8] Compiling System.PosixCompat.Extensions ( dist/build/System/PosixCompat/Extensions.hs, dist/build/System/PosixCompat/Extensions.o )
[5 of 8] Compiling System.PosixCompat.Time ( src/System/PosixCompat/Time.hs, dist/build/System/PosixCompat/Time.o )
[6 of 8] Compiling System.PosixCompat.Temp ( src/System/PosixCompat/Temp.hs, dist/build/System/PosixCompat/Temp.o )
[7 of 8] Compiling System.PosixCompat.Files ( dist/build/System/PosixCompat/Files.hs, dist/build/System/PosixCompat/Files.o )
[8 of 8] Compiling System.PosixCompat ( src/System/PosixCompat.hs, dist/build/System/PosixCompat.o )
In-place registering unix-compat-0.4.1.4...
Running Haddock for unix-compat-0.4.1.4...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-unix-compat-0.4.13332934691779451238.4
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/unix-compat-0.4.1.4-DeAF5HEzYMu4CPLnbGbHUz
Registering unix-compat-0.4.1.4...
Installed unix-compat-0.4.1.4
Configuring directory-1.2.4.0...
checking for gcc... /usr/bin/gcc
checking whether the C compiler works... yes
checking for C compiler default output file name... a.out
checking for suffix of executables...
checking whether we are cross compiling... no
checking for suffix of object files... o
checking whether we are using the GNU C compiler... yes
checking whether /usr/bin/gcc accepts -g... yes
checking for /usr/bin/gcc option to accept ISO C89... none needed
checking how to run the C preprocessor... /usr/bin/gcc -E
checking for grep that handles long lines and -e... /bin/grep
checking for egrep... /bin/grep -E
checking for ANSI C header files... yes
checking for sys/types.h... yes
checking for sys/stat.h... yes
checking for stdlib.h... yes
checking for string.h... yes
checking for memory.h... yes
checking for strings.h... yes
checking for inttypes.h... yes
checking for stdint.h... yes
checking for unistd.h... yes
checking fcntl.h usability... yes
checking fcntl.h presence... yes
checking for fcntl.h... yes
checking limits.h usability... yes
checking limits.h presence... yes
checking for limits.h... yes
checking for sys/types.h... (cached) yes
checking for sys/stat.h... (cached) yes
checking time.h usability... yes
checking time.h presence... yes
checking for time.h... yes
checking for utimensat... yes
configure: creating ./config.status
config.status: creating include/HsDirectoryConfig.h
Building directory-1.2.4.0...
Preprocessing library directory-1.2.4.0...
[1 of 6] Compiling System.Directory.Internal.Windows ( dist/build/System/Directory/Internal/Windows.hs, dist/build/System/Directory/Internal/Windows.o )
[2 of 6] Compiling System.Directory.Internal.Posix ( dist/build/System/Directory/Internal/Posix.hs, dist/build/System/Directory/Internal/Posix.o )
[3 of 6] Compiling System.Directory.Internal.C_utimensat ( dist/build/System/Directory/Internal/C_utimensat.hs, dist/build/System/Directory/Internal/C_utimensat.o )
[4 of 6] Compiling System.Directory.Internal.Config ( System/Directory/Internal/Config.hs, dist/build/System/Directory/Internal/Config.o )
[5 of 6] Compiling System.Directory.Internal ( dist/build/System/Directory/Internal.hs, dist/build/System/Directory/Internal.o )
[6 of 6] Compiling System.Directory ( System/Directory.hs, dist/build/System/Directory.o )
In-place registering directory-1.2.4.0...
Running Haddock for directory-1.2.4.0...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-directory-1.2.4198628789995234140.0
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/directory-1.2.4.0-JtYQPkJAV6443KwzETqw0n
Registering directory-1.2.4.0...
Installed directory-1.2.4.0
Configuring microlens-th-0.2.1.2...
Building microlens-th-0.2.1.2...
Preprocessing library microlens-th-0.2.1.2...
[1 of 1] Compiling Lens.Micro.TH ( src/Lens/Micro/TH.hs, dist/build/Lens/Micro/TH.o )
In-place registering microlens-th-0.2.1.2...
Running Haddock for microlens-th-0.2.1.2...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-microlens-th-0.2.115618127221322623287.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/microlens-th-0.2.1.2-HeublwSNZFFDJCdlO91v4S
Registering microlens-th-0.2.1.2...
Installed microlens-th-0.2.1.2
Configuring glpk-hs-0.3.5...
Building glpk-hs-0.3.5...
Preprocessing library glpk-hs-0.3.5...
[ 1 of 21] Compiling Data.LinearProgram.GLPK.Types ( Data/LinearProgram/GLPK/Types.hs, dist/build/Data/LinearProgram/GLPK/Types.o )
[ 2 of 21] Compiling Control.Monad.LPMonad.Supply.Class ( Control/Monad/LPMonad/Supply/Class.hs, dist/build/Control/Monad/LPMonad/Supply/Class.o )
Control/Monad/LPMonad/Supply/Class.hs:8:1: Warning:
Module ‘Control.Monad.Error’ is deprecated:
Use Control.Monad.Except instead
Control/Monad/LPMonad/Supply/Class.hs:18:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:19:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:20:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:21:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:22:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:23:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:24:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:27:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:28:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:31:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:32:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:34:11: Warning:
In the use of type constructor or class ‘Error’
(imported from Control.Monad.Error, but defined in transformers-0.4.2.0:Control.Monad.Trans.Error):
Deprecated: "Use Control.Monad.Trans.Except instead"
Control/Monad/LPMonad/Supply/Class.hs:34:55: Warning:
In the use of type constructor or class ‘ErrorT’
(imported from Control.Monad.Error, but defined in transformers-0.4.2.0:Control.Monad.Trans.Error):
Deprecated: "Use Control.Monad.Trans.Except instead"
Control/Monad/LPMonad/Supply/Class.hs:35:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:36:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:39:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:40:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:43:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:44:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:47:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:48:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:51:1: Warning: Tab character
Control/Monad/LPMonad/Supply/Class.hs:52:1: Warning: Tab character
[ 3 of 21] Compiling Control.Monad.LPMonad.Supply ( Control/Monad/LPMonad/Supply.hs, dist/build/Control/Monad/LPMonad/Supply.o )
[ 4 of 21] Compiling Data.Algebra.Group ( Data/Algebra/Group.hs, dist/build/Data/Algebra/Group.o )
Data/Algebra/Group.hs:16:1: Warning: Tab character
Data/Algebra/Group.hs:17:1: Warning: Tab character
Data/Algebra/Group.hs:18:1: Warning: Tab character
Data/Algebra/Group.hs:19:1: Warning: Tab character
Data/Algebra/Group.hs:20:1: Warning: Tab character
Data/Algebra/Group.hs:21:1: Warning: Tab character
Data/Algebra/Group.hs:22:1: Warning: Tab character
Data/Algebra/Group.hs:23:1: Warning: Tab character
Data/Algebra/Group.hs:26:1: Warning: Tab character
Data/Algebra/Group.hs:27:1: Warning: Tab character
Data/Algebra/Group.hs:28:1: Warning: Tab character
Data/Algebra/Group.hs:29:1: Warning: Tab character
Data/Algebra/Group.hs:32:1: Warning: Tab character
Data/Algebra/Group.hs:33:1: Warning: Tab character
Data/Algebra/Group.hs:34:1: Warning: Tab character
Data/Algebra/Group.hs:35:1: Warning: Tab character
Data/Algebra/Group.hs:38:1: Warning: Tab character
Data/Algebra/Group.hs:39:1: Warning: Tab character
Data/Algebra/Group.hs:40:1: Warning: Tab character
Data/Algebra/Group.hs:41:1: Warning: Tab character
Data/Algebra/Group.hs:44:1: Warning: Tab character
Data/Algebra/Group.hs:45:1: Warning: Tab character
Data/Algebra/Group.hs:46:1: Warning: Tab character
Data/Algebra/Group.hs:47:1: Warning: Tab character
Data/Algebra/Group.hs:50:1: Warning: Tab character
Data/Algebra/Group.hs:51:1: Warning: Tab character
Data/Algebra/Group.hs:52:1: Warning: Tab character
Data/Algebra/Group.hs:53:1: Warning: Tab character
Data/Algebra/Group.hs:54:1: Warning: Tab character
Data/Algebra/Group.hs:57:1: Warning: Tab character
Data/Algebra/Group.hs:58:1: Warning: Tab character
Data/Algebra/Group.hs:59:1: Warning: Tab character
Data/Algebra/Group.hs:60:1: Warning: Tab character
Data/Algebra/Group.hs:63:1: Warning: Tab character
Data/Algebra/Group.hs:64:1: Warning: Tab character
Data/Algebra/Group.hs:65:1: Warning: Tab character
Data/Algebra/Group.hs:68:1: Warning: Tab character
Data/Algebra/Group.hs:69:1: Warning: Tab character
Data/Algebra/Group.hs:70:1: Warning: Tab character
Data/Algebra/Group.hs:73:1: Warning: Tab character
Data/Algebra/Group.hs:74:1: Warning: Tab character
Data/Algebra/Group.hs:75:1: Warning: Tab character
Data/Algebra/Group.hs:76:1: Warning: Tab character
Data/Algebra/Group.hs:79:1: Warning: Tab character
Data/Algebra/Group.hs:80:1: Warning: Tab character
Data/Algebra/Group.hs:81:1: Warning: Tab character
Data/Algebra/Group.hs:82:1: Warning: Tab character
Data/Algebra/Group.hs:83:1: Warning: Tab character
Data/Algebra/Group.hs:86:1: Warning: Tab character
Data/Algebra/Group.hs:87:1: Warning: Tab character
Data/Algebra/Group.hs:88:1: Warning: Tab character
Data/Algebra/Group.hs:89:1: Warning: Tab character
Data/Algebra/Group.hs:90:1: Warning: Tab character
Data/Algebra/Group.hs:93:1: Warning: Tab character
Data/Algebra/Group.hs:94:1: Warning: Tab character
Data/Algebra/Group.hs:95:1: Warning: Tab character
Data/Algebra/Group.hs:96:1: Warning: Tab character
Data/Algebra/Group.hs:97:1: Warning: Tab character
[ 5 of 21] Compiling Data.Algebra.Ring ( Data/Algebra/Ring.hs, dist/build/Data/Algebra/Ring.o )
Data/Algebra/Ring.hs:19:1: Warning: Tab character
Data/Algebra/Ring.hs:20:1: Warning: Tab character
Data/Algebra/Ring.hs:23:1: Warning: Tab character
Data/Algebra/Ring.hs:24:1: Warning: Tab character
Data/Algebra/Ring.hs:27:1: Warning: Tab character
Data/Algebra/Ring.hs:28:1: Warning: Tab character
Data/Algebra/Ring.hs:31:1: Warning: Tab character
Data/Algebra/Ring.hs:32:1: Warning: Tab character
Data/Algebra/Ring.hs:35:1: Warning: Tab character
Data/Algebra/Ring.hs:36:1: Warning: Tab character
Data/Algebra/Ring.hs:39:1: Warning: Tab character
Data/Algebra/Ring.hs:40:1: Warning: Tab character
Data/Algebra/Ring.hs:41:1: Warning: Tab character
Data/Algebra/Ring.hs:45:1: Warning: Tab character
Data/Algebra/Ring.hs:46:1: Warning: Tab character
Data/Algebra/Ring.hs:47:1: Warning: Tab character
Data/Algebra/Ring.hs:51:1: Warning: Tab character
Data/Algebra/Ring.hs:52:1: Warning: Tab character
Data/Algebra/Ring.hs:56:1: Warning: Tab character
Data/Algebra/Ring.hs:57:1: Warning: Tab character
[ 6 of 21] Compiling Data.Algebra.Module ( Data/Algebra/Module.hs, dist/build/Data/Algebra/Module.o )
Data/Algebra/Module.hs:14:1: Warning: Tab character
Data/Algebra/Module.hs:17:1: Warning: Tab character
Data/Algebra/Module.hs:20:1: Warning: Tab character
Data/Algebra/Module.hs:23:1: Warning: Tab character
Data/Algebra/Module.hs:26:1: Warning: Tab character
Data/Algebra/Module.hs:27:1: Warning: Tab character
Data/Algebra/Module.hs:30:1: Warning: Tab character
Data/Algebra/Module.hs:31:1: Warning: Tab character
Data/Algebra/Module.hs:34:1: Warning: Tab character
Data/Algebra/Module.hs:35:1: Warning: Tab character
Data/Algebra/Module.hs:38:1: Warning: Tab character
Data/Algebra/Module.hs:41:1: Warning: Tab character
Data/Algebra/Module.hs:44:1: Warning: Tab character
Data/Algebra/Module.hs:45:1: Warning: Tab character
Data/Algebra/Module.hs:48:1: Warning: Tab character
Data/Algebra/Module.hs:51:1: Warning: Tab character
Data/Algebra/Module.hs:54:1: Warning: Tab character
Data/Algebra/Module.hs:57:1: Warning: Tab character
Data/Algebra/Module.hs:60:1: Warning: Tab character
Data/Algebra/Module.hs:63:1: Warning: Tab character
Data/Algebra/Module.hs:64:1: Warning: Tab character
Data/Algebra/Module.hs:67:1: Warning: Tab character
Data/Algebra/Module.hs:68:1: Warning: Tab character
Data/Algebra/Module.hs:71:1: Warning: Tab character
Data/Algebra/Module.hs:72:1: Warning: Tab character
Data/Algebra/Module.hs:106:1: Warning: Tab character
Data/Algebra/Module.hs:107:1: Warning: Tab character
Data/Algebra/Module.hs:108:1: Warning: Tab character
Data/Algebra/Module.hs:109:1: Warning: Tab character
Data/Algebra/Module.hs:63:9: Warning:
Forall'd constraint ‘Ring r’ is not bound in RULE lhs
Orig bndrs: [r, m, $dRing_agtl, $dGroup_agtm, $dModule_agtn]
Orig lhs: let {
$dGroup_agAF :: Group m
[LclId, Str=DmdType]
$dGroup_agAF =
Data.Algebra.Module.$p2Module @ r @ m $dModule_agtn } in
let {
$dRing_agAE :: Ring r
[LclId, Str=DmdType]
$dRing_agAE =
Data.Algebra.Module.$p1Module @ r @ m $dModule_agtn } in
let {
$dGroup_agAG :: Group r
[LclId, Str=DmdType]
$dGroup_agAG = Data.Algebra.Ring.$p1Ring @ r $dRing_agAE } in
let {
$dGroup_agAD :: Group r
[LclId, Str=DmdType]
$dGroup_agAD = Data.Algebra.Ring.$p1Ring @ r $dRing_agtl } in
let {
$dModule_agtu :: Module r m
[LclId, Str=DmdType]
$dModule_agtu = $dModule_agtn } in
let {
$dModule_agtt :: Module r m
[LclId, Str=DmdType]
$dModule_agtt = $dModule_agtn } in
let {
$dGroup_agts :: Group (m, m)
[LclId, Str=DmdType]
$dGroup_agts = $dGroup_agtm } in
let {
$dRing_agtr :: Ring r
[LclId, Str=DmdType]
$dRing_agtr = $dRing_agAE } in
Data.Algebra.Module.$fModuler(,)
@ r @ m @ m $dRing_agtr $dGroup_agts $dModule_agtt $dModule_agtu
optimised lhs: Data.Algebra.Module.$fModuler(,)
@ r
@ m
@ m
(Data.Algebra.Module.$p1Module @ r @ m $dModule_agtn)
$dGroup_agtm
$dModule_agtt
$dModule_agtu
Data/Algebra/Module.hs:63:9: Warning:
Forall'd constraint ‘Ring r’ is not bound in RULE lhs
Orig bndrs: [r, m, $dRing_agtl, $dGroup_agtm, $dModule_agtn]
Orig lhs: let {
$dGroup_agAF :: Group m
[LclId, Str=DmdType]
$dGroup_agAF =
Data.Algebra.Module.$p2Module @ r @ m $dModule_agtn } in
let {
$dRing_agAE :: Ring r
[LclId, Str=DmdType]
$dRing_agAE =
Data.Algebra.Module.$p1Module @ r @ m $dModule_agtn } in
let {
$dGroup_agAG :: Group r
[LclId, Str=DmdType]
$dGroup_agAG = Data.Algebra.Ring.$p1Ring @ r $dRing_agAE } in
let {
$dGroup_agAD :: Group r
[LclId, Str=DmdType]
$dGroup_agAD = Data.Algebra.Ring.$p1Ring @ r $dRing_agtl } in
let {
$dModule_agtu :: Module r m
[LclId, Str=DmdType]
$dModule_agtu = $dModule_agtn } in
let {
$dModule_agtt :: Module r m
[LclId, Str=DmdType]
$dModule_agtt = $dModule_agtn } in
let {
$dGroup_agts :: Group (m, m)
[LclId, Str=DmdType]
$dGroup_agts = $dGroup_agtm } in
let {
$dRing_agtr :: Ring r
[LclId, Str=DmdType]
$dRing_agtr = $dRing_agAE } in
$c*^
@ r @ m @ m $dRing_agtr $dGroup_agts $dModule_agtt $dModule_agtu
optimised lhs: $c*^
@ r
@ m
@ m
(Data.Algebra.Module.$p1Module @ r @ m $dModule_agtn)
$dGroup_agtm
$dModule_agtt
$dModule_agtu
Data/Algebra/Module.hs:67:9: Warning:
Forall'd constraint ‘Ring r’ is not bound in RULE lhs
Orig bndrs: [r, m, $dRing_agsA, $dGroup_agsB, $dModule_agsC]
Orig lhs: let {
$dGroup_agAl :: Group m
[LclId, Str=DmdType]
$dGroup_agAl =
Data.Algebra.Module.$p2Module @ r @ m $dModule_agsC } in
let {
$dRing_agAk :: Ring r
[LclId, Str=DmdType]
$dRing_agAk =
Data.Algebra.Module.$p1Module @ r @ m $dModule_agsC } in
let {
$dGroup_agAm :: Group r
[LclId, Str=DmdType]
$dGroup_agAm = Data.Algebra.Ring.$p1Ring @ r $dRing_agAk } in
let {
$dGroup_agAj :: Group r
[LclId, Str=DmdType]
$dGroup_agAj = Data.Algebra.Ring.$p1Ring @ r $dRing_agsA } in
let {
$dModule_agsL :: Module r m
[LclId, Str=DmdType]
$dModule_agsL = $dModule_agsC } in
let {
$dModule_agsK :: Module r m
[LclId, Str=DmdType]
$dModule_agsK = $dModule_agsC } in
let {
$dModule_agsJ :: Module r m
[LclId, Str=DmdType]
$dModule_agsJ = $dModule_agsC } in
let {
$dGroup_agsI :: Group (m, m, m)
[LclId, Str=DmdType]
$dGroup_agsI = $dGroup_agsB } in
let {
$dRing_agsH :: Ring r
[LclId, Str=DmdType]
$dRing_agsH = $dRing_agAk } in
Data.Algebra.Module.$fModuler(,,)
@ r
@ m
@ m
@ m
$dRing_agsH
$dGroup_agsI
$dModule_agsJ
$dModule_agsK
$dModule_agsL
optimised lhs: Data.Algebra.Module.$fModuler(,,)
@ r
@ m
@ m
@ m
(Data.Algebra.Module.$p1Module @ r @ m $dModule_agsC)
$dGroup_agsB
$dModule_agsJ
$dModule_agsK
$dModule_agsL
Data/Algebra/Module.hs:67:9: Warning:
Forall'd constraint ‘Ring r’ is not bound in RULE lhs
Orig bndrs: [r, m, $dRing_agsA, $dGroup_agsB, $dModule_agsC]
Orig lhs: let {
$dGroup_agAl :: Group m
[LclId, Str=DmdType]
$dGroup_agAl =
Data.Algebra.Module.$p2Module @ r @ m $dModule_agsC } in
let {
$dRing_agAk :: Ring r
[LclId, Str=DmdType]
$dRing_agAk =
Data.Algebra.Module.$p1Module @ r @ m $dModule_agsC } in
let {
$dGroup_agAm :: Group r
[LclId, Str=DmdType]
$dGroup_agAm = Data.Algebra.Ring.$p1Ring @ r $dRing_agAk } in
let {
$dGroup_agAj :: Group r
[LclId, Str=DmdType]
$dGroup_agAj = Data.Algebra.Ring.$p1Ring @ r $dRing_agsA } in
let {
$dModule_agsL :: Module r m
[LclId, Str=DmdType]
$dModule_agsL = $dModule_agsC } in
let {
$dModule_agsK :: Module r m
[LclId, Str=DmdType]
$dModule_agsK = $dModule_agsC } in
let {
$dModule_agsJ :: Module r m
[LclId, Str=DmdType]
$dModule_agsJ = $dModule_agsC } in
let {
$dGroup_agsI :: Group (m, m, m)
[LclId, Str=DmdType]
$dGroup_agsI = $dGroup_agsB } in
let {
$dRing_agsH :: Ring r
[LclId, Str=DmdType]
$dRing_agsH = $dRing_agAk } in
$c*^
@ r
@ m
@ m
@ m
$dRing_agsH
$dGroup_agsI
$dModule_agsJ
$dModule_agsK
$dModule_agsL
optimised lhs: $c*^
@ r
@ m
@ m
@ m
(Data.Algebra.Module.$p1Module @ r @ m $dModule_agsC)
$dGroup_agsB
$dModule_agsJ
$dModule_agsK
$dModule_agsL
Data/Algebra/Module.hs:71:9: Warning:
Forall'd constraint ‘Ring r’ is not bound in RULE lhs
Orig bndrs: [r, m, $dRing_agrH, $dGroup_agrI, $dModule_agrJ]
Orig lhs: let {
$dGroup_agzV :: Group m
[LclId, Str=DmdType]
$dGroup_agzV =
Data.Algebra.Module.$p2Module @ r @ m $dModule_agrJ } in
let {
$dRing_agzU :: Ring r
[LclId, Str=DmdType]
$dRing_agzU =
Data.Algebra.Module.$p1Module @ r @ m $dModule_agrJ } in
let {
$dGroup_agzW :: Group r
[LclId, Str=DmdType]
$dGroup_agzW = Data.Algebra.Ring.$p1Ring @ r $dRing_agzU } in
let {
$dGroup_agzT :: Group r
[LclId, Str=DmdType]
$dGroup_agzT = Data.Algebra.Ring.$p1Ring @ r $dRing_agrH } in
let {
$dModule_agrU :: Module r m
[LclId, Str=DmdType]
$dModule_agrU = $dModule_agrJ } in
let {
$dModule_agrT :: Module r m
[LclId, Str=DmdType]
$dModule_agrT = $dModule_agrJ } in
let {
$dModule_agrS :: Module r m
[LclId, Str=DmdType]
$dModule_agrS = $dModule_agrJ } in
let {
$dModule_agrR :: Module r m
[LclId, Str=DmdType]
$dModule_agrR = $dModule_agrJ } in
let {
$dGroup_agrQ :: Group (m, m, m, m)
[LclId, Str=DmdType]
$dGroup_agrQ = $dGroup_agrI } in
let {
$dRing_agrP :: Ring r
[LclId, Str=DmdType]
$dRing_agrP = $dRing_agzU } in
Data.Algebra.Module.$fModuler(,,,)
@ r
@ m
@ m
@ m
@ m
$dRing_agrP
$dGroup_agrQ
$dModule_agrR
$dModule_agrS
$dModule_agrT
$dModule_agrU
optimised lhs: Data.Algebra.Module.$fModuler(,,,)
@ r
@ m
@ m
@ m
@ m
(Data.Algebra.Module.$p1Module @ r @ m $dModule_agrJ)
$dGroup_agrI
$dModule_agrR
$dModule_agrS
$dModule_agrT
$dModule_agrU
Data/Algebra/Module.hs:71:9: Warning:
Forall'd constraint ‘Ring r’ is not bound in RULE lhs
Orig bndrs: [r, m, $dRing_agrH, $dGroup_agrI, $dModule_agrJ]
Orig lhs: let {
$dGroup_agzV :: Group m
[LclId, Str=DmdType]
$dGroup_agzV =
Data.Algebra.Module.$p2Module @ r @ m $dModule_agrJ } in
let {
$dRing_agzU :: Ring r
[LclId, Str=DmdType]
$dRing_agzU =
Data.Algebra.Module.$p1Module @ r @ m $dModule_agrJ } in
let {
$dGroup_agzW :: Group r
[LclId, Str=DmdType]
$dGroup_agzW = Data.Algebra.Ring.$p1Ring @ r $dRing_agzU } in
let {
$dGroup_agzT :: Group r
[LclId, Str=DmdType]
$dGroup_agzT = Data.Algebra.Ring.$p1Ring @ r $dRing_agrH } in
let {
$dModule_agrU :: Module r m
[LclId, Str=DmdType]
$dModule_agrU = $dModule_agrJ } in
let {
$dModule_agrT :: Module r m
[LclId, Str=DmdType]
$dModule_agrT = $dModule_agrJ } in
let {
$dModule_agrS :: Module r m
[LclId, Str=DmdType]
$dModule_agrS = $dModule_agrJ } in
let {
$dModule_agrR :: Module r m
[LclId, Str=DmdType]
$dModule_agrR = $dModule_agrJ } in
let {
$dGroup_agrQ :: Group (m, m, m, m)
[LclId, Str=DmdType]
$dGroup_agrQ = $dGroup_agrI } in
let {
$dRing_agrP :: Ring r
[LclId, Str=DmdType]
$dRing_agrP = $dRing_agzU } in
$c*^
@ r
@ m
@ m
@ m
@ m
$dRing_agrP
$dGroup_agrQ
$dModule_agrR
$dModule_agrS
$dModule_agrT
$dModule_agrU
optimised lhs: $c*^
@ r
@ m
@ m
@ m
@ m
(Data.Algebra.Module.$p1Module @ r @ m $dModule_agrJ)
$dGroup_agrI
$dModule_agrR
$dModule_agrS
$dModule_agrT
$dModule_agrU
[ 7 of 21] Compiling Data.Algebra.Field ( Data/Algebra/Field.hs, dist/build/Data/Algebra/Field.o )
Data/Algebra/Field.hs:11:1: Warning: Tab character
Data/Algebra/Field.hs:12:1: Warning: Tab character
Data/Algebra/Field.hs:13:1: Warning: Tab character
Data/Algebra/Field.hs:14:1: Warning: Tab character
Data/Algebra/Field.hs:17:1: Warning: Tab character
Data/Algebra/Field.hs:20:1: Warning: Tab character
Data/Algebra/Field.hs:21:1: Warning: Tab character
[ 8 of 21] Compiling Data.LinearProgram.Types ( Data/LinearProgram/Types.hs, dist/build/Data/LinearProgram/Types.o )
[ 9 of 21] Compiling Data.Algebra ( Data/Algebra.hs, dist/build/Data/Algebra.o )
Data/Algebra.hs:12:1: Warning: Tab character
Data/Algebra.hs:13:1: Warning: Tab character
Data/Algebra.hs:14:1: Warning: Tab character
Data/Algebra.hs:15:1: Warning: Tab character
Data/Algebra.hs:16:1: Warning: Tab character
Data/Algebra.hs:17:1: Warning: Tab character
Data/Algebra.hs:18:1: Warning: Tab character
Data/Algebra.hs:19:1: Warning: Tab character
Data/Algebra.hs:20:1: Warning: Tab character
Data/Algebra.hs:21:1: Warning: Tab character
Data/Algebra.hs:22:1: Warning: Tab character
Data/Algebra.hs:23:1: Warning: Tab character
Data/Algebra.hs:24:1: Warning: Tab character
Data/Algebra.hs:25:1: Warning: Tab character
Data/Algebra.hs:26:1: Warning: Tab character
Data/Algebra.hs:27:1: Warning: Tab character
Data/Algebra.hs:28:1: Warning: Tab character
Data/Algebra.hs:29:1: Warning: Tab character
Data/Algebra.hs:30:1: Warning: Tab character
[10 of 21] Compiling Data.LinearProgram.LinExpr ( Data/LinearProgram/LinExpr.hs, dist/build/Data/LinearProgram/LinExpr.o )
Data/LinearProgram/LinExpr.hs:3:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:28:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:29:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:30:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:31:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:34:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:38:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:38:16: Warning: Tab character
Data/LinearProgram/LinExpr.hs:39:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:39:15: Warning: Tab character
Data/LinearProgram/LinExpr.hs:43:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:50:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:50:16: Warning: Tab character
Data/LinearProgram/LinExpr.hs:51:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:52:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:56:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:57:1: Warning: Tab character
Data/LinearProgram/LinExpr.hs:58:1: Warning: Tab character
[11 of 21] Compiling Data.LinearProgram.Spec ( Data/LinearProgram/Spec.hs, dist/build/Data/LinearProgram/Spec.o )
[12 of 21] Compiling Data.LinearProgram.Common ( Data/LinearProgram/Common.hs, dist/build/Data/LinearProgram/Common.o )
Data/LinearProgram/Common.hs:4:1: Warning: Tab character
Data/LinearProgram/Common.hs:5:1: Warning: Tab character
Data/LinearProgram/Common.hs:6:1: Warning: Tab character
Data/LinearProgram/Common.hs:16:1: Warning: Tab character
Data/LinearProgram/Common.hs:17:1: Warning: Tab character
Data/LinearProgram/Common.hs:18:1: Warning: Tab character
Data/LinearProgram/Common.hs:19:1: Warning: Tab character
[13 of 21] Compiling Control.Monad.LPMonad.Internal ( Control/Monad/LPMonad/Internal.hs, dist/build/Control/Monad/LPMonad/Internal.o )
Control/Monad/LPMonad/Internal.hs:84:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avVy :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avVy = GHC.Base.$p1Monad @ m $dMonad_avMc } in
let {
$dFunctor_avVz :: Functor m
[LclId, Str=DmdType]
$dFunctor_avVz =
GHC.Base.$p1Applicative @ m $dApplicative_avVy } in
setDirection
@ (StateT (LP v c) m)
@ v
@ c
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avVz)
$dFunctor_avVz
$dMonad_avMc)
$dMonad_avMc)
$dMonad_avMc)
Orig lhs: let {
$dApplicative_avVy :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avVy = GHC.Base.$p1Monad @ m $dMonad_avMc } in
let {
$dFunctor_avVz :: Functor m
[LclId, Str=DmdType]
$dFunctor_avVz =
GHC.Base.$p1Applicative @ m $dApplicative_avVy } in
let {
$dFunctor_avVC :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avVC =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avVz } in
let {
$dApplicative_avVB :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avVB =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avVC $dFunctor_avVz $dMonad_avMc } in
let {
$dMonad_avVA :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avVA =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avVB $dMonad_avMc } in
let {
$dMonadState_avMg :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avMg =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avVA $dMonad_avMc } in
setDirection @ (StateT (LP v c) m) @ v @ c $dMonadState_avMg
Control/Monad/LPMonad/Internal.hs:88:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avVh :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avVh = GHC.Base.$p1Monad @ m $dMonad_avLc } in
let {
$dFunctor_avVi :: Functor m
[LclId, Str=DmdType]
$dFunctor_avVi =
GHC.Base.$p1Applicative @ m $dApplicative_avVh } in
equal
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avLa
$dGroup_avLb
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avVi)
$dFunctor_avVi
$dMonad_avLc)
$dMonad_avLc)
$dMonad_avLc)
Orig lhs: let {
$dApplicative_avVh :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avVh = GHC.Base.$p1Monad @ m $dMonad_avLc } in
let {
$dFunctor_avVi :: Functor m
[LclId, Str=DmdType]
$dFunctor_avVi =
GHC.Base.$p1Applicative @ m $dApplicative_avVh } in
let {
$dFunctor_avVl :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avVl =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avVi } in
let {
$dApplicative_avVk :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avVk =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avVl $dFunctor_avVi $dMonad_avLc } in
let {
$dMonad_avVj :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avVj =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avVk $dMonad_avLc } in
let {
$dEq_avVg :: Eq v
[LclId, Str=DmdType]
$dEq_avVg = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avLa } in
let {
$dMonadState_avLi :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avLi =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avVj $dMonad_avLc } in
let {
$dGroup_avLh :: Group c
[LclId, Str=DmdType]
$dGroup_avLh = $dGroup_avLb } in
let {
$dOrd_avLg :: Ord v
[LclId, Str=DmdType]
$dOrd_avLg = $dOrd_avLa } in
equal
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avLg
$dGroup_avLh
$dMonadState_avLi
Control/Monad/LPMonad/Internal.hs:90:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avUF :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avUF = GHC.Base.$p1Monad @ m $dMonad_avIi } in
let {
$dFunctor_avUG :: Functor m
[LclId, Str=DmdType]
$dFunctor_avUG =
GHC.Base.$p1Applicative @ m $dApplicative_avUF } in
leq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avIg
$dGroup_avIh
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avUG)
$dFunctor_avUG
$dMonad_avIi)
$dMonad_avIi)
$dMonad_avIi)
Orig lhs: let {
$dApplicative_avUF :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avUF = GHC.Base.$p1Monad @ m $dMonad_avIi } in
let {
$dFunctor_avUG :: Functor m
[LclId, Str=DmdType]
$dFunctor_avUG =
GHC.Base.$p1Applicative @ m $dApplicative_avUF } in
let {
$dFunctor_avUJ :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avUJ =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avUG } in
let {
$dApplicative_avUI :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avUI =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avUJ $dFunctor_avUG $dMonad_avIi } in
let {
$dMonad_avUH :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avUH =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avUI $dMonad_avIi } in
let {
$dEq_avUE :: Eq v
[LclId, Str=DmdType]
$dEq_avUE = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avIg } in
let {
$dMonadState_avIo :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avIo =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avUH $dMonad_avIi } in
let {
$dGroup_avIn :: Group c
[LclId, Str=DmdType]
$dGroup_avIn = $dGroup_avIh } in
let {
$dOrd_avIm :: Ord v
[LclId, Str=DmdType]
$dOrd_avIm = $dOrd_avIg } in
leq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avIm
$dGroup_avIn
$dMonadState_avIo
Control/Monad/LPMonad/Internal.hs:92:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avUY :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avUY = GHC.Base.$p1Monad @ m $dMonad_avJK } in
let {
$dFunctor_avUZ :: Functor m
[LclId, Str=DmdType]
$dFunctor_avUZ =
GHC.Base.$p1Applicative @ m $dApplicative_avUY } in
geq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avJI
$dGroup_avJJ
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avUZ)
$dFunctor_avUZ
$dMonad_avJK)
$dMonad_avJK)
$dMonad_avJK)
Orig lhs: let {
$dApplicative_avUY :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avUY = GHC.Base.$p1Monad @ m $dMonad_avJK } in
let {
$dFunctor_avUZ :: Functor m
[LclId, Str=DmdType]
$dFunctor_avUZ =
GHC.Base.$p1Applicative @ m $dApplicative_avUY } in
let {
$dFunctor_avV2 :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avV2 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avUZ } in
let {
$dApplicative_avV1 :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avV1 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avV2 $dFunctor_avUZ $dMonad_avJK } in
let {
$dMonad_avV0 :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avV0 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avV1 $dMonad_avJK } in
let {
$dEq_avUX :: Eq v
[LclId, Str=DmdType]
$dEq_avUX = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avJI } in
let {
$dMonadState_avJQ :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avJQ =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avV0 $dMonad_avJK } in
let {
$dGroup_avJP :: Group c
[LclId, Str=DmdType]
$dGroup_avJP = $dGroup_avJJ } in
let {
$dOrd_avJO :: Ord v
[LclId, Str=DmdType]
$dOrd_avJO = $dOrd_avJI } in
geq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avJO
$dGroup_avJP
$dMonadState_avJQ
Control/Monad/LPMonad/Internal.hs:104:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avUm :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avUm = GHC.Base.$p1Monad @ m $dMonad_avGQ } in
let {
$dFunctor_avUn :: Functor m
[LclId, Str=DmdType]
$dFunctor_avUn =
GHC.Base.$p1Applicative @ m $dApplicative_avUm } in
equal'
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avGO
$dGroup_avGP
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avUn)
$dFunctor_avUn
$dMonad_avGQ)
$dMonad_avGQ)
$dMonad_avGQ)
Orig lhs: let {
$dApplicative_avUm :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avUm = GHC.Base.$p1Monad @ m $dMonad_avGQ } in
let {
$dFunctor_avUn :: Functor m
[LclId, Str=DmdType]
$dFunctor_avUn =
GHC.Base.$p1Applicative @ m $dApplicative_avUm } in
let {
$dFunctor_avUq :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avUq =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avUn } in
let {
$dApplicative_avUp :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avUp =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avUq $dFunctor_avUn $dMonad_avGQ } in
let {
$dMonad_avUo :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avUo =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avUp $dMonad_avGQ } in
let {
$dEq_avUl :: Eq v
[LclId, Str=DmdType]
$dEq_avUl = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avGO } in
let {
$dMonadState_avGW :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avGW =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avUo $dMonad_avGQ } in
let {
$dGroup_avGV :: Group c
[LclId, Str=DmdType]
$dGroup_avGV = $dGroup_avGP } in
let {
$dOrd_avGU :: Ord v
[LclId, Str=DmdType]
$dOrd_avGU = $dOrd_avGO } in
equal'
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avGU
$dGroup_avGV
$dMonadState_avGW
Control/Monad/LPMonad/Internal.hs:106:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avU3 :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avU3 = GHC.Base.$p1Monad @ m $dMonad_avFo } in
let {
$dFunctor_avU4 :: Functor m
[LclId, Str=DmdType]
$dFunctor_avU4 =
GHC.Base.$p1Applicative @ m $dApplicative_avU3 } in
geq'
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avFm
$dGroup_avFn
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avU4)
$dFunctor_avU4
$dMonad_avFo)
$dMonad_avFo)
$dMonad_avFo)
Orig lhs: let {
$dApplicative_avU3 :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avU3 = GHC.Base.$p1Monad @ m $dMonad_avFo } in
let {
$dFunctor_avU4 :: Functor m
[LclId, Str=DmdType]
$dFunctor_avU4 =
GHC.Base.$p1Applicative @ m $dApplicative_avU3 } in
let {
$dFunctor_avU7 :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avU7 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avU4 } in
let {
$dApplicative_avU6 :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avU6 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avU7 $dFunctor_avU4 $dMonad_avFo } in
let {
$dMonad_avU5 :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avU5 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avU6 $dMonad_avFo } in
let {
$dEq_avU2 :: Eq v
[LclId, Str=DmdType]
$dEq_avU2 = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avFm } in
let {
$dMonadState_avFu :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avFu =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avU5 $dMonad_avFo } in
let {
$dGroup_avFt :: Group c
[LclId, Str=DmdType]
$dGroup_avFt = $dGroup_avFn } in
let {
$dOrd_avFs :: Ord v
[LclId, Str=DmdType]
$dOrd_avFs = $dOrd_avFm } in
geq'
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avFs
$dGroup_avFt
$dMonadState_avFu
Control/Monad/LPMonad/Internal.hs:108:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avTK :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avTK = GHC.Base.$p1Monad @ m $dMonad_avDS } in
let {
$dFunctor_avTL :: Functor m
[LclId, Str=DmdType]
$dFunctor_avTL =
GHC.Base.$p1Applicative @ m $dApplicative_avTK } in
leq'
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avDQ
$dGroup_avDR
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avTL)
$dFunctor_avTL
$dMonad_avDS)
$dMonad_avDS)
$dMonad_avDS)
Orig lhs: let {
$dApplicative_avTK :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avTK = GHC.Base.$p1Monad @ m $dMonad_avDS } in
let {
$dFunctor_avTL :: Functor m
[LclId, Str=DmdType]
$dFunctor_avTL =
GHC.Base.$p1Applicative @ m $dApplicative_avTK } in
let {
$dFunctor_avTO :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avTO =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avTL } in
let {
$dApplicative_avTN :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avTN =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avTO $dFunctor_avTL $dMonad_avDS } in
let {
$dMonad_avTM :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avTM =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avTN $dMonad_avDS } in
let {
$dEq_avTJ :: Eq v
[LclId, Str=DmdType]
$dEq_avTJ = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avDQ } in
let {
$dMonadState_avDY :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avDY =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avTM $dMonad_avDS } in
let {
$dGroup_avDX :: Group c
[LclId, Str=DmdType]
$dGroup_avDX = $dGroup_avDR } in
let {
$dOrd_avDW :: Ord v
[LclId, Str=DmdType]
$dOrd_avDW = $dOrd_avDQ } in
leq'
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avDW
$dGroup_avDX
$dMonadState_avDY
Control/Monad/LPMonad/Internal.hs:116:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avTs :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avTs = GHC.Base.$p1Monad @ m $dMonad_avCw } in
let {
$dFunctor_avTt :: Functor m
[LclId, Str=DmdType]
$dFunctor_avTt =
GHC.Base.$p1Applicative @ m $dApplicative_avTs } in
equalTo
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avTt)
$dFunctor_avTt
$dMonad_avCw)
$dMonad_avCw)
$dMonad_avCw)
Orig lhs: let {
$dApplicative_avTs :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avTs = GHC.Base.$p1Monad @ m $dMonad_avCw } in
let {
$dFunctor_avTt :: Functor m
[LclId, Str=DmdType]
$dFunctor_avTt =
GHC.Base.$p1Applicative @ m $dApplicative_avTs } in
let {
$dFunctor_avTw :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avTw =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avTt } in
let {
$dApplicative_avTv :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avTv =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avTw $dFunctor_avTt $dMonad_avCw } in
let {
$dMonad_avTu :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avTu =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avTv $dMonad_avCw } in
let {
$dMonadState_avCA :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avCA =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avTu $dMonad_avCw } in
equalTo @ v @ c @ (StateT (LP v c) m) $dMonadState_avCA
Control/Monad/LPMonad/Internal.hs:117:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avSW :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSW = GHC.Base.$p1Monad @ m $dMonad_avAE } in
let {
$dFunctor_avSX :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSX =
GHC.Base.$p1Applicative @ m $dApplicative_avSW } in
geqTo
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSX)
$dFunctor_avSX
$dMonad_avAE)
$dMonad_avAE)
$dMonad_avAE)
Orig lhs: let {
$dApplicative_avSW :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSW = GHC.Base.$p1Monad @ m $dMonad_avAE } in
let {
$dFunctor_avSX :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSX =
GHC.Base.$p1Applicative @ m $dApplicative_avSW } in
let {
$dFunctor_avT0 :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avT0 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSX } in
let {
$dApplicative_avSZ :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avSZ =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avT0 $dFunctor_avSX $dMonad_avAE } in
let {
$dMonad_avSY :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avSY =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avSZ $dMonad_avAE } in
let {
$dMonadState_avAI :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avAI =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avSY $dMonad_avAE } in
geqTo @ v @ c @ (StateT (LP v c) m) $dMonadState_avAI
Control/Monad/LPMonad/Internal.hs:118:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avTc :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avTc = GHC.Base.$p1Monad @ m $dMonad_avBA } in
let {
$dFunctor_avTd :: Functor m
[LclId, Str=DmdType]
$dFunctor_avTd =
GHC.Base.$p1Applicative @ m $dApplicative_avTc } in
leqTo
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avTd)
$dFunctor_avTd
$dMonad_avBA)
$dMonad_avBA)
$dMonad_avBA)
Orig lhs: let {
$dApplicative_avTc :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avTc = GHC.Base.$p1Monad @ m $dMonad_avBA } in
let {
$dFunctor_avTd :: Functor m
[LclId, Str=DmdType]
$dFunctor_avTd =
GHC.Base.$p1Applicative @ m $dApplicative_avTc } in
let {
$dFunctor_avTg :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avTg =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avTd } in
let {
$dApplicative_avTf :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avTf =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avTg $dFunctor_avTd $dMonad_avBA } in
let {
$dMonad_avTe :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avTe =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avTf $dMonad_avBA } in
let {
$dMonadState_avBE :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avBE =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avTe $dMonad_avBA } in
leqTo @ v @ c @ (StateT (LP v c) m) $dMonadState_avBE
Control/Monad/LPMonad/Internal.hs:125:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avSG :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSG = GHC.Base.$p1Monad @ m $dMonad_avzI } in
let {
$dFunctor_avSH :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSH =
GHC.Base.$p1Applicative @ m $dApplicative_avSG } in
equalTo'
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSH)
$dFunctor_avSH
$dMonad_avzI)
$dMonad_avzI)
$dMonad_avzI)
Orig lhs: let {
$dApplicative_avSG :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSG = GHC.Base.$p1Monad @ m $dMonad_avzI } in
let {
$dFunctor_avSH :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSH =
GHC.Base.$p1Applicative @ m $dApplicative_avSG } in
let {
$dFunctor_avSK :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avSK =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSH } in
let {
$dApplicative_avSJ :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avSJ =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avSK $dFunctor_avSH $dMonad_avzI } in
let {
$dMonad_avSI :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avSI =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avSJ $dMonad_avzI } in
let {
$dMonadState_avzM :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avzM =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avSI $dMonad_avzI } in
equalTo' @ v @ c @ (StateT (LP v c) m) $dMonadState_avzM
Control/Monad/LPMonad/Internal.hs:127:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avSa :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSa = GHC.Base.$p1Monad @ m $dMonad_avxQ } in
let {
$dFunctor_avSb :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSb =
GHC.Base.$p1Applicative @ m $dApplicative_avSa } in
geqTo'
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSb)
$dFunctor_avSb
$dMonad_avxQ)
$dMonad_avxQ)
$dMonad_avxQ)
Orig lhs: let {
$dApplicative_avSa :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSa = GHC.Base.$p1Monad @ m $dMonad_avxQ } in
let {
$dFunctor_avSb :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSb =
GHC.Base.$p1Applicative @ m $dApplicative_avSa } in
let {
$dFunctor_avSe :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avSe =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSb } in
let {
$dApplicative_avSd :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avSd =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avSe $dFunctor_avSb $dMonad_avxQ } in
let {
$dMonad_avSc :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avSc =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avSd $dMonad_avxQ } in
let {
$dMonadState_avxU :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avxU =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avSc $dMonad_avxQ } in
geqTo' @ v @ c @ (StateT (LP v c) m) $dMonadState_avxU
Control/Monad/LPMonad/Internal.hs:129:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avSq :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSq = GHC.Base.$p1Monad @ m $dMonad_avyM } in
let {
$dFunctor_avSr :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSr =
GHC.Base.$p1Applicative @ m $dApplicative_avSq } in
leqTo'
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSr)
$dFunctor_avSr
$dMonad_avyM)
$dMonad_avyM)
$dMonad_avyM)
Orig lhs: let {
$dApplicative_avSq :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avSq = GHC.Base.$p1Monad @ m $dMonad_avyM } in
let {
$dFunctor_avSr :: Functor m
[LclId, Str=DmdType]
$dFunctor_avSr =
GHC.Base.$p1Applicative @ m $dApplicative_avSq } in
let {
$dFunctor_avSu :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avSu =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avSr } in
let {
$dApplicative_avSt :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avSt =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avSu $dFunctor_avSr $dMonad_avyM } in
let {
$dMonad_avSs :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avSs =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avSt $dMonad_avyM } in
let {
$dMonadState_avyQ :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avyQ =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avSs $dMonad_avyM } in
leqTo' @ v @ c @ (StateT (LP v c) m) $dMonadState_avyQ
Control/Monad/LPMonad/Internal.hs:171:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avRS :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avRS = GHC.Base.$p1Monad @ m $dMonad_avwO } in
let {
$dFunctor_avRT :: Functor m
[LclId, Str=DmdType]
$dFunctor_avRT =
GHC.Base.$p1Applicative @ m $dApplicative_avRS } in
varEq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avwM
$dOrd_avwN
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avRT)
$dFunctor_avRT
$dMonad_avwO)
$dMonad_avwO)
$dMonad_avwO)
Orig lhs: let {
$dApplicative_avRS :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avRS = GHC.Base.$p1Monad @ m $dMonad_avwO } in
let {
$dFunctor_avRT :: Functor m
[LclId, Str=DmdType]
$dFunctor_avRT =
GHC.Base.$p1Applicative @ m $dApplicative_avRS } in
let {
$dFunctor_avRW :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avRW =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avRT } in
let {
$dApplicative_avRV :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avRV =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avRW $dFunctor_avRT $dMonad_avwO } in
let {
$dMonad_avRU :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avRU =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avRV $dMonad_avwO } in
let {
$dEq_avRR :: Eq c
[LclId, Str=DmdType]
$dEq_avRR = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ c $dOrd_avwN } in
let {
$dEq_avRQ :: Eq v
[LclId, Str=DmdType]
$dEq_avRQ = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avwM } in
let {
$dMonadState_avwU :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avwU =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avRU $dMonad_avwO } in
let {
$dOrd_avwT :: Ord c
[LclId, Str=DmdType]
$dOrd_avwT = $dOrd_avwN } in
let {
$dOrd_avwS :: Ord v
[LclId, Str=DmdType]
$dOrd_avwS = $dOrd_avwM } in
varEq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avwS
$dOrd_avwT
$dMonadState_avwU
Control/Monad/LPMonad/Internal.hs:173:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avRw :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avRw = GHC.Base.$p1Monad @ m $dMonad_avvr } in
let {
$dFunctor_avRx :: Functor m
[LclId, Str=DmdType]
$dFunctor_avRx =
GHC.Base.$p1Applicative @ m $dApplicative_avRw } in
varLeq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avvp
$dOrd_avvq
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avRx)
$dFunctor_avRx
$dMonad_avvr)
$dMonad_avvr)
$dMonad_avvr)
Orig lhs: let {
$dApplicative_avRw :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avRw = GHC.Base.$p1Monad @ m $dMonad_avvr } in
let {
$dFunctor_avRx :: Functor m
[LclId, Str=DmdType]
$dFunctor_avRx =
GHC.Base.$p1Applicative @ m $dApplicative_avRw } in
let {
$dFunctor_avRA :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avRA =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avRx } in
let {
$dApplicative_avRz :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avRz =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avRA $dFunctor_avRx $dMonad_avvr } in
let {
$dMonad_avRy :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avRy =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avRz $dMonad_avvr } in
let {
$dEq_avRv :: Eq c
[LclId, Str=DmdType]
$dEq_avRv = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ c $dOrd_avvq } in
let {
$dEq_avRu :: Eq v
[LclId, Str=DmdType]
$dEq_avRu = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avvp } in
let {
$dMonadState_avvx :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avvx =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avRy $dMonad_avvr } in
let {
$dOrd_avvw :: Ord c
[LclId, Str=DmdType]
$dOrd_avvw = $dOrd_avvq } in
let {
$dOrd_avvv :: Ord v
[LclId, Str=DmdType]
$dOrd_avvv = $dOrd_avvp } in
varLeq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avvv
$dOrd_avvw
$dMonadState_avvx
Control/Monad/LPMonad/Internal.hs:175:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avRa :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avRa = GHC.Base.$p1Monad @ m $dMonad_avu4 } in
let {
$dFunctor_avRb :: Functor m
[LclId, Str=DmdType]
$dFunctor_avRb =
GHC.Base.$p1Applicative @ m $dApplicative_avRa } in
varGeq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avu2
$dOrd_avu3
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avRb)
$dFunctor_avRb
$dMonad_avu4)
$dMonad_avu4)
$dMonad_avu4)
Orig lhs: let {
$dApplicative_avRa :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avRa = GHC.Base.$p1Monad @ m $dMonad_avu4 } in
let {
$dFunctor_avRb :: Functor m
[LclId, Str=DmdType]
$dFunctor_avRb =
GHC.Base.$p1Applicative @ m $dApplicative_avRa } in
let {
$dFunctor_avRe :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avRe =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avRb } in
let {
$dApplicative_avRd :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avRd =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avRe $dFunctor_avRb $dMonad_avu4 } in
let {
$dMonad_avRc :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avRc =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avRd $dMonad_avu4 } in
let {
$dEq_avR9 :: Eq c
[LclId, Str=DmdType]
$dEq_avR9 = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ c $dOrd_avu3 } in
let {
$dEq_avR8 :: Eq v
[LclId, Str=DmdType]
$dEq_avR8 = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avu2 } in
let {
$dMonadState_avua :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avua =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avRc $dMonad_avu4 } in
let {
$dOrd_avu9 :: Ord c
[LclId, Str=DmdType]
$dOrd_avu9 = $dOrd_avu3 } in
let {
$dOrd_avu8 :: Ord v
[LclId, Str=DmdType]
$dOrd_avu8 = $dOrd_avu2 } in
varGeq
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avu8
$dOrd_avu9
$dMonadState_avua
Control/Monad/LPMonad/Internal.hs:185:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avQO :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avQO = GHC.Base.$p1Monad @ m $dMonad_avsH } in
let {
$dFunctor_avQP :: Functor m
[LclId, Str=DmdType]
$dFunctor_avQP =
GHC.Base.$p1Applicative @ m $dApplicative_avQO } in
varBds
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avsF
$dOrd_avsG
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avQP)
$dFunctor_avQP
$dMonad_avsH)
$dMonad_avsH)
$dMonad_avsH)
Orig lhs: let {
$dApplicative_avQO :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avQO = GHC.Base.$p1Monad @ m $dMonad_avsH } in
let {
$dFunctor_avQP :: Functor m
[LclId, Str=DmdType]
$dFunctor_avQP =
GHC.Base.$p1Applicative @ m $dApplicative_avQO } in
let {
$dFunctor_avQS :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avQS =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avQP } in
let {
$dApplicative_avQR :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avQR =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avQS $dFunctor_avQP $dMonad_avsH } in
let {
$dMonad_avQQ :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avQQ =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avQR $dMonad_avsH } in
let {
$dEq_avQN :: Eq c
[LclId, Str=DmdType]
$dEq_avQN = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ c $dOrd_avsG } in
let {
$dEq_avQM :: Eq v
[LclId, Str=DmdType]
$dEq_avQM = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avsF } in
let {
$dMonadState_avsN :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avsN =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avQQ $dMonad_avsH } in
let {
$dOrd_avsM :: Ord c
[LclId, Str=DmdType]
$dOrd_avsM = $dOrd_avsG } in
let {
$dOrd_avsL :: Ord v
[LclId, Str=DmdType]
$dOrd_avsL = $dOrd_avsF } in
varBds
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avsL
$dOrd_avsM
$dMonadState_avsN
Control/Monad/LPMonad/Internal.hs:193:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avQu :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avQu = GHC.Base.$p1Monad @ m $dMonad_avrq } in
let {
$dFunctor_avQv :: Functor m
[LclId, Str=DmdType]
$dFunctor_avQv =
GHC.Base.$p1Applicative @ m $dApplicative_avQu } in
constrain
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avQv)
$dFunctor_avQv
$dMonad_avrq)
$dMonad_avrq)
$dMonad_avrq)
Orig lhs: let {
$dApplicative_avQu :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avQu = GHC.Base.$p1Monad @ m $dMonad_avrq } in
let {
$dFunctor_avQv :: Functor m
[LclId, Str=DmdType]
$dFunctor_avQv =
GHC.Base.$p1Applicative @ m $dApplicative_avQu } in
let {
$dFunctor_avQy :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avQy =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avQv } in
let {
$dApplicative_avQx :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avQx =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avQy $dFunctor_avQv $dMonad_avrq } in
let {
$dMonad_avQw :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avQw =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avQx $dMonad_avrq } in
let {
$dMonadState_avru :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avru =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avQw $dMonad_avrq } in
constrain @ v @ c @ (StateT (LP v c) m) $dMonadState_avru
Control/Monad/LPMonad/Internal.hs:201:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avQe :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avQe = GHC.Base.$p1Monad @ m $dMonad_avqg } in
let {
$dFunctor_avQf :: Functor m
[LclId, Str=DmdType]
$dFunctor_avQf =
GHC.Base.$p1Applicative @ m $dApplicative_avQe } in
constrain'
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avQf)
$dFunctor_avQf
$dMonad_avqg)
$dMonad_avqg)
$dMonad_avqg)
Orig lhs: let {
$dApplicative_avQe :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avQe = GHC.Base.$p1Monad @ m $dMonad_avqg } in
let {
$dFunctor_avQf :: Functor m
[LclId, Str=DmdType]
$dFunctor_avQf =
GHC.Base.$p1Applicative @ m $dApplicative_avQe } in
let {
$dFunctor_avQi :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avQi =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avQf } in
let {
$dApplicative_avQh :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avQh =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avQi $dFunctor_avQf $dMonad_avqg } in
let {
$dMonad_avQg :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avQg =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avQh $dMonad_avqg } in
let {
$dMonadState_avqk :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avqk =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avQg $dMonad_avqg } in
constrain' @ v @ c @ (StateT (LP v c) m) $dMonadState_avqk
Control/Monad/LPMonad/Internal.hs:209:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avPY :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avPY = GHC.Base.$p1Monad @ m $dMonad_avp6 } in
let {
$dFunctor_avPZ :: Functor m
[LclId, Str=DmdType]
$dFunctor_avPZ =
GHC.Base.$p1Applicative @ m $dApplicative_avPY } in
setObjective
@ v
@ c
@ (StateT (LP v c) m)
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avPZ)
$dFunctor_avPZ
$dMonad_avp6)
$dMonad_avp6)
$dMonad_avp6)
Orig lhs: let {
$dApplicative_avPY :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avPY = GHC.Base.$p1Monad @ m $dMonad_avp6 } in
let {
$dFunctor_avPZ :: Functor m
[LclId, Str=DmdType]
$dFunctor_avPZ =
GHC.Base.$p1Applicative @ m $dApplicative_avPY } in
let {
$dFunctor_avQ2 :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avQ2 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avPZ } in
let {
$dApplicative_avQ1 :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avQ1 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avQ2 $dFunctor_avPZ $dMonad_avp6 } in
let {
$dMonad_avQ0 :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avQ0 =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avQ1 $dMonad_avp6 } in
let {
$dMonadState_avpa :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avpa =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avQ0 $dMonad_avp6 } in
setObjective @ v @ c @ (StateT (LP v c) m) $dMonadState_avpa
Control/Monad/LPMonad/Internal.hs:216:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avPe :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avPe = GHC.Base.$p1Monad @ m $dMonad_avmi } in
let {
$dFunctor_avPf :: Functor m
[LclId, Str=DmdType]
$dFunctor_avPf =
GHC.Base.$p1Applicative @ m $dApplicative_avPe } in
addObjective
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avmg
$dGroup_avmh
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avPf)
$dFunctor_avPf
$dMonad_avmi)
$dMonad_avmi)
$dMonad_avmi)
Orig lhs: let {
$dApplicative_avPe :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avPe = GHC.Base.$p1Monad @ m $dMonad_avmi } in
let {
$dFunctor_avPf :: Functor m
[LclId, Str=DmdType]
$dFunctor_avPf =
GHC.Base.$p1Applicative @ m $dApplicative_avPe } in
let {
$dFunctor_avPi :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avPi =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avPf } in
let {
$dApplicative_avPh :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avPh =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avPi $dFunctor_avPf $dMonad_avmi } in
let {
$dMonad_avPg :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avPg =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avPh $dMonad_avmi } in
let {
$dEq_avPd :: Eq v
[LclId, Str=DmdType]
$dEq_avPd = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avmg } in
let {
$dMonadState_avmo :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avmo =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avPg $dMonad_avmi } in
let {
$dGroup_avmn :: Group c
[LclId, Str=DmdType]
$dGroup_avmn = $dGroup_avmh } in
let {
$dOrd_avmm :: Ord v
[LclId, Str=DmdType]
$dOrd_avmm = $dOrd_avmg } in
addObjective
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avmm
$dGroup_avmn
$dMonadState_avmo
Control/Monad/LPMonad/Internal.hs:223:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avPE :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avPE = GHC.Base.$p1Monad @ m $dMonad_avnV } in
let {
$dFunctor_avPF :: Functor m
[LclId, Str=DmdType]
$dFunctor_avPF =
GHC.Base.$p1Applicative @ m $dApplicative_avPE } in
addWeightedObjective
@ r
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avnT
$dModule_avnU
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avPF)
$dFunctor_avPF
$dMonad_avnV)
$dMonad_avnV)
$dMonad_avnV)
Orig lhs: let {
$dApplicative_avPE :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avPE = GHC.Base.$p1Monad @ m $dMonad_avnV } in
let {
$dFunctor_avPF :: Functor m
[LclId, Str=DmdType]
$dFunctor_avPF =
GHC.Base.$p1Applicative @ m $dApplicative_avPE } in
let {
$dFunctor_avPI :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avPI =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avPF } in
let {
$dApplicative_avPH :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avPH =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avPI $dFunctor_avPF $dMonad_avnV } in
let {
$dMonad_avPG :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avPG =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avPH $dMonad_avnV } in
let {
$dGroup_avPC :: Group c
[LclId, Str=DmdType]
$dGroup_avPC =
Data.Algebra.Module.$p2Module @ r @ c $dModule_avnU } in
let {
$dRing_avPB :: Ring r
[LclId, Str=DmdType]
$dRing_avPB =
Data.Algebra.Module.$p1Module @ r @ c $dModule_avnU } in
let {
$dGroup_avPD :: Group r
[LclId, Str=DmdType]
$dGroup_avPD = Data.Algebra.Ring.$p1Ring @ r $dRing_avPB } in
let {
$dEq_avPA :: Eq v
[LclId, Str=DmdType]
$dEq_avPA = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avnT } in
let {
$dMonadState_avo2 :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avo2 =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avPG $dMonad_avnV } in
let {
$dModule_avo1 :: Module r c
[LclId, Str=DmdType]
$dModule_avo1 = $dModule_avnU } in
let {
$dOrd_avo0 :: Ord v
[LclId, Str=DmdType]
$dOrd_avo0 = $dOrd_avnT } in
addWeightedObjective
@ r
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avo0
$dModule_avo1
$dMonadState_avo2
Control/Monad/LPMonad/Internal.hs:230:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avOU :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avOU = GHC.Base.$p1Monad @ m $dMonad_avkI } in
let {
$dFunctor_avOV :: Functor m
[LclId, Str=DmdType]
$dFunctor_avOV =
GHC.Base.$p1Applicative @ m $dApplicative_avOU } in
setVarBounds
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avkG
$dOrd_avkH
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avOV)
$dFunctor_avOV
$dMonad_avkI)
$dMonad_avkI)
$dMonad_avkI)
Orig lhs: let {
$dApplicative_avOU :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avOU = GHC.Base.$p1Monad @ m $dMonad_avkI } in
let {
$dFunctor_avOV :: Functor m
[LclId, Str=DmdType]
$dFunctor_avOV =
GHC.Base.$p1Applicative @ m $dApplicative_avOU } in
let {
$dFunctor_avOY :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avOY =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avOV } in
let {
$dApplicative_avOX :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avOX =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avOY $dFunctor_avOV $dMonad_avkI } in
let {
$dMonad_avOW :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avOW =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avOX $dMonad_avkI } in
let {
$dEq_avOT :: Eq c
[LclId, Str=DmdType]
$dEq_avOT = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ c $dOrd_avkH } in
let {
$dEq_avOS :: Eq v
[LclId, Str=DmdType]
$dEq_avOS = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avkG } in
let {
$dMonadState_avkO :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avkO =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avOW $dMonad_avkI } in
let {
$dOrd_avkN :: Ord c
[LclId, Str=DmdType]
$dOrd_avkN = $dOrd_avkH } in
let {
$dOrd_avkM :: Ord v
[LclId, Str=DmdType]
$dOrd_avkM = $dOrd_avkG } in
setVarBounds
@ v
@ c
@ (StateT (LP v c) m)
$dOrd_avkM
$dOrd_avkN
$dMonadState_avkO
Control/Monad/LPMonad/Internal.hs:240:1: Warning:
RULE left-hand side too complicated to desugar
Optimised lhs: let {
$dApplicative_avOz :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avOz = GHC.Base.$p1Monad @ m $dMonad_avj6 } in
let {
$dFunctor_avOA :: Functor m
[LclId, Str=DmdType]
$dFunctor_avOA =
GHC.Base.$p1Applicative @ m $dApplicative_avOz } in
setVarKind
@ v
@ (StateT (LP v c) m)
@ c
$dOrd_avj5
(Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c)
@ m
(transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avOA)
$dFunctor_avOA
$dMonad_avj6)
$dMonad_avj6)
$dMonad_avj6)
Orig lhs: let {
$dApplicative_avOz :: Applicative m
[LclId, Str=DmdType]
$dApplicative_avOz = GHC.Base.$p1Monad @ m $dMonad_avj6 } in
let {
$dFunctor_avOA :: Functor m
[LclId, Str=DmdType]
$dFunctor_avOA =
GHC.Base.$p1Applicative @ m $dApplicative_avOz } in
let {
$dFunctor_avOD :: Functor (StateT (LP v c) m)
[LclId, Str=DmdType]
$dFunctor_avOD =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fFunctorStateT
@ (LP v c) @ m $dFunctor_avOA } in
let {
$dApplicative_avOC :: Applicative (StateT (LP v c) m)
[LclId, Str=DmdType]
$dApplicative_avOC =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fApplicativeStateT
@ (LP v c) @ m $dFunctor_avOD $dFunctor_avOA $dMonad_avj6 } in
let {
$dMonad_avOB :: Monad (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonad_avOB =
transformers-0.4.2.0:Control.Monad.Trans.State.Strict.$fMonadStateT
@ (LP v c) @ m $dApplicative_avOC $dMonad_avj6 } in
let {
$dEq_avOy :: Eq v
[LclId, Str=DmdType]
$dEq_avOy = ghc-prim-0.4.0.0:GHC.Classes.$p1Ord @ v $dOrd_avj5 } in
let {
$dMonadState_avjb :: MonadState (LP v c) (StateT (LP v c) m)
[LclId, Str=DmdType]
$dMonadState_avjb =
Control.Monad.State.Class.$fMonadStatesStateT
@ (LP v c) @ m $dMonad_avOB $dMonad_avj6 } in
let {
$dOrd_avja :: Ord v
[LclId, Str=DmdType]
$dOrd_avja = $dOrd_avj5 } in
setVarKind
@ v @ (StateT (LP v c) m) @ c $dOrd_avja $dMonadState_avjb
[14 of 21] Compiling Data.LinearProgram.GLPK.Internal ( Data/LinearProgram/GLPK/Internal.hs, dist/build/Data/LinearProgram/GLPK/Internal.o )
Data/LinearProgram/GLPK/Internal.hs:3:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:40:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:49:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:49:12: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:50:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:50:12: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:69:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:69:13: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:70:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:70:17: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:71:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:71:17: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:72:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:72:18: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:73:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:73:14: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:82:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:83:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:84:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:85:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:86:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:86:14: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:99:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:100:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:101:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:102:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:102:14: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:120:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:122:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:123:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:124:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:124:14: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:125:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:126:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:127:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:128:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:129:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:130:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:131:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:132:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:133:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:134:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:135:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:150:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:153:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:154:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:155:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:156:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:157:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:158:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:158:22: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:159:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:160:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:161:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:162:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:164:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:165:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:166:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:167:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:168:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:169:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:170:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:170:14: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:171:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:172:1: Warning: Tab character
Data/LinearProgram/GLPK/Internal.hs:173:1: Warning: Tab character
[15 of 21] Compiling Data.LinearProgram.GLPK.Common ( Data/LinearProgram/GLPK/Common.hs, dist/build/Data/LinearProgram/GLPK/Common.o )
Data/LinearProgram/GLPK/Common.hs:2:1: Warning: Tab character
Data/LinearProgram/GLPK/Common.hs:3:1: Warning: Tab character
Data/LinearProgram/GLPK/Common.hs:4:1: Warning: Tab character
Data/LinearProgram/GLPK/Common.hs:5:1: Warning: Tab character
Data/LinearProgram/GLPK/Common.hs:6:1: Warning: Tab character
[16 of 21] Compiling Data.LinearProgram.GLPK.Solver ( Data/LinearProgram/GLPK/Solver.hs, dist/build/Data/LinearProgram/GLPK/Solver.o )
Data/LinearProgram/GLPK/Solver.hs:15:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:16:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:17:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:18:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:19:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:20:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:21:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:22:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:23:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:24:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:25:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:26:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:27:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:28:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:29:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:40:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:41:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:42:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:43:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:44:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:45:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:54:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:59:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:60:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:61:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:62:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:63:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:64:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:65:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:66:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:68:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:69:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:70:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:71:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:72:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:73:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:74:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:75:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:78:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:79:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:85:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:86:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:87:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:88:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:89:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:90:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:91:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:92:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:93:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:94:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:96:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:97:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:98:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:99:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:100:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:101:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:102:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:103:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:104:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:105:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:108:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:111:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:112:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:113:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:114:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:116:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:117:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:118:1: Warning: Tab character
Data/LinearProgram/GLPK/Solver.hs:119:1: Warning: Tab character
[17 of 21] Compiling Data.LinearProgram.GLPK.IO.Internal ( Data/LinearProgram/GLPK/IO/Internal.hs, dist/build/Data/LinearProgram/GLPK/IO/Internal.o )
Data/LinearProgram/GLPK/IO/Internal.hs:50:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:50:25: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:51:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:51:20: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:77:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:79:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:80:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:81:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:81:18: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:82:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:82:18: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:83:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:83:18: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:84:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:84:18: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:85:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:85:18: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:86:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:91:13: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:92:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:93:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:94:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:95:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:96:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:97:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:98:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:99:1: Warning: Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:100:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:104:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:105:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:106:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:107:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:108:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:109:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:110:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:111:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:112:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:113:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:114:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:115:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:116:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:117:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:118:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:119:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:120:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:121:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:122:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:123:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:124:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:125:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:126:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:127:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:131:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:132:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:133:1: Warning:
Tab character
Data/LinearProgram/GLPK/IO/Internal.hs:134:1: Warning:
Tab character
[18 of 21] Compiling Data.LinearProgram.GLPK.IO ( Data/LinearProgram/GLPK/IO.hs, dist/build/Data/LinearProgram/GLPK/IO.o )
[19 of 21] Compiling Data.LinearProgram.GLPK ( Data/LinearProgram/GLPK.hs, dist/build/Data/LinearProgram/GLPK.o )
Data/LinearProgram/GLPK.hs:3:1: Warning: Tab character
Data/LinearProgram/GLPK.hs:4:1: Warning: Tab character
Data/LinearProgram/GLPK.hs:5:1: Warning: Tab character
[20 of 21] Compiling Control.Monad.LPMonad ( Control/Monad/LPMonad.hs, dist/build/Control/Monad/LPMonad.o )
Control/Monad/LPMonad.hs:13:1: Warning: Tab character
Control/Monad/LPMonad.hs:14:1: Warning: Tab character
Control/Monad/LPMonad.hs:15:1: Warning: Tab character
Control/Monad/LPMonad.hs:16:1: Warning: Tab character
Control/Monad/LPMonad.hs:17:1: Warning: Tab character
Control/Monad/LPMonad.hs:18:1: Warning: Tab character
Control/Monad/LPMonad.hs:19:1: Warning: Tab character
Control/Monad/LPMonad.hs:20:1: Warning: Tab character
Control/Monad/LPMonad.hs:21:1: Warning: Tab character
Control/Monad/LPMonad.hs:22:1: Warning: Tab character
Control/Monad/LPMonad.hs:23:1: Warning: Tab character
Control/Monad/LPMonad.hs:24:1: Warning: Tab character
Control/Monad/LPMonad.hs:25:1: Warning: Tab character
Control/Monad/LPMonad.hs:26:1: Warning: Tab character
Control/Monad/LPMonad.hs:42:1: Warning: Tab character
Control/Monad/LPMonad.hs:44:1: Warning: Tab character
Control/Monad/LPMonad.hs:48:1: Warning: Tab character
Control/Monad/LPMonad.hs:64:1: Warning: Tab character
Control/Monad/LPMonad.hs:73:1: Warning: Tab character
Control/Monad/LPMonad.hs:80:1: Warning: Tab character
Control/Monad/LPMonad.hs:90:1: Warning: Tab character
Control/Monad/LPMonad.hs:97:1: Warning: Tab character
[21 of 21] Compiling Data.LinearProgram ( Data/LinearProgram.hs, dist/build/Data/LinearProgram.o )
Data/LinearProgram.hs:2:1: Warning: Tab character
Data/LinearProgram.hs:3:1: Warning: Tab character
Data/LinearProgram.hs:4:1: Warning: Tab character
In-place registering glpk-hs-0.3.5...
Running Haddock for glpk-hs-0.3.5...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-glpk-hs-0.313905980891028363610.5
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/glpk-hs-0.3.5-B01S0pK8b0FFTc8N5BvBe2
Registering glpk-hs-0.3.5...
Installed glpk-hs-0.3.5
Configuring integration-0.2.1...
Building integration-0.2.1...
Preprocessing library integration-0.2.1...
[1 of 1] Compiling Numeric.Integration.TanhSinh ( src/Numeric/Integration/TanhSinh.hs, dist/build/Numeric/Integration/TanhSinh.o )
In-place registering integration-0.2.1...
Running Haddock for integration-0.2.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-integration-0.2303872261608340634.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/integration-0.2.1-3LIORpV8uTw2qbWYNwqacp
Registering integration-0.2.1...
Installed integration-0.2.1
Configuring vector-0.11.0.0...
Building vector-0.11.0.0...
Preprocessing library vector-0.11.0.0...
[ 1 of 21] Compiling Data.Vector.Storable.Internal ( Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.o )
[ 2 of 21] Compiling Data.Vector.Generic.Mutable.Base ( Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.o )
[ 3 of 21] Compiling Data.Vector.Generic.Base ( Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.o )
[ 4 of 21] Compiling Data.Vector.Fusion.Util ( Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.o )
Data/Vector/Fusion/Util.hs:19:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
[ 5 of 21] Compiling Data.Vector.Fusion.Bundle.Size ( Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.o )
[ 6 of 21] Compiling Data.Vector.Internal.Check ( Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.o )
[ 7 of 21] Compiling Data.Vector.Fusion.Stream.Monadic ( Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o )
Data/Vector/Fusion/Stream/Monadic.hs:93:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
[ 8 of 21] Compiling Data.Vector.Fusion.Bundle.Monadic ( Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.o )
Data/Vector/Fusion/Bundle/Monadic.hs:105:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
[ 9 of 21] Compiling Data.Vector.Fusion.Bundle ( Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.o )
Data/Vector/Fusion/Bundle.hs:114:1: Warning: Tab character
[10 of 21] Compiling Data.Vector.Generic.Mutable ( Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.o )
[11 of 21] Compiling Data.Vector.Generic.New ( Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.o )
[12 of 21] Compiling Data.Vector.Generic ( Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.o )
[13 of 21] Compiling Data.Vector.Primitive.Mutable ( Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.o )
[14 of 21] Compiling Data.Vector.Primitive ( Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.o )
Data/Vector/Primitive.hs:167:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[15 of 21] Compiling Data.Vector.Storable.Mutable ( Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.o )
[16 of 21] Compiling Data.Vector.Storable ( Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.o )
Data/Vector/Storable.hs:172:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[17 of 21] Compiling Data.Vector.Unboxed.Base ( Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.o )
Data/Vector/Unboxed/Base.hs:33:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
[18 of 21] Compiling Data.Vector.Unboxed ( Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.o )
Data/Vector/Unboxed.hs:189:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[19 of 21] Compiling Data.Vector.Unboxed.Mutable ( Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.o )
[20 of 21] Compiling Data.Vector.Mutable ( Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.o )
[21 of 21] Compiling Data.Vector ( Data/Vector.hs, dist/build/Data/Vector.o )
Data/Vector.hs:190:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
In-place registering vector-0.11.0.0...
Running Haddock for vector-0.11.0.0...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-vector-0.11.05623902792025251990.0
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/vector-0.11.0.0-A9qWf1eecPQGJD12EBZIxF
Registering vector-0.11.0.0...
Installed vector-0.11.0.0
Configuring StateVar-1.1.0.1...
Building StateVar-1.1.0.1...
Preprocessing library StateVar-1.1.0.1...
[1 of 1] Compiling Data.StateVar ( src/Data/StateVar.hs, dist/build/Data/StateVar.o )
In-place registering StateVar-1.1.0.1...
Running Haddock for StateVar-1.1.0.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-StateVar-1.1.01457880381461851014.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/StateVar-1.1.0.1-6K4a3UqSdqh6lGAm1wlr9s
Registering StateVar-1.1.0.1...
Installed StateVar-1.1.0.1
Configuring hashable-1.2.3.3...
Building hashable-1.2.3.3...
Preprocessing library hashable-1.2.3.3...
[1 of 3] Compiling Data.Hashable.Class ( Data/Hashable/Class.hs, dist/build/Data/Hashable/Class.o )
Data/Hashable/Class.hs:54:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
Data/Hashable/Class.hs:218:11: Warning:
In the use of ‘bitSize’ (imported from Data.Bits):
Deprecated: "Use 'bitSizeMaybe' or 'finiteBitSize' instead"
Data/Hashable/Class.hs:241:11: Warning:
In the use of ‘bitSize’ (imported from Data.Bits):
Deprecated: "Use 'bitSizeMaybe' or 'finiteBitSize' instead"
Data/Hashable/Class.hs:420:28: Warning:
In the use of ‘B.inlinePerformIO’
(imported from Data.ByteString.Internal):
Deprecated: "If you think you know what you are doing, use 'unsafePerformIO'. If you are sure you know what you are doing, use 'unsafeDupablePerformIO'. If you enjoy sharing an address space with a malevolent agent of chaos, try 'accursedUnutterablePerformIO'."
[2 of 3] Compiling Data.Hashable.Generic ( Data/Hashable/Generic.hs, dist/build/Data/Hashable/Generic.o )
Data/Hashable/Generic.hs:20:1: Warning:
The import of ‘Bits’ from module ‘Data.Bits’ is redundant
[3 of 3] Compiling Data.Hashable ( Data/Hashable.hs, dist/build/Data/Hashable.o )
In-place registering hashable-1.2.3.3...
Running Haddock for hashable-1.2.3.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-hashable-1.2.34870738471750829613.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/hashable-1.2.3.3-2GTZqecVp8NJZrNuKzGxfy
Registering hashable-1.2.3.3...
Installed hashable-1.2.3.3
Configuring polyparse-1.11...
Building polyparse-1.11...
Preprocessing library polyparse-1.11...
[ 1 of 18] Compiling Text.ParserCombinators.Poly.Result ( src/Text/ParserCombinators/Poly/Result.hs, dist/build/Text/ParserCombinators/Poly/Result.o )
src/Text/ParserCombinators/Poly/Result.hs:3:15: Warning:
Tab character
[ 2 of 18] Compiling Text.ParserCombinators.Poly.Base ( src/Text/ParserCombinators/Poly/Base.hs, dist/build/Text/ParserCombinators/Poly/Base.o )
src/Text/ParserCombinators/Poly/Base.hs:3:19: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:4:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:8:10: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:9:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:11:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:13:11: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:15:10: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:17:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:18:9: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:19:10: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:20:10: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:21:11: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:22:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/Base.hs:23:12: Warning:
Tab character
[ 3 of 18] Compiling Text.ParserCombinators.Poly.Parser ( src/Text/ParserCombinators/Poly/Parser.hs, dist/build/Text/ParserCombinators/Poly/Parser.o )
src/Text/ParserCombinators/Poly/Parser.hs:7:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/Parser.hs:8:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/Parser.hs:10:9: Warning:
Tab character
src/Text/ParserCombinators/Poly/Parser.hs:11:8: Warning:
Tab character
src/Text/ParserCombinators/Poly/Parser.hs:12:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/Parser.hs:13:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/Parser.hs:17:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/Parser.hs:79:18: Warning:
Tab character
[ 4 of 18] Compiling Text.ParserCombinators.Poly.Lazy ( src/Text/ParserCombinators/Poly/Lazy.hs, dist/build/Text/ParserCombinators/Poly/Lazy.o )
src/Text/ParserCombinators/Poly/Lazy.hs:4:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/Lazy.hs:5:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/Lazy.hs:6:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/Lazy.hs:8:9: Warning: Tab character
src/Text/ParserCombinators/Poly/Lazy.hs:9:8: Warning: Tab character
src/Text/ParserCombinators/Poly/Lazy.hs:10:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/Lazy.hs:11:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/Lazy.hs:15:12: Warning:
Tab character
[ 5 of 18] Compiling Text.ParserCombinators.Poly.StateParser ( src/Text/ParserCombinators/Poly/StateParser.hs, dist/build/Text/ParserCombinators/Poly/StateParser.o )
src/Text/ParserCombinators/Poly/StateParser.hs:7:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateParser.hs:8:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateParser.hs:10:9: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateParser.hs:11:8: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateParser.hs:12:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateParser.hs:19:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateParser.hs:82:18: Warning:
Tab character
[ 6 of 18] Compiling Text.ParserCombinators.Poly.State ( src/Text/ParserCombinators/Poly/State.hs, dist/build/Text/ParserCombinators/Poly/State.o )
src/Text/ParserCombinators/Poly/State.hs:3:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/State.hs:4:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/State.hs:5:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/State.hs:7:9: Warning:
Tab character
src/Text/ParserCombinators/Poly/State.hs:8:8: Warning:
Tab character
src/Text/ParserCombinators/Poly/State.hs:9:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/State.hs:10:11: Warning:
Tab character
src/Text/ParserCombinators/Poly/State.hs:16:12: Warning:
Tab character
[ 7 of 18] Compiling Text.ParserCombinators.Poly.StateLazy ( src/Text/ParserCombinators/Poly/StateLazy.hs, dist/build/Text/ParserCombinators/Poly/StateLazy.o )
src/Text/ParserCombinators/Poly/StateLazy.hs:4:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateLazy.hs:5:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateLazy.hs:6:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateLazy.hs:8:9: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateLazy.hs:9:8: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateLazy.hs:10:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateLazy.hs:12:16: Warning:
Tab character
src/Text/ParserCombinators/Poly/StateLazy.hs:18:12: Warning:
Tab character
[ 8 of 18] Compiling Text.ParserCombinators.Poly.Lex ( src/Text/ParserCombinators/Poly/Lex.hs, dist/build/Text/ParserCombinators/Poly/Lex.o )
src/Text/ParserCombinators/Poly/Lex.hs:89:18: Warning:
Tab character
[ 9 of 18] Compiling Text.ParserCombinators.Poly.ByteString ( src/Text/ParserCombinators/Poly/ByteString.hs, dist/build/Text/ParserCombinators/Poly/ByteString.o )
[10 of 18] Compiling Text.ParserCombinators.Poly.ByteStringChar ( src/Text/ParserCombinators/Poly/ByteStringChar.hs, dist/build/Text/ParserCombinators/Poly/ByteStringChar.o )
[11 of 18] Compiling Text.Parse.ByteString ( src/Text/Parse/ByteString.hs, dist/build/Text/Parse/ByteString.o )
src/Text/Parse/ByteString.hs:5:15: Warning: Tab character
src/Text/Parse/ByteString.hs:6:14: Warning: Tab character
src/Text/Parse/ByteString.hs:7:1: Warning: Tab character
src/Text/Parse/ByteString.hs:8:16: Warning: Tab character
src/Text/Parse/ByteString.hs:12:9: Warning: Tab character
src/Text/Parse/ByteString.hs:13:11: Warning: Tab character
src/Text/Parse/ByteString.hs:14:12: Warning: Tab character
src/Text/Parse/ByteString.hs:15:19: Warning: Tab character
src/Text/Parse/ByteString.hs:16:11: Warning: Tab character
src/Text/Parse/ByteString.hs:17:10: Warning: Tab character
src/Text/Parse/ByteString.hs:74:32: Warning: Tab character
src/Text/Parse/ByteString.hs:419:31: Warning: Tab character
src/Text/Parse/ByteString.hs:429:1: Warning: Tab character
[12 of 18] Compiling Text.ParserCombinators.Poly.Text ( src/Text/ParserCombinators/Poly/Text.hs, dist/build/Text/ParserCombinators/Poly/Text.o )
[13 of 18] Compiling Text.ParserCombinators.Poly.StateText ( src/Text/ParserCombinators/Poly/StateText.hs, dist/build/Text/ParserCombinators/Poly/StateText.o )
[14 of 18] Compiling Text.ParserCombinators.Poly.Plain ( src/Text/ParserCombinators/Poly/Plain.hs, dist/build/Text/ParserCombinators/Poly/Plain.o )
src/Text/ParserCombinators/Poly/Plain.hs:3:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:4:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:5:14: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:7:9: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:8:8: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:9:12: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:10:15: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:11:11: Warning:
Tab character
src/Text/ParserCombinators/Poly/Plain.hs:14:12: Warning:
Tab character
[15 of 18] Compiling Text.ParserCombinators.Poly ( src/Text/ParserCombinators/Poly.hs, dist/build/Text/ParserCombinators/Poly.o )
[16 of 18] Compiling Text.Parse ( src/Text/Parse.hs, dist/build/Text/Parse.o )
src/Text/Parse.hs:4:15: Warning: Tab character
src/Text/Parse.hs:5:14: Warning: Tab character
src/Text/Parse.hs:6:1: Warning: Tab character
src/Text/Parse.hs:7:16: Warning: Tab character
src/Text/Parse.hs:11:9: Warning: Tab character
src/Text/Parse.hs:12:11: Warning: Tab character
src/Text/Parse.hs:13:12: Warning: Tab character
src/Text/Parse.hs:14:19: Warning: Tab character
src/Text/Parse.hs:15:11: Warning: Tab character
src/Text/Parse.hs:16:10: Warning: Tab character
src/Text/Parse.hs:67:32: Warning: Tab character
src/Text/Parse.hs:389:1: Warning: Tab character
[17 of 18] Compiling Text.ParserCombinators.HuttonMeijerWallace ( src/Text/ParserCombinators/HuttonMeijerWallace.hs, dist/build/Text/ParserCombinators/HuttonMeijerWallace.o )
[18 of 18] Compiling Text.ParserCombinators.HuttonMeijer ( src/Text/ParserCombinators/HuttonMeijer.hs, dist/build/Text/ParserCombinators/HuttonMeijer.o )
In-place registering polyparse-1.11...
Running Haddock for polyparse-1.11...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-polyparse-119893523241813511382.11
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/polyparse-1.11-5gbM4m6k3rhGIQyEboR1bR
Registering polyparse-1.11...
Installed polyparse-1.11
Configuring wl-pprint-text-1.1.0.4...
Building wl-pprint-text-1.1.0.4...
Preprocessing library wl-pprint-text-1.1.0.4...
[1 of 2] Compiling Text.PrettyPrint.Leijen.Text ( Text/PrettyPrint/Leijen/Text.hs, dist/build/Text/PrettyPrint/Leijen/Text.o )
[2 of 2] Compiling Text.PrettyPrint.Leijen.Text.Monadic ( Text/PrettyPrint/Leijen/Text/Monadic.hs, dist/build/Text/PrettyPrint/Leijen/Text/Monadic.o )
In-place registering wl-pprint-text-1.1.0.4...
Running Haddock for wl-pprint-text-1.1.0.4...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-wl-pprint-text-1.1.0657852921137638147.4
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/wl-pprint-text-1.1.0.4-Eo8UcpwfxGy67b1BPEKoMG
Registering wl-pprint-text-1.1.0.4...
Installed wl-pprint-text-1.1.0.4
[1 of 1] Compiling Main ( /tmp/cabal-tmp-4661/distributive-0.4.4/dist/setup/setup.hs, /tmp/cabal-tmp-4661/distributive-0.4.4/dist/setup/Main.o )
Linking /tmp/cabal-tmp-4661/distributive-0.4.4/dist/setup/setup ...
Configuring distributive-0.4.4...
Building distributive-0.4.4...
Preprocessing library distributive-0.4.4...
[1 of 2] Compiling Data.Distributive.Generic ( src/Data/Distributive/Generic.hs, dist/build/Data/Distributive/Generic.o )
[2 of 2] Compiling Data.Distributive ( src/Data/Distributive.hs, dist/build/Data/Distributive.o )
In-place registering distributive-0.4.4...
Running Haddock for distributive-0.4.4...
setup: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-distributive-0.418061195402138078721.4
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/distributive-0.4.4-IiTFZxvjHzA0FvKz3AU35Q
Registering distributive-0.4.4...
Installed distributive-0.4.4
Configuring exceptions-0.8.0.2...
Building exceptions-0.8.0.2...
Preprocessing library exceptions-0.8.0.2...
[1 of 2] Compiling Control.Monad.Catch ( src/Control/Monad/Catch.hs, dist/build/Control/Monad/Catch.o )
[2 of 2] Compiling Control.Monad.Catch.Pure ( src/Control/Monad/Catch/Pure.hs, dist/build/Control/Monad/Catch/Pure.o )
In-place registering exceptions-0.8.0.2...
Running Haddock for exceptions-0.8.0.2...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-exceptions-0.8.019920553821818084292.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/exceptions-0.8.0.2-8GsEeHgaIks3pVGk6GaELJ
Registering exceptions-0.8.0.2...
Installed exceptions-0.8.0.2
Configuring microlens-mtl-0.1.5.0...
Building microlens-mtl-0.1.5.0...
Preprocessing library microlens-mtl-0.1.5.0...
[1 of 2] Compiling Lens.Micro.Mtl.Zoom ( src/Lens/Micro/Mtl/Zoom.hs, dist/build/Lens/Micro/Mtl/Zoom.o )
[2 of 2] Compiling Lens.Micro.Mtl ( src/Lens/Micro/Mtl.hs, dist/build/Lens/Micro/Mtl.o )
In-place registering microlens-mtl-0.1.5.0...
Running Haddock for microlens-mtl-0.1.5.0...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-microlens-mtl-0.1.51138101281366831742.0
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/microlens-mtl-0.1.5.0-4uBDutahFGC8ScFUsr0Xzp
Registering microlens-mtl-0.1.5.0...
Installed microlens-mtl-0.1.5.0
Configuring process-1.3.0.0...
configure: WARNING: unrecognized options: --with-compiler, --with-gcc
checking for gcc... gcc
checking whether the C compiler works... yes
checking for C compiler default output file name... a.out
checking for suffix of executables...
checking whether we are cross compiling... no
checking for suffix of object files... o
checking whether we are using the GNU C compiler... yes
checking whether gcc accepts -g... yes
checking for gcc option to accept ISO C89... none needed
checking how to run the C preprocessor... gcc -E
checking for grep that handles long lines and -e... /bin/grep
checking for egrep... /bin/grep -E
checking for ANSI C header files... yes
checking for sys/types.h... yes
checking for sys/stat.h... yes
checking for stdlib.h... yes
checking for string.h... yes
checking for memory.h... yes
checking for strings.h... yes
checking for inttypes.h... yes
checking for stdint.h... yes
checking for unistd.h... yes
checking for pid_t... yes
checking vfork.h usability... no
checking vfork.h presence... no
checking for vfork.h... no
checking for fork... yes
checking for vfork... yes
checking for working fork... yes
checking for working vfork... (cached) yes
checking signal.h usability... yes
checking signal.h presence... yes
checking for signal.h... yes
checking sys/wait.h usability... yes
checking sys/wait.h presence... yes
checking for sys/wait.h... yes
checking fcntl.h usability... yes
checking fcntl.h presence... yes
checking for fcntl.h... yes
checking for setitimer... yes
checking for sysconf... yes
checking value of SIG_DFL... -1
checking value of SIG_IGN... -1
configure: creating ./config.status
config.status: creating include/HsProcessConfig.h
configure: WARNING: unrecognized options: --with-compiler, --with-gcc
Building process-1.3.0.0...
Preprocessing library process-1.3.0.0...
[1 of 3] Compiling System.Process.Internals ( System/Process/Internals.hs, dist/build/System/Process/Internals.o )
[2 of 3] Compiling System.Process ( dist/build/System/Process.hs, dist/build/System/Process.o )
[3 of 3] Compiling System.Cmd ( System/Cmd.hs, dist/build/System/Cmd.o )
In-place registering process-1.3.0.0...
Running Haddock for process-1.3.0.0...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-process-1.3.016367506141483332973.0
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/process-1.3.0.0-76BIVAWQyyC1HCLTOd2ciK
Registering process-1.3.0.0...
Installed process-1.3.0.0
Configuring matrices-0.4.2...
Building matrices-0.4.2...
Preprocessing library matrices-0.4.2...
[ 1 of 13] Compiling Data.Matrix.Generic.Mutable ( src/Data/Matrix/Generic/Mutable.hs, dist/build/Data/Matrix/Generic/Mutable.o )
[ 2 of 13] Compiling Data.Matrix.Symmetric.Mutable ( src/Data/Matrix/Symmetric/Mutable.hs, dist/build/Data/Matrix/Symmetric/Mutable.o )
[ 3 of 13] Compiling Data.Matrix.Generic ( src/Data/Matrix/Generic.hs, dist/build/Data/Matrix/Generic.o )
[ 4 of 13] Compiling Data.Matrix.Symmetric ( src/Data/Matrix/Symmetric.hs, dist/build/Data/Matrix/Symmetric.o )
[ 5 of 13] Compiling Data.Matrix.Dense.Generic.Mutable ( src/Data/Matrix/Dense/Generic/Mutable.hs, dist/build/Data/Matrix/Dense/Generic/Mutable.o )
[ 6 of 13] Compiling Data.Matrix.Storable.Mutable ( src/Data/Matrix/Storable/Mutable.hs, dist/build/Data/Matrix/Storable/Mutable.o )
[ 7 of 13] Compiling Data.Matrix.Unboxed.Mutable ( src/Data/Matrix/Unboxed/Mutable.hs, dist/build/Data/Matrix/Unboxed/Mutable.o )
[ 8 of 13] Compiling Data.Matrix.Sparse.Generic ( src/Data/Matrix/Sparse/Generic.hs, dist/build/Data/Matrix/Sparse/Generic.o )
src/Data/Matrix/Sparse/Generic.hs:41:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
[ 9 of 13] Compiling Data.Matrix.Mutable ( src/Data/Matrix/Mutable.hs, dist/build/Data/Matrix/Mutable.o )
[10 of 13] Compiling Data.Matrix.Dense.Generic ( src/Data/Matrix/Dense/Generic.hs, dist/build/Data/Matrix/Dense/Generic.o )
[11 of 13] Compiling Data.Matrix.Storable ( src/Data/Matrix/Storable.hs, dist/build/Data/Matrix/Storable.o )
[12 of 13] Compiling Data.Matrix.Unboxed ( src/Data/Matrix/Unboxed.hs, dist/build/Data/Matrix/Unboxed.o )
[13 of 13] Compiling Data.Matrix ( src/Data/Matrix.hs, dist/build/Data/Matrix.o )
In-place registering matrices-0.4.2...
Running Haddock for matrices-0.4.2...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-matrices-0.47426169138172497.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/matrices-0.4.2-9notq1wHfZs4EqK9CZIyQl
Registering matrices-0.4.2...
Installed matrices-0.4.2
Configuring polynomials-bernstein-1.1.1...
Building polynomials-bernstein-1.1.1...
Preprocessing library polynomials-bernstein-1.1.1...
[1 of 2] Compiling Algebra.Polynomials.Numerical ( Algebra/Polynomials/Numerical.hs, dist/build/Algebra/Polynomials/Numerical.o )
Algebra/Polynomials/Numerical.hs:165:10: Warning:
No explicit implementation for
‘exp’, ‘log’, ‘atan’, ‘sinh’, ‘cosh’, ‘asinh’, ‘acosh’, and ‘atanh’
In the instance declaration for ‘Floating Interval’
Algebra/Polynomials/Numerical.hs:240:10: Warning:
No explicit implementation for
‘GMV.basicInitialize’
In the instance declaration for ‘GMV.MVector MVector Interval’
Algebra/Polynomials/Numerical.hs:261:1: Warning:
Defined but not used: ‘!#’
[2 of 2] Compiling Algebra.Polynomials.Bernstein ( Algebra/Polynomials/Bernstein.lhs, dist/build/Algebra/Polynomials/Bernstein.o )
Algebra/Polynomials/Bernstein.lhs:833:10: Warning:
Defined but not used: ‘allz’
Algebra/Polynomials/Bernstein.lhs:855:10: Warning:
Defined but not used: ‘allz0’
Algebra/Polynomials/Bernstein.lhs:858:10: Warning:
Defined but not used: ‘allz1’
Algebra/Polynomials/Bernstein.lhs:892:10: Warning:
Defined but not used: ‘allz0’
Algebra/Polynomials/Bernstein.lhs:895:10: Warning:
Defined but not used: ‘allz1’
Algebra/Polynomials/Bernstein.lhs:898:10: Warning:
Defined but not used: ‘allz2’
Algebra/Polynomials/Bernstein.lhs:940:10: Warning:
Defined but not used: ‘allz0’
Algebra/Polynomials/Bernstein.lhs:943:10: Warning:
Defined but not used: ‘allz1’
Algebra/Polynomials/Bernstein.lhs:946:10: Warning:
Defined but not used: ‘allz2’
Algebra/Polynomials/Bernstein.lhs:949:10: Warning:
Defined but not used: ‘allz3’
In-place registering polynomials-bernstein-1.1.1...
Running Haddock for polynomials-bernstein-1.1.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-polynomials-bernstein-1.11767125139318333694.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/polynomials-bernstein-1.1.1-HP1ACivQgLPGvV6ZvWGX5S
Registering polynomials-bernstein-1.1.1...
Installed polynomials-bernstein-1.1.1
Configuring scientific-0.3.3.8...
Building scientific-0.3.3.8...
Preprocessing library scientific-0.3.3.8...
[1 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, dist/build/Math/NumberTheory/Logarithms.o )
[2 of 4] Compiling Data.Scientific ( src/Data/Scientific.hs, dist/build/Data/Scientific.o )
src/Data/Scientific.hs:92:1: Warning:
The import of ‘Data.Functor’ is redundant
except perhaps to import instances from ‘Data.Functor’
To import instances alone, use: import Data.Functor()
[3 of 4] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, dist/build/Data/Text/Lazy/Builder/Scientific.o )
[4 of 4] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, dist/build/Data/ByteString/Builder/Scientific.o )
src/Data/ByteString/Builder/Scientific.hs:26:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
In-place registering scientific-0.3.3.8...
Running Haddock for scientific-0.3.3.8...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-scientific-0.3.34424827812074216439.8
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/scientific-0.3.3.8-5NQHiMKEgH2DOLHdLSFbA2
Registering scientific-0.3.3.8...
Installed scientific-0.3.3.8
Configuring unordered-containers-0.2.5.1...
Building unordered-containers-0.2.5.1...
Preprocessing library unordered-containers-0.2.5.1...
[1 of 8] Compiling Data.HashMap.UnsafeShift ( Data/HashMap/UnsafeShift.hs, dist/build/Data/HashMap/UnsafeShift.o )
[2 of 8] Compiling Data.HashMap.PopCount ( Data/HashMap/PopCount.hs, dist/build/Data/HashMap/PopCount.o )
[3 of 8] Compiling Data.HashMap.Unsafe ( Data/HashMap/Unsafe.hs, dist/build/Data/HashMap/Unsafe.o )
[4 of 8] Compiling Data.HashMap.Array ( Data/HashMap/Array.hs, dist/build/Data/HashMap/Array.o )
[5 of 8] Compiling Data.HashMap.Base ( Data/HashMap/Base.hs, dist/build/Data/HashMap/Base.o )
Data/HashMap/Base.hs:85:1: Warning:
The import of ‘Data.Functor’ is redundant
except perhaps to import instances from ‘Data.Functor’
To import instances alone, use: import Data.Functor()
[6 of 8] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o )
[7 of 8] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o )
[8 of 8] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o )
In-place registering unordered-containers-0.2.5.1...
Running Haddock for unordered-containers-0.2.5.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-unordered-containers-0.2.5202019540104221117.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/unordered-containers-0.2.5.1-7E41cj9RvqSJeZ4jSnbs1a
Registering unordered-containers-0.2.5.1...
Installed unordered-containers-0.2.5.1
Configuring temporary-1.2.0.3...
Building temporary-1.2.0.3...
Preprocessing library temporary-1.2.0.3...
[1 of 3] Compiling Distribution.Compat.Exception ( Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.o )
[2 of 3] Compiling Distribution.Compat.TempFile ( Distribution/Compat/TempFile.hs, dist/build/Distribution/Compat/TempFile.o )
[3 of 3] Compiling System.IO.Temp ( System/IO/Temp.hs, dist/build/System/IO/Temp.o )
In-place registering temporary-1.2.0.3...
Running Haddock for temporary-1.2.0.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-temporary-1.2.03582798761682367563.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/temporary-1.2.0.3-0YaiD69D6OqIC0LlJQkYqP
Registering temporary-1.2.0.3...
Installed temporary-1.2.0.3
Configuring cubicbezier-0.4.0.2...
Building cubicbezier-0.4.0.2...
Preprocessing library cubicbezier-0.4.0.2...
[ 1 of 11] Compiling Math.BernsteinPoly ( Math/BernsteinPoly.hs, dist/build/Math/BernsteinPoly.o )
[ 2 of 11] Compiling Geom2D.CubicBezier.Numeric ( Geom2D/CubicBezier/Numeric.hs, dist/build/Geom2D/CubicBezier/Numeric.o )
Geom2D/CubicBezier/Numeric.hs:12:1: Warning:
Top-level binding with no type signature:
sign :: forall a a1. (Num a, Num a1, Ord a) => a -> a1
[ 3 of 11] Compiling Geom2D ( Geom2D.hs, dist/build/Geom2D.o )
Geom2D.hs:63:10: Warning:
No explicit implementation for
‘M.basicInitialize’
In the instance declaration for ‘M.MVector V.MVector (Point a)’
[ 4 of 11] Compiling Geom2D.CubicBezier.Basic ( Geom2D/CubicBezier/Basic.hs, dist/build/Geom2D/CubicBezier/Basic.o )
Geom2D/CubicBezier/Basic.hs:98:19: Warning:
This binding for ‘p’ shadows the existing binding
bound at Geom2D/CubicBezier/Basic.hs:95:33
Geom2D/CubicBezier/Basic.hs:99:35: Warning:
This binding for ‘p’ shadows the existing binding
bound at Geom2D/CubicBezier/Basic.hs:95:33
[ 5 of 11] Compiling Geom2D.CubicBezier.Approximate ( Geom2D/CubicBezier/Approximate.hs, dist/build/Geom2D/CubicBezier/Approximate.o )
[ 6 of 11] Compiling Geom2D.CubicBezier.Outline ( Geom2D/CubicBezier/Outline.hs, dist/build/Geom2D/CubicBezier/Outline.o )
[ 7 of 11] Compiling Geom2D.CubicBezier.Intersection ( Geom2D/CubicBezier/Intersection.hs, dist/build/Geom2D/CubicBezier/Intersection.o )
Geom2D/CubicBezier/Intersection.hs:11:1: Warning:
The import of ‘Debug.Trace’ is redundant
except perhaps to import instances from ‘Debug.Trace’
To import instances alone, use: import Debug.Trace()
Geom2D/CubicBezier/Intersection.hs:154:1: Warning:
Top-level binding with no type signature: maxEps :: Double
[ 8 of 11] Compiling Geom2D.CubicBezier.Overlap ( Geom2D/CubicBezier/Overlap.lhs, dist/build/Geom2D/CubicBezier/Overlap.o )
Geom2D/CubicBezier/Overlap.lhs:48:3: Warning:
The import of ‘Data.Functor’ is redundant
except perhaps to import instances from ‘Data.Functor’
To import instances alone, use: import Data.Functor()
Geom2D/CubicBezier/Overlap.lhs:322:3: Warning:
Defined but not used: ‘belowLine’
Geom2D/CubicBezier/Overlap.lhs:330:3: Warning:
Defined but not used: ‘aboveLine’
Geom2D/CubicBezier/Overlap.lhs:456:22: Warning:
This binding for ‘m’ shadows the existing binding
bound at Geom2D/CubicBezier/Overlap.lhs:452:15
Geom2D/CubicBezier/Overlap.lhs:463:19: Warning:
This binding for ‘m’ shadows the existing binding
bound at Geom2D/CubicBezier/Overlap.lhs:452:15
Geom2D/CubicBezier/Overlap.lhs:471:11: Warning:
This binding for ‘m’ shadows the existing binding
bound at Geom2D/CubicBezier/Overlap.lhs:452:15
Geom2D/CubicBezier/Overlap.lhs:540:8: Warning:
A do-notation statement discarded a result of type ‘Maybe ()’
Suppress this warning by saying
‘_ <- mapM ((.) modify xStructAdd) c2’
or by using the flag -fno-warn-unused-do-bind
[ 9 of 11] Compiling Geom2D.CubicBezier.Curvature ( Geom2D/CubicBezier/Curvature.hs, dist/build/Geom2D/CubicBezier/Curvature.o )
[10 of 11] Compiling Geom2D.CubicBezier.MetaPath ( Geom2D/CubicBezier/MetaPath.hs, dist/build/Geom2D/CubicBezier/MetaPath.o )
[11 of 11] Compiling Geom2D.CubicBezier ( Geom2D/CubicBezier.hs, dist/build/Geom2D/CubicBezier.o )
In-place registering cubicbezier-0.4.0.2...
Running Haddock for cubicbezier-0.4.0.2...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-cubicbezier-0.4.06600644721069774565.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/cubicbezier-0.4.0.2-4L9mfGkR6gT6KdF9bmi9di
Registering cubicbezier-0.4.0.2...
Installed cubicbezier-0.4.0.2
Configuring typography-geometry-1.0.0...
Building typography-geometry-1.0.0...
Preprocessing library typography-geometry-1.0.0...
[1 of 4] Compiling Graphics.Typography.Geometry ( Graphics/Typography/Geometry.lhs, dist/build/Graphics/Typography/Geometry.o )
Graphics/Typography/Geometry.lhs:27:10: Warning:
No explicit implementation for
either ‘negate’ or ‘-’
In the instance declaration for ‘Num (Matrix2 a)’
[2 of 4] Compiling Graphics.Typography.Geometry.Bezier ( Graphics/Typography/Geometry/Bezier.lhs, dist/build/Graphics/Typography/Geometry/Bezier.o )
Graphics/Typography/Geometry/Bezier.lhs:123:7:
Non type-variable argument
in the constraint: Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t, t, t, t, t) a_a723
(Use FlexibleContexts to permit this)
When checking that ‘solutions’ has the inferred type
solutions :: forall t t1 t2 t3 t4 t5.
(Eq t, Eq t1, Eq t2, Eq t3, Eq t4, Eq t5, Show t, Show t1, Show t2,
Show t3, Show t4, Show t5,
Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t1, t2, t3, t4, t5) a0) =>
Double
-> [(Double, Double, t, t1, t2, t3, t4, t5)]
-> [(Double, Double, t, t1, t2, t3, t4, t5)]
In the expression:
let
thrx = 1e-5
solutions _ [] = []
solutions thr boxes@(_ : _)
= let ... in correct ++ (solutions (thr / 2) toRefine)
in
map (\ (u, v, w, x, _, _, _, _) -> (u, v, w, x))
$ solutions 1e-2
$ [(t0a, t1a, t0b, t1b, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double, Double, Double)]
In an equation for ‘inter’:
inter
op@(Offset {cx = bxp_, cy = byp_, matrix = mp, t0 = t0a, t1 = t1a})
(Offset {cx = bxq_, cy = byq_, matrix = mq, t0 = t0b, t1 = t1b})
= let
thrx = 1e-5
solutions _ [] = ...
solutions thr boxes@(_ : _) = ...
in
map (\ (u, v, w, x, _, _, _, _) -> (u, v, w, x))
$ solutions 1e-2
$ [(t0a, t1a, t0b, t1b, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double, Double, Double)]
where
imp@(Matrix2 ap bp cp dp) = intervalize mp
imq@(Matrix2 aq bq cq dq) = intervalize mq
(Matrix2 ap_ bp_ cp_ dp_) = inverse imp
(Matrix2 aq_ bq_ cq_ dq_) = inverse imq
....
Graphics/Typography/Geometry/Bezier.lhs:239:7:
Non type-variable argument
in the constraint: Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t) (t_a7qQ, t_a7qR)
(Use FlexibleContexts to permit this)
When checking that ‘solutions’ has the inferred type
solutions :: forall t t2.
(Eq t, Eq t2, Show t, Show t2,
Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t2) (t0, t1)) =>
Double -> [(Double, Double, t, t2)] -> [(Double, Double, t, t2)]
In the expression:
let
ix = intervalize bxp
iy = intervalize byp
m@(Matrix2 a b c d) = intervalize mp
....
in
foldl
(\ l (u, v, _, _)
-> let (Interval xl xu, Interval yl yu) = ...
in
case angle (Interval xl xu) (Interval yl yu) cir of {
Just (Interval a0 a1) -> ... : l
Nothing -> l })
[]
$ removeFalse initCl
$ sort $ solutions 1e-2 [(t0 o, t1 o, 0 :: Double, 1 :: Double)]
In an equation for ‘inter’:
inter
o@(Offset {cx = bxp, cy = byp, matrix = mp})
cir@(Circle {cx0, cy0, matrix = mq})
= let
ix = intervalize bxp
iy = intervalize byp
....
in
foldl
(\ l (u, v, _, _)
-> let ...
in
case angle (Interval xl xu) (Interval yl yu) cir of {
Just (Interval a0 a1) -> ...
Nothing -> ... })
[]
$ removeFalse initCl
$ sort $ solutions 1e-2 [(t0 o, t1 o, 0 :: Double, 1 :: Double)]
Graphics/Typography/Geometry/Bezier.lhs:280:41:
No instance for (Ord t0) arising from a use of ‘sort’
The type variable ‘t0’ is ambiguous
Note: there are several potential instances:
instance Ord a => Ord (Control.Applicative.Const a b)
-- Defined in ‘Control.Applicative’
instance Ord a => Ord (Control.Applicative.ZipList a)
-- Defined in ‘Control.Applicative’
instance (Ord a, Ord b) => Ord (Either a b)
-- Defined in ‘Data.Either’
...plus 65 others
In the expression: sort
In the second argument of ‘($)’, namely
‘sort $ solutions 1e-2 [(t0 o, t1 o, 0 :: Double, 1 :: Double)]’
In the second argument of ‘($)’, namely
‘removeFalse initCl
$ sort $ solutions 1e-2 [(t0 o, t1 o, 0 :: Double, 1 :: Double)]’
Graphics/Typography/Geometry/Bezier.lhs:369:7:
Non type-variable argument
in the constraint: Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t) (Int, Int)
(Use FlexibleContexts to permit this)
When checking that ‘solutions’ has the inferred type
solutions :: forall t t1.
(Eq t, Eq t1, Show t, Show t1,
Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t1) (Int, Int)) =>
Double -> [(Double, Double, t, t1)] -> [(Double, Double, t, t1)]
In the expression:
let
p0
= (promote 1 $ intervalize bxa) - (promote 2 $ intervalize xb) ::
Bernsteinp (Int, Int) Interval
p1
= (promote 1 $ intervalize bya) - (promote 2 $ intervalize yb) ::
Bernsteinp (Int, Int) Interval
thrx = 1e-2
....
in solutions 1e-2 [(t0a, t1a, t0b, t1b)]
In an equation for ‘inter’:
inter
op@(Bezier {cx = bxa, cy = bya, t0 = t0a, t1 = t1a})
(Bezier {cx = xb, cy = yb, t0 = t0b, t1 = t1b})
= let
p0 = ...
p1 = ...
....
in solutions 1e-2 [(t0a, t1a, t0b, t1b)]
Graphics/Typography/Geometry/Bezier.lhs:423:7:
Non type-variable argument
in the constraint: Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t, t, t) a_a7Yo
(Use FlexibleContexts to permit this)
When checking that ‘solutions’ has the inferred type
solutions :: forall t t1 t2 t3.
(Eq t, Eq t1, Eq t2, Eq t3, Show t, Show t1, Show t2, Show t3,
Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t1, t2, t3) a0) =>
Double
-> [(Double, Double, t, t1, t2, t3)]
-> [(Double, Double, t, t1, t2, t3)]
In the expression:
let
thr = 1e-2
thrx = 1e-5
solutions _ [] = []
solutions thr boxes@(_ : _)
= let ... in correct ++ (solutions (thr / 2) toRefine)
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:425:29:
Could not deduce (Show t2) arising from a use of ‘solve’
from the context (Eq t,
Eq t5,
Eq t6,
Eq t7,
Show t,
Show t5,
Show t6,
Show t7,
Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t5, t6, t7) (t2, t3, t4))
bound by the inferred type of
solutions :: (Eq t, Eq t5, Eq t6, Eq t7, Show t, Show t5, Show t6,
Show t7,
Algebra.Polynomials.Bernstein.Box
(Double, Double, t, t5, t6, t7) (t2, t3, t4)) =>
Double
-> [(Double, Double, t, t5, t6, t7)]
-> [(Double, Double, t, t5, t6, t7)]
at Graphics/Typography/Geometry/Bezier.lhs:(423,7)-(433,46)
The type variable ‘t2’ is ambiguous
Relevant bindings include
eq0 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:465:7)
bxp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:446:7)
eq1 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:466:7)
eq2 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:467:7)
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there are several potential instances:
instance Show a => Show (Control.Applicative.Const a b)
-- Defined in ‘Control.Applicative’
instance Show a => Show (Control.Applicative.ZipList a)
-- Defined in ‘Control.Applicative’
instance Show a => Show (Data.Complex.Complex a)
-- Defined in ‘Data.Complex’
...plus 69 others
In the first argument of ‘concatMap’, namely
‘(solve thr (V.fromList [eq0, eq1, eq2]))’
In the expression:
concatMap (solve thr (V.fromList [eq0, eq1, eq2])) boxes
In an equation for ‘sol0’:
sol0 = concatMap (solve thr (V.fromList [eq0, eq1, eq2])) boxes
Graphics/Typography/Geometry/Bezier.lhs:446:12:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘promote’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
bxp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:446:7)
eq1 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:466:7)
eq2 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:467:7)
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: promote 1 bxp
In an equation for ‘bxp3’: bxp3 = promote 1 bxp
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:447:12:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘promote’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
byq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:449:7)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: promote 1 byp
In an equation for ‘byp3’: byp3 = promote 1 byp
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:448:12:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘promote’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
byq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:449:7)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: promote 2 bxq
In an equation for ‘bxq3’: bxq3 = promote 2 bxq
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:449:12:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘promote’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
byq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:449:7)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: promote 2 byq
In an equation for ‘byq3’: byq3 = promote 2 byq
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:453:12:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘promote’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
byq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:449:7)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: promote 1
In the expression: promote 1 $ (scale ap_ bxp') + (scale bp_ byp')
In an equation for ‘bXp'’:
bXp' = promote 1 $ (scale ap_ bxp') + (scale bp_ byp')
Graphics/Typography/Geometry/Bezier.lhs:454:12:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘promote’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
byq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:449:7)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: promote 1
In the expression: promote 1 $ (scale cp_ bxp') + (scale dp_ byp')
In an equation for ‘bYp'’:
bYp' = promote 1 $ (scale cp_ bxp') + (scale dp_ byp')
Graphics/Typography/Geometry/Bezier.lhs:456:44:
No instance for (Num (Bernsteinp (t2, t3, t4) Interval))
arising from a use of ‘+’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
byq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:449:7)
Note: there is a potential instance available:
instance (Fractional a, Num a, UV.Unbox a) =>
Num (Bernsteinp (Int, Int, Int) a)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: (bXp' * bXp') + (bYp' * bYp')
In a pattern binding:
omp@(Bernsteinp _ omegap) = (bXp' * bXp') + (bYp' * bYp')
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:464:26:
No instance for (Num t2) arising from the literal ‘1’
The type variable ‘t2’ is ambiguous
Relevant bindings include
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there are several potential instances:
instance RealFloat a => Num (Data.Complex.Complex a)
-- Defined in ‘Data.Complex’
instance forall (k :: BOX) (f :: k -> *) (a :: k).
Num (f a) =>
Num (Data.Monoid.Alt f a)
-- Defined in ‘Data.Monoid’
instance Num a => Num (Data.Monoid.Product a)
-- Defined in ‘Data.Monoid’
...plus 21 others
In the expression: 1
In the first argument of ‘Bernsteinp’, namely ‘(1, 1, 2)’
In the expression: Bernsteinp (1, 1, 2)
Graphics/Typography/Geometry/Bezier.lhs:464:28:
No instance for (Num t3) arising from the literal ‘1’
The type variable ‘t3’ is ambiguous
Relevant bindings include
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there are several potential instances:
instance RealFloat a => Num (Data.Complex.Complex a)
-- Defined in ‘Data.Complex’
instance forall (k :: BOX) (f :: k -> *) (a :: k).
Num (f a) =>
Num (Data.Monoid.Alt f a)
-- Defined in ‘Data.Monoid’
instance Num a => Num (Data.Monoid.Product a)
-- Defined in ‘Data.Monoid’
...plus 21 others
In the expression: 1
In the first argument of ‘Bernsteinp’, namely ‘(1, 1, 2)’
In the expression: Bernsteinp (1, 1, 2)
Graphics/Typography/Geometry/Bezier.lhs:464:30:
No instance for (Num t4) arising from the literal ‘2’
The type variable ‘t4’ is ambiguous
Relevant bindings include
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
bxq3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:448:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there are several potential instances:
instance RealFloat a => Num (Data.Complex.Complex a)
-- Defined in ‘Data.Complex’
instance forall (k :: BOX) (f :: k -> *) (a :: k).
Num (f a) =>
Num (Data.Monoid.Alt f a)
-- Defined in ‘Data.Monoid’
instance Num a => Num (Data.Monoid.Product a)
-- Defined in ‘Data.Monoid’
...plus 21 others
In the expression: 2
In the first argument of ‘Bernsteinp’, namely ‘(1, 1, 2)’
In the expression: Bernsteinp (1, 1, 2)
Graphics/Typography/Geometry/Bezier.lhs:465:26:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘scale’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
eq0 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:465:7)
bxp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:446:7)
eq1 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:466:7)
eq2 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:467:7)
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the second argument of ‘(+)’, namely ‘(scale ap bYp')’
In the first argument of ‘(-)’, namely
‘bxp3 * alphau + (scale ap bYp')’
In the first argument of ‘(-)’, namely
‘bxp3 * alphau + (scale ap bYp') - (scale bp bXp')’
Graphics/Typography/Geometry/Bezier.lhs:465:59:
No instance for (Num (Bernsteinp (t2, t3, t4) Interval))
arising from a use of ‘-’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
eq0 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:465:7)
bxp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:446:7)
eq1 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:466:7)
eq2 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:467:7)
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there is a potential instance available:
instance (Fractional a, Num a, UV.Unbox a) =>
Num (Bernsteinp (Int, Int, Int) a)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression:
bxp3 * alphau + (scale ap bYp') - (scale bp bXp') - bxq3
In an equation for ‘eq0’:
eq0 = bxp3 * alphau + (scale ap bYp') - (scale bp bXp') - bxq3
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:466:26:
No instance for (Bernstein (t2, t3, t4))
arising from a use of ‘scale’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
eq1 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:466:7)
eq2 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:467:7)
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there is a potential instance available:
instance Bernstein (Int, Int, Int)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the second argument of ‘(+)’, namely ‘(scale cp bYp')’
In the first argument of ‘(-)’, namely
‘byp3 * alphau + (scale cp bYp')’
In the first argument of ‘(-)’, namely
‘byp3 * alphau + (scale cp bYp') - (scale dp bXp')’
Graphics/Typography/Geometry/Bezier.lhs:466:59:
No instance for (Num (Bernsteinp (t2, t3, t4) Interval))
arising from a use of ‘-’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
eq1 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:466:7)
eq2 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:467:7)
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there is a potential instance available:
instance (Fractional a, Num a, UV.Unbox a) =>
Num (Bernsteinp (Int, Int, Int) a)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression:
byp3 * alphau + (scale cp bYp') - (scale dp bXp') - byq3
In an equation for ‘eq1’:
eq1 = byp3 * alphau + (scale cp bYp') - (scale dp bXp') - byq3
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Graphics/Typography/Geometry/Bezier.lhs:467:24:
No instance for (Num (Bernsteinp (t2, t3, t4) Interval))
arising from a use of ‘-’
The type variables ‘t2’, ‘t3’, ‘t4’ are ambiguous
Relevant bindings include
eq2 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:467:7)
alphau :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:464:7)
omp :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:456:7)
bYp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:454:7)
bXp' :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:453:7)
byp3 :: Bernsteinp (t2, t3, t4) Interval
(bound at Graphics/Typography/Geometry/Bezier.lhs:447:7)
(Some bindings suppressed; use -fmax-relevant-binds=N or -fno-max-relevant-binds)
Note: there is a potential instance available:
instance (Fractional a, Num a, UV.Unbox a) =>
Num (Bernsteinp (Int, Int, Int) a)
-- Defined in ‘Algebra.Polynomials.Bernstein’
In the expression: alphau * alphau - omp
In an equation for ‘eq2’: eq2 = alphau * alphau - omp
In an equation for ‘inter’:
inter off@(Offset {}) bez@(Bezier {})
= let
thr = 1e-2
thrx = 1e-5
....
in
map (\ (a, b, c, d, _, _) -> (a, b, c, d))
$ solutions 1e-2
$ [(0, 1, 0, 1, 0, 1) ::
(Double, Double, Double, Double, Double, Double)]
where
bxp = intervalize $ cx off
byp = intervalize $ cy off
bxq = intervalize $ cx bez
byq = intervalize $ cy bez
....
Failed to install typography-geometry-1.0.0
Configuring attoparsec-0.13.0.1...
Building attoparsec-0.13.0.1...
Preprocessing library attoparsec-0.13.0.1...
[ 1 of 21] Compiling Data.Attoparsec.Text.FastSet ( Data/Attoparsec/Text/FastSet.hs, dist/build/Data/Attoparsec/Text/FastSet.o )
[ 2 of 21] Compiling Data.Attoparsec.Internal.Fhthagn ( Data/Attoparsec/Internal/Fhthagn.hs, dist/build/Data/Attoparsec/Internal/Fhthagn.o )
[ 3 of 21] Compiling Data.Attoparsec.Text.Buffer ( Data/Attoparsec/Text/Buffer.hs, dist/build/Data/Attoparsec/Text/Buffer.o )
[ 4 of 21] Compiling Data.Attoparsec.ByteString.Buffer ( Data/Attoparsec/ByteString/Buffer.hs, dist/build/Data/Attoparsec/ByteString/Buffer.o )
[ 5 of 21] Compiling Data.Attoparsec.Zepto ( Data/Attoparsec/Zepto.hs, dist/build/Data/Attoparsec/Zepto.o )
[ 6 of 21] Compiling Data.Attoparsec.Number ( Data/Attoparsec/Number.hs, dist/build/Data/Attoparsec/Number.o )
[ 7 of 21] Compiling Data.Attoparsec.ByteString.FastSet ( Data/Attoparsec/ByteString/FastSet.hs, dist/build/Data/Attoparsec/ByteString/FastSet.o )
[ 8 of 21] Compiling Data.Attoparsec.Internal.Types ( Data/Attoparsec/Internal/Types.hs, dist/build/Data/Attoparsec/Internal/Types.o )
[ 9 of 21] Compiling Data.Attoparsec.Types ( Data/Attoparsec/Types.hs, dist/build/Data/Attoparsec/Types.o )
[10 of 21] Compiling Data.Attoparsec.Internal ( Data/Attoparsec/Internal.hs, dist/build/Data/Attoparsec/Internal.o )
[11 of 21] Compiling Data.Attoparsec.Combinator ( Data/Attoparsec/Combinator.hs, dist/build/Data/Attoparsec/Combinator.o )
[12 of 21] Compiling Data.Attoparsec.ByteString.Internal ( Data/Attoparsec/ByteString/Internal.hs, dist/build/Data/Attoparsec/ByteString/Internal.o )
[13 of 21] Compiling Data.Attoparsec.Text.Internal ( Data/Attoparsec/Text/Internal.hs, dist/build/Data/Attoparsec/Text/Internal.o )
[14 of 21] Compiling Data.Attoparsec.Text ( Data/Attoparsec/Text.hs, dist/build/Data/Attoparsec/Text.o )
[15 of 21] Compiling Data.Attoparsec.Text.Lazy ( Data/Attoparsec/Text/Lazy.hs, dist/build/Data/Attoparsec/Text/Lazy.o )
[16 of 21] Compiling Data.Attoparsec.ByteString ( Data/Attoparsec/ByteString.hs, dist/build/Data/Attoparsec/ByteString.o )
[17 of 21] Compiling Data.Attoparsec.ByteString.Char8 ( Data/Attoparsec/ByteString/Char8.hs, dist/build/Data/Attoparsec/ByteString/Char8.o )
[18 of 21] Compiling Data.Attoparsec.Char8 ( Data/Attoparsec/Char8.hs, dist/build/Data/Attoparsec/Char8.o )
[19 of 21] Compiling Data.Attoparsec.ByteString.Lazy ( Data/Attoparsec/ByteString/Lazy.hs, dist/build/Data/Attoparsec/ByteString/Lazy.o )
[20 of 21] Compiling Data.Attoparsec.Lazy ( Data/Attoparsec/Lazy.hs, dist/build/Data/Attoparsec/Lazy.o )
[21 of 21] Compiling Data.Attoparsec ( Data/Attoparsec.hs, dist/build/Data/Attoparsec.o )
In-place registering attoparsec-0.13.0.1...
Running Haddock for attoparsec-0.13.0.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-attoparsec-0.13.012182727841918258803.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/attoparsec-0.13.0.1-46jJ1gLWm1hDQN03fs9Cv6
Registering attoparsec-0.13.0.1...
Installed attoparsec-0.13.0.1
Configuring semigroups-0.17.0.1...
Building semigroups-0.17.0.1...
Preprocessing library semigroups-0.17.0.1...
[1 of 3] Compiling Data.List.NonEmpty ( src/Data/List/NonEmpty.hs, dist/build/Data/List/NonEmpty.o )
[2 of 3] Compiling Data.Semigroup ( src/Data/Semigroup.hs, dist/build/Data/Semigroup.o )
[3 of 3] Compiling Data.Semigroup.Generic ( src/Data/Semigroup/Generic.hs, dist/build/Data/Semigroup/Generic.o )
In-place registering semigroups-0.17.0.1...
Running Haddock for semigroups-0.17.0.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-semigroups-0.17.011212413021402505904.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/semigroups-0.17.0.1-7ZJSgZ5CNVm8tWmGAujY46
Registering semigroups-0.17.0.1...
Installed semigroups-0.17.0.1
Configuring graphviz-2999.18.0.1...
Building graphviz-2999.18.0.1...
Preprocessing library graphviz-2999.18.0.1...
[ 1 of 31] Compiling Data.GraphViz.Attributes.ColorScheme ( Data/GraphViz/Attributes/ColorScheme.hs, dist/build/Data/GraphViz/Attributes/ColorScheme.o )
[ 2 of 31] Compiling Data.GraphViz.Exception ( Data/GraphViz/Exception.hs, dist/build/Data/GraphViz/Exception.o )
[ 3 of 31] Compiling Data.GraphViz.Internal.State ( Data/GraphViz/Internal/State.hs, dist/build/Data/GraphViz/Internal/State.o )
[ 4 of 31] Compiling Data.GraphViz.Internal.Util ( Data/GraphViz/Internal/Util.hs, dist/build/Data/GraphViz/Internal/Util.o )
[ 5 of 31] Compiling Data.GraphViz.Parsing ( Data/GraphViz/Parsing.hs, dist/build/Data/GraphViz/Parsing.o )
[ 6 of 31] Compiling Data.GraphViz.PreProcessing ( Data/GraphViz/PreProcessing.hs, dist/build/Data/GraphViz/PreProcessing.o )
[ 7 of 31] Compiling Data.GraphViz.Printing ( Data/GraphViz/Printing.hs, dist/build/Data/GraphViz/Printing.o )
[ 8 of 31] Compiling Data.GraphViz.Commands.Available ( Data/GraphViz/Commands/Available.hs, dist/build/Data/GraphViz/Commands/Available.o )
[ 9 of 31] Compiling Data.GraphViz.Attributes.Colors.X11 ( Data/GraphViz/Attributes/Colors/X11.hs, dist/build/Data/GraphViz/Attributes/Colors/X11.o )
[10 of 31] Compiling Data.GraphViz.Attributes.Internal ( Data/GraphViz/Attributes/Internal.hs, dist/build/Data/GraphViz/Attributes/Internal.o )
[11 of 31] Compiling Data.GraphViz.Attributes.Colors.Brewer ( Data/GraphViz/Attributes/Colors/Brewer.hs, dist/build/Data/GraphViz/Attributes/Colors/Brewer.o )
[12 of 31] Compiling Data.GraphViz.Attributes.Colors.SVG ( Data/GraphViz/Attributes/Colors/SVG.hs, dist/build/Data/GraphViz/Attributes/Colors/SVG.o )
[13 of 31] Compiling Data.GraphViz.Attributes.Arrows ( Data/GraphViz/Attributes/Arrows.hs, dist/build/Data/GraphViz/Attributes/Arrows.o )
[14 of 31] Compiling Data.GraphViz.Attributes.Colors ( Data/GraphViz/Attributes/Colors.hs, dist/build/Data/GraphViz/Attributes/Colors.o )
[15 of 31] Compiling Data.GraphViz.Attributes.HTML ( Data/GraphViz/Attributes/HTML.hs, dist/build/Data/GraphViz/Attributes/HTML.o )
[16 of 31] Compiling Data.GraphViz.Attributes.Values ( Data/GraphViz/Attributes/Values.hs, dist/build/Data/GraphViz/Attributes/Values.o )
[17 of 31] Compiling Data.GraphViz.Attributes.Complete ( Data/GraphViz/Attributes/Complete.hs, dist/build/Data/GraphViz/Attributes/Complete.o )
[18 of 31] Compiling Data.GraphViz.Types.Internal.Common ( Data/GraphViz/Types/Internal/Common.hs, dist/build/Data/GraphViz/Types/Internal/Common.o )
[19 of 31] Compiling Data.GraphViz.Attributes.Same ( Data/GraphViz/Attributes/Same.hs, dist/build/Data/GraphViz/Attributes/Same.o )
[20 of 31] Compiling Data.GraphViz.Types.State ( Data/GraphViz/Types/State.hs, dist/build/Data/GraphViz/Types/State.o )
[21 of 31] Compiling Data.GraphViz.Attributes ( Data/GraphViz/Attributes.hs, dist/build/Data/GraphViz/Attributes.o )
[22 of 31] Compiling Data.GraphViz.Types.Canonical ( Data/GraphViz/Types/Canonical.hs, dist/build/Data/GraphViz/Types/Canonical.o )
[23 of 31] Compiling Data.GraphViz.Algorithms.Clustering ( Data/GraphViz/Algorithms/Clustering.hs, dist/build/Data/GraphViz/Algorithms/Clustering.o )
[24 of 31] Compiling Data.GraphViz.Types ( Data/GraphViz/Types.hs, dist/build/Data/GraphViz/Types.o )
[25 of 31] Compiling Data.GraphViz.Algorithms ( Data/GraphViz/Algorithms.hs, dist/build/Data/GraphViz/Algorithms.o )
[26 of 31] Compiling Data.GraphViz.Commands.IO ( Data/GraphViz/Commands/IO.hs, dist/build/Data/GraphViz/Commands/IO.o )
[27 of 31] Compiling Data.GraphViz.Commands ( Data/GraphViz/Commands.hs, dist/build/Data/GraphViz/Commands.o )
[28 of 31] Compiling Data.GraphViz.Types.Generalised ( Data/GraphViz/Types/Generalised.hs, dist/build/Data/GraphViz/Types/Generalised.o )
[29 of 31] Compiling Data.GraphViz.Types.Monadic ( Data/GraphViz/Types/Monadic.hs, dist/build/Data/GraphViz/Types/Monadic.o )
[30 of 31] Compiling Data.GraphViz.Types.Graph ( Data/GraphViz/Types/Graph.hs, dist/build/Data/GraphViz/Types/Graph.o )
[31 of 31] Compiling Data.GraphViz ( Data/GraphViz.hs, dist/build/Data/GraphViz.o )
In-place registering graphviz-2999.18.0.1...
Running Haddock for graphviz-2999.18.0.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-graphviz-2999.18.0972605807115206657.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/graphviz-2999.18.0.1-JnmnHApaOBuEhF9KNy79Kj
Registering graphviz-2999.18.0.1...
Installed graphviz-2999.18.0.1
Configuring configurator-0.3.0.0...
Building configurator-0.3.0.0...
Preprocessing library configurator-0.3.0.0...
[1 of 5] Compiling Data.Configurator.Types.Internal ( Data/Configurator/Types/Internal.hs, dist/build/Data/Configurator/Types/Internal.o )
[2 of 5] Compiling Data.Configurator.Types ( Data/Configurator/Types.hs, dist/build/Data/Configurator/Types.o )
[3 of 5] Compiling Data.Configurator.Parser ( Data/Configurator/Parser.hs, dist/build/Data/Configurator/Parser.o )
Data/Configurator/Parser.hs:19:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
Data/Configurator/Parser.hs:26:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[4 of 5] Compiling Data.Configurator.Instances ( Data/Configurator/Instances.hs, dist/build/Data/Configurator/Instances.o )
Data/Configurator/Instances.hs:6:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
Data/Configurator/Instances.hs:13:1: Warning:
The import of ‘Word’ from module ‘Data.Word’ is redundant
[5 of 5] Compiling Data.Configurator ( Data/Configurator.hs, dist/build/Data/Configurator.o )
Data/Configurator.hs:63:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
Data/Configurator.hs:73:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
In-place registering configurator-0.3.0.0...
Running Haddock for configurator-0.3.0.0...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-configurator-0.3.019843139701004642738.0
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/configurator-0.3.0.0-3azlmfY8iumCBafZVPr4ua
Registering configurator-0.3.0.0...
Installed configurator-0.3.0.0
Configuring bifunctors-5...
Building bifunctors-5...
Preprocessing library bifunctors-5...
[ 1 of 11] Compiling Data.Bifoldable ( src/Data/Bifoldable.hs, dist/build/Data/Bifoldable.o )
[ 2 of 11] Compiling Data.Bitraversable ( src/Data/Bitraversable.hs, dist/build/Data/Bitraversable.o )
[ 3 of 11] Compiling Data.Biapplicative ( src/Data/Biapplicative.hs, dist/build/Data/Biapplicative.o )
[ 4 of 11] Compiling Data.Bifunctor.Biff ( src/Data/Bifunctor/Biff.hs, dist/build/Data/Bifunctor/Biff.o )
src/Data/Bifunctor/Biff.hs:15:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Biff.hs:19:1: Warning:
The import of ‘Data.Foldable’ is redundant
except perhaps to import instances from ‘Data.Foldable’
To import instances alone, use: import Data.Foldable()
src/Data/Bifunctor/Biff.hs:20:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
src/Data/Bifunctor/Biff.hs:21:1: Warning:
The import of ‘Data.Traversable’ is redundant
except perhaps to import instances from ‘Data.Traversable’
To import instances alone, use: import Data.Traversable()
[ 5 of 11] Compiling Data.Bifunctor.Clown ( src/Data/Bifunctor/Clown.hs, dist/build/Data/Bifunctor/Clown.o )
src/Data/Bifunctor/Clown.hs:17:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Clown.hs:21:1: Warning:
The import of ‘Data.Foldable’ is redundant
except perhaps to import instances from ‘Data.Foldable’
To import instances alone, use: import Data.Foldable()
src/Data/Bifunctor/Clown.hs:22:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
src/Data/Bifunctor/Clown.hs:23:1: Warning:
The import of ‘Data.Traversable’ is redundant
except perhaps to import instances from ‘Data.Traversable’
To import instances alone, use: import Data.Traversable()
[ 6 of 11] Compiling Data.Bifunctor.Flip ( src/Data/Bifunctor/Flip.hs, dist/build/Data/Bifunctor/Flip.o )
src/Data/Bifunctor/Flip.hs:16:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Flip.hs:20:1: Warning:
The import of ‘Data.Foldable’ is redundant
except perhaps to import instances from ‘Data.Foldable’
To import instances alone, use: import Data.Foldable()
src/Data/Bifunctor/Flip.hs:21:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
src/Data/Bifunctor/Flip.hs:22:1: Warning:
The import of ‘Data.Traversable’ is redundant
except perhaps to import instances from ‘Data.Traversable’
To import instances alone, use: import Data.Traversable()
[ 7 of 11] Compiling Data.Bifunctor.Join ( src/Data/Bifunctor/Join.hs, dist/build/Data/Bifunctor/Join.o )
src/Data/Bifunctor/Join.hs:16:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Join.hs:20:1: Warning:
The import of ‘Data.Foldable’ is redundant
except perhaps to import instances from ‘Data.Foldable’
To import instances alone, use: import Data.Foldable()
src/Data/Bifunctor/Join.hs:21:1: Warning:
The import of ‘Data.Traversable’ is redundant
except perhaps to import instances from ‘Data.Traversable’
To import instances alone, use: import Data.Traversable()
[ 8 of 11] Compiling Data.Bifunctor.Joker ( src/Data/Bifunctor/Joker.hs, dist/build/Data/Bifunctor/Joker.o )
src/Data/Bifunctor/Joker.hs:17:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Joker.hs:21:1: Warning:
The import of ‘Data.Foldable’ is redundant
except perhaps to import instances from ‘Data.Foldable’
To import instances alone, use: import Data.Foldable()
src/Data/Bifunctor/Joker.hs:22:1: Warning:
The import of ‘Data.Traversable’ is redundant
except perhaps to import instances from ‘Data.Traversable’
To import instances alone, use: import Data.Traversable()
[ 9 of 11] Compiling Data.Bifunctor.Product ( src/Data/Bifunctor/Product.hs, dist/build/Data/Bifunctor/Product.o )
src/Data/Bifunctor/Product.hs:16:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Product.hs:20:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
[10 of 11] Compiling Data.Bifunctor.Tannen ( src/Data/Bifunctor/Tannen.hs, dist/build/Data/Bifunctor/Tannen.o )
src/Data/Bifunctor/Tannen.hs:15:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Tannen.hs:19:1: Warning:
The import of ‘Data.Foldable’ is redundant
except perhaps to import instances from ‘Data.Foldable’
To import instances alone, use: import Data.Foldable()
src/Data/Bifunctor/Tannen.hs:20:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
src/Data/Bifunctor/Tannen.hs:21:1: Warning:
The import of ‘Data.Traversable’ is redundant
except perhaps to import instances from ‘Data.Traversable’
To import instances alone, use: import Data.Traversable()
[11 of 11] Compiling Data.Bifunctor.Wrapped ( src/Data/Bifunctor/Wrapped.hs, dist/build/Data/Bifunctor/Wrapped.o )
src/Data/Bifunctor/Wrapped.hs:15:1: Warning:
The import of ‘Control.Applicative’ is redundant
except perhaps to import instances from ‘Control.Applicative’
To import instances alone, use: import Control.Applicative()
src/Data/Bifunctor/Wrapped.hs:19:1: Warning:
The import of ‘Data.Foldable’ is redundant
except perhaps to import instances from ‘Data.Foldable’
To import instances alone, use: import Data.Foldable()
src/Data/Bifunctor/Wrapped.hs:20:1: Warning:
The import of ‘Data.Monoid’ is redundant
except perhaps to import instances from ‘Data.Monoid’
To import instances alone, use: import Data.Monoid()
src/Data/Bifunctor/Wrapped.hs:21:1: Warning:
The import of ‘Data.Traversable’ is redundant
except perhaps to import instances from ‘Data.Traversable’
To import instances alone, use: import Data.Traversable()
In-place registering bifunctors-5...
Running Haddock for bifunctors-5...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-bifunctors-51426608253847915875
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/bifunctors-5-G4gLtDmKDxFEnUJ9Mt7bVz
Registering bifunctors-5...
Installed bifunctors-5
Configuring void-0.7.1...
Building void-0.7.1...
Preprocessing library void-0.7.1...
[1 of 1] Compiling Data.Void.Unsafe ( src/Data/Void/Unsafe.hs, dist/build/Data/Void/Unsafe.o )
In-place registering void-0.7.1...
Running Haddock for void-0.7.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-void-0.720669908161312712376.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/void-0.7.1-9yhpMnPXpwdEXb0fUkPcv6
Registering void-0.7.1...
Installed void-0.7.1
Configuring contravariant-1.3.3...
Building contravariant-1.3.3...
Preprocessing library contravariant-1.3.3...
[1 of 4] Compiling Data.Functor.Contravariant ( src/Data/Functor/Contravariant.hs, dist/build/Data/Functor/Contravariant.o )
[2 of 4] Compiling Data.Functor.Contravariant.Divisible ( src/Data/Functor/Contravariant/Divisible.hs, dist/build/Data/Functor/Contravariant/Divisible.o )
[3 of 4] Compiling Data.Functor.Contravariant.Compose ( src/Data/Functor/Contravariant/Compose.hs, dist/build/Data/Functor/Contravariant/Compose.o )
[4 of 4] Compiling Data.Functor.Contravariant.Generic ( src/Data/Functor/Contravariant/Generic.hs, dist/build/Data/Functor/Contravariant/Generic.o )
In-place registering contravariant-1.3.3...
Running Haddock for contravariant-1.3.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-contravariant-1.31665676898878786386.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/contravariant-1.3.3-6YXCrIazFLhDoYkGeQkZZL
Registering contravariant-1.3.3...
Installed contravariant-1.3.3
[1 of 1] Compiling Main ( /tmp/cabal-tmp-4661/comonad-4.2.7.2/dist/setup/setup.hs, /tmp/cabal-tmp-4661/comonad-4.2.7.2/dist/setup/Main.o )
Linking /tmp/cabal-tmp-4661/comonad-4.2.7.2/dist/setup/setup ...
Configuring comonad-4.2.7.2...
Building comonad-4.2.7.2...
Preprocessing library comonad-4.2.7.2...
[ 1 of 16] Compiling Data.Functor.Composition ( src/Data/Functor/Composition.hs, dist/build/Data/Functor/Composition.o )
[ 2 of 16] Compiling Control.Comonad.Trans.Identity ( src/Control/Comonad/Trans/Identity.hs, dist/build/Control/Comonad/Trans/Identity.o )
[ 3 of 16] Compiling Control.Comonad ( src/Control/Comonad.hs, dist/build/Control/Comonad.o )
[ 4 of 16] Compiling Control.Comonad.Trans.Class ( src/Control/Comonad/Trans/Class.hs, dist/build/Control/Comonad/Trans/Class.o )
[ 5 of 16] Compiling Control.Comonad.Hoist.Class ( src/Control/Comonad/Hoist/Class.hs, dist/build/Control/Comonad/Hoist/Class.o )
[ 6 of 16] Compiling Control.Comonad.Trans.Env ( src/Control/Comonad/Trans/Env.hs, dist/build/Control/Comonad/Trans/Env.o )
[ 7 of 16] Compiling Control.Comonad.Trans.Store ( src/Control/Comonad/Trans/Store.hs, dist/build/Control/Comonad/Trans/Store.o )
[ 8 of 16] Compiling Control.Comonad.Trans.Traced ( src/Control/Comonad/Trans/Traced.hs, dist/build/Control/Comonad/Trans/Traced.o )
[ 9 of 16] Compiling Control.Comonad.Env.Class ( src/Control/Comonad/Env/Class.hs, dist/build/Control/Comonad/Env/Class.o )
[10 of 16] Compiling Control.Comonad.Env ( src/Control/Comonad/Env.hs, dist/build/Control/Comonad/Env.o )
[11 of 16] Compiling Control.Comonad.Identity ( src/Control/Comonad/Identity.hs, dist/build/Control/Comonad/Identity.o )
[12 of 16] Compiling Control.Comonad.Store.Class ( src/Control/Comonad/Store/Class.hs, dist/build/Control/Comonad/Store/Class.o )
[13 of 16] Compiling Control.Comonad.Store ( src/Control/Comonad/Store.hs, dist/build/Control/Comonad/Store.o )
[14 of 16] Compiling Control.Comonad.Traced.Class ( src/Control/Comonad/Traced/Class.hs, dist/build/Control/Comonad/Traced/Class.o )
[15 of 16] Compiling Control.Comonad.Traced ( src/Control/Comonad/Traced.hs, dist/build/Control/Comonad/Traced.o )
[16 of 16] Compiling Data.Functor.Coproduct ( src/Data/Functor/Coproduct.hs, dist/build/Data/Functor/Coproduct.o )
In-place registering comonad-4.2.7.2...
Running Haddock for comonad-4.2.7.2...
setup: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-comonad-4.2.7764324635114962507.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/comonad-4.2.7.2-BggM6Z4XCUeHVlPwhbJP28
Registering comonad-4.2.7.2...
Installed comonad-4.2.7.2
Configuring profunctors-5.1.1...
Building profunctors-5.1.1...
Preprocessing library profunctors-5.1.1...
[ 1 of 14] Compiling Data.Profunctor.Trace ( src/Data/Profunctor/Trace.hs, dist/build/Data/Profunctor/Trace.o )
[ 2 of 14] Compiling Data.Profunctor.Unsafe ( src/Data/Profunctor/Unsafe.hs, dist/build/Data/Profunctor/Unsafe.o )
[ 3 of 14] Compiling Data.Profunctor ( src/Data/Profunctor.hs, dist/build/Data/Profunctor.o )
[ 4 of 14] Compiling Data.Profunctor.Monad ( src/Data/Profunctor/Monad.hs, dist/build/Data/Profunctor/Monad.o )
[ 5 of 14] Compiling Data.Profunctor.Adjunction ( src/Data/Profunctor/Adjunction.hs, dist/build/Data/Profunctor/Adjunction.o )
[ 6 of 14] Compiling Data.Profunctor.Cayley ( src/Data/Profunctor/Cayley.hs, dist/build/Data/Profunctor/Cayley.o )
[ 7 of 14] Compiling Data.Profunctor.Closed ( src/Data/Profunctor/Closed.hs, dist/build/Data/Profunctor/Closed.o )
[ 8 of 14] Compiling Data.Profunctor.Sieve ( src/Data/Profunctor/Sieve.hs, dist/build/Data/Profunctor/Sieve.o )
[ 9 of 14] Compiling Data.Profunctor.Rep ( src/Data/Profunctor/Rep.hs, dist/build/Data/Profunctor/Rep.o )
[10 of 14] Compiling Data.Profunctor.Composition ( src/Data/Profunctor/Composition.hs, dist/build/Data/Profunctor/Composition.o )
[11 of 14] Compiling Data.Profunctor.Codensity ( src/Data/Profunctor/Codensity.hs, dist/build/Data/Profunctor/Codensity.o )
[12 of 14] Compiling Data.Profunctor.Monoid ( src/Data/Profunctor/Monoid.hs, dist/build/Data/Profunctor/Monoid.o )
[13 of 14] Compiling Data.Profunctor.Ran ( src/Data/Profunctor/Ran.hs, dist/build/Data/Profunctor/Ran.o )
[14 of 14] Compiling Data.Profunctor.Tambara ( src/Data/Profunctor/Tambara.hs, dist/build/Data/Profunctor/Tambara.o )
In-place registering profunctors-5.1.1...
Running Haddock for profunctors-5.1.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-profunctors-5.1726764303368046387.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/profunctors-5.1.1-6VYMPItTJb46h1RTnXn5Hg
Registering profunctors-5.1.1...
Installed profunctors-5.1.1
[1 of 1] Compiling Main ( /tmp/cabal-tmp-4661/semigroupoids-5.0.0.4/dist/setup/setup.hs, /tmp/cabal-tmp-4661/semigroupoids-5.0.0.4/dist/setup/Main.o )
Linking /tmp/cabal-tmp-4661/semigroupoids-5.0.0.4/dist/setup/setup ...
Configuring semigroupoids-5.0.0.4...
Building semigroupoids-5.0.0.4...
Preprocessing library semigroupoids-5.0.0.4...
[ 1 of 21] Compiling Data.Traversable.Instances ( src/Data/Traversable/Instances.hs, dist/build/Data/Traversable/Instances.o )
[ 2 of 21] Compiling Data.Semigroup.Foldable.Class ( src/Data/Semigroup/Foldable/Class.hs, dist/build/Data/Semigroup/Foldable/Class.o )
[ 3 of 21] Compiling Data.Functor.Extend ( src/Data/Functor/Extend.hs, dist/build/Data/Functor/Extend.o )
[ 4 of 21] Compiling Data.Functor.Bind.Class ( src/Data/Functor/Bind/Class.hs, dist/build/Data/Functor/Bind/Class.o )
[ 5 of 21] Compiling Data.Functor.Apply ( src/Data/Functor/Apply.hs, dist/build/Data/Functor/Apply.o )
[ 6 of 21] Compiling Data.Semigroup.Bifoldable ( src/Data/Semigroup/Bifoldable.hs, dist/build/Data/Semigroup/Bifoldable.o )
[ 7 of 21] Compiling Data.Functor.Bind ( src/Data/Functor/Bind.hs, dist/build/Data/Functor/Bind.o )
[ 8 of 21] Compiling Data.Functor.Alt ( src/Data/Functor/Alt.hs, dist/build/Data/Functor/Alt.o )
[ 9 of 21] Compiling Data.Semigroup.Foldable ( src/Data/Semigroup/Foldable.hs, dist/build/Data/Semigroup/Foldable.o )
[10 of 21] Compiling Data.Semigroup.Traversable.Class ( src/Data/Semigroup/Traversable/Class.hs, dist/build/Data/Semigroup/Traversable/Class.o )
[11 of 21] Compiling Data.Semigroup.Bitraversable ( src/Data/Semigroup/Bitraversable.hs, dist/build/Data/Semigroup/Bitraversable.o )
[12 of 21] Compiling Data.Semigroup.Traversable ( src/Data/Semigroup/Traversable.hs, dist/build/Data/Semigroup/Traversable.o )
[13 of 21] Compiling Data.Functor.Bind.Trans ( src/Data/Functor/Bind/Trans.hs, dist/build/Data/Functor/Bind/Trans.o )
[14 of 21] Compiling Data.Functor.Plus ( src/Data/Functor/Plus.hs, dist/build/Data/Functor/Plus.o )
[15 of 21] Compiling Data.Semigroupoid ( src/Data/Semigroupoid.hs, dist/build/Data/Semigroupoid.o )
[16 of 21] Compiling Data.Semigroupoid.Dual ( src/Data/Semigroupoid/Dual.hs, dist/build/Data/Semigroupoid/Dual.o )
[17 of 21] Compiling Data.Groupoid ( src/Data/Groupoid.hs, dist/build/Data/Groupoid.o )
[18 of 21] Compiling Data.Isomorphism ( src/Data/Isomorphism.hs, dist/build/Data/Isomorphism.o )
[19 of 21] Compiling Data.Semigroupoid.Static ( src/Data/Semigroupoid/Static.hs, dist/build/Data/Semigroupoid/Static.o )
[20 of 21] Compiling Data.Semigroupoid.Ob ( src/Data/Semigroupoid/Ob.hs, dist/build/Data/Semigroupoid/Ob.o )
[21 of 21] Compiling Data.Bifunctor.Apply ( src/Data/Bifunctor/Apply.hs, dist/build/Data/Bifunctor/Apply.o )
In-place registering semigroupoids-5.0.0.4...
Running Haddock for semigroupoids-5.0.0.4...
setup: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-semigroupoids-5.0.02135693054475853939.4
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/semigroupoids-5.0.0.4-BW6xw8pFrWDHWU5GlvdG4W
Registering semigroupoids-5.0.0.4...
Installed semigroupoids-5.0.0.4
Configuring free-4.12.1...
Building free-4.12.1...
Preprocessing library free-4.12.1...
[ 1 of 16] Compiling Control.Monad.Free.TH ( src/Control/Monad/Free/TH.hs, dist/build/Control/Monad/Free/TH.o )
[ 2 of 16] Compiling Control.Monad.Free.Class ( src/Control/Monad/Free/Class.hs, dist/build/Control/Monad/Free/Class.o )
[ 3 of 16] Compiling Control.Monad.Trans.Iter ( src/Control/Monad/Trans/Iter.hs, dist/build/Control/Monad/Trans/Iter.o )
[ 4 of 16] Compiling Control.Monad.Trans.Free ( src/Control/Monad/Trans/Free.hs, dist/build/Control/Monad/Trans/Free.o )
[ 5 of 16] Compiling Control.Monad.Trans.Free.Church ( src/Control/Monad/Trans/Free/Church.hs, dist/build/Control/Monad/Trans/Free/Church.o )
[ 6 of 16] Compiling Control.Monad.Free ( src/Control/Monad/Free.hs, dist/build/Control/Monad/Free.o )
[ 7 of 16] Compiling Control.Monad.Free.Church ( src/Control/Monad/Free/Church.hs, dist/build/Control/Monad/Free/Church.o )
[ 8 of 16] Compiling Control.Comonad.Cofree.Class ( src/Control/Comonad/Cofree/Class.hs, dist/build/Control/Comonad/Cofree/Class.o )
[ 9 of 16] Compiling Control.Comonad.Trans.Cofree ( src/Control/Comonad/Trans/Cofree.hs, dist/build/Control/Comonad/Trans/Cofree.o )
[10 of 16] Compiling Control.Comonad.Trans.Coiter ( src/Control/Comonad/Trans/Coiter.hs, dist/build/Control/Comonad/Trans/Coiter.o )
[11 of 16] Compiling Control.Comonad.Cofree ( src/Control/Comonad/Cofree.hs, dist/build/Control/Comonad/Cofree.o )
[12 of 16] Compiling Control.Alternative.Free.Final ( src/Control/Alternative/Free/Final.hs, dist/build/Control/Alternative/Free/Final.o )
[13 of 16] Compiling Control.Alternative.Free ( src/Control/Alternative/Free.hs, dist/build/Control/Alternative/Free.o )
[14 of 16] Compiling Control.Applicative.Trans.Free ( src/Control/Applicative/Trans/Free.hs, dist/build/Control/Applicative/Trans/Free.o )
[15 of 16] Compiling Control.Applicative.Free.Final ( src/Control/Applicative/Free/Final.hs, dist/build/Control/Applicative/Free/Final.o )
[16 of 16] Compiling Control.Applicative.Free ( src/Control/Applicative/Free.hs, dist/build/Control/Applicative/Free.o )
In-place registering free-4.12.1...
Running Haddock for free-4.12.1...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-free-4.128065175531063765871.1
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/free-4.12.1-KK4wRIzDy168X97wpxlOT9
Registering free-4.12.1...
Installed free-4.12.1
Configuring adjunctions-4.2.2...
Building adjunctions-4.2.2...
Preprocessing library adjunctions-4.2.2...
[ 1 of 11] Compiling Data.Functor.Contravariant.Rep ( src/Data/Functor/Contravariant/Rep.hs, dist/build/Data/Functor/Contravariant/Rep.o )
[ 2 of 11] Compiling Control.Monad.Trans.Conts ( src/Control/Monad/Trans/Conts.hs, dist/build/Control/Monad/Trans/Conts.o )
[ 3 of 11] Compiling Data.Functor.Contravariant.Adjunction ( src/Data/Functor/Contravariant/Adjunction.hs, dist/build/Data/Functor/Contravariant/Adjunction.o )
[ 4 of 11] Compiling Control.Monad.Trans.Contravariant.Adjoint ( src/Control/Monad/Trans/Contravariant/Adjoint.hs, dist/build/Control/Monad/Trans/Contravariant/Adjoint.o )
[ 5 of 11] Compiling Data.Functor.Rep ( src/Data/Functor/Rep.hs, dist/build/Data/Functor/Rep.o )
[ 6 of 11] Compiling Data.Functor.Adjunction ( src/Data/Functor/Adjunction.hs, dist/build/Data/Functor/Adjunction.o )
[ 7 of 11] Compiling Control.Comonad.Trans.Adjoint ( src/Control/Comonad/Trans/Adjoint.hs, dist/build/Control/Comonad/Trans/Adjoint.o )
[ 8 of 11] Compiling Control.Monad.Trans.Adjoint ( src/Control/Monad/Trans/Adjoint.hs, dist/build/Control/Monad/Trans/Adjoint.o )
[ 9 of 11] Compiling Control.Monad.Representable.Reader ( src/Control/Monad/Representable/Reader.hs, dist/build/Control/Monad/Representable/Reader.o )
[10 of 11] Compiling Control.Monad.Representable.State ( src/Control/Monad/Representable/State.hs, dist/build/Control/Monad/Representable/State.o )
[11 of 11] Compiling Control.Comonad.Representable.Store ( src/Control/Comonad/Representable/Store.hs, dist/build/Control/Comonad/Representable/Store.o )
In-place registering adjunctions-4.2.2...
Running Haddock for adjunctions-4.2.2...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-adjunctions-4.221193893042129043633.2
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/adjunctions-4.2.2-JV35obEa2gxDMp9QpaNrGL
Registering adjunctions-4.2.2...
Installed adjunctions-4.2.2
Configuring kan-extensions-4.2.3...
Building kan-extensions-4.2.3...
Preprocessing library kan-extensions-4.2.3...
[ 1 of 13] Compiling Data.Functor.Kan.Rift ( src/Data/Functor/Kan/Rift.hs, dist/build/Data/Functor/Kan/Rift.o )
[ 2 of 13] Compiling Data.Functor.Kan.Lift ( src/Data/Functor/Kan/Lift.hs, dist/build/Data/Functor/Kan/Lift.o )
[ 3 of 13] Compiling Data.Functor.Day ( src/Data/Functor/Day.hs, dist/build/Data/Functor/Day.o )
[ 4 of 13] Compiling Data.Functor.Contravariant.Coyoneda ( src/Data/Functor/Contravariant/Coyoneda.hs, dist/build/Data/Functor/Contravariant/Coyoneda.o )
[ 5 of 13] Compiling Data.Functor.Contravariant.Yoneda ( src/Data/Functor/Contravariant/Yoneda.hs, dist/build/Data/Functor/Contravariant/Yoneda.o )
[ 6 of 13] Compiling Data.Functor.Contravariant.Day ( src/Data/Functor/Contravariant/Day.hs, dist/build/Data/Functor/Contravariant/Day.o )
[ 7 of 13] Compiling Data.Functor.Kan.Ran ( src/Data/Functor/Kan/Ran.hs, dist/build/Data/Functor/Kan/Ran.o )
[ 8 of 13] Compiling Data.Functor.Yoneda ( src/Data/Functor/Yoneda.hs, dist/build/Data/Functor/Yoneda.o )
[ 9 of 13] Compiling Control.Monad.Codensity ( src/Control/Monad/Codensity.hs, dist/build/Control/Monad/Codensity.o )
[10 of 13] Compiling Data.Functor.Kan.Lan ( src/Data/Functor/Kan/Lan.hs, dist/build/Data/Functor/Kan/Lan.o )
[11 of 13] Compiling Data.Functor.Coyoneda ( src/Data/Functor/Coyoneda.hs, dist/build/Data/Functor/Coyoneda.o )
[12 of 13] Compiling Control.Comonad.Density ( src/Control/Comonad/Density.hs, dist/build/Control/Comonad/Density.o )
[13 of 13] Compiling Control.Monad.Co ( src/Control/Monad/Co.hs, dist/build/Control/Monad/Co.o )
In-place registering kan-extensions-4.2.3...
Running Haddock for kan-extensions-4.2.3...
cabal: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file:
/tmp/pkgConf-kan-extensions-4.21366405247302935500.3
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/kan-extensions-4.2.3-AZ1z1CuYG3UJ3G7vJTiBt5
Registering kan-extensions-4.2.3...
Installed kan-extensions-4.2.3
[1 of 1] Compiling Main ( /tmp/cabal-tmp-4661/lens-4.13/dist/setup/setup.hs, /tmp/cabal-tmp-4661/lens-4.13/dist/setup/Main.o )
Linking /tmp/cabal-tmp-4661/lens-4.13/dist/setup/setup ...
Configuring lens-4.13...
Building lens-4.13...
Preprocessing library lens-4.13...
[ 1 of 81] Compiling Paths_lens ( dist/build/autogen/Paths_lens.hs, dist/build/Paths_lens.o )
[ 2 of 81] Compiling Data.Map.Lens ( src/Data/Map/Lens.hs, dist/build/Data/Map/Lens.o )
[ 3 of 81] Compiling Control.Lens.Internal.List ( src/Control/Lens/Internal/List.hs, dist/build/Control/Lens/Internal/List.o )
[ 4 of 81] Compiling Control.Lens.Internal.TH ( src/Control/Lens/Internal/TH.hs, dist/build/Control/Lens/Internal/TH.o )
[ 5 of 81] Compiling Control.Lens.Internal.Coerce ( src/Control/Lens/Internal/Coerce.hs, dist/build/Control/Lens/Internal/Coerce.o )
[ 6 of 81] Compiling Control.Lens.Internal.Instances ( src/Control/Lens/Internal/Instances.hs, dist/build/Control/Lens/Internal/Instances.o )
[ 7 of 81] Compiling Control.Lens.Internal.Zoom ( src/Control/Lens/Internal/Zoom.hs, dist/build/Control/Lens/Internal/Zoom.o )
[ 8 of 81] Compiling Control.Lens.Internal.Setter ( src/Control/Lens/Internal/Setter.hs, dist/build/Control/Lens/Internal/Setter.o )
[ 9 of 81] Compiling Control.Lens.Internal.Review ( src/Control/Lens/Internal/Review.hs, dist/build/Control/Lens/Internal/Review.o )
[10 of 81] Compiling Control.Lens.Internal.Prism ( src/Control/Lens/Internal/Prism.hs, dist/build/Control/Lens/Internal/Prism.o )
[11 of 81] Compiling Control.Lens.Internal.Iso ( src/Control/Lens/Internal/Iso.hs, dist/build/Control/Lens/Internal/Iso.o )
[12 of 81] Compiling Control.Lens.Internal.Level ( src/Control/Lens/Internal/Level.hs, dist/build/Control/Lens/Internal/Level.o )
[13 of 81] Compiling Control.Lens.Internal.Indexed ( src/Control/Lens/Internal/Indexed.hs, dist/build/Control/Lens/Internal/Indexed.o )
[14 of 81] Compiling Control.Lens.Internal.Context ( src/Control/Lens/Internal/Context.hs, dist/build/Control/Lens/Internal/Context.o )
[15 of 81] Compiling Control.Lens.Internal.Bazaar ( src/Control/Lens/Internal/Bazaar.hs, dist/build/Control/Lens/Internal/Bazaar.o )
[16 of 81] Compiling Control.Lens.Internal.Magma ( src/Control/Lens/Internal/Magma.hs, dist/build/Control/Lens/Internal/Magma.o )
[17 of 81] Compiling Control.Lens.Internal.Getter ( src/Control/Lens/Internal/Getter.hs, dist/build/Control/Lens/Internal/Getter.o )
[18 of 81] Compiling Control.Lens.Internal.Fold ( src/Control/Lens/Internal/Fold.hs, dist/build/Control/Lens/Internal/Fold.o )
[19 of 81] Compiling Control.Lens.Type ( src/Control/Lens/Type.hs, dist/build/Control/Lens/Type.o )
[20 of 81] Compiling Control.Lens.Setter ( src/Control/Lens/Setter.hs, dist/build/Control/Lens/Setter.o )
[21 of 81] Compiling Control.Lens.Lens ( src/Control/Lens/Lens.hs, dist/build/Control/Lens/Lens.o )
[22 of 81] Compiling Control.Lens.Tuple ( src/Control/Lens/Tuple.hs, dist/build/Control/Lens/Tuple.o )
[23 of 81] Compiling Control.Lens.Getter ( src/Control/Lens/Getter.hs, dist/build/Control/Lens/Getter.o )
[24 of 81] Compiling Control.Lens.Review ( src/Control/Lens/Review.hs, dist/build/Control/Lens/Review.o )
[25 of 81] Compiling Control.Lens.Prism ( src/Control/Lens/Prism.hs, dist/build/Control/Lens/Prism.o )
[26 of 81] Compiling Control.Lens.Zoom ( src/Control/Lens/Zoom.hs, dist/build/Control/Lens/Zoom.o )
[27 of 81] Compiling Data.Set.Lens ( src/Data/Set/Lens.hs, dist/build/Data/Set/Lens.o )
[28 of 81] Compiling Data.HashSet.Lens ( src/Data/HashSet/Lens.hs, dist/build/Data/HashSet/Lens.o )
[29 of 81] Compiling Control.Lens.Fold ( src/Control/Lens/Fold.hs, dist/build/Control/Lens/Fold.o )
[30 of 81] Compiling Control.Lens.Traversal ( src/Control/Lens/Traversal.hs, dist/build/Control/Lens/Traversal.o )
[31 of 81] Compiling Control.Lens.Indexed ( src/Control/Lens/Indexed.hs, dist/build/Control/Lens/Indexed.o )
[32 of 81] Compiling Control.Lens.Level ( src/Control/Lens/Level.hs, dist/build/Control/Lens/Level.o )
[33 of 81] Compiling Control.Lens.Reified ( src/Control/Lens/Reified.hs, dist/build/Control/Lens/Reified.o )
[34 of 81] Compiling Data.Data.Lens ( src/Data/Data/Lens.hs, dist/build/Data/Data/Lens.o )
[35 of 81] Compiling Control.Lens.Plated ( src/Control/Lens/Plated.hs, dist/build/Control/Lens/Plated.o )
[36 of 81] Compiling Control.Lens.Internal.ByteString ( src/Control/Lens/Internal/ByteString.hs, dist/build/Control/Lens/Internal/ByteString.o )
[37 of 81] Compiling Control.Lens.Equality ( src/Control/Lens/Equality.hs, dist/build/Control/Lens/Equality.o )
[38 of 81] Compiling Control.Lens.Iso ( src/Control/Lens/Iso.hs, dist/build/Control/Lens/Iso.o )
[39 of 81] Compiling Control.Lens.Wrapped ( src/Control/Lens/Wrapped.hs, dist/build/Control/Lens/Wrapped.o )
[40 of 81] Compiling Data.Vector.Generic.Lens ( src/Data/Vector/Generic/Lens.hs, dist/build/Data/Vector/Generic/Lens.o )
[41 of 81] Compiling Data.Text.Strict.Lens ( src/Data/Text/Strict/Lens.hs, dist/build/Data/Text/Strict/Lens.o )
[42 of 81] Compiling Data.Text.Lazy.Lens ( src/Data/Text/Lazy/Lens.hs, dist/build/Data/Text/Lazy/Lens.o )
[43 of 81] Compiling Data.Text.Lens ( src/Data/Text/Lens.hs, dist/build/Data/Text/Lens.o )
[44 of 81] Compiling Control.Lens.Empty ( src/Control/Lens/Empty.hs, dist/build/Control/Lens/Empty.o )
[45 of 81] Compiling Control.Lens.Each ( src/Control/Lens/Each.hs, dist/build/Control/Lens/Each.o )
[46 of 81] Compiling Control.Lens.Cons ( src/Control/Lens/Cons.hs, dist/build/Control/Lens/Cons.o )
[47 of 81] Compiling Control.Lens.Internal.Deque ( src/Control/Lens/Internal/Deque.hs, dist/build/Control/Lens/Internal/Deque.o )
[48 of 81] Compiling Control.Lens.At ( src/Control/Lens/At.hs, dist/build/Control/Lens/At.o )
[49 of 81] Compiling Language.Haskell.TH.Lens ( src/Language/Haskell/TH/Lens.hs, dist/build/Language/Haskell/TH/Lens.o )
[50 of 81] Compiling Control.Lens.Internal.FieldTH ( src/Control/Lens/Internal/FieldTH.hs, dist/build/Control/Lens/Internal/FieldTH.o )
[51 of 81] Compiling Control.Lens.Internal.PrismTH ( src/Control/Lens/Internal/PrismTH.hs, dist/build/Control/Lens/Internal/PrismTH.o )
[52 of 81] Compiling Control.Lens.TH ( src/Control/Lens/TH.hs, dist/build/Control/Lens/TH.o )
[53 of 81] Compiling Control.Lens.Internal.Exception ( src/Control/Lens/Internal/Exception.hs, dist/build/Control/Lens/Internal/Exception.o )
[54 of 81] Compiling Control.Lens.Internal ( src/Control/Lens/Internal.hs, dist/build/Control/Lens/Internal.o )
[55 of 81] Compiling Control.Lens ( src/Control/Lens.hs, dist/build/Control/Lens.o )
[56 of 81] Compiling Control.Lens.Combinators ( src/Control/Lens/Combinators.hs, dist/build/Control/Lens/Combinators.o )
[57 of 81] Compiling Control.Lens.Extras ( src/Control/Lens/Extras.hs, dist/build/Control/Lens/Extras.o )
[58 of 81] Compiling Control.Lens.Operators ( src/Control/Lens/Operators.hs, dist/build/Control/Lens/Operators.o )
[59 of 81] Compiling Control.Monad.Error.Lens ( src/Control/Monad/Error/Lens.hs, dist/build/Control/Monad/Error/Lens.o )
[60 of 81] Compiling Control.Parallel.Strategies.Lens ( src/Control/Parallel/Strategies/Lens.hs, dist/build/Control/Parallel/Strategies/Lens.o )
[61 of 81] Compiling Control.Seq.Lens ( src/Control/Seq/Lens.hs, dist/build/Control/Seq/Lens.o )
[62 of 81] Compiling Data.Array.Lens ( src/Data/Array/Lens.hs, dist/build/Data/Array/Lens.o )
[63 of 81] Compiling Data.Bits.Lens ( src/Data/Bits/Lens.hs, dist/build/Data/Bits/Lens.o )
[64 of 81] Compiling Data.ByteString.Strict.Lens ( src/Data/ByteString/Strict/Lens.hs, dist/build/Data/ByteString/Strict/Lens.o )
[65 of 81] Compiling Data.ByteString.Lazy.Lens ( src/Data/ByteString/Lazy/Lens.hs, dist/build/Data/ByteString/Lazy/Lens.o )
[66 of 81] Compiling Data.ByteString.Lens ( src/Data/ByteString/Lens.hs, dist/build/Data/ByteString/Lens.o )
[67 of 81] Compiling Data.Complex.Lens ( src/Data/Complex/Lens.hs, dist/build/Data/Complex/Lens.o )
[68 of 81] Compiling Data.IntSet.Lens ( src/Data/IntSet/Lens.hs, dist/build/Data/IntSet/Lens.o )
[69 of 81] Compiling Data.List.Lens ( src/Data/List/Lens.hs, dist/build/Data/List/Lens.o )
[70 of 81] Compiling Data.Sequence.Lens ( src/Data/Sequence/Lens.hs, dist/build/Data/Sequence/Lens.o )
[71 of 81] Compiling Data.Tree.Lens ( src/Data/Tree/Lens.hs, dist/build/Data/Tree/Lens.o )
[72 of 81] Compiling Data.Typeable.Lens ( src/Data/Typeable/Lens.hs, dist/build/Data/Typeable/Lens.o )
[73 of 81] Compiling Data.Vector.Lens ( src/Data/Vector/Lens.hs, dist/build/Data/Vector/Lens.o )
[74 of 81] Compiling Generics.Deriving.Lens ( src/Generics/Deriving/Lens.hs, dist/build/Generics/Deriving/Lens.o )
[75 of 81] Compiling GHC.Generics.Lens ( src/GHC/Generics/Lens.hs, dist/build/GHC/Generics/Lens.o )
[76 of 81] Compiling System.FilePath.Lens ( src/System/FilePath/Lens.hs, dist/build/System/FilePath/Lens.o )
[77 of 81] Compiling System.IO.Error.Lens ( src/System/IO/Error/Lens.hs, dist/build/System/IO/Error/Lens.o )
[78 of 81] Compiling Numeric.Lens ( src/Numeric/Lens.hs, dist/build/Numeric/Lens.o )
[79 of 81] Compiling Control.Exception.Lens ( src/Control/Exception/Lens.hs, dist/build/Control/Exception/Lens.o )
[80 of 81] Compiling Data.Dynamic.Lens ( src/Data/Dynamic/Lens.hs, dist/build/Data/Dynamic/Lens.o )
[81 of 81] Compiling System.Exit.Lens ( src/System/Exit/Lens.hs, dist/build/System/Exit/Lens.o )
In-place registering lens-4.13...
Running Haddock for lens-4.13...
setup: Haddock's internal GHC version must match the configured GHC version.
The GHC version is 7.10.2 but haddock is using GHC version 7.8.3
Creating package registration file: /tmp/pkgConf-lens-47299728351937495191.13
Installing library in
/home/builder/hackage-server/build-cache/tmp-install/lib/x86_64-linux-ghc-7.10.2/lens-4.13-J8bloZepXyH0EgLwE9kPcO
Registering lens-4.13...
Installed lens-4.13
cabal: Error: some packages failed to install:
marxup-3.0.0.1 depends on typography-geometry-1.0.0 which failed to install.
typography-geometry-1.0.0 failed during the building phase. The exception was:
ExitFailure 1
Test log
No test log was submitted for this report.